Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems by Carla P. Gomes, Bart Selman, Nuno Crato and henry Kautz Presented by Yunho.

Slides:



Advertisements
Similar presentations
Completeness and Expressiveness
Advertisements

1 Constraint Satisfaction Problems A Quick Overview (based on AIMA book slides)
Introduction to MiniSat v1.14 Presented by Yunho Kim Provable Software Lab, KAIST.
Proofs from SAT Solvers Yeting Ge ACSys NYU Nov
1/30 SAT Solver Changki PSWLAB SAT Solver Daniel Kroening, Ofer Strichman.
1 Backdoor Sets in SAT Instances Ryan Williams Carnegie Mellon University Joint work in IJCAI03 with: Carla Gomes and Bart Selman Cornell University.
IBM Labs in Haifa © 2005 IBM Corporation Adaptive Application of SAT Solving Techniques Ohad Shacham and Karen Yorav Presented by Sharon Barner.
Dynamic Restarts Optimal Randomized Restart Policies with Observation Henry Kautz, Eric Horvitz, Yongshao Ruan, Carla Gomes and Bart Selman.
By Claudia Fiorini, Enrico Martinelli, Fabio Massacci
Binary Response Lecture 22 Lecture 22.
Statistical Regimes Across Constrainedness Regions Carla P. Gomes, Cesar Fernandez Bart Selman, and Christian Bessiere Cornell University Universitat de.
CP Formal Models of Heavy-Tailed Behavior in Combinatorial Search Hubie Chen, Carla P. Gomes, and Bart Selman
Methods for SAT- a Survey Robert Glaubius CSCE 976 May 6, 2002.
Boolean Satisfiability Solvers Wonhong Nam
Heavy-Tailed Behavior and Search Algorithms for SAT Tang Yi Based on [1][2][3]
Ryan Kinworthy 2/26/20031 Chapter 7- Local Search part 1 Ryan Kinworthy CSCE Advanced Constraint Processing.
Implicit Hitting Set Problems Richard M. Karp Harvard University August 29, 2011.
Presented by Ed Clarke Slides borrowed from P. Chauhan and C. Bartzis
State-of-the-art in SAT solvers
AAAI00 Austin, Texas Generating Satisfiable Problem Instances Dimitris Achlioptas Microsoft Carla P. Gomes Cornell University Henry Kautz University of.
Analysis of Algorithms CS 477/677
Short XORs for Model Counting: From Theory to Practice Carla P. Gomes, Joerg Hoffmann, Ashish Sabharwal, Bart Selman Cornell University & Univ. of Innsbruck.
Search in the semantic domain. Some definitions atomic formula: smallest formula possible (no sub- formulas) literal: atomic formula or negation of an.
1 Backdoors To Typical Case Complexity Ryan Williams Carnegie Mellon University Joint work with: Carla Gomes and Bart Selman Cornell University.
Carla P. Gomes CS4700 CS 4700: Foundations of Artificial Intelligence Carla P. Gomes Module: Randomization in Complete Tree Search.
Structure and Phase Transition Phenomena in the VTC Problem C. P. Gomes, H. Kautz, B. Selman R. Bejar, and I. Vetsikas IISI Cornell University University.
Last time Proof-system search ( ` ) Interpretation search ( ² ) Quantifiers Equality Decision procedures Induction Cross-cutting aspectsMain search strategy.
Carla P. Gomes CS4700 CS 4700: Foundations of Artificial Intelligence Carla P. Gomes Module: Instance Hardness and Phase Transitions.
Chapter 11: Limitations of Algorithmic Power
CP-AI-OR-02 Gomes & Shmoys 1 The Promise of LP to Boost CSP Techniques for Combinatorial Problems Carla P. Gomes David Shmoys
1 CS 4700: Foundations of Artificial Intelligence Carla P. Gomes Module: Satisfiability (Reading R&N: Chapter 7)
Knowledge Representation II (Inference in Propositional Logic) CSE 473 Continued…
Volatility Chapter 9 Risk Management and Financial Institutions 2e, Chapter 9, Copyright © John C. Hull
GRASP: A Search Algorithm for Propositional Satisfiability EE878C Homework #2 2002/11/1 KAIST, EECS ICS Lab Lee, Dongsoo.
1 Understanding Problem Hardness: Recent Developments and Directions Bart Selman Cornell University.
Lukas Kroc, Ashish Sabharwal, Bart Selman Cornell University, USA SAT 2010 Conference Edinburgh, July 2010 An Empirical Study of Optimal Noise and Runtime.
SAT Solving Presented by Avi Yadgar. The SAT Problem Given a Boolean formula, look for assignment A for such that.  A is a solution for. A partial assignment.
1 Combinatorial Problems in Cooperative Control: Complexity and Scalability Carla Gomes and Bart Selman Cornell University Muri Meeting March 2002.
Daniel Kroening and Ofer Strichman Decision Procedures An Algorithmic Point of View Deciding ILPs with Branch & Bound ILP References: ‘Integer Programming’
Learning to Search Henry Kautz University of Washington joint work with Dimitri Achlioptas, Carla Gomes, Eric Horvitz, Don Patterson, Yongshao Ruan, Bart.
© Copyright McGraw-Hill CHAPTER 6 The Normal Distribution.
Distributions of Randomized Backtrack Search Key Properties: I Erratic behavior of mean II Distributions have “heavy tails”.
Logics for Data and Knowledge Representation Propositional Logic: Reasoning Originally by Alessandro Agostini and Fausto Giunchiglia Modified by Fausto.
Structure and Phase Transition Phenomena in the VTC Problem C. P. Gomes, H. Kautz, B. Selman R. Bejar, and I. Vetsikas IISI Cornell University University.
Constrainedness Including slides from Toby Walsh.
Explorations in Artificial Intelligence Prof. Carla P. Gomes Module 3 Logic Representations (Part 2)
Solvers for the Problem of Boolean Satisfiability (SAT) Will Klieber Aug 31, 2011 TexPoint fonts used in EMF. Read the TexPoint manual before you.
Introduction to Inferential Statistics Statistical analyses are initially divided into: Descriptive Statistics or Inferential Statistics. Descriptive Statistics.
1 The Theory of NP-Completeness 2 Cook ’ s Theorem (1971) Prof. Cook Toronto U. Receiving Turing Award (1982) Discussing difficult problems: worst case.
Explorations in Artificial Intelligence Prof. Carla P. Gomes Module Logic Representations.
Boolean Satisfiability Present and Future
Quality of LP-based Approximations for Highly Combinatorial Problems Lucian Leahu and Carla Gomes Computer Science Department Cornell University.
SAT 2009 Ashish Sabharwal Backdoors in the Context of Learning (short paper) Bistra Dilkina, Carla P. Gomes, Ashish Sabharwal Cornell University SAT-09.
Review of Propositional Logic Syntax
Nikolaj Bjørner Microsoft Research DTU Winter course January 2 nd 2012 Organized by Flemming Nielson & Hanne Riis Nielson.
Accelerating Random Walks Wei Wei and Bart Selman.
1 Combinatorial Problems in Cooperative Control: Complexity and Scalability Carla P. Gomes and Bart Selman Cornell University Muri Meeting June 2002.
Balance and Filtering in Structured Satisfiability Problems Henry Kautz University of Washington joint work with Yongshao Ruan (UW), Dimitris Achlioptas.
Satisfiability and SAT Solvers CS 270 Math Foundations of CS Jeremy Johnson.
Chapter 5 Team Teaching AI (created by Dewi Liliana) PTIIK Constraint Satisfaction Problems.
SAT Solving As implemented in - DPLL solvers: GRASP, Chaff and
Lecture 8 Randomized Search Algorithms Part I: Backtrack Search CSE 573 Artificial Intelligence I Henry Kautz Fall 2001.
Inference in Propositional Logic (and Intro to SAT) CSE 473.
拉丁方陣 交大應數系 蔡奕正. Definition A Latin square of order n with entries from an n-set X is an n * n array L in which every cell contains an element of X such.
Formal Complexity Analysis of RoboFlag Drill & Communication and Computation in Distributed Negotiation Algorithms in Distributed Negotiation Algorithms.
Inference in Propositional Logic (and Intro to SAT)
Constraint Programming and Backtracking Search Algorithms
Constraints and Search
CSE 6408 Advanced Algorithms.
Presentation transcript:

Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems by Carla P. Gomes, Bart Selman, Nuno Crato and henry Kautz Presented by Yunho Kim Provable Software Lab, KAIST

Contents Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems Yunho Kim, Provable Software Lab, KAIST 2/28 Introduction Search procedures and problem domains Cost distributions of backtrack search Consequences for Algorithm Design Conclusion

Introduction(1/4) Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems Yunho Kim, Provable Software Lab, KAIST 3/28 The DPLL algorithm is a complete algorithm for deciding the satisfiability of propositional logic formulas – It is guaranteed that eventually either the DPLL algorithm finds a satisfying model or proves the formula is unsatisfiable The iterative version of DPLL algorithm 1 status = preprocess(); 2 if (status!=UNKNOWN) return status; 3 while(1){ 4 decide_next_branch(); 5 while(1){ 6 status = deduce(); 7 if (status == CONFLICT){ 8 blevel = analyze_conflict(); 9 if (blevel == 0) 10 return UNSAT; 11 else backtrack(blevel); 12 } 13 else if (status == SAT) 14 return SAT; 15 else break; 16 } 17 }

Introduction(2/4) Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems Yunho Kim, Provable Software Lab, KAIST 4/28 At each step a heuristic is used to select the next branch variable – A branch heuristic scores each variable in some manner and select the highest one Randomization can be used for tie-breaking – If several choices are ranked equally, choose among them at random – All variables that receive scores within H -percent of the highest score are considered equally good H is a heuristic equivalence parameter Empirically it is known that randomized branching heuristics is effective on hard instances

Introduction(3/4) Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems Yunho Kim, Provable Software Lab, KAIST 5/28 Problem instance: quasigroup completion problem (N = 11, 30% pre-assignments) The sample mean of the number of backtracks does diverge Sample mean (number of backtracks) Number of runs

Introduction(4/4) Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems Yunho Kim, Provable Software Lab, KAIST 6/28 The authors have observed the erratic behavior of the mean and the variance of the search cost distributions on a same instance The mean cost calculated over an increasing number of runs, on the same satisfiable problem instance, of a randomized backtrack search procedure does diverge. The authors have not found unsatisfiable instances with heavy-tailed behavior

Contents Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems Yunho Kim, Provable Software Lab, KAIST 7/28 Introduction Search procedures and problem domains Cost distributions of backtrack search Consequences for Algorithm Design Conclusion

Search Procedures Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems Yunho Kim, Provable Software Lab, KAIST 8/28 The authors modified two state-of-the-art SAT solvers(at that time), Satz and Relsat Both solvers hire similar occurrences-based decision heuristics Satz employs chronological backtracking while Relsat uses non-chronological backtracking

Quasigroup Completion Problem(1/2) Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems Yunho Kim, Provable Software Lab, KAIST 9/28 A quasigroup is an ordered pair( Q, ¢ ), where Q is a set and ( ¢ ) is a binary operation on Q such that the equations a ¢ x = b and y ¢ a = b are uniquely solvable for every pair of elements a, b in Q The order N of the quasigroup is the cardinality of the set Q The multiplication table of a finite quasigroup is a Latin square – An N £ N table filled with n different symbols in such a way that each symbol occurs exactly once in each row and exactly once in each column Order 4 quasigroupOrder 10 quasigroup

Quasigroup Completion Problem(2/2) Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems Yunho Kim, Provable Software Lab, KAIST 10/28 The quasigroup completion problem – determining whether the remaining entries of the partial Latin square can be filled in such a way that we obtain a complete Latin square The quasigroup completion problem is NP-complete 32% pre-assigned

Other Problems Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems Yunho Kim, Provable Software Lab, KAIST 11/28 Timetabling, planning and instances in the Dimacs Challenge benchmark are also considered Timetabling problem is to determine whether there exists a feasible schedule that consider a set of pairing and distribution constraints Planning is to find a sequence of actions that transform an initial state to a goal state

Contents Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems Yunho Kim, Provable Software Lab, KAIST 12/28 Introduction Search procedures and problem domains Cost distributions of backtrack search Consequences for Algorithm Design Conclusion

Cumulative Distribution(1/2) Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems Yunho Kim, Provable Software Lab, KAIST 13/28 Data was produced by running the randomized backtrack search procedure 10,000 times on the same instance Even though 50% of the runs solve the instance in 1 backtrack or less, after 100,000 backtracks 0.5% of the runs were still not completed Number of backtracks Cumulative fraction of successful runs Completion of quasigroup

Cumulative Distribution(2/2) Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems Yunho Kim, Provable Software Lab, KAIST 14/28 A solution is found in 1,000 backtracks or less in 80% of runs However, 5% of the runs do not result in a solution even after 1,000,000 backtracks Number of backtracks Cumulative fraction of successful runs Timetabling

Heavy-Tailed Distributions(1/3) Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems Yunho Kim, Provable Software Lab, KAIST 15/28 Standard Exponential decay e.g. Normal: P{ X > x } ~ Ce - x 2 for some C > 0 Heavy-Tailed Power law decay e.g. Pareto-Levy: P{ X > x } ~ Cx - ® where for some 0 0 Power Law Decay Standard Distribution (finite mean & variance) Exponential Decay

Heavy-Tailed Distributions(2/3) Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems Yunho Kim, Provable Software Lab, KAIST 16/28 We consider distributions that asymptotically have “heavy tails”, namely, where for some 0 0 The ® is referred to as the index of stability of the distribution – The lower the index, the heavier the tail Heavy-tailed distributions have finite/infinite mean and infinite variance P { X > x } ~ Cx - ® 0 < ® · 11 < ® MeanInfiniteFinite VarianceInfinite

Heavy-Tailed Distributions(3/3) Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems Yunho Kim, Provable Software Lab, KAIST 17/28 Comparison of tail probabilities P{X > c} – Cauchy distribution is the heavy-tailed distribution which has ® = 1.0 – Levy distribution is the heavy-tailed-distribution which has ® = 0.5

Visual Check(1/3) Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems Yunho Kim, Provable Software Lab, KAIST 18/28 Log-log plot of the cost distribution of the satisfiable completion of quasigroups instances 1- F ( x ) = P{ X > x } ~ Cx - ® N = 15, 40% pre-assignments Completion of quasigroups Log(1-F(x)) N = 15, 30% pre-assignments N = 11, 30% pre-assignments Log number of backtracks Log(1- F ( x )) ~ - ® Log( x ) + C ’

Visual Check(2/3) Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems Yunho Kim, Provable Software Lab, KAIST 19/28 Log-log plot of the cost distribution of the satisfiable timetabling instance 1- F ( x ) = P{ X > x } ~ Cx - ® Completion of timetabling Log(1-F(x)) Log number of backtracks

Visual Check(3/3) Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems Yunho Kim, Provable Software Lab, KAIST 20/28 Log-log plot of the cost distribution of the satisfiable logistics planning from two different SAT solvers 1- F ( x ) = P{ X > x } ~ Cx - ® Logistics planning Log(1-F(x)) Log number of backtracks Satz Relsat

Estimation of ® Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems Yunho Kim, Provable Software Lab, KAIST 21/28 Calculated maximum likelihood estimates of ® using Hill estimator – k is sample size Since ® · 1, mean and variance are infinite

Unsatisfiable Instance Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems Yunho Kim, Provable Software Lab, KAIST 22/28 Log-log plot of the cost distribution of unsatisfiable completion of quasigroups instnces 1- F ( x ) = P{ X > x } ~ Cx - ® Completion of quasigroups Log(1-F(x)) Log number of backtracks

Contents Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems Yunho Kim, Provable Software Lab, KAIST 23/28 Introduction Search procedures and problem domains Cost distributions of backtrack search Consequences for Algorithm Design Conclusion

Restarts Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems Yunho Kim, Provable Software Lab, KAIST 24/28 Restart after a fixed number of backtracks prevent a solver from entering pitfall Total number of backtracks Effect of restarts on a quasigroup instance N = 20, 5% pre-assignments Log(1-F(x)) No restarts With restarts Without restarts and given a total of 300 backtracks, 70% of runs failed With restarts, only 0.01% of runs failed

Restarts Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems Yunho Kim, Provable Software Lab, KAIST 25/28 Randomized rapid restarts(RRR) show better performance than deterministic

Contents Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems Yunho Kim, Provable Software Lab, KAIST 26/28 Introduction Search procedures and problem domains Cost distributions of backtrack search Consequences for Algorithm Design Conclusion

Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems Yunho Kim, Provable Software Lab, KAIST 27/28 The authors show the suitability of heavy-tailed distributions in modeling the runtime behavior of DPLL SAT solver with the random decision heuristic Restarts can exploit the mass of probability on the left of the cost distributions

Reference Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems Yunho Kim, Provable Software Lab, KAIST 28/28 Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems by Carla P. Gomes, Bart Selman, Nuno Crato and Henry Kautz in Journal of Automated Reasoning 24: , 2000

Lévy Distribution(1/2) Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems Yunho Kim, Provable Software Lab, KAIST 29/28 Probability density function of Lévy distribution – Lévy have infinite mean and variance

Lévy Distribution(2/2) Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems Yunho Kim, Provable Software Lab, KAIST 30/28 Cumulative distribution function of Lévy distribution