Skip navigation
Skip navigation

Automated complexity proofs for qualitative spatial and temporal calculi

Renz, Jochen; Li, Jason


Identifying complexity results for qualitative spatial or temporal calculi has been an important research topic in the past 15 years. Most interesting calculi have been shown to be at least NP-complete, but if tractable fragments of the calculi can be found then efficient reasoning with these calculi is possible. In order to get the most efficient reasoning algorithms, we are interested in identifying maximal tractable fragments of a calculus (tractable fragments such that any extension of the...[Show more]

CollectionsANU Research Publications
Date published: 2008
Type: Conference paper
Source: Proceedings of the 11th International Conference on Principles of Knowledge Representation and Reasoning


File Description SizeFormat Image
01_Renz_Automated_complexity_proofs_2008.pdf1.15 MBAdobe PDF    Request a copy
02_Renz_Automated_complexity_proofs_2008.pdf1.06 MBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator