Normal Forms for Knowledge Compilation

DOI10.1007/11425274_32zbMATH Open1132.68550OpenAlexW1881465754MaRDI QIDQ5450872FDOQ5450872

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

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

Mathematics Subject Classification ID

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

Cited In (11)

• New canonical representations by augmenting OBDDs with conjunctive decomposition
• Knowledge compilation of logic programs using approximation fixpoint theory
• A transformation system for unique minimal normal forms of conditional knowledge bases
• Decomposable negation normal form
• Efficient query processing with reduced implicate tries
• Tableaux for projection computation and knowledge compilation
• Duality in Knowledge Compilation Techniques
• Tableaux, path dissolution, and decomposable negation normal form for knowledge compilation
• Title not available (Why is that?)
• 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)