$$\#\exists $$ SAT: Projected Model Counting
- 27 October 2015
- book chapter
- Published by Springer Science and Business Media LLC
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- SAT-Based Analysis and Quantification of Information Flow in ProgramsLecture Notes in Computer Science, 2013
- Boolean Quantifier Elimination for Automotive Configuration – A Case StudyLecture Notes in Computer Science, 2013
- Conflict-driven answer set solving: From theory to practiceArtificial Intelligence, 2012
- Existential Quantification as Incremental SATLecture Notes in Computer Science, 2011
- Solution Enumeration for Projected Boolean Search ProblemsLecture Notes in Computer Science, 2009
- sharpSAT – Counting Models with Advanced Component Caching and Implicit BCPLecture Notes in Computer Science, 2006
- Heuristics for Fast Exact Model CountingLecture Notes in Computer Science, 2005
- Decomposable negation normal formJournal of the ACM, 2001
- ChaffPublished by Association for Computing Machinery (ACM) ,2001
- A machine program for theorem-provingCommunications of the ACM, 1962