An exhaustive DPLL algorithm for model counting

MaRDI QIDQ4639880zbMATH OpenFDO

Authors Umut Oztok, Adnan Darwiche

Publication date 14 May 2018

Full work available at URL https://www.jair.org/index.php/jair/article/view/11201

zbMATH Keywords

model countersprobabilistic reasoningSAT solving techniques

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Reasoning under uncertainty in the context of artificial intelligence (68T37) Analysis of algorithms (68W40)

Recommendations

• Theory and Applications of Satisfiability Testing
• scientific article; zbMATH DE number 1315584
• Exact model counting of query expressions. Limitations of propositional methods
• Algorithms for Propositional Model Counting
• Two approximate algorithms for model counting

Cited in

(2)

• On the role of logical separability in knowledge compilation
• On the benefits of knowledge compilation for feature-model analyses

This page was built for publication: An exhaustive DPLL algorithm for model counting

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