GRASP—a new search algorithm for satisfiability

Authors:
João P. Marques Silva;Karem A. Sakallah
Affiliations:
Cadence European Laboratories IST/INESC, 1000 Lisboa, Portugal;Department of EECS, University of Michigan, Ann Arbor, Michigan
Venue:
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Year:
1997

Citing 7
Cited 240

Efficient generation of test patterns using Boolean satisfiability

Efficient generation of test patterns using Boolean satisfiability
Dynamic search-space pruning techniques in path sensitization

DAC '94 Proceedings of the 31st annual Design Automation Conference
Improvements to propositional satisfiability search algorithms

Improvements to propositional satisfiability search algorithms
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Search State Equivalence for Redundancy Identification and Test Generation

Proceedings of the IEEE International Test Conference on Test: Faster, Better, Sooner
Recursive Learning: An Attractive Alternative to the Decision Tree for Test Genration in Digital Circuits

Proceedings of the IEEE International Test Conference on Discover the New World of Test and Design

FPGA routing and routability estimation via Boolean satisfiability

FPGA '97 Proceedings of the 1997 ACM fifth international symposium on Field-programmable gate arrays
A SAT-based implication engine for efficient ATPG, equivalence checking, and optimization of netlists

ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
Using reconfigurable computing techniques to accelerate problems in the CAD domain: a case study with Boolean satisfiability

DAC '98 Proceedings of the 35th annual Design Automation Conference
Functional vector generation for HDL models using linear programming and 3-satisfiability

DAC '98 Proceedings of the 35th annual Design Automation Conference
An intermediate design language and its analysis

SIGSOFT '98/FSE-6 Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering
Satisfiability-based layout revisited: detailed routing of complex FPGAs via search-based Boolean SAT

FPGA '99 Proceedings of the 1999 ACM/SIGDA seventh international symposium on Field programmable gate arrays
GRASP: A Search Algorithm for Propositional Satisfiability

IEEE Transactions on Computers
Combinational equivalence checking using satisfiability and recursive learning

DATE '99 Proceedings of the conference on Design, automation and test in Europe
Algorithms for solving Boolean satisfiability in combinational circuits

DATE '99 Proceedings of the conference on Design, automation and test in Europe
Why is ATPG easy?

Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Optimization-intensive watermarking techniques for decision problems

Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Gradient-based optimization of custom circuits using a static-timing formulation

Proceedings of the 36th annual ACM/IEEE Design Automation Conference
A massively-parallel easily-scalable satisfiability solver using reconfigurable hardware

Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Boolean satisfiability in electronic design automation

Proceedings of the 37th Annual Design Automation Conference
SAT based ATPG using fast justification and propagation in the implication graph

ICCAD '99 Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design
Techniques for improving the efficiency of sequential circuit test generation

ICCAD '99 Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design
A BDD-based satisfiability infrastructure using the unate recursive paradigm

DATE '00 Proceedings of the conference on Design, automation and test in Europe
Automatic lighthouse generation for directed state space search

DATE '00 Proceedings of the conference on Design, automation and test in Europe
On using satisfiability-based pruning techniques in covering algorithms

DATE '00 Proceedings of the conference on Design, automation and test in Europe
On applying incremental satisfiability to delay fault testing

DATE '00 Proceedings of the conference on Design, automation and test in Europe
Automating first-order relational logic

SIGSOFT '00/FSE-8 Proceedings of the 8th ACM SIGSOFT international symposium on Foundations of software engineering: twenty-first century applications
Using SAT for combinational equivalence checking

Proceedings of the conference on Design, automation and test in Europe
An efficient learning procedure for multiple implication checks

Proceedings of the conference on Design, automation and test in Europe
LPSAT: a unified approach to RTL satisfiability

Proceedings of the conference on Design, automation and test in Europe
Streaming BDD manipulation for large-scale combinatorial problems

Proceedings of the conference on Design, automation and test in Europe
Scalable hybrid verification of complex microprocessors

Proceedings of the 38th annual Design Automation Conference
Checking equivalence for partial implementations

Proceedings of the 38th annual Design Automation Conference
Dynamic detection and removal of inactive clauses in SAT with application in image computation

