Normal Forms for Knowledge Compilation

DOI10.1007/11425274_32MaRDI QIDQ5450872zbMATH OpenOpenAlexFDO

Authors Reiner Hähnle, Neil V. Murray, Erik Rosenthal

Publication date 17 March 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11425274_32

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Knowledge representation (68T30)

Recommendations

• Decomposable negation normal form
• Tableaux, path dissolution, and decomposable negation normal form for knowledge compilation
• scientific article; zbMATH DE number 1946853
• Duality in Knowledge Compilation Techniques
• Knowledge compilation and theory approximation

Cited in

(11)

• New canonical representations by augmenting OBDDs with conjunctive decomposition
• A transformation system for unique minimal normal forms of conditional knowledge bases
• Knowledge compilation of logic programs using approximation fixpoint theory
• Efficient query processing with reduced implicate tries
• Decomposable negation normal form
• Tableaux for projection computation and knowledge compilation
• Tableaux, path dissolution, and decomposable negation normal form for knowledge compilation
• Duality in Knowledge Compilation Techniques
• scientific article; zbMATH DE number 1696816 (Why is no real title available?)
• On the role of logical separability in knowledge compilation
• Formula normalizations in verification

This page was built for publication: Normal Forms for Knowledge Compilation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5450872)