Symbolic techniques in satisfiability solving
From MaRDI portal
Publication:862403
DOI10.1007/S10817-005-9009-7zbMATH Open1109.68104OpenAlexW1963535597MaRDI QIDQ862403FDOQ862403
Authors: Guoqiang Pan, Moshe Y. Vardi 
Publication date: 24 January 2007
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10817-005-9009-7
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
- BerkMin: A fast and robust SAT-solver
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Graph-Based Algorithms for Boolean Function Manipulation
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- Principles and Practice of Constraint Programming – CP 2004
- Symbolic model checking: \(10^{20}\) states and beyond
- Complexity of Finding Embeddings in a k-Tree
- The complexity of satisfiability problems
- Network-based heuristics for constraint-satisfaction problems
- Theory and Applications of Satisfiability Testing
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- Self-reducibility
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Theory and Applications of Satisfiability Testing
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- Treewidth: computational experiments
- The Complexity of Propositional Proofs
- Solving satisfiability using decomposition and the most constrained subproblem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Random 3-SAT: The plot thickens
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (22)
- A deductive approach towards reasoning about algebraic transition systems
- Symbol elimination and applications to parametric entailment problems
- Principles and Practice of Constraint Programming – CP 2004
- Extended Resolution Proofs for Symbolic SAT Solving with Quantification
- Title not available (Why is that?)
- ProCount: weighted projected model counting with graded project-join trees
- Theory and Applications of Satisfiability Testing
- A direct construction of polynomial-size OBDD proof of pigeon hole problem
- Exploiting the real power of unit propagation lookahead
- ON OBDD-BASED ALGORITHMS AND PROOF SYSTEMS THAT DYNAMICALLY CHANGE THE ORDER OF VARIABLES
- Propositional proof systems based on maximum satisfiability
- Symbolic-interval cooperation in constraint programming
- Theory and Applications of Satisfiability Testing
- A finite state intersection approach to propositional satisfiability
- Title not available (Why is that?)
- Title not available (Why is that?)
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Variable and clause ordering in an FSA approach to propositional satisfiability
- Extending existential quantification in conjuctions of BDDs
- Pumping, cleaning and symbolic constraints solving
- A satisfiability procedure for quantified Boolean formulae
Uses Software
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)
