10.3 Reformulation 10.4.1 The Lex-Leader Method Shant Karakashian 1.

Slides:



Advertisements
Similar presentations
Global Constraints Toby Walsh National ICT Australia and University of New South Wales
Advertisements

Elementary Linear Algebra
Interchangeability in Constraint Programming Shant Karakashian, Robert J. Woodward, Berthe Y. Choueiry, Steven D. Prestwich and Eugene C. Freuder 1.
Solving LP Models Improving Search Special Form of Improving Search
1 Finite Constraint Domains. 2 u Constraint satisfaction problems (CSP) u A backtracking solver u Node and arc consistency u Bounds consistency u Generalized.
Exploiting Symmetry in Planning Maria Fox Durham Planning Group University of Durham, UK.
Proofs from SAT Solvers Yeting Ge ACSys NYU Nov
Nonstandard Problmes Produced by E. Gretchen Gascon.
Review: Constraint Satisfaction Problems How is a CSP defined? How do we solve CSPs?
Constraint Processing and Programming Introductory Exemple Javier Larrosa.
Properties of SLUR Formulae Ondřej Čepek, Petr Kučera, Václav Vlček Charles University in Prague SOFSEM 2012 January 23, 2012.
1.2 Row Reduction and Echelon Forms
Linear Equations in Linear Algebra
Lesson 8 Gauss Jordan Elimination
Introduction to Symmetry Handbook of Constraint Programming, Chapter 10 Presentation by: Robert Woodward Advanced CP, Fall
CPSC 322, Lecture 18Slide 1 Planning: Heuristics and CSP Planning Computer Science cpsc322, Lecture 18 (Textbook Chpt 8) February, 12, 2010.
Constraint Models for the Covering Test Problems Authors: Brahim Hnich, Steven D. Prestwich, Evgeny Selensky, Barbara M. Smith Speaker: Pingyu Zhang CSE.
Maths of Constraint Satisfaction, Oxford, March 2006 Constraint Programming Models for Graceful Graphs Barbara Smith.
Constraint Logic Programming Ryan Kinworthy. Overview Introduction Logic Programming LP as a constraint programming language Constraint Logic Programming.
08/1 Foundations of AI 8. Satisfiability and Model Construction Davis-Putnam, Phase Transitions, GSAT Wolfram Burgard and Bernhard Nebel.
November 10, 2009Introduction to Cognitive Science Lecture 17: Game-Playing Algorithms 1 Decision Trees Many classes of problems can be formalized as search.
CPSC 322, Lecture 12Slide 1 CSPs: Search and Arc Consistency Computer Science cpsc322, Lecture 12 (Textbook Chpt ) January, 29, 2010.
Chapter 10: Iterative Improvement
1 Backdoors To Typical Case Complexity Ryan Williams Carnegie Mellon University Joint work with: Carla Gomes and Bart Selman Cornell University.
Shatter: Efficient Symmetry- Breaking for Boolean Satisfiability Fadi A. Aloul Igor L. Markov, Karem A. Sakallah The University of Michigan.
Reducing Symmetry in Matrix Models Alan Frisch, Ian Miguel, Toby Walsh (York) Pierre Flener, Brahim Hnich, Zeynep Kiziltan, Justin Pearson (Uppsala)
Modeling the Covering Test Problem Brahim Hnich, Steven Prestwich, and Evgeny Selensky Cork Constraint Computation Center UCC Supported by SFI.
Alan M. Frisch Artificial Intelligence Group Department of Computer Science University of York Co-authors Ian Miguel, Toby Walsh, Pierre Flener, Brahim.
Linear Programming Applications
Copyright 2008 Koren ECE666/Koren Part.6a.1 Israel Koren Spring 2008 UNIVERSITY OF MASSACHUSETTS Dept. of Electrical & Computer Engineering Digital Computer.
Constraint Systems Laboratory 11/22/2005Zheng – Comprehensive1 Survey of Techniques for Detecting and Exploiting Symmetry in Constraint Satisfaction Problems.
Global Constraints for Lexicographic Orderings Alan Frisch, Ian Miguel (University of York) Brahim Hnich, Toby Walsh (4C) Zeynep Kiziltan (Uppsala University)
Courtesy RK Brayton (UCB) and A Kuehlmann (Cadence) 1 Logic Synthesis Two-Level Minimization I.
Chapter 4 Section 1 Copyright © 2011 Pearson Education, Inc.
1.2 Gaussian Elimination.
Constraint Satisfaction Problems
1 1.1 © 2012 Pearson Education, Inc. Linear Equations in Linear Algebra SYSTEMS OF LINEAR EQUATIONS.
Systems and Matrices (Chapter5)
Genetic Algorithm.
Tractable Symmetry Breaking Using Restricted Search Trees Colva M. Roney-Dougal, Ian P. Gent, Tom Kelsey, Steve Linton Presented by: Shant Karakashian.
Systems of Linear Equation and Matrices
MATH 250 Linear Equations and Matrices
CP Summer School Modelling for Constraint Programming Barbara Smith 1.Definitions, Viewpoints, Constraints 2.Implied Constraints, Optimization,
Symmetry Breaking Ordering Constraints Zeynep Kiziltan Department of Information Science Uppsala University, Sweden A progress.
Solvers for the Problem of Boolean Satisfiability (SAT) Will Klieber Aug 31, 2011 TexPoint fonts used in EMF. Read the TexPoint manual before you.
Constraint Satisfaction Problems (CSPs) CPSC 322 – CSP 1 Poole & Mackworth textbook: Sections § Lecturer: Alan Mackworth September 28, 2012.
Matrices Addition & Subtraction Scalar Multiplication & Multiplication Determinants Inverses Solving Systems – 2x2 & 3x3 Cramer’s Rule.
Modelling for Constraint Programming Barbara Smith CP 2010 Doctoral Programme.
Stocs – A Stochastic CSP Solver Bella Dubrov IBM Haifa Research Lab © Copyright IBM.
CP Summer School Modelling for Constraint Programming Barbara Smith 2. Implied Constraints, Optimization, Dominance Rules.
Hande ÇAKIN IES 503 TERM PROJECT CONSTRAINT SATISFACTION PROBLEMS.
CP Summer School Modelling for Constraint Programming Barbara Smith 4. Combining Viewpoints, Modelling Advice.
1 Constraint Symmetry and Solution Symmetry Presented by Beau M. Christ Symmetry in CSP’s Spring 2010 Presented by Beau M. Christ Symmetry in CSP’s Spring.
CP Summer School Modelling for Constraint Programming Barbara Smith 3. Symmetry, Viewpoints.
Maximum Density Still Life Symmetries and Lazy Clause Generation Geoffrey Chu, Maria Garcia de la Banda, Chris Mears, Peter J. Stuckey.
Robust Planning using Constraint Satisfaction Techniques Daniel Buettner and Berthe Y. Choueiry Constraint Systems Laboratory Department of Computer Science.
Chapter 13 Backtracking Introduction The 3-coloring problem
1 CSC 384 Lecture Slides (c) , C. Boutilier and P. Poupart CSC384: Lecture 16  Last time Searching a Graphplan for a plan, and relaxed plan heuristics.
ECE DIGITAL LOGIC LECTURE 15: COMBINATIONAL CIRCUITS Assistant Prof. Fareena Saqib Florida Institute of Technology Fall 2015, 10/20/2015.
1 1.2 Linear Equations in Linear Algebra Row Reduction and Echelon Forms © 2016 Pearson Education, Ltd.
(iii) Simplex method - I D Nagesh Kumar, IISc Water Resources Planning and Management: M3L3 Linear Programming and Applications.
1 Constraint Satisfaction Problems (CSP). Announcements Second Test Wednesday, April 27.
CSPs: Search and Arc Consistency Computer Science cpsc322, Lecture 12
CSPs: Search and Arc Consistency Computer Science cpsc322, Lecture 12
CSPs: Search and Arc Consistency Computer Science cpsc322, Lecture 12
Linear Equations in Linear Algebra
Elementary Row Operations Gaussian Elimination Method
Generic SBDD using Computational Group Theory
Linear Equations in Linear Algebra
Presentation transcript:

