ML Anthology

A New Method to Index and Query Sets

Jörg Hoffmann, Jana Koehler
IJCAI 1999 pp. 462-467
/ijcai/1999/hoffmann1999ijcai-new/

Abstract

Let us consider the following problem: Given a (probably huge) set of sets S and a query set g, is there some set s S such that 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. 1

PDF Semantic Scholar

Cite

Text

Hoffmann and Koehler. "A New Method to Index and Query Sets." International Joint Conference on Artificial Intelligence, 1999.

Markdown

[Hoffmann and Koehler. "A New Method to Index and Query Sets." International Joint Conference on Artificial Intelligence, 1999.](https://mlanthology.org/ijcai/1999/hoffmann1999ijcai-new/)

BibTeX

@inproceedings{hoffmann1999ijcai-new,
  title     = {{A New Method to Index and Query Sets}},
  author    = {Hoffmann, Jörg and Koehler, Jana},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {1999},
  pages     = {462-467},
  url       = {https://mlanthology.org/ijcai/1999/hoffmann1999ijcai-new/}
}