A New Method to Index and Query Sets
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence. Constraint Satisfaction. Pages 462-466.
Abstract
Let us consider the following problem: Given a (probably huge) set of sets Sand a query set q, is there some set s E S such that s ~ q? This problem occurs in at least four application areas: the matching of a large number (usually several 100,000s) of production rules, the processing of queries in data bases supporting set-valued attributes, the identification of inconsistent subgoals during artificial intelligence planning and the detection of potential periodic chains in labeled tableau systems for modal logics. In this paper, we introduce a data structure and algorithm that allow a compact representation of such a huge set of sets and an efficient answering of subset and superset queries. The algorithm has been used successfully in the IPP system and enabled this planner to win the ADL track of the first planning competition.
@inproceedings{ijcai1999p67,
title = {A New Method to Index and Query Sets},
author = {Hoffmann, Jörg and Koehler, Jana},
booktitle = {Proceedings of the Sixteenth International Joint Conference on
Artificial Intelligence, {IJCAI-99}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Thomas Dean},
pages = {462--466},
year = {1999},
note = {Constraint Satisfaction},
url = {https://ijcai.org/proceedings/1999/67},
}
TY - CPAPER TI - A New Method to Index and Query Sets AU - Hoffmann, Jörg AU - Koehler, Jana T2 - Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI-99 PB - International Joint Conferences on Artificial Intelligence PY - 1999 SP - 462 EP - 466 UR - https://ijcai.org/proceedings/1999/67 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
