Updating Reduced Implicate Tries

  • Authors:

  • Neil V. Murray;Erik Rosenthal

  • Affiliations:

  • Department of Computer Science, State University of New York, Albany, NY 12222, USA;Department of Mathematics, University of New Haven, West Haven, CT 06516, USA

  • Venue:
  • TABLEAUX '07 Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

The reduced implicate trie, introduced in [11], is a data structure that may be used as a target language for knowledge compilation. It has the property that, even when large, it guarantees fast response to queries. Specifically, a query can be processed in time linear in the size of the queryregardless of the size of the compiled knowledge base.The knowledge compilation paradigm typically assumes that the "intractable part" of the processing be done once, during compilation. This assumption could render updating the knowledge base infeasible if recompilation is required. The ability to install updates without recompilation may therefore considerably widen applicability.In this paper, several update operations not requiring recompilation are developed. These include disjunction, substitution of truth constants, conjunction with unit clauses, reordering of variables, and conjunction with clauses.