Proceedings of the 38th annual Design Automation Conference
Accelerating boolean satisfiability through application specific processing

Proceedings of the 14th international symposium on Systems synthesis
Satisfiability models and algorithms for circuit delay computation

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Flexibillity in logic

Logic Synthesis and Verification
SIVA: A System for Coverage-Directed State Space Search

Journal of Electronic Testing: Theory and Applications
Streaming BDD Manipulation

IEEE Transactions on Computers
An Overview of Backtrack Search Satisfiability Algorithms

Annals of Mathematics and Artificial Intelligence
A propositional theorem prover to solve planning and other problems

Annals of Mathematics and Artificial Intelligence
Lemma and cut strategies for propositional model elimination

Annals of Mathematics and Artificial Intelligence
A SAT Solver Using Reconfigurable Hardware and Virtual Logic

Journal of Automated Reasoning
Proving Unsatisfiability of CNFs Locally

Journal of Automated Reasoning
Efficient Algorithms for the Inference of Minimum Size DFAs

Machine Learning
Faster SAT and smaller BDDs via common function structure

Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Reconfigurable Accelerators for Combinatorial Problems

Computer
BDD Based Procedures for a Theory of Equality with Uninterpreted Functions

Formal Methods in System Design
The Impact of Branching Heuristics in Propositional Satisfiability Algorithms

EPIA '99 Proceedings of the 9th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence
SAT-Based Image Computation with Application in Reachability Analysis

FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
Multiagent SAT (MASSAT): Autonomous Pattern Search in Constrained Domains

IDEAL '02 Proceedings of the Third International Conference on Intelligent Data Engineering and Automated Learning
A Compressed Breadth-First Search for Satisfiability

ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Lemma and Model Caching in Decision Procedures for Quantified Boolean Formulas

TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Applying SAT Methods in Unbounded Symbolic Model Checking

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Semi-formal Bounded Model Checking

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
A Parallel Pipelined SAT Solver for FPGAs

FPL '00 Proceedings of the The Roadmap to Reconfigurable Computing, 10th International Workshop on Field-Programmable Logic and Applications
Sequential optimization in the absence of global reset

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Conflict driven techniques for improving deterministic test pattern generation

Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
Checking satisfiability of a conjunction of BDDs

Proceedings of the 40th annual Design Automation Conference
Modular verification of software components in C

Proceedings of the 25th International Conference on Software Engineering
A Scalable, Loadable Custom Programmable Logic Device for Solving Boolean Satisfiability Problems

FCCM '00 Proceedings of the 2000 IEEE Symposium on Field-Programmable Custom Computing Machines
Improved SAT-based Bounded Reachability Analysis

ASP-DAC '02 Proceedings of the 2002 Asia and South Pacific Design Automation Conference
Formal Verification Using Bounded Model Checking: SAT versus Sequential ATPG Engines

VLSID '03 Proceedings of the 16th International Conference on VLSI Design
On Solving Stack-Based Incremental Satisfiability Problems

ICCD '00 Proceedings of the 2000 IEEE International Conference on Computer Design: VLSI in Computers & Processors
Finding all minimal unsatisfiable subsets

Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Solving Satisfiability in Combinational Circuits

IEEE Design & Test
Satisfiability-Based Algorithms for Boolean Optimization

Annals of Mathematics and Artificial Intelligence
Persistent and Quasi-Persistent Lemmas in Propositional Model Elimination

Annals of Mathematics and Artificial Intelligence
Learning in a compiler for MINSAT algorithms

Theory and Practice of Logic Programming
Refining the SAT decision ordering for bounded model checking

Proceedings of the 41st annual Design Automation Conference
Modular Verification of Software Components in C

IEEE Transactions on Software Engineering
Improving simulation-based verification by means of formal methods

Proceedings of the 2004 Asia and South Pacific Design Automation Conference
ASSAT: computing answer sets of a logic program by SAT solvers

Artificial Intelligence - Special issue on nonmonotonic reasoning
The SAT2002 Competition

Annals of Mathematics and Artificial Intelligence
Efficient Data Structures for Backtrack Search SAT Solvers

