Tractable disjunctions of linear constraints: Basic results and applications to temporal reasoning

Theoretical Computer Science

Volumn 266, Issue 1-2, 2001, Pages 311-339

  Koubarakis, Manolis ^a  

^a TECHNICAL UNIVERSITY OF CRETE   (Greece)

Author keywords

Global consistency; Interval algebra; Linear constraints; ORD Horn constraints; Variable elimination

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; LOGIC PROGRAMMING; POLYNOMIALS;

CONSTRAINT DATABASES (CDB); CONSTRAINT LOGIC PROGRAMMING (CLP); LINEAR CONSTRAINTS;

CONSTRAINT THEORY;

EID: 0035817892     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00177-8     Document Type: Article

References (36)

1. Maintaining knowledge about temporal intervals
2. Satisfiability of Boolean formulas over linear constraints
3. An optimal k-consistency algorithm
4. From local to global consistency
5. Temporal constraint networks
6. Synthesizing constraint expressions
7. A sufficient condition for backtrack-free search
8. Variable elimination for disequations in geralized linear constraint systems
9. Variable elimination for generalized linear constraints: Particular problems involving disequalities
10. Redundancy, variable elimination and linear disequations
11. On the handling of disequations in CLP over linear rational arithmetic
12. Constraint logic programming: A survey
13. A linear programming approach to temporal reasoning
14. A unifying approach to temporal constraint reasoning
15. Constraint query languages
16. A polynomial algorithm in linear programming
17. Dense time and temporal constraints with ≠
18. Complexity results for first-order theories of temporal constraints
19. Database models for infinite and indefinite temporal information
20. Foundations of indefinite constraint databases
21. From local to global consistency in temporal constraint networks
22. From local to global consistency in temporal constraint networks
23. The complexity of query evaluation in indefinite temporal constraint databases
24. On binary constraint problems
25. A canonical form for generalized linear costraints
26. A canonical form for generalized linear constraints
27. Reasoning about temporal relations: A maximal tractable subclass of Allen's interval algebra
28. Real addition and the polynomial time hierarchy
29. Reasoning about qualitative temporal information
30. Exact and approximate reasoning about temporal relations
31. Constraint propagation algorithms for temporal reasoning: A revised report