10.3 Reformulation The Lex-Leader Method Shant Karakashian 1

Outline Introduction: Modeling & Reformulation Examples – Social Golfers Problem: Set Variables and Difficulties – n-integer permutation and Reformulation Reformulation Techniques – Different Viewpoints – Prestwich's Reformulation The Properties of Reformulation Adding Constraints Before Search Introduction to Lex-Leader Method Lex-Leader Method – The idea – Procedure – Lex-Leader and Variable Ordering – Limitation 2

Introduction Modelling a problem has a substantial effect on the efficiently of the problem solving Different models of the same problem can have different symmetries A problem can be reformulated thus getting different symmetries. Modeling and reformulation are important for symmetry breaking Once a problem is reformulated, the remaining symmetries can be dealt with before or during search 3

Social Golfers Problem Golfers play once a week in groups, such that no two people play in the same group in two different weeks – 32 golfers – 8 groups of 4 people each – 10 weeks The problem has 32!10!8!104!80 symmetries. Remodel the problem to get 32!10! symmetries [B. Smith '04] – Adding a variable for each pair of players to indicate which week they played together 4

Set Variables Given: a number of indistinguishable variables Encode the variables as a set of variables In the social golfers' example: – Encode the groups playing within each week as sets (total of 8 sets per week) – The size of each set is 4 – Every pair of sets constraint to have empty intersection – Result: lose 4! symmetries in each group – Total reduction of symmetries:

Difficulties with Set Variables There are theoretical and practical difficulties associated with set variables: – Representations of set variables by the solver can have dramatically different behaviors in propagation: e.g. if the used representation is not suitable for the constraints associated with the variables, search can be dramatically increased. – In cases where set and integer variables are mixed: "Channeling" between set and integer variables can be difficult, and lead to delaying the propagation until late in search. – Reformulating is an art, not a science. 6

Example: n-integer permutation Given n integers from 0 to n-1, find a permutation so that the differences between adjacent numbers are also a permutation of the numbers 1 to n-1. n=11: Four obvious symmetries in the problem: – identity – reversing the series – negating each element by subtracting it from (n-1) – reversing and negating 7

Reformulation of n-integer permutation [Gent et al. '04] Given a solution to the problem, cycle it about a pivot to generate another solution The difference between first and last terms must always duplicate a difference in the sequence, so this operation can be applied to any solution 8

Reformulation of n-integer permutation (contd.) Reformulate the problem to solve a different problem Solutions of reformulated problem lead to solutions to the original problem – Given n integers from 0 to n-1, find a permutation so that: The differences between adjacent numbers and the two extreme numbers are also a permutation of the numbers 1 to n- 1 – The sequence has to obey two constraints: The permutation starts 0,n-1,1 The n differences between consecutive numbers contain all of 1,...n- 1 with one difference occurring exactly twice 9

Different Viewpoints Given a CSP with: – n variables – single domain for all variables of size n – all variables must take different values Then there are different 'Viewpoints" of the problem: – Find values for each variable – Find variables for each value If there is symmetry: – Value symmetry in the first viewpoint is interchanged with variable symmetry in the second and vice versa 10

Prestwich's Reformulation A significant advance in understanding how reformulation can be applied mechanically Prestwich showed that value symmetries can be eliminated automatically by a new encoding of CSPs to SAT Breaks all value symmetries of a special kind: – Called 'Dynamic Substitutability’ – Is a variant of Freuder's value interchangeability Prestwich's encoding eliminates all dynamic substitutability Symmetry detection not necessary 11

The Properties of the Reformulation Disadvantages: – Limited to certain types of value symmetry – No guarantee that the reformulation would lead to improved search Adventages: – From a black art to a science – The concerns are on tradeoffs and implementation – No need for magical insights 12

Adding Constraints Before Search Symmetry breaking constraints when added in an ad hoc fashion: – Need to recognize the symmetry – Variables are indistinguishable: force them to be in non-decreasing order. – Variables are indistinguishable and must have different values: Force them to be in strictly increasing order – Can loose solutions if incorrectly done 13

Introduction to Lex-Leader Method A CSP has symmetry: – Eliminated by adding constraints to the original problem – Possible to find a 'reduced form‘ [Crawford et al. '96] outlined the technique lex- leader: – For Variable symmetries – Constructs symmetry-breaking ordering constraints 14

The idea of Lex-Leader Method For a symmetry group: – For each equivalence class of solutions – Predefine one to be the canonical solution Achieved by: – Adding constraints before search – Satisfy only the canonical solutions – To induce an ordering on full assignments: Requires choosing a static variable ordering 15

Lex-Leader Method Defined on variable symmetries For every permutation g converting a tuple into another tuple: – Choose the one that gives the value that is lexicographically least – example: variables: A, B, C constraints: all differnet Permutations: A B C, A C B, B A C, B C A, C A B, C B A Solutions [A=1 B=2 C=3] and [A=1 B=3 C=2] are equivalent With constraint A B C <= A C B only [1 2 3] is a solution For [1 3 2] : [1 3 2] > [1 2 3] 16

Lex-Leader Example Consider a 3x2 matrix in a context The rows and columns may be freely permuted The symmetries form the group S3 x S2 Group order is 3!2! = 12 1.ABCDEF ≤lex ABCDEF 2.ABCDEF ≤lex ACBDFE 3.ABCDEF ≤lex BCAEFD 4.ABCDEF ≤lex BACEDF 5.ABCDEF ≤lex CABFDE 6.ABCDEF ≤lex CBAFED 7.ABCDEF ≤lex DFEACB 8.ABCDEF ≤lex EFDBCA 9.ABCDEF ≤lex EDFBAC 10.ABCDEF ≤lex FDECAB 11.ABCDEF ≤lex FEDCBA 12.ABCDEF ≤lex DEFABC 17 ABC DEF DEF ABC

Lex-Leader and Variable Ordering Does not respect the variable and value ordering heuristics If the leftmost solution in the search tree is not canonical: – Disallowed – Leads to increased search Limits the power of the constraint programming to use dynamic variable ordering heuristics 18

Lex-Leader Limitation Requires one constraint for each element of the symmetry group Many groups contain an exponential number of symmetries In the case of matrix with m rows and n columns, this is m!n! Applicable to many cases but it is impractical 19