TY - GEN

T1 - The hyper system

T2 - 6th Pacific Rim International Conference on Artificial Intelligence, PRICAI 2000

AU - Prendinger, Helmut

AU - Ishizuka, Mitsuru

AU - Yamamoto, Tetsu

PY - 2000

Y1 - 2000

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84867836008&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84867836008&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84867836008

SN - 3540679251

SN - 9783540679257

VL - 1886 LNAI

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 93

EP - 103

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Y2 - 28 August 2000 through 1 September 2000

ER -