Duality in knowledge compilation techniques

Authors:
Neil V. Murray;Erik Rosenthal
Affiliations:
Department of Computer Science, State University of NewYork, 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 13
Cited 1

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)
On the relative merits of path dissolution and the method of analytic tableaux

Theoretical Computer Science
Knowledge compilation and theory approximation

Journal of the ACM (JACM)
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
Decomposable negation normal form

Journal of the ACM (JACM)
CNF and DNF Considered Harmful for Computing Prime Implicants/Implicates

Journal of Automated Reasoning
ZRES: The Old Davis-Putman Procedure Meets ZBDD

CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Knowledge Compilation Using the Extension Rule

Journal of Automated Reasoning
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
Normal forms for knowledge compilation

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

Efficient query processing with compiled knowledge bases

TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods

Quantified Score

Hi-index	0.01

Visualization

Abstract

Several classes of propositional formulas have been used as target languages for knowledge compilation. Some are based primarily on c-paths (essentially, the clauses in disjunctive normal form); others are based primarily on d-paths. Such duality is not surprising in light of the duality fundamental to classical logic. There is also duality among target languages in terms of how they treat links (complementary pairs of literals): Some are link-free; others are pairwise-linked (essentially, each pair of clauses is linked). In this paper, both types of duality are explored, first, by investigating the structure of existing forms, and secondly, by developing new forms for target languages.