On Finding a Solution in Temporal Constraint Satisfaction Problems
Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence. Temporal Reasoning. 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.
@inproceedings{ijcai1997p210,
title = {On Finding a Solution in Temporal Constraint Satisfaction Problems},
author = {Gerevini, Alfonso and Cristani, Matteo},
booktitle = {Proceedings of the Fifteenth International Joint Conference on
Artificial Intelligence, {IJCAI-97}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Martha E. Pollack},
pages = {1460--1464},
year = {1997},
note = {Temporal Reasoning},
url = {https://ijcai.org/proceedings/1997/210},
}
TY - CPAPER TI - On Finding a Solution in Temporal Constraint Satisfaction Problems AU - Gerevini, Alfonso AU - Cristani, Matteo T2 - Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, IJCAI-97 PB - International Joint Conferences on Artificial Intelligence PY - 1997 SP - 1460 EP - 1464 UR - https://ijcai.org/proceedings/1997/210 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
