ABHELSINKI UNIVERSITY OF TECHNOLOGY
|
|
- Berenice Griselda Anderson
- 5 years ago
- Views:
Transcription
1 Local Search Algorithms for Random Satisfiability Pekka Orponen (joint work with Sakari Seitz and Mikko Alava) Helsinki University of Technology Local Search Algorithms for Random Satisfiability 1/30
2 Outline Background WalkSAT and related algorithms Results and conjectures on WalkSAT Experiments on WalkSAT Record-to-Record Travel and variants Experiments on RRT Focused Metropolis Search Experiments on FMS Dynamics of FMS Analysis? Local Search Algorithms for Random Satisfiability 2/30
3 Background Denote N = number of variables, M = number of clauses, α = M/N. Satisfiability transition at α c (Mitchell et al. 1992,..., Braunstein et al. 2002). Good experiences with local search methods in the satisfiable region α < α c : e.g. GSAT (Selman et al. 1992), WalkSAT (Selman et al. 1996). Experiments 1996: N 2000 at α α c. Local Search Algorithms for Random Satisfiability 3/30
4 GSAT Selman et al Denote by E = E F (s) the number of unsatisfied clauses in formula F under truth assignment s. GSAT(F): s = initial truth assignment; while flips < max_flips do if s satisfies F then output s & halt, else: - find a variable x whose flipping causes largest decrease in E (if no decrease is possible, then smallest increase); - flip x. Local Search Algorithms for Random Satisfiability 4/30
5 NoisyGSAT GSAT augmented by a fraction p of random walk moves. NoisyGSAT(F,p): s = initial truth assignment; while flips < max_flips do if s satisfies F then output s & halt, else: - with probability p, pick a variable x uniformly at random and flip it; - with probability (1-p), do basic GSAT move: - find a variable x whose flipping causes largest decrease in E (if no decrease is possible, then smallest increase); - flip x. Local Search Algorithms for Random Satisfiability 5/30
6 WalkSAT NoisyGSAT focused on the unsatisfied clauses. WalkSAT(F,p): s = initial truth assignment; while flips < max_flips do if s satisfies F then output s & halt, else: - pick a random unsatisfied clause C in F; - if some variables in C can be flipped without breaking any presently satisfied clauses, then pick one such variable x at random; else: - with probability p, pick a variable x in C at random; - with probability (1-p), pick an x in C that breaks a minimal number of presently satisfied clauses; - flip x. Local Search Algorithms for Random Satisfiability 6/30
7 WalkSAT vs. NoisyGSAT The focusing seems to be important: in the (unsystematic) experiments in Selman et al. (1996), WalkSAT outperforms NoisyGSAT by several orders of magnitude. Local Search Algorithms for Random Satisfiability 7/30
8 Recent results and conjectures Barthel et al. (2003): numerical experiments with WalkSAT (mainly with p = 1, some also with p < 1) at N = 50,000, α = Observed transition in the dynamics at α dyn When α < α dyn, satisfying assignments are found in linear time per variable (i.e. in a total of cn flips ), when α > α dyn exponential time is required. Similar results obtained by Semerjian & Monasson (2003), though with smaller experiments (N = 500). Explanation: for α > α dyn the search equilibrates at a nonzero energy level, and can only escape to a ground state through a large enough random fluctuation. Conjecture: no local search algorithm works in linear time beyond the clustering transition at α s (Mézard, Monasson, Weigt et al.) Local Search Algorithms for Random Satisfiability 8/30
9 WalkSAT experiments (3-SAT) WalkSAT (N = 10^5) WalkSAT (N = 10^5) flips/n 100 flips/n p = 0.45 p = 0.55 p = 0.57 p = p = 0.45 p = 0.55 p = 0.57 p = alpha alpha Normalised solution times for WalkSAT, α = Left: complete data; right: medians and quartiles. Local Search Algorithms for Random Satisfiability 9/30
10 WalkSAT linear scaling WalkSAT (p = 0.55, alpha = 4.15) WalkSAT (p = 0.55, alpha = 4.20) cum.freq cum.freq N = 10^4 N = 3*10^4 N = 10^5 N = 3*10^5 N = 10^ N = 10^4 N = 3*10^ flips/n flips/n Cumulative solution time distributions for WalkSAT with p = Local Search Algorithms for Random Satisfiability 10/30
11 WalkSAT optimal noise level? WalkSAT (N = 10^5) flips/n alpha = 4.10 alpha = 4.12 alpha = alpha = 4.16 alpha = 4.18 alpha = 4.20 alpha = p Normalised solution times for WalkSAT with p = , α = Local Search Algorithms for Random Satisfiability 11/30
12 WalkSAT sensitivity to noise WalkSAT (p = 0.55, alpha = 4.20) WalkSAT (p = 0.57, alpha = 4.20) cum.freq cum.freq N = 10^4 N = 3*10^ N = 10^4 N = 3*10^4 N = 10^5 N = 3*10^5 N = 10^ flips/n flips/n Cumulative solution time distributions for WalkSAT at α = 4.20 with p = 0.55 and p = Local Search Algorithms for Random Satisfiability 12/30
13 Record-to-Record Travel (RRT) Very simple stochastic local optimisation algorithm introduced by Dueck (1993). Dueck claimed good results on solving 442-city and 532-city TSP s; after that little used. RRT(E,d): s = initial feasible solution; s* = s; E* = E(s); while moves < max_moves do if s is a global min. of E then output s & halt, else: pick a random neighbour s of s; if E(s ) <= E* + d then let s = s ; if E(s ) < E* then: s* = s ; E* = E(s ). Local Search Algorithms for Random Satisfiability 13/30
14 RRT in action (d = 2) Local Search Algorithms for Random Satisfiability 14/30
15 RRT in action (d = 2) Local Search Algorithms for Random Satisfiability 14/30
16 RRT in action (d = 2) Local Search Algorithms for Random Satisfiability 14/30
17 RRT in action (d = 2) Local Search Algorithms for Random Satisfiability 14/30
18 RRT in action (d = 2) Local Search Algorithms for Random Satisfiability 14/30
19 RRT in action (d = 2) Local Search Algorithms for Random Satisfiability 14/30
20 RRT in action (d = 2) Local Search Algorithms for Random Satisfiability 14/30
21 RRT in action (d = 2) Local Search Algorithms for Random Satisfiability 14/30
22 Focused RRT In applying RRT to SAT, E(s) = number of clauses unsatisfied by truth assignment s. Single-variable flip neighbourhoods. Focusing: flipped variables chosen from unsatisfied clauses. (Precisely: one unsatisfied clause is chosen at random, and from there a variable at random.) FRRT = focused RRT. Local Search Algorithms for Random Satisfiability 15/30
23 FRRT experiments (3-SAT) Focused Record-to-Record Travel (N = 10^5) Focused Record-to-Record Travel (N = 10^5) flips/n 100 flips/n d = 5 d = 7 d = 9 d = d = 5 d = 7 d = 9 d = alpha alpha Normalised solution times for FRRT, α = Left: complete data; right: medians and quartiles. Local Search Algorithms for Random Satisfiability 16/30
24 FRRT linear scaling Focused Record-to-Record Travel (alpha = 4.15) Focused Record-to-Record Travel (alpha = 4.20) cum.freq cum.freq N = 10^4 N = 3*10^4 N = 10^5 N = 3*10^5 N = 10^ N = 10^4 N = 3*10^4 N = 10^5 N = 3*10^5 N = 10^ flips/n flips/n Cumulative solution time distributions for FRRT with d = 9. Local Search Algorithms for Random Satisfiability 17/30
25 FRRT linear scaling (cont d) Focused Record-to-Record Travel (alpha = 4.15) Focused Record-to-Record Travel (alpha = 4.20) cum.freq cum.freq N = 10^4 N = 3*10^4 N = 10^5 N = 3*10^5 N = 10^ N = 10^4 N = 3*10^ flips/n flips/n Cumulative solution time distributions for FRRT with d = 7. Local Search Algorithms for Random Satisfiability 18/30
26 FRRT qualitative observations 10 4 x N flips d=5 d=6 d=7 d=8 d=9 WalkSAT fitted curves intersections a α For each fixed d there seems to be a transition value α d s.th. for α < α d the algorithm runs in linear time per variable, and for α > α d requires exponential time per variable. (Empirical estimates: α , α , α , α , α ) Local Search Algorithms for Random Satisfiability 19/30
27 FRRT qualitative observations cont d 10 4 x N flips d=5 d=6 d=7 d=8 d=9 WalkSAT fitted curves intersections a α An empirical fit of the transition points α d suggests that for large d they converge towards α Comparative experiments using WalkSAT with near optimal parameter settings (p = 0.55) yield estimate α dyn 4.19 for WalkSAT s transition point. Local Search Algorithms for Random Satisfiability 20/30
28 WalkSAT & FRRT on structured problems Jia, Moore & Selman (2004) tested WalkSAT and FRRT on highly structured glassy 3-SAT formulas. Here the number of variables is always of the form N = L L; values of L = 5,8,10,11,16 were tried out. At L = 16 WalkSAT no longer converged; FRRT did, but only for d = 5. 1e+09 WalkSAT and FRRT on NM glassy formulas (alpha = 4) 1e+08 1e+07 total flips 1e WalkSAT WalkSAT median FRRT FRRT median N Local Search Algorithms for Random Satisfiability 21/30
29 Focused Metropolis Search Arguably the most natural focused local search algorithm. Variable flip acceptance probabilities determined by a parameter η, 0 η 1. FMS(F,eta): s = initial truth assignment; while flips < max_flips do if s satisfies F then output s & halt, else: pick a random unsatisfied clause C in F; pick a variable x in C at random; let x = flip(x), s = s[x /x]; if E(s ) <= E(s) then flip x, else: flip x with prob. eta^(e(s )-E(s)). Local Search Algorithms for Random Satisfiability 22/30
30 FMS experiments (3-SAT) Focused Metropolis Search (N = 10^5) Focused Metropolis Search (N = 10^5) flips/n 100 flips/n eta = 0.2 eta = 0.3 eta = 0.36 eta = eta = 0.2 eta = 0.3 eta = 0.36 eta = alpha alpha Normalised solution times for FMS, α = Left: complete data; right: medians and quartiles. Local Search Algorithms for Random Satisfiability 23/30
31 FMS linear scaling Focused Metropolis Search (eta = 0.3, alpha = 4.00) Focused Metropolis Search (eta = 0.3, alpha = 4.10) cum.freq cum.freq N = 10^4 N = 3*10^4 N = 10^5 N = 3*10^5 N = 10^ N = 10^4 N = 3*10^4 N = 10^5 N = 3*10^5 N = 10^ flips/n flips/n Cumulative solution time distributions for FMS with η = 0.3. Local Search Algorithms for Random Satisfiability 24/30
32 FMS optimal acceptance ratio? Focused Metropolis Search (N = 10^5) flips/n alpha = 4.10 alpha = 4.12 alpha = alpha = 4.16 alpha = 4.18 alpha = alpha = eta Normalised solution times for FMS with η = , α = Local Search Algorithms for Random Satisfiability 25/30
33 FMS optimal acceptance ratio cont d Focused Metropolis Search (eta = 0.36, alpha = 4.20) cum.freq N = 10^4 N = 3*10^4 N = 10^5 N = 3*10^ flips/n Cumulative solution time distributions for FMS with η = 0.36, α = Local Search Algorithms for Random Satisfiability 26/30
34 Analysis? For FRRT: landscape structure? For FMS: contact processes? Local Search Algorithms for Random Satisfiability 27/30
35 Combinatorial landscapes Reidys & Stadler (SIAM Rev. 2002) f z b(x) x y barrier height from x to y: b(x,y) = min{max{f(z) f(x),0 z p} p an x-y path} barrier height of x Opt: b(x) = min{b(x,y) f(y) < f(x)} depth of a landscape: D f = max{b(x) x Opt} Local Search Algorithms for Random Satisfiability 28/30
36 Focused search as a contact process Local Search Algorithms for Random Satisfiability 29/30
37 Focused search as a contact process Local Search Algorithms for Random Satisfiability 29/30
38 Focused search as a contact process Local Search Algorithms for Random Satisfiability 29/30
39 Focused search as a contact process Local Search Algorithms for Random Satisfiability 29/30
40 References References [1] S. Seitz, P. Orponen: An efficient local search method for random 3-satisfiability. Proc. LICS 03 Workshop on Typical Case Complexity and Phase Transitions (Ottawa, Canada, June 2003). Elsevier Electronic Notes in Discrete Mathematics Vol. 16. [2] S. Seitz, M. Alava, P. Orponen: Threshold behaviour of WalkSAT and focused Metropolis search on random 3-satisfiability. Proc. 8th Intl. Conf. on Theory and Applications of Satisfiability Testing (St. Andrews, Scotland, June 2005). Springer-Verlag, Berlin, to appear. [3] S. Seitz, M. Alava, P. Orponen: Focused local search algorithms for random 3-satisfiability. To appear. Local Search Algorithms for Random Satisfiability 30/30
CS-E3200 Discrete Models and Search
Shahab Tasharrofi Department of Information and Computer Science, Aalto University Lecture 7: Complete and local search methods for SAT Outline Algorithms for solving Boolean satisfiability problems Complete
More informationLecture: Iterative Search Methods
Lecture: Iterative Search Methods Overview Constructive Search is exponential. State-Space Search exhibits better performance on some problems. Research in understanding heuristic and iterative search
More informationFoundations of AI. 8. Satisfiability and Model Construction. Davis-Putnam, Phase Transitions, GSAT and GWSAT. Wolfram Burgard & Bernhard Nebel
Foundations of AI 8. Satisfiability and Model Construction Davis-Putnam, Phase Transitions, GSAT and GWSAT Wolfram Burgard & Bernhard Nebel Contents Motivation Davis-Putnam Procedure Average complexity
More informationSatisfiability. Michail G. Lagoudakis. Department of Computer Science Duke University Durham, NC SATISFIABILITY
Satisfiability Michail G. Lagoudakis Department of Computer Science Duke University Durham, NC 27708 COMPSCI 271 - Spring 2001 DUKE UNIVERSITY Page 1 Why SAT? Historical Reasons The first NP-COMPLETE problem
More informationalgorithms, i.e., they attempt to construct a solution piece by piece and are not able to offer a complete solution until the end. The FM algorithm, l
The FMSAT Satisfiability Solver: Hypergraph Partitioning meets Boolean Satisfiability Arathi Ramani, Igor Markov framania, imarkovg@eecs.umich.edu February 6, 2002 Abstract This report is intended to present
More informationStochastic greedy local search Chapter 7
Stochastic greedy local search Chapter 7 ICS-275 Winter 2016 Example: 8-queen problem Main elements Choose a full assignment and iteratively improve it towards a solution Requires a cost function: number
More informationSimple mechanisms for escaping from local optima:
The methods we have seen so far are iterative improvement methods, that is, they get stuck in local optima. Simple mechanisms for escaping from local optima: I Restart: re-initialise search whenever a
More informationNote: In physical process (e.g., annealing of metals), perfect ground states are achieved by very slow lowering of temperature.
Simulated Annealing Key idea: Vary temperature parameter, i.e., probability of accepting worsening moves, in Probabilistic Iterative Improvement according to annealing schedule (aka cooling schedule).
More informationCS227: Assignment 1 Report
1 CS227: Assignment 1 Report Lei Huang and Lawson Wong April 20, 2008 1 Introduction Propositional satisfiability (SAT) problems have been of great historical and practical significance in AI. Despite
More informationMassively Parallel Seesaw Search for MAX-SAT
Massively Parallel Seesaw Search for MAX-SAT Harshad Paradkar Rochester Institute of Technology hp7212@rit.edu Prof. Alan Kaminsky (Advisor) Rochester Institute of Technology ark@cs.rit.edu Abstract The
More informationComputational problems. Lecture 2: Combinatorial search and optimisation problems. Computational problems. Examples. Example
Lecture 2: Combinatorial search and optimisation problems Different types of computational problems Examples of computational problems Relationships between problems Computational properties of different
More informationSAT-Solving: Performance Analysis of Survey Propagation and DPLL
SAT-Solving: Performance Analysis of Survey Propagation and DPLL Christian Steinruecken June 2007 Abstract The Boolean Satisfiability Problem (SAT) belongs to the class of NP-complete problems, meaning
More informationSet 5: Constraint Satisfaction Problems Chapter 6 R&N
Set 5: Constraint Satisfaction Problems Chapter 6 R&N ICS 271 Fall 2017 Kalev Kask ICS-271:Notes 5: 1 The constraint network model Outline Variables, domains, constraints, constraint graph, solutions Examples:
More informationSpeeding Up the ESG Algorithm
Speeding Up the ESG Algorithm Yousef Kilani 1 and Abdullah. Mohdzin 2 1 Prince Hussein bin Abdullah Information Technology College, Al Al-Bayt University, Jordan 2 Faculty of Information Science and Technology,
More informationKalev Kask and Rina Dechter. Department of Information and Computer Science. University of California, Irvine, CA
GSAT and Local Consistency 3 Kalev Kask and Rina Dechter Department of Information and Computer Science University of California, Irvine, CA 92717-3425 fkkask,dechterg@ics.uci.edu Abstract It has been
More informationBoolean Functions (Formulas) and Propositional Logic
EECS 219C: Computer-Aided Verification Boolean Satisfiability Solving Part I: Basics Sanjit A. Seshia EECS, UC Berkeley Boolean Functions (Formulas) and Propositional Logic Variables: x 1, x 2, x 3,, x
More informationGSAT and Local Consistency
GSAT and Local Consistency Kalev Kask Computer Science Department University of California at Irvine Irvine, CA 92717 USA Rina Dechter Computer Science Department University of California at Irvine Irvine,
More informationChoosing Probability Distributions for Stochastic Local Search and the Role of Make versus Break
Choosing Probability Distributions for Stochastic Local Search and the Role of Make versus Break Adrian Balint and Uwe Schöning Ulm University Institute of Theoretical Computer Science 89069 Ulm, Germany
More informationExample: Map coloring
Today s s lecture Local Search Lecture 7: Search - 6 Heuristic Repair CSP and 3-SAT Solving CSPs using Systematic Search. Victor Lesser CMPSCI 683 Fall 2004 The relationship between problem structure and
More informationEvidence for Invariants in Local Search
This paper appears in the Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI-97), Providence, RI, 1997. Copyright 1997 American Association for Artificial Intelligence.
More informationSet 5: Constraint Satisfaction Problems
Set 5: Constraint Satisfaction Problems ICS 271 Fall 2014 Kalev Kask ICS-271:Notes 5: 1 The constraint network model Outline Variables, domains, constraints, constraint graph, solutions Examples: graph-coloring,
More informationModule 4. Constraint satisfaction problems. Version 2 CSE IIT, Kharagpur
Module 4 Constraint satisfaction problems Lesson 10 Constraint satisfaction problems - II 4.5 Variable and Value Ordering A search algorithm for constraint satisfaction requires the order in which variables
More informationThe MAX-SAX Problems
STOCHASTIC LOCAL SEARCH FOUNDATION AND APPLICATION MAX-SAT & MAX-CSP Presented by: Wei-Lwun Lu 1 The MAX-SAX Problems MAX-SAT is the optimization variant of SAT. Unweighted MAX-SAT: Finds a variable assignment
More informationAn Introduction to SAT Solvers
An Introduction to SAT Solvers Knowles Atchison, Jr. Fall 2012 Johns Hopkins University Computational Complexity Research Paper December 11, 2012 Abstract As the first known example of an NP Complete problem,
More informationLocal 3-approximation algorithms for weighted dominating set and vertex cover in quasi unit-disk graphs
Local 3-approximation algorithms for weighted dominating set and vertex cover in quasi unit-disk graphs Marja Hassinen, Valentin Polishchuk, Jukka Suomela HIIT, University of Helsinki, Finland LOCALGOS
More informationSolving the Satisfiability Problem Using Finite Learning Automata
International Journal of Computer Science & Applications Vol. 4 Issue 3, pp 15-29 2007 Technomathematics Research Foundation Solving the Satisfiability Problem Using Finite Learning Automata Ole-Christoffer
More informationDiscrete Optimization. Lecture Notes 2
Discrete Optimization. Lecture Notes 2 Disjunctive Constraints Defining variables and formulating linear constraints can be straightforward or more sophisticated, depending on the problem structure. The
More informationUsing Learning Automata to Enhance Local-Search Based SAT Solvers
Using Learning Automata to Enhance Local-Search Based SAT Solvers with Learning Capability 63 5 Using Learning Automata to Enhance Local-Search Based SAT Solvers with Learning Capability Ole-Christoffer
More informationHeuristic Optimisation
Heuristic Optimisation Part 2: Basic concepts Sándor Zoltán Németh http://web.mat.bham.ac.uk/s.z.nemeth s.nemeth@bham.ac.uk University of Birmingham S Z Németh (s.nemeth@bham.ac.uk) Heuristic Optimisation
More information2SAT Andreas Klappenecker
2SAT Andreas Klappenecker The Problem Can we make the following boolean formula true? ( x y) ( y z) (z y)! Terminology A boolean variable is a variable that can be assigned the values true (T) or false
More informationP and NP (Millenium problem)
CMPS 2200 Fall 2017 P and NP (Millenium problem) Carola Wenk Slides courtesy of Piotr Indyk with additions by Carola Wenk CMPS 2200 Introduction to Algorithms 1 We have seen so far Algorithms for various
More informationSet 5: Constraint Satisfaction Problems
Set 5: Constraint Satisfaction Problems ICS 271 Fall 2012 Rina Dechter ICS-271:Notes 5: 1 Outline The constraint network model Variables, domains, constraints, constraint graph, solutions Examples: graph-coloring,
More informationSet 5: Constraint Satisfaction Problems
Set 5: Constraint Satisfaction Problems ICS 271 Fall 2013 Kalev Kask ICS-271:Notes 5: 1 The constraint network model Outline Variables, domains, constraints, constraint graph, solutions Examples: graph-coloring,
More informationEECS 219C: Computer-Aided Verification Boolean Satisfiability Solving. Sanjit A. Seshia EECS, UC Berkeley
EECS 219C: Computer-Aided Verification Boolean Satisfiability Solving Sanjit A. Seshia EECS, UC Berkeley Project Proposals Due Friday, February 13 on bcourses Will discuss project topics on Monday Instructions
More informationExploring the Landscape of the Space of Heuristics for Local Search in SAT
Exploring the Landscape of the Space of Heuristics for Local Search in SAT Andrew W. Burnett School of Computer Science University of Nottingham Nottingham, NG8 1BB, UK Email: psxab4@exmail.nottingham.ac.uk
More informationKalev Kask and Rina Dechter
From: AAAI-96 Proceedings. Copyright 1996, AAAI (www.aaai.org). All rights reserved. A Graph-Based Method for Improving GSAT Kalev Kask and Rina Dechter Department of Information and Computer Science University
More informationThe Scaling of Search Cost. Ian P. Gent and Ewan MacIntyre and Patrick Prosser and Toby Walsh.
The Scaling of Search Cost Ian P. Gent and Ewan MacIntyre and Patrick Prosser and Toby Walsh Apes Research Group, Department of Computer Science, University of Strathclyde, Glasgow G XH, Scotland Email:
More informationAn Adaptive Noise Mechanism for WalkSAT
From: AAAI-02 Proceedings. Copyright 2002, AAAI (www.aaai.org). All rights reserved. An Adaptive Noise Mechanism for WalkSAT Holger H. Hoos University of British Columbia Computer Science Department 2366
More informationPerformance Prediction and Automated Tuning of Randomized and Parametric Algorithms
Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms Frank Hutter 1, Youssef Hamadi 2, Holger Hoos 1, and Kevin Leyton-Brown 1 1 University of British Columbia, Vancouver,
More informationEECS 219C: Formal Methods Boolean Satisfiability Solving. Sanjit A. Seshia EECS, UC Berkeley
EECS 219C: Formal Methods Boolean Satisfiability Solving Sanjit A. Seshia EECS, UC Berkeley The Boolean Satisfiability Problem (SAT) Given: A Boolean formula F(x 1, x 2, x 3,, x n ) Can F evaluate to 1
More informationCMPUT 366 Intelligent Systems
CMPUT 366 Intelligent Systems Assignment 1 Fall 2004 Department of Computing Science University of Alberta Due: Thursday, September 30 at 23:59:59 local time Worth: 10% of final grade (5 questions worth
More information6.034 Notes: Section 3.1
6.034 Notes: Section 3.1 Slide 3.1.1 In this presentation, we'll take a look at the class of problems called Constraint Satisfaction Problems (CSPs). CSPs arise in many application areas: they can be used
More informationSteiner trees in the stochastic mean-field model of distance
Steiner trees in the stochastic mean-field model of distance Angus Davidson University of Bristol Joint work with Ayalvadi Ganesh and Balint Toth Climbing Redwoods Angus Davidson University of Bristol
More informationCMU-Q Lecture 8: Optimization I: Optimization for CSP Local Search. Teacher: Gianni A. Di Caro
CMU-Q 15-381 Lecture 8: Optimization I: Optimization for CSP Local Search Teacher: Gianni A. Di Caro LOCAL SEARCH FOR CSP Real-life CSPs can be very large and hard to solve Methods so far: construct a
More informationHandbook of Constraint Programming 245 Edited by F. Rossi, P. van Beek and T. Walsh c 2006 Elsevier All rights reserved
Handbook of Constraint Programming 245 Edited by F. Rossi, P. van Beek and T. Walsh c 2006 Elsevier All rights reserved Chapter 8 Local Search Methods Holger H. Hoos and Edward Tsang Local search is one
More informationChapter 27. Other Approaches to Reasoning and Representation
Chapter 27. Other Approaches to Reasoning and Representation The Quest for Artificial Intelligence, Nilsson, N. J., 2009. Lecture Notes on Artificial Intelligence Summarized by Ha, Jung-Woo and Lee, Beom-Jin
More informationSolving Problems with Hard and Soft Constraints Using a Stochastic Algorithm for MAX-SAT
This paper appeared at the st International Joint Workshop on Artificial Intelligence and Operations Research, Timberline, Oregon, 995. Solving Problems with Hard and Soft Constraints Using a Stochastic
More informationSurvey Propagation Revisited, or where is all the satisfaction coming from. Lukas Kroc, Ashish Sabharwal, Bart Selman
Survey Propagation Revisited, or where is all the satisfaction coming from Lukas Kroc, Ashish Sabharwal, Bart Selman Uncertainty in Artificial Intelligence July 2007 1 Talk Outline Introduction What is
More informationCS:4420 Artificial Intelligence
CS:4420 Artificial Intelligence Spring 2018 Beyond Classical Search Cesare Tinelli The University of Iowa Copyright 2004 18, Cesare Tinelli and Stuart Russell a a These notes were originally developed
More informationStochastic Local Search Methods for Dynamic SAT an Initial Investigation
Stochastic Local Search Methods for Dynamic SAT an Initial Investigation Holger H. Hoos and Kevin O Neill Abstract. We introduce the dynamic SAT problem, a generalisation of the satisfiability problem
More information1. To condense data in a single value. 2. To facilitate comparisons between data.
The main objectives 1. To condense data in a single value. 2. To facilitate comparisons between data. Measures :- Locational (positional ) average Partition values Median Quartiles Deciles Percentiles
More informationApproximation Algorithms
15-251: Great Ideas in Theoretical Computer Science Spring 2019, Lecture 14 March 5, 2019 Approximation Algorithms 1 2 SAT 3SAT Clique Hamiltonian- Cycle given a Boolean formula F, is it satisfiable? same,
More informationThe Resolution Algorithm
The Resolution Algorithm Introduction In this lecture we introduce the Resolution algorithm for solving instances of the NP-complete CNF- SAT decision problem. Although the algorithm does not run in polynomial
More information3.6.2 Generating admissible heuristics from relaxed problems
3.6.2 Generating admissible heuristics from relaxed problems To come up with heuristic functions one can study relaxed problems from which some restrictions of the original problem have been removed The
More informationUnit 8: Coping with NP-Completeness. Complexity classes Reducibility and NP-completeness proofs Coping with NP-complete problems. Y.-W.
: Coping with NP-Completeness Course contents: Complexity classes Reducibility and NP-completeness proofs Coping with NP-complete problems Reading: Chapter 34 Chapter 35.1, 35.2 Y.-W. Chang 1 Complexity
More informationspace. We will apply the idea of enforcing local consistency to GSAT with the hope that its performance can
GSAT and Local Consistency 3 Kalev Kask Computer Science Department University of California at Irvine Irvine, CA 92717 USA Rina Dechter Computer Science Department University of California at Irvine Irvine,
More informationRandomness and Computation March 25, Lecture 5
0368.463 Randomness and Computation March 25, 2009 Lecturer: Ronitt Rubinfeld Lecture 5 Scribe: Inbal Marhaim, Naama Ben-Aroya Today Uniform generation of DNF satisfying assignments Uniform generation
More informationConfiguration landscape analysis and backbone guided local search. Part I: Satisfiability and maximum satisfiability
Artificial Intelligence 158 (2004) 1 26 www.elsevier.com/locate/artint Configuration landscape analysis and backbone guided local search. Part I: Satisfiability and maximum satisfiability Weixiong Zhang
More informationInterior Penalty Functions. Barrier Functions A Problem and a Solution
Interior Penalty Functions Barrier Functions A Problem and a Solution Initial Steps A second type of penalty function begins with an initial point inside the feasible region, which is why these procedures
More informationTwo approaches. Local Search TSP. Examples of algorithms using local search. Local search heuristics - To do list
Unless P=NP, there is no polynomial time algorithm for SAT, MAXSAT, MIN NODE COVER, MAX INDEPENDENT SET, MAX CLIQUE, MIN SET COVER, TSP,. But we have to solve (instances of) these problems anyway what
More informationOn the Run-time Behaviour of Stochastic Local Search Algorithms for SAT
From: AAAI-99 Proceedings. Copyright 1999, AAAI (www.aaai.org). All rights reserved. On the Run-time Behaviour of Stochastic Local Search Algorithms for SAT Holger H. Hoos University of British Columbia
More informationCS270 Combinatorial Algorithms & Data Structures Spring Lecture 19:
CS270 Combinatorial Algorithms & Data Structures Spring 2003 Lecture 19: 4.1.03 Lecturer: Satish Rao Scribes: Kevin Lacker and Bill Kramer Disclaimer: These notes have not been subjected to the usual scrutiny
More informationConstraint Satisfaction Problems
Constraint Satisfaction Problems Greedy Local Search Bernhard Nebel, Julien Hué, and Stefan Wölfl Albert-Ludwigs-Universität Freiburg June 19, 2007 Nebel, Hué and Wölfl (Universität Freiburg) Constraint
More informationA Simple ¾-Approximation Algorithm for MAX SAT
A Simple ¾-Approximation Algorithm for MAX SAT David P. Williamson Joint work with Matthias Poloczek (Cornell), Georg Schnitger (Frankfurt), and Anke van Zuylen (William & Mary) Maximum Satisfiability
More informationCOMPARISON OF SIMPLIFIED GRADIENT DESCENT ALGORITHMS FOR DECODING LDPC CODES
COMPARISON OF SIMPLIFIED GRADIENT DESCENT ALGORITHMS FOR DECODING LDPC CODES Boorle Ashok Kumar 1, G Y. Padma Sree 2 1 PG Scholar, Al-Ameer College Of Engineering & Information Technology, Anandapuram,
More informationFirst-improvement vs. Best-improvement Local Optima Networks of NK Landscapes
First-improvement vs. Best-improvement Local Optima Networks of NK Landscapes Gabriela Ochoa 1, Sébastien Verel 2, and Marco Tomassini 3 1 School of Computer Science, University of Nottingham, Nottingham,
More informationConstraint Satisfaction Problems
Constraint Satisfaction Problems Tuomas Sandholm Carnegie Mellon University Computer Science Department [Read Chapter 6 of Russell & Norvig] Constraint satisfaction problems (CSPs) Standard search problem:
More informationAndrew Davenport and Edward Tsang. fdaveat,edwardgessex.ac.uk. mostly soluble problems and regions of overconstrained, mostly insoluble problems as
An empirical investigation into the exceptionally hard problems Andrew Davenport and Edward Tsang Department of Computer Science, University of Essex, Colchester, Essex CO SQ, United Kingdom. fdaveat,edwardgessex.ac.uk
More informationDiscrete Lagrangian-Based Search for Solving MAX-SAT Problems. Benjamin W. Wah and Yi Shang West Main Street. Urbana, IL 61801, USA
To appear: 15th International Joint Conference on Articial Intelligence, 1997 Discrete Lagrangian-Based Search for Solving MAX-SAT Problems Abstract Weighted maximum satisability problems (MAX-SAT) are
More information(Stochastic) Local Search Algorithms
DM841 DISCRETE OPTIMIZATION Part 2 Heuristics (Stochastic) Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. 2. 3. Components 2 Outline 1. 2. 3. Components
More informationCaptain Jack: New Variable Selection Heuristics in Local Search for SAT
Captain Jack: New Variable Selection Heuristics in Local Search for SAT Dave Tompkins, Adrian Balint, Holger Hoos SAT 2011 :: Ann Arbor, Michigan http://www.cs.ubc.ca/research/captain-jack Key Contribution:
More informationRandom Subset Optimization
Random Subset Optimization Boi Faltings and Quang-Huy Nguyen Artificial Intelligence Laboratory (LIA), Swiss Federal Institute of Technology (EPFL), IN-Ecublens, CH-1015 Ecublens, Switzerland, boi.faltings
More informationStochastic Local Search for SMT
DISI - Via Sommarive, 14-38123 POVO, Trento - Italy http://disi.unitn.it Stochastic Local Search for SMT Silvia Tomasi December 2010 Technical Report # DISI-10-060 Contents 1 Introduction 5 2 Background
More informationSLS Methods: An Overview
HEURSTC OPTMZATON SLS Methods: An Overview adapted from slides for SLS:FA, Chapter 2 Outline 1. Constructive Heuristics (Revisited) 2. terative mprovement (Revisited) 3. Simple SLS Methods 4. Hybrid SLS
More informationN-Queens problem. Administrative. Local Search
Local Search CS151 David Kauchak Fall 2010 http://www.youtube.com/watch?v=4pcl6-mjrnk Some material borrowed from: Sara Owsley Sood and others Administrative N-Queens problem Assign 1 grading Assign 2
More informationOutline of the module
Evolutionary and Heuristic Optimisation (ITNPD8) Lecture 2: Heuristics and Metaheuristics Gabriela Ochoa http://www.cs.stir.ac.uk/~goc/ Computing Science and Mathematics, School of Natural Sciences University
More informationREACTIVE SEARCH FOR MAX-SAT: DIVERSIFICATION- BIAS PROPERTIES WITH PROHIBITIONS AND PENALTIES
DEPARTMENT OF INFORMATION AND COMMUNICATION TECHNOLOGY 38050 Povo Trento (Italy), Via Sommarive 14 http://dit.unitn.it/ REACTIVE SEARCH FOR MAX-SAT: DIVERSIFICATION- BIAS PROPERTIES WITH PROHIBITIONS AND
More informationAn upper bound for the chromatic number of line graphs
EuroComb 005 DMTCS proc AE, 005, 151 156 An upper bound for the chromatic number of line graphs A D King, B A Reed and A Vetta School of Computer Science, McGill University, 3480 University Ave, Montréal,
More informationA Course on Meta-Heuristic Search Methods for Combinatorial Optimization Problems
A Course on Meta-Heuristic Search Methods for Combinatorial Optimization Problems AutOrI LAB, DIA, Roma Tre Email: mandal@dia.uniroma3.it January 16, 2014 Outline 1 An example Assignment-I Tips Variants
More informationELEMENTARY NUMBER THEORY AND METHODS OF PROOF
CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF Copyright Cengage Learning. All rights reserved. SECTION 4.2 Direct Proof and Counterexample II: Rational Numbers Copyright Cengage Learning. All
More informationAn IPS for TQBF Intro to Approximability
An IPS for TQBF Intro to Approximability Outline Proof that TQBF (the language of true (valid) quantified Boolean formulas) is in the class IP Introduction to approximation algorithms for NP optimization
More informationAn Analysis and Comparison of Satisfiability Solving Techniques
An Analysis and Comparison of Satisfiability Solving Techniques Ankur Jain, Harsha V. Madhyastha, Craig M. Prince Department of Computer Science and Engineering University of Washington Seattle, WA 98195
More informationComparison of Interior Point Filter Line Search Strategies for Constrained Optimization by Performance Profiles
INTERNATIONAL JOURNAL OF MATHEMATICS MODELS AND METHODS IN APPLIED SCIENCES Comparison of Interior Point Filter Line Search Strategies for Constrained Optimization by Performance Profiles M. Fernanda P.
More informationRandom Walk With Continuously Smoothed Variable Weights
Random Walk With Continuously Smoothed Variable Weights Steven Prestwich Cork Constraint Computation Centre Department of Computer Science University College Cork, Ireland s.prestwich@cs.ucc.ie Abstract.
More informationAnt Colony Optimization
Ant Colony Optimization CompSci 760 Patricia J Riddle 1 Natural Inspiration The name Ant Colony Optimization was chosen to reflect its original inspiration: the foraging behavior of some ant species. It
More informationCMPUT 366 Assignment 1
CMPUT 66 Assignment Instructor: R. Greiner Due Date: Thurs, October 007 at start of class The following exercises are intended to further your understanding of agents, policies, search, constraint satisfaction
More informationDynamic Variable Filtering for Hard Random 3-SAT Problems
Dynamic Variable Filtering for Hard Random 3-SAT Problems Anbulagan, John Thornton, and Abdul Sattar School of Information Technology Gold Coast Campus, Griffith University PMB 50 Gold Coast Mail Centre,
More informationArtificial Intelligence
Artificial Intelligence Lesson 4 Local Search Local improvement, no paths Look around at states in the local neighborhood and choose the one with the best value Pros: Quick (usually linear) Sometimes enough
More informationExtending the Reach of SAT with Many-Valued Logics
Extending the Reach of SAT with Many-Valued Logics Ramón Béjar a, Alba Cabiscol b,césar Fernández b, Felip Manyà b and Carla Gomes a a Dept. of Comp. Science, Cornell University, Ithaca, NY 14853 USA,
More informationA B. A: sigmoid B: EBA (x0=0.03) C: EBA (x0=0.05) U
Extending the Power and Capacity of Constraint Satisfaction Networks nchuan Zeng and Tony R. Martinez Computer Science Department, Brigham Young University, Provo, Utah 8460 Email: zengx@axon.cs.byu.edu,
More informationTravelling salesman problem using reduced algorithmic Branch and bound approach P. Ranjana Hindustan Institute of Technology and Science
Volume 118 No. 20 2018, 419-424 ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu Travelling salesman problem using reduced algorithmic Branch and bound approach P. Ranjana Hindustan
More informationImproving the Hopfield Network through Beam Search
Brigham Young University BYU ScholarsArchive All Faculty Publications 2001-07-19 Improving the Hopfield Network through Beam Search Tony R. Martinez martinez@cs.byu.edu Xinchuan Zeng Follow this and additional
More informationLecture 20: Satisfiability Steven Skiena. Department of Computer Science State University of New York Stony Brook, NY
Lecture 20: Satisfiability Steven Skiena Department of Computer Science State University of New York Stony Brook, NY 11794 4400 http://www.cs.sunysb.edu/ skiena Problem of the Day Suppose we are given
More informationCycles in Random Graphs
Cycles in Random Graphs Valery Van Kerrebroeck Enzo Marinari, Guilhem Semerjian [Phys. Rev. E 75, 066708 (2007)] [J. Phys. Conf. Series 95, 012014 (2008)] Outline Introduction Statistical Mechanics Approach
More informationP vs. NP. Simpsons: Treehouse of Horror VI
P vs. NP Simpsons: Treehouse of Horror VI Attribution These slides were prepared for the New Jersey Governor s School course The Math Behind the Machine taught in the summer of 2012 by Grant Schoenebeck
More informationA Simplied NP-complete MAXSAT Problem. Abstract. It is shown that the MAX2SAT problem is NP-complete even if every variable
A Simplied NP-complete MAXSAT Problem Venkatesh Raman 1, B. Ravikumar 2 and S. Srinivasa Rao 1 1 The Institute of Mathematical Sciences, C. I. T. Campus, Chennai 600 113. India 2 Department of Computer
More informationEE795: Computer Vision and Intelligent Systems
EE795: Computer Vision and Intelligent Systems Spring 2012 TTh 17:30-18:45 WRI C225 Lecture 04 130131 http://www.ee.unlv.edu/~b1morris/ecg795/ 2 Outline Review Histogram Equalization Image Filtering Linear
More informationPre-requisite Material for Course Heuristics and Approximation Algorithms
Pre-requisite Material for Course Heuristics and Approximation Algorithms This document contains an overview of the basic concepts that are needed in preparation to participate in the course. In addition,
More informationRandom backtracking in backtrack search algorithms for satisfiability
Discrete Applied Mathematics 155 (2007) 1604 1612 www.elsevier.com/locate/dam Random backtracking in backtrack search algorithms for satisfiability I. Lynce, J. Marques-Silva Technical University of Lisbon,
More informationA Multilevel Greedy Algorithm for the Satisfiability Problem
A Multilevel Greedy Algorithm for the Satisfiability Problem 3 Noureddine Bouhmala 1 and Xing Cai 2 1 Vestfold University College, 2 Simula Research Laboratory, Norway 1. Introduction The satisfiability
More information