Clause Deletion Strategy in a Satisfiability Solver Presented by Colin Southwood For CMPS 217, Logic in Computer Science Tuesday, December 11 th, 2007.

Slides:

Advertisements

Similar presentations

Hybrid BDD and All-SAT Method for Model Checking Orna Grumberg Joint work with Assaf Schuster and Avi Yadgar Technion – Israel Institute of Technology.

Advertisements

Chaff: Engineering an Efficient SAT Solver Matthew W.Moskewicz, Concor F. Madigan, Ying Zhao, Lintao Zhang, Sharad Malik Princeton University Modified.

Presented by Monissa Mohan 1.  A highly optimized BCP algorithm  Two watched literals  Fast Backtracking  Efficient Decision Heuristic  Focused on.

Chaff: Engineering an Efficient SAT Solver Matthew W.Moskewicz, Concor F. Madigan, Ying Zhao, Lintao Zhang, Sharad Malik Princeton University Presenting:

Satisfiability Modulo Theories (An introduction)

Sorting Really Big Files Sorting Part 3. Using K Temporary Files Given  N records in file F  M records will fit into internal memory  Use K temp files,

Introduction to MiniSat v1.14 Presented by Yunho Kim Provable Software Lab, KAIST.

Proofs from SAT Solvers Yeting Ge ACSys NYU Nov

IBM Labs in Haifa © 2005 IBM Corporation Adaptive Application of SAT Solving Techniques Ohad Shacham and Karen Yorav Presented by Sharon Barner.

© 2002 Fadi A. Aloul, University of Michigan PBS: A Pseudo-Boolean Solver and Optimizer Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Karem A. Sakallah.

CPSC 322, Lecture 13Slide 1 CSPs: Arc Consistency & Domain Splitting Computer Science cpsc322, Lecture 13 (Textbook Chpt 4.5,4.6) February, 01, 2010.

Hrinking hrinking A signment tack tack. Agenda Introduction Algorithm Description Heuristics Experimental Results Conclusions.

1 Boolean Satisfiability in Electronic Design Automation (EDA ) By Kunal P. Ganeshpure.

CPSC 322, Lecture 12Slide 1 CSPs: Search and Arc Consistency Computer Science cpsc322, Lecture 12 (Textbook Chpt ) January, 29, 2010.

CPSC 322, Lecture 13Slide 1 CSPs: Arc Consistency & Domain Splitting Computer Science cpsc322, Lecture 13 (Textbook Chpt 4.5,4.8) February, 02, 2009.

In Search of a Phase Transition in the AC-Matching Problem Phokion G. Kolaitis Thomas Raffill Computer Science Department UC Santa Cruz.

Presented by Ed Clarke Slides borrowed from P. Chauhan and C. Bartzis

GRASP-an efficient SAT solver Pankaj Chauhan. 6/19/ : GRASP and Chaff2 What is SAT? Given a propositional formula in CNF, find an assignment.

State-of-the-art in SAT solvers

Abstract Data Types (ADT)

GRASP SAT solver Presented by Constantinos Bartzis Slides borrowed from Pankaj Chauhan J. Marques-Silva and K. Sakallah.

CS 206 Introduction to Computer Science II 12 / 01 / 2008 Instructor: Michael Eckmann.

Identifying Conflicts in Overconstrained Temporal Problems Mark H. Liffiton, Michael D. Moffitt, Martha E. Pollack, and Karem A. Sakallah University of.

SAT Algorithms in EDA Applications Mukul R. Prasad Dept. of Electrical Engineering & Computer Sciences University of California-Berkeley EE219B Seminar.

Pruning techniques for the SAT-based Bounded Model-Checking problem Ofer Shtrichman Weizmann Institute of Science & IBM - HRL.

Detecting State Coding Conflicts in STGs Using SAT Victor Khomenko, Maciej Koutny, and Alex Yakovlev University of Newcastle upon Tyne.

MiniSAT: World fastest SAT solver (2005 and 2006) Niklas Sorensson, Niklas Een and Armin Biere Some slides are from Niklas Sorensson presentation Presented.

Branch and Bound Algorithm for Solving Integer Linear Programming

ENGG3190 Logic Synthesis “Boolean Satisfiability” Winter 2014 S. Areibi School of Engineering University of Guelph.

GRASP: A Search Algorithm for Propositional Satisfiability EE878C Homework #2 2002/11/1 KAIST, EECS ICS Lab Lee, Dongsoo.

Sampling Combinatorial Space Using Biased Random Walks Jordan Erenrich, Wei Wei and Bart Selman Dept. of Computer Science Cornell University.

