Using Problem Symmetry in Search Based Satisfiability Algorithms
Eugene Goldberg,Mukul R. Prasad,Robert K. Brayton +2 more
- 04 Mar 2002
- pp 134-141
TL;DR: A theory of essential points is developed to formally characterize the potential search-space pruning that can be realized by exploiting problem symmetry in search-based SAT algorithms and a new pruning rule exploited problem symmetry is proposed.
read more
Abstract: We introduce the notion of problem symmetry in search-based SAT algorithms. We develop a theory of essential points to formally characterize the potential search-space pruning that can be realized by exploiting problem symmetry. We unify several search-pruning techniques used in modern SAT solvers under a single framework, by showing them to be special cases of the general theory of essential points. We also propose a new pruning rule exploiting problem symmetry. Preliminary experimental results validate the efficacy of this rule in providing additional search-space pruning beyond the pruning realized by techniques implemented in leading-edge SAT solvers.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Book
Proceedings : 2002 Design, Automation and Test in Europe, conference and exhibition : March 4-8, 2002, Paris, France
Aeia,Carlos Delgado Kloos,Jose da Franca +2 more
- 01 Jan 2002
TL;DR: The following topics are dealt with: semiconductor IP; formal verification; cooling; power management; defect oriented test; SAT and BDD techniques; low power design; mixed signal test; collaborative design; logic synthesis; symbolic techniques; EDA tools; analogue circuits; asynchronous circuits; BIST; DFT.
119
Quantifier elimination by Dependency Sequents
Eugene Goldberg,Panagiotis Manolios +1 more
- 01 Oct 2012
TL;DR: In this article, a Dependency-sequent (D-sequent) is used to record that a set of quantified variables is redundant under a partial assignment, and the join operation that produces new D-sequents from existing ones.
Boundary Points and Resolution
Eugene Goldberg
- 29 Jun 2009
TL;DR: It is shown experimentally that in contrast to proofs generated by this SAT-solver, almost every resolution of a specialized proof eliminates a boundary point, which implies that the share of resolutions eliminating boundary points as a metric for proof quality.
•Posted Content
Quantifier Elimination by Dependency Sequents
TL;DR: This work introduces an algorithm based on DDS, a new method for solving the problem of existential quantifier elimination for Boolean CNF formulas, and shows that DDS is compositional, i.e., if the authors' input formula is a conjunction of independent formulas, DDS automatically recognizes and exploits this information.
14
A BMC-based formulation for the scheduling problem of hardware systems
Gianpiero Cabodi,Alex Kondratyev,Luciano Lavagno,Sergio Nocco,Stefano Quer,Yosinori Watanabe +5 more
TL;DR: This paper defines a new SAT-based formulation of automata-based scheduling and proposes for the first time a completely new resolution algorithm based on SAT solvers and bounded model checking (BMC) that is specifically suited to control-dominated applications.
11
References
•Book
A machine program for theorem-proving
Martin Davis,George Logemann,Donald W. Loveland +2 more
- 31 Aug 2011
TL;DR: The programming of a proof procedure is discussed in connection with trial runs and possible improvements.
3.6K
Chaff: engineering an efficient SAT solver
Matthew W. Moskewicz,Conor F. Madigan,Ying Zhao,Lintao Zhang,Sharad Malik +4 more
- 22 Jun 2001
TL;DR: The development of a new complete solver, Chaff, is described which achieves significant performance gains through careful engineering of all aspects of the search-especially a particularly efficient implementation of Boolean constraint propagation (BCP) and a novel low overhead decision strategy.
A Computing Procedure for Quantification Theory
Martin Davis,Hilary Putnam +1 more
TL;DR: In the present paper, a uniform proof procedure for quantification theory is given which is feasible for use with some rather complicated formulas and which does not ordinarily lead to exponentiation.
Symbolic Model Checking without BDDs
Armin Biere,Alessandro Cimatti,Edmund M. Clarke,Yunshan Zhu +3 more
- 22 Mar 1999
TL;DR: This paper shows how boolean decision procedures, like Stalmarck's Method or the Davis & Putnam Procedure, can replace BDDs, and introduces a bounded model checking procedure for LTL which reduces model checking to propositional satisfiability.
GRASP: a search algorithm for propositional satisfiability
TL;DR: Experimental results obtained from a large number of benchmarks indicate that application of the proposed conflict analysis techniques to SAT algorithms can be extremely effective for aLarge number of representative classes of SAT instances.
Related Papers (5)
R. Ostrowski,Bertrand Mazure,Lakhdar Sais,Éric Grégoire +3 more
- 03 Nov 2003
Kenneth L. McMillan
- 08 Jul 2003
Chongyuan Yin,Guiming Luo,Pei Hu +2 more
- 14 Aug 2009