Search vs. symbolic techniques in satisfiability solving
From MaRDI portal
Recommendations
- Symbolic techniques in satisfiability solving
- Satisfiability checking and symbolic computation
- Solving Satisfiability with Less Searching
- Building bridges between symbolic computation and satisfiability checking
- Evaluating search heuristics and optimization techniques in propositional satisfiability
- Symbolic reachability analysis based on SAT-solvers
- Symbolic optimization with SMT solvers
- A symbolic search based approach for quantified Boolean formulas
- The quest for efficient Boolean satisfiability solvers
Cited in
(15)- Generating extended resolution proofs with a BDD-based SAT solver
- Non-clausal redundancy properties
- Propositional proof systems based on maximum satisfiability
- Solving Satisfiability with Less Searching
- Extending existential quantification in conjuctions of BDDs
- Ordered binary decision diagrams and the Davis-Putnam procedure
- scientific article; zbMATH DE number 7250156 (Why is no real title available?)
- Theory and Applications of Satisfiability Testing
- A symbolic search based approach for quantified Boolean formulas
- Using DPLL for efficient OBDD construction
- Extended Resolution Proofs for Symbolic SAT Solving with Quantification
- Principles and Practice of Constraint Programming – CP 2004
- Optimizing a BDD-based modal solver.
- Generating Extended Resolution Proofs with a BDD-Based SAT Solver
- Symbolic techniques in satisfiability solving
This page was built for publication: Search vs. symbolic techniques in satisfiability solving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5714754)
