Definability for model counting
From MaRDI portal
Publication:2303508
DOI10.1016/j.artint.2019.103229zbMath1435.68304OpenAlexW2999944813WikidataQ126402804 ScholiaQ126402804MaRDI QIDQ2303508
Jean-Marie Lagniez, Emmanuel Lonca, Pierre Marquis
Publication date: 4 March 2020
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2019.103229
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Classical propositional logic (03B05) Switching theory, applications of Boolean algebras to circuits and networks (94C11) Computational aspects of satisfiability (68R07)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On computing minimal independent support and its applications to sampling and counting
- Simulating circuit-level simplifications on CNF
- Theory and applications of satisfiability testing -- SAT 2012. 15th international conference, Trento, Italy, June 17--20, 2012. Proceedings
- The complexity of computing the permanent
- A structure-preserving clause form translation
- On compact representations of propositional circumscription
- Theory and applications of satisfiability testing -- SAT 2018. 21st international conference, SAT 2018, held as part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9--12, 2018. Proceedings
- Fast and flexible probabilistic model counting
- Exploiting treewidth for projected model counting and its limits
- Probabilistic model counting with short XORs
- On a generalization of extended resolution
- Algorithms for propositional model counting
- On preprocessing techniques and their impact on propositional model counting
- Theory and applications of satisfiability testing -- SAT 2013. 16th international conference, Helsinki, Finland, July 8--12, 2013. Proceedings
- On probabilistic inference by weighted model counting
- On propositional definability
- Principles and practice of constraint programming. 21st international conference, CP 2015, Cork, Ireland, August 31 -- September 4, 2015. Proceedings
- Subtractive reductions and complete problems for counting complexity classes
- On the hardness of approximate reasoning
- On Efficient Computation of Variable MUSes
- Efficient CNF Simplification Based on Binary Implication Graphs
- On Computing Preferred MUSes and MCSes
- Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory
- PP is as Hard as the Polynomial-Time Hierarchy
- $$\#\exists $$ SAT: Projected Model Counting
- Solution Enumeration for Projected Boolean Search Problems
- The Complexity of Weighted Boolean #CSP
- GRASP: a search algorithm for propositional satisfiability
- Clause Elimination Procedures for CNF Formulas
- Theory and Applications of Satisfiability Testing
- Compiling Probabilistic Graphical Models Using Sentential Decision Diagrams
- Factoring Out Assumptions to Speed Up MUS Extraction
- Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction
- Decomposable negation normal form
- A Computing Procedure for Quantification Theory
- The complexity of theorem-proving procedures
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
This page was built for publication: Definability for model counting