Annals of Mathematics and Artificial Intelligence
Toward Leaner Binary-Clause Reasoning in a Satisfiability Solver

Annals of Mathematics and Artificial Intelligence
GridSAT: A Chaff-based Distributed SAT Solver for the Grid

Proceedings of the 2003 ACM/IEEE conference on Supercomputing
Resolution cannot polynomially simulate compressed-BFS

Annals of Mathematics and Artificial Intelligence
Lemma Exchange in a Microcontroller Based Parallel SAT Solver

ISVLSI '05 Proceedings of the IEEE Computer Society Annual Symposium on VLSI: New Frontiers in VLSI Design
PASSAT: Efficient SAT-Based Test Pattern Generation for Industrial Circuits

ISVLSI '05 Proceedings of the IEEE Computer Society Annual Symposium on VLSI: New Frontiers in VLSI Design
Unrestricted vs restricted cut in a tableau method for Boolean circuits

Annals of Mathematics and Artificial Intelligence
Functional test generation based on word-level SAT

Journal of Systems Architecture: the EUROMICRO Journal
Guiding CNF-SAT search via efficient constraint partitioning

Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design
Efficient computation of small abstraction refinements

Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design
Integrating CNF and BDD based SAT solvers

HLDVT '03 Proceedings of the Eighth IEEE International Workshop on High-Level Design Validation and Test Workshop
An interpolating theorem prover

Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
Solving topological constraints for declarative families of objects

Proceedings of the 2006 ACM symposium on Solid and physical modeling
Strong conflict analysis for propositional satisfiability

Proceedings of the conference on Design, automation and test in Europe: Proceedings
On the relation between simulation-based and SAT-based diagnosis

Proceedings of the conference on Design, automation and test in Europe: Proceedings
Predicate learning and selective theory deduction for a difference logic solver

Proceedings of the 43rd annual Design Automation Conference
Efficient SAT-based Boolean matching for FPGA technology mapping

Proceedings of the 43rd annual Design Automation Conference
MathSAT: Tight Integration of SAT and Mathematical Decision Procedures

Journal of Automated Reasoning
Propositional Satisfiability and Constraint Programming: A comparative survey

ACM Computing Surveys (CSUR)
Embedded software verification using symbolic execution and uninterpreted functions

International Journal of Parallel Programming
Efficient theory combination via boolean search

Information and Computation - Special issue: Combining logical systems
On-Chip Communication Architectures: System on Chip Interconnect

On-Chip Communication Architectures: System on Chip Interconnect
GridSAT: a system for solving satisfiability problems using a computational grid

Parallel Computing - Optimization on grids - Optimization for grids
Reducing verification overhead with RTL slicing

Proceedings of the 17th ACM Great Lakes symposium on VLSI
Interpolant Learning and Reuse in SAT-Based Model Checking

Electronic Notes in Theoretical Computer Science (ENTCS)
The state of SAT

Discrete Applied Mathematics
Solving topological constraints for declarative families of objects

Computer-Aided Design
EHSAT: an efficient RTL satisfiability solver using an extended DPLL procedure

Proceedings of the 44th annual Design Automation Conference
FPGA Design Automation: A Survey

Foundations and Trends in Electronic Design Automation
Another look at graph coloring via propositional satisfiability

Discrete Applied Mathematics
SAT-based ATPG using multilevel compatible don't-cares

ACM Transactions on Design Automation of Electronic Systems (TODAES)
A Methodology for Handling Complex Functional Constraints for Large Industrial Designs

Journal of Electronic Testing: Theory and Applications
Efficient symbolic multi-objective design space exploration

Proceedings of the 2008 Asia and South Pacific Design Automation Conference
Model checking with Boolean Satisfiability

Journal of Algorithms
SAT graph-based representation: A new perspective

Journal of Algorithms
A Study of SAT-Based Branching Heuristics for the CSP

SETN '08 Proceedings of the 5th Hellenic conference on Artificial Intelligence: Theories, Models and Applications
Experimenting with Small Changes in Conflict-Driven Clause Learning Algorithms

CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
FPGA-based hardware acceleration for Boolean satisfiability

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Dynamic Path Reduction for Software Model Checking

IFM '09 Proceedings of the 7th International Conference on Integrated Formal Methods
Self-adjusting constrained random stimulus generation using splitting evenness evaluation and XOR constraints

Proceedings of the 2009 Asia and South Pacific Design Automation Conference
Monotonic Partial Order Reduction: An Optimal Symbolic Partial Order Reduction Technique

CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
An Exponential Lower Bound for Width-Restricted Clause Learning

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
On-the-Fly Clause Improvement

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Dynamic Symmetry Breaking by Simulating Zykov Contraction

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Problem-Sensitive Restart Heuristics for the DPLL Procedure

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Software model checking

ACM Computing Surveys (CSUR)
Symbolic pruning of concurrent program executions

Proceedings of the the 7th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
The backdoor key: a path to understanding problem hardness

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
SymChaff: a structure-aware satisfiability solver

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Performing Bayesian inference by weighted model counting

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Clause learning can effectively P-simulate general propositional resolution

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Efficient memoization for dynamic programming with ad-hoc constraints

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
A new clause learning scheme for efficient unsatisfiability proofs

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Towards understanding and harnessing the potential of clause learning

Journal of Artificial Intelligence Research
Clause/term resolution and learning in the evaluation of quantified Boolean formulas

Journal of Artificial Intelligence Research
The language of search

Journal of Artificial Intelligence Research
MINIMAXSAT: an efficient weighted max-SAT solver

Journal of Artificial Intelligence Research
The effect of restarts on the efficiency of clause learning

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts

Proceedings of the 46th Annual Design Automation Conference
A structure-based variable ordering heuristic for SAT

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Understanding the power of clause learning

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Automated reasoning in modal and description logics via SAT encoding: the case study of KmALC-satisfiability

Journal of Artificial Intelligence Research
SymChaff: exploiting symmetry in a structure-aware satisfiability solver

Constraints
SAT-Solving in Practice, with a Tutorial Example from Supervisory Control

Discrete Event Dynamic Systems
Control-based clause sharing in parallel SAT solving

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Speeding-up heuristic allocation, scheduling and binding with SAT-based abstraction/refinement techniques

ACM Transactions on Design Automation of Electronic Systems (TODAES)
An Incremental Algorithm to Check Satisfiability for Bounded Model Checking

Electronic Notes in Theoretical Computer Science (ENTCS)
A collaborative approach for multi-threaded SAT solving

International Journal of Parallel Programming
Formula Caching in DPLL

ACM Transactions on Computation Theory (TOCT)
On Modern Clause-Learning Satisfiability Solvers

Journal of Automated Reasoning
Inference of regular languages using state merging algorithms with search

Pattern Recognition
A Gröbner basis approach to CNF-formulae preprocessing

TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Automatic abstraction without counterexamples

TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
An online proof-producing decision procedure for mixed-integer linear arithmetic

TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
The effect of Nogood recording in DPLL-CBJ SAT algorithms

ERCIM'02/CologNet'02 Proceedings of the 2002 Joint ERCIM/CologNet international conference on Constraint solving and constraint logic programming
Solving multi-objective pseudo-boolean problems

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Towards a better understanding of the functionality of a conflict-driven SAT solver

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
A lightweight component caching scheme for satisfiability solvers

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Towards robust CNF encodings of cardinality constraints

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Structural relaxations by variable renaming and their compilation for solving MinCostSAT

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
A case for simple SAT solvers

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Compressing propositional proofs by common subproof extraction

EUROCAST'07 Proceedings of the 11th international conference on Computer aided systems theory
Boolean satisfiability on a graphics processor

Proceedings of the 20th symposium on Great lakes symposium on VLSI
An interpolation method for CLP traversal

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
On the power of clause-learning SAT solvers with restarts

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
On multi-threaded satisfiability solving with OpenMP

IWOMP'08 Proceedings of the 4th international conference on OpenMP in a new era of parallelism
Improvements to hybrid incremental SAT algorithms

SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Extended clause learning

Artificial Intelligence
Solving satisfiability problems with preferences

