On enumerating short projected models
From MaRDI portal
Publication:6657245
DOI10.1016/j.dam.2024.10.021MaRDI QIDQ6657245
Roberto Sebastiani, Sibylle Möhle, Armin Biere
Publication date: 6 January 2025
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Specification and verification (program logics, model checking, etc.) (68Q60) Classical propositional logic (03B05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Compact DSOP and partial DSOP forms
- A structure-preserving clause form translation
- Chronological backtracking
- A verified SAT solver framework with learn, forget, restart, and incrementality
- Backing backtracking
- Advanced SMT techniques for weighted model integration
- On probabilistic inference by weighted model counting
- On converting CNF to DNF
- Four flavors of entailment
- Formalization of Abstract State Transition Systems for SAT
- $$\#\exists $$ SAT: Projected Model Counting
- Solving SAT and SAT Modulo Theories
- Solution Enumeration for Projected Boolean Search Problems
- Solving the incremental satisfiability problem
- GRASP: a search algorithm for propositional satisfiability
- Implementing Efficient All Solutions SAT Solvers
- Tools and Algorithms for the Construction and Analysis of Systems
- Minimizing Models for Tseitin-Encoded SAT Instances
- Mathematical Foundations of Computer Science 2003
- Formal Methods in Computer-Aided Design
- A Machine-Oriented Logic Based on the Resolution Principle
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- Tools and Algorithms for the Construction and Analysis of Systems
- Computer Aided Verification
This page was built for publication: On enumerating short projected models
