On finding a solution in temporal constraint satisfaction problems

Authors:
Alfonso Gerevini;Matteo Cristani
Affiliations:
Dipartimento di Elettronica per l'Automazione, Universita degli studi di Brescia, Brescia, Italy;Istituto Policattedra, Universita degli studi di Verona, Verona, Italy
Venue:
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Year:
1997

Citing 8
Cited 13

Introduction to algorithms

Introduction to algorithms
Temporal constraint networks

Artificial Intelligence - Special issue on knowledge representation
Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra

Journal of the ACM (JACM)
Efficient algorithms for qualitative reasoning about time

Artificial Intelligence
Unit Refutations and Horn Sets

Journal of the ACM (JACM)
Maintaining knowledge about temporal intervals

Communications of the ACM
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 new proof of tractability for 0RD-horn relations

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1

Combining topological and size information for spatial reasoning

Artificial Intelligence
Temporal Constraints: A Survey

Constraints
A method for metric temporal reasoning

Eighteenth national conference on Artificial intelligence
Incremental qualitative temporal reasoning: algorithms for the point algebra and the ORD-Horn class

Artificial Intelligence
Temporal reasoning about fuzzy intervals

Artificial Intelligence
An approach to temporal planning and scheduling in domains with predictable exogenous events

Journal of Artificial Intelligence Research
Maximal tractable fragments of the region connection calculus: a complete analysis

IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
A new framework for reasoning about points, intervals and durations

IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Resource temporal networks: definition and complexity

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Incremental tractable reasoning about qualitative temporal constraints

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Incremental qualitative temporal reasoning: Algorithms for the Point Algebra and the ORD-Horn class

Artificial Intelligence
Qualitative spatial reasoning with topological information

Qualitative spatial reasoning with topological information
A SAT-based decision procedure for the boolean combination of difference constraints

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Computing a consistent interpretation of the variables involved in a set of temporal constraints is an important task for many areas of AI requiring temporal reasoning. We focus on the important classes of the qualitative relations in Nebel and Biirckert's ORD-Horn algebra, and of the metric constraints forming a STP, possibly augmented w i th inequations. For these tractable classes we present three new algorithms for solving the problem of finding a solution, and an efficient algorithm for determining the consistency of a STP augmented with in equations.