On Finding a Solution in Temporal Constraint Satisfaction Problems
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 with 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. 1
Cite
Text
Gerevini and Cristani. "On Finding a Solution in Temporal Constraint Satisfaction Problems." International Joint Conference on Artificial Intelligence, 1997.Markdown
[Gerevini and Cristani. "On Finding a Solution in Temporal Constraint Satisfaction Problems." International Joint Conference on Artificial Intelligence, 1997.](https://mlanthology.org/ijcai/1997/gerevini1997ijcai-finding/)BibTeX
@inproceedings{gerevini1997ijcai-finding,
title = {{On Finding a Solution in Temporal Constraint Satisfaction Problems}},
author = {Gerevini, Alfonso and Cristani, Matteo},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1997},
pages = {1460-1465},
url = {https://mlanthology.org/ijcai/1997/gerevini1997ijcai-finding/}
}