Introduction - The Need for Data Structures Data structures organize data –This gives more efficient programs. More powerful computers encourage more complex.

1 A Introduction to Data Structures and Algorithm Analysis Data Structures Asst. Professor Kiran Soni.

SAT Solver Math Foundations of Computer Science. 2 Boolean Expressions  A Boolean expression is a Boolean function  Any Boolean function can be written.

Boolean Satisfiability and SAT Solvers

MBSat Satisfiability Program and Heuristics Brief Overview VLSI Testing B Marc Boulé April 2001 McGill University Electrical and Computer Engineering.

Solvers for the Problem of Boolean Satisfiability (SAT) Will Klieber Aug 31, 2011 TexPoint fonts used in EMF. Read the TexPoint manual before you.

A Faster Satisfiability Model and Algorithm for Circuit Delay Computation 鍾逸亭.

BoolTool: A Tool for Manipulation of Boolean Functions Petr Fišer, David Toman Czech Technical University in Prague Dept. of Computer Science and Engineering.

Chapter 1 Data Structures and Algorithms. Primary Goals Present commonly used data structures Present commonly used data structures Introduce the idea.

CSED101 INTRODUCTION TO COMPUTING TREE 2 Hwanjo Yu.

On the Relation between SAT and BDDs for Equivalence Checking Sherief Reda Rolf Drechsler Alex Orailoglu Computer Science & Engineering Dept. University.

Breadth First Search and Depth First Search. Greatest problem in Computer Science Has lead to a lot of new ideas and data structures Search engines before.

Solving the Logic Satisfiability problem Solving the Logic Satisfiability problem Jesus De Loera.

1 Boolean Satisfiability (SAT) Class Presentation By Girish Paladugu.

Faster Symmetry Discovery using Sparsity of Symmetries Paul T. Darga Karem A. Sakallah Igor L. Markov The University of Michigan.

Data Structure and Algorithm Introduction.  The manner in which computer program is being developed is not as simple as you may possibly think.  It.

Project proposals. Most involve implementation inside minisat+ Project includes: Reading Implementation Evaluation Short presentation Submission of results.

© R.A. Rutenbar 2009 Slide 1 Carnegie Mellon (Lec 06) Boolean Satisfiability: SAT Solvers (Pt 1) What you know  Representation and manipulation via BDDs,

Hybrid BDD and All-SAT Method for Model Checking

Hardware Acceleration of A Boolean Satisfiability Solver

Clause Learning in a SAT-Solver

CSPs: Search and Arc Consistency Computer Science cpsc322, Lecture 12

Inference and search for the propositional satisfiability problem

CSPs: Search and Arc Consistency Computer Science cpsc322, Lecture 12

SAT’07 Conference, Lisbon;

Logic Synthesis CNF Satisfiability.

Simple Circuit-Based SAT Solver

CSPs: Search and Arc Consistency Computer Science cpsc322, Lecture 12

Introduction to Algorithms

ECE 667 Synthesis and Verification of Digital Circuits

Data Structures: Introductory lecture

Massive Parallelization of SAT Solvers

A Progressive Approach for Satisfiability Modulo Theories

Constraints and Search

Basic case splitting algorithm

SAT/SMT seminar 18/02/2018 Computing multiple MUSes (Minimal Unsatisfiable Subformulas) and MSISes (Minimal Safe Inductive Subsets) Alexander Ivrii IBM.

GRASP-an efficient SAT solver

Presentation transcript:

Clause Deletion Strategy in a Satisfiability Solver Presented by Colin Southwood For CMPS 217, Logic in Computer Science Tuesday, December 11 th, 2007

Conflict, or ‘Learnt’ Clauses 1996 GRASP– “Generic seaRch Algorithm for the Satisfiability Problem” by Joao P. Marques Silva and Karem A. Sakallah Introduced the idea of recording the causes of conflicts Prunes the Search Tree

Problems with accumulating Conflict Clauses Takes up Space, makes using the lessons depend on the access times of main memory and possibly of disk Requires BCP take more time, when it already takes up a lot of time ( BCP already takes %90 of time for solving SAT problems )

Experimental Results

No Clause Deletion

Calls to BCP procedure; more calls, but less time

Calls to BCP procedure; fewer calls, but more time

Activity an additional constraint; fewer are deleted

learnts more easily sat. criteria Of deletion; Num. learnts rarely exceeds limit

How to deal with knowing too much Delete no clauses? Delete “weaker” clauses? Delete “low activity” clauses? No. Yes. Yes. In the right balance. It is a balancing act. Don’t delete too many, don’t delete too few!