Computational Complexity of Propositional Linear Temporal Logics Based on Qualitative Spatial or Temporal Reasoning
Authors:
- 14 March 2002
- book chapter
- Published by Springer Nature
- p. 162-176
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A new approach to cyclic ordering of 2D orientations using ternary relation algebrasArtificial Intelligence, 2000
- The Complexity of Reasoning about Spatial CongruenceJournal of Artificial Intelligence Research, 1999
- On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection CalculusArtificial Intelligence, 1999
- Determining Consistency of Topological RelationsConstraints, 1998
- Reasoning about Cardinal DirectionsJournal of Visual Languages & Computing, 1998
- Combining Topological and Qualitative Size Constraints for Spatial ReasoningLecture Notes in Computer Science, 1998
- Computational properties of qualitative spatial reasoning: First results1995
- Maintaining knowledge about temporal intervalsCommunications of the ACM, 1983
- Synthesizing constraint expressionsCommunications of the ACM, 1978
- Relationships between nondeterministic and deterministic tape complexitiesJournal of Computer and System Sciences, 1970