Constants and finite unary relations in qualitative constraint reasoning
Author:
- Peter JonssonPJPeter Jonsson
- 1 April 2018
- journal article
- research article
- Published by Elsevier in Artificial Intelligence
- Vol. 257, 1-23
Abstract
No abstract availableKeywords
This publication has 36 references indexed in Scilit:
- A fast algorithm and datalog inexpressibility for temporal reasoningACM Transactions on Computational Logic, 2010
- The complexity of temporal constraint satisfaction problemsJournal of the ACM, 2010
- Qualitative Temporal and Spatial Reasoning RevisitedJournal of Logic and Computation, 2009
- Cores of Countably Categorical StructuresLogical Methods in Computer Science, 2007
- On Topological Consistency and RealizationConstraints, 2006
- On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection CalculusArtificial Intelligence, 1999
- A unifying approach to temporal constraint reasoningArtificial Intelligence, 1998
- Expressive power and complexity in algebraic logicJournal of Logic and Computation, 1997
- Reasoning about temporal relationsJournal of the ACM, 1995
- Some Theorems on DeducibilityAnnals of Mathematics, 1926