On the role of logical separability in knowledge compilation

DOI10.1016/J.ARTINT.2024.104077MaRDI QIDQ6494362

Zhao-Rong Lai, Quanlong Guan, Liangda Fang, Qian Dong, Zhanhao Xiao, Wenqing Li, Junming Qiu

Publication date: 30 April 2024

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

propositional logicknowledge compilationlogical separability

Mathematics Subject Classification ID

Knowledge representation (68T30) Mechanization of proofs and logical operations (03B35)

Cites Work

• Disjunctive closures for knowledge compilation
• Conformant planning via symbolic model checking and heuristic search
• Verifying binarized neural networks by Angluin-style learning
• Definability for model counting
• On probabilistic inference by weighted model counting
• Graph-Based Algorithms for Boolean Function Manipulation
• Knowledge compilation and theory approximation
• On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision
• On Quantifying Literals in Boolean Logic and its Applications to Explainable AI
• Properties of Switch-List Representations of Boolean Functions
• Theory and Applications of Satisfiability Testing
• The complexity of the counting constraint satisfaction problem
• Decomposable negation normal form
• The decision problem for formulas in prenex conjunctive normal form with binary disjunctions
• A Computing Procedure for Quantification Theory
• On sentences which are true of direct unions of algebras
• What's hard about Boolean functional synthesis?
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the role of logical separability in knowledge compilation