Foundations of semantic query optimization for deductive databases
Foundations of deductive databases and logic programming
The complexity of logic-based abduction
Journal of the ACM (JACM)
Unfolding-definition-folding, in this order, for avoiding unnecessary variables in logic programs
PLILP '91 Selected papers of the symposium on Programming language implementation and logic programming
Artificial Intelligence - Special issue: artificial intelligence research in Japan
Speeding up inferences using relevance reasoning: a formalism and algorithms
Artificial Intelligence - Special issue on relevance
Qualifying the expressivity/efficiency tradeoff: reformation-based diagnosis
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Journal of Automated Reasoning
Preparing a First-Order Knowledge Base for Fast Inference
Proceedings of the Twelfth International Florida Artificial Intelligence Research Society Conference
Knowledge Object Decomposition
Proceedings of the Twelfth International Florida Artificial Intelligence Research Society Conference
PRICAI '98 Proceedings of the 5th Pacific Rim International Conference on Artificial Intelligence: Topics in Artificial Intelligence
A survey on knowledge compilation
AI Communications
Domain-independent extensions to GSAT: solving large structured satisfiability problems
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
A model-based approach to reactive self-configuring systems
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Pushing the envelope: planning, propositional logic, and stochastic search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Improving search in a hypothetical reasoning system
ACSC '03 Proceedings of the 26th Australasian computer science conference - Volume 16
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Hi-index | 0.00 |
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.