Tractable cover compilations

  • Authors:

  • Yacine Boufkhad;Eric Gregoire;Pierre Marquis;Bertrand Mazure;Lakhdar Sais

  • Affiliations:

  • LIP6, University Paris 6, Paris Cedex 05, France;CRIL, University d'Artois, Lens Cedex, France;CRIL, University d'Artois, Lens Cedex, France;CRIL, University d'Artois, Lens Cedex, France;CRIL, University d'Artois, Lens Cedex, France and IUT de Lens, University d'Artois, Lens Cedex, France

  • Venue:
  • IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
  • Year:
  • 1997

Quantified Score

Hi-index 0.01

Visualization

Abstract

Tractable covers are introduced as a new approach to equivalence-preserving compilation of propositional knowledge bases. First, a general framework is presented. Then, two specific cases are considered. In the first one, partial interpretations are used to shape the knowledge base into tractable formulas from several possible classes. In the second case, they are used to derive renamable Horn formulas. This last case is proved less space-consuming than prime implicants cover compilations for every knowledge base. Finally, experimental results show that the new approaches can prove efficient w.r.t. direct query answering and offer significant time and space savings w.r.t. prime implicants covers.