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 inequations.

On Finding a Solution in Temporal Constraint Satisfaction Problems

CRISTANI, Matteo
1997

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 inequations.
Constraint processing; Temporal reasoning
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11562/18715
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 31
  • ???jsp.display-item.citation.isi??? 10
social impact