---
title: "On Finding a Solution in Temporal Constraint Satisfaction Problems"
authors:
  - "Alfonso Gerevini"
  - "Matteo Cristani"
doi: ""
url: "https://ijcai.org/proceedings/1997/210"
pdf: "https://ijcai.org/proceedings/1997/0210.pdf"
venue: "Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence"
year: 1997
pages: "1460-1464"
track: "Temporal Reasoning"
keywords:
---

# On Finding a Solution in Temporal Constraint Satisfaction Problems

Alfonso Gerevini, Matteo Cristani

*Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence*, pages 1460-1464.

## Abstract

Computing a consiste nt int erpretatio n of th e 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 qualit at ive relations in Nebel and Biirckert's ORD-Horn algebra, and of the metric constraints forming a STP , possibly augmented with in equat ions. For these tractable classes we prese nt three new algorithms for solving the problem of finding a solution, and an efficie nt algorithm for determining the consistency of a STP augmented with inequations.