Entailment vs. verification for partial-assignment satisfiability and enumeration
From MaRDI portal
Cites work
- \(\#{\exists}\mathrm{SAT}\): projected model counting
- A machine program for theorem-proving
- A structure-preserving clause form translation
- Advanced SMT techniques for weighted model integration
- AllSAT for combinational circuits
- Approximate Counting in SMT and Value Estimation for Probabilistic Programs
- Are tableaux an improvement on truth-tables? Cut-free proofs and bivalence
- Building decision procedures for modal logics from propositional decision procedures: The case study of modal \(K(m)\).
- Decomposable negation normal form
- Embedding complex decision procedures inside an interactive theorem prover.
- Enhancing SMT-based weighted model integration by structure awareness
- Entailing generalization boosts enumeration
- Four flavors of entailment
- From KSAT to Delayed Theory Combination: Exploiting DPLL Outside the SAT Domain
- Graph-Based Algorithms for Boolean Function Manipulation
- scientific article; zbMATH DE number 1946853 (Why is no real title available?)
- scientific article; zbMATH DE number 3274715 (Why is no real title available?)
- scientific article; zbMATH DE number 3325539 (Why is no real title available?)
- Lazy satisfiability modulo theories
- On CNF conversion for disjoint SAT enumeration
- On enumerating short projected models
- Optimization modulo theories with linear rational costs
- Solution Enumeration for Projected Boolean Search Problems
- Symbolic model checking: \(10^{20}\) states and beyond
This page was built for publication: Entailment vs. verification for partial-assignment satisfiability and enumeration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6869918)
