Please use this identifier to cite or link to this item: http://hdl.handle.net/1783.1/154

Improving search using indexing: a study with temporal CSPs

Authors Mamoulis, N
Papadias, D
Issue Date 1999
Source IJCAI-99: PROCEEDINGS OF THE SIXTEENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOLS 1 & 2, 1999, p. 436-441
Summary Most studies concerning constraint satisfaction problems (CSPs) involve variables that take values 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.
Subjects
CSP
ISBN 1-55860-613-0
Language English
Format Conference paper
Access View full-text via Web of Science
Files in this item:
File Description Size Format
ijcai99.pdf 72935 B Adobe PDF