Improving Search Using Indexing: A Study with Temporal CSPs
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence. Constraint Satisfaction. Pages 436-440.
Abstract
Most studies concerning constraint satisfaction problems (CSPs) involve variables that take v~l ues from small domains. This paper deals with an alternative form of temporal CSPs; the number of variables is relatively small and the domains are large collections of intervals. Such situations may arise in temporal databases where several types of queries can be modeled and processed as CSPs. For these problems, systematic CSP algorithms can take advantage of temporal indexing to accelerate search. Directed search versions of chronological backtracking and forward checking are presented and tested . Our results show that indexing can drastically improve search performance.
@inproceedings{ijcai1999p63,
title = {Improving Search Using Indexing: A Study with Temporal CSPs},
author = {Mamoulis, Nikos and Papadias, Dimitris},
booktitle = {Proceedings of the Sixteenth International Joint Conference on
Artificial Intelligence, {IJCAI-99}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Thomas Dean},
pages = {436--440},
year = {1999},
note = {Constraint Satisfaction},
url = {https://ijcai.org/proceedings/1999/63},
}
TY - CPAPER TI - Improving Search Using Indexing: A Study with Temporal CSPs AU - Mamoulis, Nikos AU - Papadias, Dimitris T2 - Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI-99 PB - International Joint Conferences on Artificial Intelligence PY - 1999 SP - 436 EP - 440 UR - https://ijcai.org/proceedings/1999/63 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