Constraints
2009 CAV award announcement

Formal Methods in System Design
Making deduction more effective in SAT solvers

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Solving satisfiability in combinational circuits with backtrack search and recursive learning

SBCCI'99 Proceedings of the XIIth conference on Integrated circuits and systems design
Solver technology for system-level to RTL equivalence checking

Proceedings of the Conference on Design, Automation and Test in Europe
Partial weighted MaxSAT for optimal planning

PRICAI'10 Proceedings of the 11th Pacific Rim international conference on Trends in artificial intelligence
Diversification and intensification in parallel SAT solving

CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Combinatorial Optimization Solutions for the Maximum Quartet Consistency Problem

Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Debugging reversible circuits

Integration, the VLSI Journal
Generating high-quality tests for Boolean circuits by treating tests as proof encoding

TAP'10 Proceedings of the 4th international conference on Tests and proofs
On the power of clause-learning SAT solvers as resolution engines

Artificial Intelligence
Boosting local search thanks to CDCL

LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Sat-solving based on boundary point elimination

HVC'10 Proceedings of the 6th international conference on Hardware and software: verification and testing
A halting algorithm to determine the existence of decoder

Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design
Relieving capacity limits on FPGA-based SAT-solvers

Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design
Propelling SAT and SAT-based BMC using careset

Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design
Clause-learning algorithms with many restarts and bounded-width resolution

Journal of Artificial Intelligence Research
Computing small unsatisfiable cores in satisfiability modulo theories

Journal of Artificial Intelligence Research
On freezing and reactivating learnt clauses

SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Empirical study of the anatomy of modern sat solvers

SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Cutting to the Chase solving linear integer arithmetic

CADE'11 Proceedings of the 23rd international conference on Automated deduction
Exploiting macro-actions and predicting plan length in planning as satisfiability

AI*IA'11 Proceedings of the 12th international conference on Artificial intelligence around man and beyond
Deciding separation logic formulae by SAT and incremental negative cycle elimination

LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
QBF reasoning on real-world instances

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
CirCUs: a hybrid satisfiability solver

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Constraints as control

POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A boolean encoding including SAT and n-ary CSPs

AIMSA'06 Proceedings of the 12th international conference on Artificial Intelligence: methodology, Systems, and Applications
MDG-SAT: an automated methodology for efficient safety checking

International Journal of Critical Computer-Based Systems
Lazy explanations for constraint propagators

PADL'10 Proceedings of the 12th international conference on Practical Aspects of Declarative Languages
Alloy+HotCore: a fast approximation to unsat core

ABZ'10 Proceedings of the Second international conference on Abstract State Machines, Alloy, B and Z
Heuristics for fast exact model counting

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Variable ordering for efficient SAT search by analyzing constraint-variable dependencies

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Cost-effective hyper-resolution for preprocessing CNF formulas

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
On applying cutting planes in DLL-Based algorithms for pseudo-boolean optimization

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Inferring assertion for complementary synthesis

Proceedings of the International Conference on Computer-Aided Design
Efficient arithmetic sum-of-product (SOP) based multiple constant multiplication (MCM) for FFT

Proceedings of the International Conference on Computer-Aided Design
An efficient diagnosis algorithm for inconsistent constraint sets

Artificial Intelligence for Engineering Design, Analysis and Manufacturing
Applications of craig interpolants in model checking

TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Efficient conflict analysis for finding all satisfying assignments of a boolean circuit

TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
An incremental and layered procedure for the satisfiability of linear arithmetic logic

TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Discovery of minimal unsatisfiable subsets of constraints using hitting set dualization

PADL'05 Proceedings of the 7th international conference on Practical Aspects of Declarative Languages
Dealing with Satisfiability and n-ary CSPs in a Logical Framework

Journal of Automated Reasoning
Lower bounds for width-restricted clause learning on small width formulas

SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Satisfiability checking of non-clausal formulas using general matings

SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Fast and flexible difference constraint propagation for DPLL(T)

SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
sharpSAT: counting models with advanced component caching and implicit BCP

SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Approximate boolean reasoning: foundations and applications in data mining

