Theory of linear and integer programming
Theory of linear and integer programming
An optimal k-consistency algorithm
Artificial Intelligence
Constraint propagation algorithms for temporal reasoning: a revised report
Readings in qualitative reasoning about physical systems
Exact and approximate reasoning about temporal relations
Computational Intelligence
Artificial Intelligence - Special issue on knowledge representation
From local to global consistency
Artificial Intelligence
A canonical form for generalized linear constraints
Journal of Symbolic Computation
Reasoning about qualitative temporal information
Artificial Intelligence - Special volume on constraint-based reasoning
Variable elimination for generalized linear constraints
ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
On the handling of disequations in CLP over linear rational arithmetic
Constraint logic programming
Journal of the ACM (JACM)
Database models for infinite and indefinite temporal information
Information Systems
Redundancy, variable elimination and linear disequations
ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra
Journal of the ACM (JACM)
Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
From local to global consistency in temporal constraint networks
Theoretical Computer Science - Special issue: principles and practice of constraint programming
The complexity of query evaluation in indefinite temporal constraint databases
Selected papers from the international workshop on Uncertainty in databases and deductive systems
A unifying approach to temporal constraint reasoning
Artificial Intelligence
A Sufficient Condition for Backtrack-Free Search
Journal of the ACM (JACM)
Maintaining knowledge about temporal intervals
Communications of the ACM
Synthesizing constraint expressions
Communications of the ACM
Foundations of Indefinite Constraint Databases
PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
From Local to Global Consistency in Temporal Constraint Networks
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
A linear-programming approach to temporal reasoning
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Querying Temporal Constraint Networks: A Unifying Approach
Applied Intelligence
The Complexity of Constraints on Intervals and Lengths
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
A method for metric temporal reasoning
Eighteenth national conference on Artificial intelligence
Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra
Journal of the ACM (JACM)
Point algebras for temporal reasoning: algorithms and complexity
Artificial Intelligence
Complexity classification in qualitative temporal constraint reasoning
Artificial Intelligence
Temporal reasoning about fuzzy intervals
Artificial Intelligence
Extending uncertainty formalisms to linear constraints and other complex formalisms
International Journal of Approximate Reasoning
Constraint Satisfaction Problems with Infinite Templates
Complexity of Constraints
Semilinear Program Feasibility
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Complexity classification in qualitative temporal constraint reasoning
Artificial Intelligence
A fast algorithm and datalog inexpressibility for temporal reasoning
ACM Transactions on Computational Logic (TOCL)
Constraint solving for interpolation
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Constraint solving for interpolation
Journal of Symbolic Computation
Proceedings of the 14th international conference on Hybrid systems: computation and control
A unified framework for heterogeneous patterns
Information Systems
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Qualitative temporal and spatial reasoning revisited
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Computational complexity of linear constraints over the integers
Artificial Intelligence
Journal of Artificial Intelligence Research
Hi-index | 5.23 |
We study the problems of deciding consistency and performing variable elimination for disjunctions of linear inequalities and disequations with at most one inequality per disjunction. This new class of constraints extends the class of generalized linear constraints originally studied by Lassez and McAloon. We show that deciding consistency of a set of constraints in this class can be done in polynomial time. We also present a variable elimination algorithm which is similar to Fourier's algorithm for linear inequalities. Finally, we use these results to provide new temporal reasoning algorithms for the Ord-Horn subclass of Allen's interval formalism. We also show that there is no low level of local consistency that can guarantee global consistency for the Ord-Horn subclass. This property distinguishes the Ord-Horn subclass from the pointizable subclass (for which strong 5-consistency is sufficient to guarantee global consistency), and the continuous endpoint subclass (for which strong 3-consistency is sufficient to guarantee global consistency). Copyright 2001. Elsevier Science B.V.