Symbolic techniques in satisfiability solving
type: Item
instance of: scholarly article
title: Symbolic techniques in satisfiability solving
zbMATH Open document ID: 1109.68104
author: Guoqiang Pan
author: Moshe Y. Vardi
published in: Journal of Automated Reasoning
publication date: 2007-01-24T00:00:00Z
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 5118125
zbMATH Keywords: optimization techniques
zbMATH Keywords: constraint satisfaction
describes a project that uses: CUDD
describes a project that uses: CirCUs
describes a project that uses: zChaff
describes a project that uses: SBSAT
describes a project that uses: Chaff
describes a project that uses: FORCE
MaRDI profile type: Publication
full work available at URL: s10817-005-9009-7
OpenAlex ID: W1963535597
cites work: Solving satisfiability using decomposition and the most constrained subproblem
cites work: Complexity of Finding Embeddings in a k-Tree
cites work: Self-reducibility
cites work: Theory and Applications of Satisfiability Testing
cites work: Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
cites work: Graph-Based Algorithms for Boolean Function Manipulation
cites work: Symbolic model checking: \(10^{20}\) states and beyond
cites work: Q4527271
cites work: Random 3-SAT: The plot thickens
cites work: A machine program for theorem-proving
cites work: A Computing Procedure for Quantification Theory
cites work: Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
cites work: Network-based heuristics for constraint-satisfaction problems
cites work: BerkMin: A fast and robust SAT-solver
cites work: Treewidth: computational experiments
cites work: Q4864698
cites work: Q4707784
cites work: Principles and Practice of Constraint Programming – CP 2004
cites work: Q4475626
cites work: The complexity of satisfiability problems
cites work: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
cites work: The Complexity of Propositional Proofs
DOI: 10.1007/S10817-005-9009-7
Recommended article: Theory and Applications of Satisfiability Testing
Recommended article: Satisfiability checking and symbolic computation
Recommended article: Q2729082
Recommended article: Symbolic Automata Constraint Solving
Recommended article: Building bridges between symbolic computation and satisfiability checking
Recommended article: Symbolic optimization with SMT solvers
Recommended article: Extended Resolution Proofs for Symbolic SAT Solving with Quantification
Recommended article: Symbolic computation in automated program reasoning
description: scientific article; zbMATH DE number 5118125