Transactions on Rough Sets V
Building efficient decision procedures on top of SAT solvers

SFM'06 Proceedings of the 6th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems
A pearl on SAT solving in prolog

FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
Efficient abstraction refinement in interpolation-based unbounded model checking

TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A pearl on SAT and SMT solving in Prolog

Theoretical Computer Science
Time-space tradeoffs in resolution: superpolynomial lower bounds for superlinear space

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
On the virtue of succinct proofs: amplifying communication complexity hardness to time-space trade-offs in proof complexity

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Lower bounds for width-restricted clause learning on formulas of small width

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
A finite state intersection approach to propositional satisfiability

Theoretical Computer Science
Parallel search for maximum satisfiability

AI Communications - 18th RCRA International Workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”
An empirical study of learning and forgetting constraints

AI Communications - 18th RCRA International Workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”
Revisiting clause exchange in parallel SAT solving

SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Online speedup learning for optimal planning

Journal of Artificial Intelligence Research
Refining restarts strategies for SAT and UNSAT

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Eigenvector centrality in industrial SAT instances

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Satisfiability solvers are static analysers

SAS'12 Proceedings of the 19th international conference on Static Analysis
A generalization of stålmarck's method

SAS'12 Proceedings of the 19th international conference on Static Analysis
On the application of SAT solvers to the test suite minimization problem

SSBSE'12 Proceedings of the 4th international conference on Search Based Software Engineering
Pseudo-partitions, transversality and locality: a combinatorial characterization for the space measure in algebraic proof systems

Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Asynchronous multi-core incremental SAT solving

TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
pEvoSAT: a novel permutation based genetic algorithm for solving the boolean satisfiability problem

Proceedings of the 15th annual conference on Genetic and evolutionary computation
Some trade-off results for polynomial calculus: extended abstract

Proceedings of the forty-fifth annual ACM symposium on Theory of computing
CafeSat: a modern SAT solver for Scala

Proceedings of the 4th Workshop on Scala
Boolean satisfiability for sequence mining

Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
A symbiosis of interval constraint propagation and cylindrical algebraic decomposition

CADE'13 Proceedings of the 24th international conference on Automated Deduction
Exponential separations in a hierarchy of clause learning proof systems

SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Concurrent clause strengthening

SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Improving glucose for incremental SAT solving with assumptions: application to MUS extraction

SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
LearnSAT: a SAT solver for education

SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Towards an understanding of polynomial calculus: new separations and lower bounds

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Complexity issues related to propagation completeness

Artificial Intelligence
Just-in-time compilation of knowledge bases

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Personalized diagnosis for over-constrained problems

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
A SAT-based approach to cost-sensitive temporally expressive planning

ACM Transactions on Intelligent Systems and Technology (TIST) - Special Section on Intelligent Mobile Knowledge Discovery and Management Systems and Special Issue on Social Web Mining
Iterative and core-guided MaxSAT solving: A survey and assessment

Constraints
FPGA acceleration of enhanced boolean constraint propagation for SAT solvers

Proceedings of the International Conference on Computer-Aided Design
Combining approaches for solving satisfiability problems with qualitative preferences

AI Communications

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper introduces GRASP (Generic seaRch Algorithm for the Satisfiability Problem), an integrated algorithmic framework for SAT that unifies several previously proposed search-pruning techniques and facilitates identification of additional ones. GRASP is premised on the inevitability of conflicts during search and its most distinguishing feature is the augmentation of basic backtracking search with a powerful conflict analysis procedure. Analyzing conflicts to determine their causes enables GRASP to backtrack non-chronologically to earlier levels in the search tree, potentially pruning large portions of the search space. In addition, by "recording" the causes of conflicts, GRASP can recognize and preempt the occurrence of similar conflicts later on in the search. Finally, straightforward bookkeeping of the causality chains leading up to conflicts allows GRASP to identify assignments that are necessary for a solution to be found. Experimental results obtained from a large number of benchmarks, including many from the field of test pattern generation, indicate that application of the proposed conflict analysis techniques to SAT algorithms can be extremely effective for a large number of representative classes of SAT instances.