Abstract
We present the Hyper system that implements a new approach to knowledge compilation, where function-free first-order acyclic Horn theories are transformed to propositional logic. The compilation method integrates techniques from deductive databases (relevance reasoning) and theory transformation via unfold/fold transformations, to obtain a compact propositional representation. The transformed theory is more compact than the ground version of the original theory in terms of significantly less and mostly shorter clauses. This form of compilation, called knowledge (base) reformation, is important since the most efficient reasoning methods are defined for propositional theories, while knowledge is most naturally expressed in a first-order language. In particular, we will show that knowledge reformation allows low-order polynomial time inference to find a near-optimal solution in cost-based first-order hypothetical reasoning (or ‘abduction’) problems. We will also present experimental results that confirm the effectiveness of our compilation method.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Marco Cadoli and Francesco M. Donini. A survey on knowledge compilation. AI Communications, 10:137–150, 1997.
U. S. Charkravarthy, John Grant, and Jack Minker. Foundations of semantic query optimization for deductive databases. In Jack Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 243–273. Morgan Kaufmann Publishers, 1988.
John Debenham. Knowledge object decomposition. In Proceedings 12th International FLAIRS Conference (FLAIRS-99), pages 203–207, 1999.
Thomas Eiter and Georg Gottlob. The complexity of logic-based abduction. Journal of the ACM, 42(1–2):3–42, 1995.
Mitsuru Ishizuka and Yutaka Matsuo. SL method for computing a near-optimal solution using linear and non-linear programming in cost-based hypothetical reasoning. In Proceedings 5th Pacific Rim Conference on Artificial Intelligence (PRICAI-98), pages 611–625, 1998.
Henry Kautz and Bart Selman. Pushing the envelope: Planning, propositional logic, and stochastic search. In Proceedings 13th National Conference on Artificial Intelligence (AAAI-96), 1996.
Hector J. Levesque. A completeness result for reasoning with incomplete first-order knowledge bases. In Proceedings 6th Conference on Principles of Knowledge Representation and Reasoning (KR-98), pages 14–23, 1998.
Alon Y. Levy, Richard E. Fikes, and Yehoshua Sagiv. Speeding up inferences using relevance reasoning: a formalism and algorithms. Artificial Intelligence, 97:83–136, 1997.
Yukio Ohsawa and Mitsuru Ishizuka. Networked bubble propagation: a polynomial-time hypothetical reasoning method for computing near-optimal solutions. Artificial Intelligence, 91:131–154, 1997.
Helmut Prendinger and Mitsuru Ishizuka. Preparing a first-order knowledge base for fast inference. In Proceedings 12th International FLAIRS Conference (FLAIRS-99), pages 208–121, 1999.
Helmut Prendinger and Mitsuru Ishizuka. Qualifying the expressivity/efficiency tradeoff: Reformation-based diagnosis. In Proceedings 16th National Conference on Artificial Intelligence (AAAI-99), pages 416–421, 1999.
Maurizio Proietti and Alberto Pettorossi. Unfolding—definition—folding, in this order, for avoiding unnecessary variables in logic programs. Theoretical Computer Science, 142:89–124, 1995.
Gerhard Schurz. Relevance in deductive reasoning: A critical overview. In G. Schurz and M. Ursic, editors, Beyond Classical Logic. Academia Press, St. Augustin, 1999.
Bart Selman and Henry Kautz. Domain-independent extensions to GSAT: Solving large structured satisfiability problems. In Proceedings 13th International Conference on Artificial Intelligence (IJCAI-93), pages 290–295, 1993.
G. Sutcliffe and C. B. Suttner. The TPTP Problem Library: CNF Release v1.2.1. Journal of Automated Reasoning, 21(2):177–203, 1998.
Hisao Tamaki and Taisuke Sato. Unfold/fold transformation of logic programs. In Proceedings 2nd International Logic Programming Conference, pages 127–138, 1984.
Brian C. Williams and P. Pandurang Nayak. A model-based approach to reactive self-configuring systems. In Proceedings 13th National Conference on Artificial Intelligence (AAAI-96), pages 971–978, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Prendinger, H., Ishizuka, M., Yamamoto, T. (2000). The Hyper System: Knowledge Reformation for Efficient First-Order Hypothetical Reasoning. In: Mizoguchi, R., Slaney, J. (eds) PRICAI 2000 Topics in Artificial Intelligence. PRICAI 2000. Lecture Notes in Computer Science(), vol 1886. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44533-1_13
Download citation
DOI: https://doi.org/10.1007/3-540-44533-1_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67925-7
Online ISBN: 978-3-540-44533-3
eBook Packages: Springer Book Archive