Symbolic techniques in satisfiability solving
From MaRDI portal
Publication:862403
DOI10.1007/s10817-005-9009-7zbMath1109.68104OpenAlexW1963535597MaRDI QIDQ862403
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
Related Items
A deductive approach towards reasoning about algebraic transition systems, ON OBDD-BASED ALGORITHMS AND PROOF SYSTEMS THAT DYNAMICALLY CHANGE THE ORDER OF VARIABLES, Propositional proof systems based on maximum satisfiability, A direct construction of polynomial-size OBDD proof of pigeon hole problem, ProCount: weighted projected model counting with graded project-join trees
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Network-based heuristics for constraint-satisfaction problems
- Symbolic model checking: \(10^{20}\) states and beyond
- Random 3-SAT: The plot thickens
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- Self-reducibility
- BerkMin: A fast and robust SAT-solver
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Graph-Based Algorithms for Boolean Function Manipulation
- Complexity of Finding Embeddings in a k-Tree
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- The complexity of satisfiability problems
- The Complexity of Propositional Proofs
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- Theory and Applications of Satisfiability Testing
- Principles and Practice of Constraint Programming – CP 2004
