Normal forms for knowledge compilation

Authors:
Reiner Hähnle;Neil V. Murray;Erik Rosenthal
Affiliations:
Department of Computing Science, Chalmers University of Technology, Gothenburg, Sweden;Department of Computer Science, State University of New York, Albany, NY;Department of Mathematics, University of New Haven, West Haven, CT
Venue:
ISMIS'05 Proceedings of the 15th international conference on Foundations of Intelligent Systems
Year:
2005

Citing 10
Cited 3

Inference with path resolution and semantic graphs

Journal of the ACM (JACM)
Symbolic Boolean manipulation with ordered binary-decision diagrams

ACM Computing Surveys (CSUR)
Building problem solvers

Building problem solvers
Dissolution: making paths vanish

Journal of the ACM (JACM)
Knowledge compilation and theory approximation

Journal of the ACM (JACM)
Decomposable negation normal form

Journal of the ACM (JACM)
BDDs and Automated Deduction

ISMIS '94 Proceedings of the 8th International Symposium on Methodologies for Intelligent Systems
Simplification: A General Constraint Propagation Technique for Propositional and Modal Tableaux

TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
A survey on knowledge compilation

AI Communications
Knowledge compilation using theory prime implicates

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1

Prime Implicates and Reduced Implicate Tries

ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems
Reduced implicate/implicant tries

ISMIS'08 Proceedings of the 17th international conference on Foundations of intelligent systems
Duality in knowledge compilation techniques

ISMIS'05 Proceedings of the 15th international conference on Foundations of Intelligent Systems

Quantified Score

Hi-index	0.04

Visualization

Abstract

A class of formulas called factored negation normal form is introduced. They are closely related to BDDs, but there is a DPLL-like tableau procedure for computing them that operates in PSPACE.Ordered factored negation normal form provides a canonical representation for any boolean function. Reduction strategies are developed that provide a unique reduced factored negation normal form. These compilation techniques work well with negated form as input, and it is shown that any logical formula can be translated into negated form in linear time.