Symbolic techniques in satisfiability solving
From MaRDI portal
Recommendations
- Theory and Applications of Satisfiability Testing
- Satisfiability checking and symbolic computation
- scientific article; zbMATH DE number 1629965
- Symbolic automata constraint solving
- Building bridges between symbolic computation and satisfiability checking
- Symbolic optimization with SMT solvers
- Extended Resolution Proofs for Symbolic SAT Solving with Quantification
- Symbolic computation in automated program reasoning
Cites work
- scientific article; zbMATH DE number 2084701 (Why is no real title available?)
- scientific article; zbMATH DE number 1560498 (Why is no real title available?)
- scientific article; zbMATH DE number 1926658 (Why is no real title available?)
- scientific article; zbMATH DE number 846270 (Why is no real title available?)
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- BerkMin: A fast and robust SAT-solver
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- Complexity of Finding Embeddings in a k-Tree
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- Graph-Based Algorithms for Boolean Function Manipulation
- Network-based heuristics for constraint-satisfaction problems
- Principles and Practice of Constraint Programming – CP 2004
- Random 3-SAT: The plot thickens
- Self-reducibility
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Solving satisfiability using decomposition and the most constrained subproblem
- Symbolic model checking: \(10^{20}\) states and beyond
- The Complexity of Propositional Proofs
- The complexity of satisfiability problems
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Treewidth: computational experiments
Cited in
(22)- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- ON OBDD-BASED ALGORITHMS AND PROOF SYSTEMS THAT DYNAMICALLY CHANGE THE ORDER OF VARIABLES
- Theory and Applications of Satisfiability Testing
- Principles and Practice of Constraint Programming – CP 2004
- Symbol elimination and applications to parametric entailment problems
- A satisfiability procedure for quantified Boolean formulae
- ProCount: weighted projected model counting with graded project-join trees
- scientific article; zbMATH DE number 2243352 (Why is no real title available?)
- A direct construction of polynomial-size OBDD proof of pigeon hole problem
- Exploiting the real power of unit propagation lookahead
- A deductive approach towards reasoning about algebraic transition systems
- Variable and clause ordering in an FSA approach to propositional satisfiability
- A finite state intersection approach to propositional satisfiability
- scientific article; zbMATH DE number 2243388 (Why is no real title available?)
- Symbolic-interval cooperation in constraint programming
- Propositional proof systems based on maximum satisfiability
- Extended Resolution Proofs for Symbolic SAT Solving with Quantification
- Theory and Applications of Satisfiability Testing
- Pumping, cleaning and symbolic constraints solving
- Extending existential quantification in conjuctions of BDDs
- scientific article; zbMATH DE number 2243377 (Why is no real title available?)
This page was built for publication: Symbolic techniques in satisfiability solving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q862403)
