A fast algorithm and datalog inexpressibility for temporal reasoning

Authors:
Manuel Bodirsky;Jan Kára
Affiliations:
Laboratoire d'Informatique (LIX, CNRS UMR 6171), École Polytechnique, Paris-Palaiseau, France;Charles University, Prague, Czech Republic
Venue:
ACM Transactions on Computational Logic (TOCL)
Year:
2010

Citing 20
Cited 5

Constraint propagation algorithms for temporal reasoning: a revised report

Readings in qualitative reasoning about physical systems
Reasoning about qualitative temporal information

Artificial Intelligence - Special volume on constraint-based reasoning
Complexity and algorithms for reasoning about time: a graph-theoretic approach

Journal of the ACM (JACM)
On binary constraint problems

Journal of the ACM (JACM)
Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra

Journal of the ACM (JACM)
The complexity of querying indefinite data about linearly ordered domains

Journal of Computer and System Sciences - Special issue: dedicated to the memory of Paris Kanellakis
Twenty-one large tractable subclasses of Allen's algebra

Artificial Intelligence
A shorter model theory

A shorter model theory
Conjunctive-query containment and constraint satisfaction

PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory

SIAM Journal on Computing
Maintaining knowledge about temporal intervals

Communications of the ACM
Tractable disjunctions of linear constraints: basic results and applications to temporal reasoning

Theoretical Computer Science
Constraint Processing

Constraint Processing
Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra

Journal of the ACM (JACM)
Scheduling with AND/OR Precedence Constraints

SIAM Journal on Computing
Handbook of Temporal Reasoning in Artificial Intelligence (Foundations of Artificial Intelligence (Elsevier))

Handbook of Temporal Reasoning in Artificial Intelligence (Foundations of Artificial Intelligence (Elsevier))
Relation Algebras and their Application in Temporal and Spatial Reasoning

Artificial Intelligence Review
Classifying the Complexity of Constraints Using Finite Algebras

SIAM Journal on Computing
The complexity of temporal constraint satisfaction problems

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Datalog and constraint satisfaction with infinite templates

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science

The complexity of temporal constraint satisfaction problems

Journal of the ACM (JACM)
Schaefer's theorem for graphs

Proceedings of the forty-third annual ACM symposium on Theory of computing
Syntactically characterizing local-to-global consistency in ORD-Horn

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Nogoods in qualitative constraint-based reasoning

KI'12 Proceedings of the 35th Annual German conference on Advances in Artificial Intelligence
Constraint satisfaction tractability from semi-lattice operations on infinite sets

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a new tractable temporal constraint language, which strictly contains the Ord-Horn language of Bürkert and Nebel and the class of AND/OR precedence constraints. The algorithm we present for this language decides whether a given set of constraints is consistent in time that is quadratic in the input size. We also prove that (unlike Ord-Horn) the constraint satisfaction problem of this language cannot be solved by Datalog or by establishing local consistency.