$$\#\exists $$ SAT: Projected Model Counting

DOI10.1007/978-3-319-24318-4_10zbMath1471.68174arXiv1507.07648OpenAlexW2232112468MaRDI QIDQ3453218

Christian Muise, Peter J. Stuckey, Rehan Abdul Aziz, Geoffrey Chu

Publication date: 20 November 2015

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

Full work available at URL: https://arxiv.org/abs/1507.07648

Mathematics Subject Classification ID

Computational aspects of satisfiability (68R07)

Related Items

A Study of Symmetry Breaking Predicates and Model Counting ⋮ \(T_{\mathcal{P}}\)-compilation for inference in probabilistic logic programs ⋮ Solving projected model counting by utilizing treewidth and its limits ⋮ OuterCount: a first-level solution-counter for quantified Boolean formulas ⋮ The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference ⋮ Definability for model counting ⋮ Counting of Teams in First-Order Team Logics ⋮ ProCount: weighted projected model counting with graded project-join trees

Uses Software

• Chaff
• sharpSAT

Cites Work

• Unnamed Item
• Unnamed Item
• Quantifier elimination by dependency sequents
• Conflict-driven answer set solving: from theory to practice
• Solution Enumeration for Projected Boolean Search Problems
• Conflict-Driven Answer Set Enumeration
• Decomposable negation normal form
• A machine program for theorem-proving
• Theory and Applications of Satisfiability Testing

This page was built for publication: $$\#\exists $$ SAT: Projected Model Counting