Alan M. Frisch Artificial Intelligence Group Department of Computer Science University of York Co-authors Ian Miguel, Toby Walsh, Pierre Flener, Brahim.

Slides:



Advertisements
Similar presentations
Modelling a Steel Mill Slab Design Problem Alan Frisch, Ian Miguel, Toby Walsh AI Group University of York.
Advertisements

Global Constraints Toby Walsh National ICT Australia and University of New South Wales
ICS-271:Notes 5: 1 Lecture 5: Constraint Satisfaction Problems ICS 271 Fall 2008.
Reducing Symmetry in Matrix Models Alan Frisch, Ian Miguel, Toby Walsh (York) Pierre Flener, Brahim Hnich, Zeynep Kiziltan, Justin Pearson (Uppsala)
1 Transportation problem The transportation problem seeks the determination of a minimum cost transportation plan for a single commodity from a number.
Case study 5: balanced academic curriculum problem Joint work with Brahim Hnich and Zeynep Kiziltan (CPAIOR 2002)
Generating Implied Constraints via Proof Planning Alan Frisch, Ian Miguel, Toby Walsh Dept of CS University of York EPSRC funded project GR/N16129.
Optimal Rectangle Packing: A Meta-CSP Approach Chris Reeson Advanced Constraint Processing Fall 2009 By Michael D. Moffitt and Martha E. Pollack, AAAI.
Leeds: 6 June 02Constraint Technology for the Masses Alan M. Frisch Artificial Intelligence Group Department of Computer Science University of York Collaborators:
Section 3 CS182 Intelligent Machines: Reasoning, Actions and Plans.
Simultaneous Linear Equations
1 1.8 © 2012 Pearson Education, Inc. Linear Equations in Linear Algebra INTRODUCTION TO LINEAR TRANSFORMATIONS.
Transforming and Refining Abstract Constraint Specifications Alan Frisch, Brahim Hnich*, Ian Miguel, Barbara Smith, and Toby Walsh *Cork Constraint Computation.
Maths for Computer Graphics
Symmetry as a Prelude to Implied Constraints Alan Frisch, Ian Miguel, Toby Walsh University of York.
Alan M. Frisch Artificial Intelligence Group Department of Computer Science University of York Extending the Reach of Constraint Technology through Reformulation.
CGRASS A System for Transforming Constraint Satisfaction Problems Alan Frisch, Ian Miguel AI Group University of York Toby Walsh 4C.
Matrix Modelling Alan M. Frisch and Ian Miguel (York) Brahim Hnich, Zeynep Kiziltan (Uppsala) Toby Walsh (Cork)
Matrix Modelling Pierre Flener (Uppsala) Alan M. Frisch (York) Brahim Hnich, Zeynep Kiziltan (Uppsala) Ian Miguel, and Toby Walsh (York)
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.
CGRASS A System for Transforming Constraint Satisfaction Problems Alan Frisch, Ian Miguel (York) Toby Walsh (Cork)
26 April 2013Lecture 5: Constraint Propagation and Consistency Enforcement1 Constraint Propagation and Consistency Enforcement Jorge Cruz DI/FCT/UNL April.
Constraint Systems Laboratory 11/22/2005Zheng – Comprehensive1 Survey of Techniques for Detecting and Exploiting Symmetry in Constraint Satisfaction Problems.
Matrix Modelling: Déjà Vu Pierre Flener (Uppsala) Alan M. Frisch (York) Brahim Hnich, Zeynep Kiziltan (Uppsala) Ian Miguel, and Toby Walsh (York)
Global Constraints for Lexicographic Orderings Alan Frisch, Ian Miguel (University of York) Brahim Hnich, Toby Walsh (4C) Zeynep Kiziltan (Uppsala University)
Modelling a Steel Mill Slab Design Problem Alan Frisch, Ian Miguel, Toby Walsh AI Group University of York.
Daniel Kroening and Ofer Strichman Decision Procedures An Algorithmic Point of View Deciding ILPs with Branch & Bound ILP References: ‘Integer Programming’
Section 8.1 – Systems of Linear Equations
Multivariate Linear Systems and Row Operations.
Major: All Engineering Majors Author(s): Autar Kaw
LINEAR PROGRAMMING SIMPLEX METHOD.
Constraint Patterns Toby Walsh 4C, UCC & Uppsala.
Tractable Symmetry Breaking Using Restricted Search Trees Colva M. Roney-Dougal, Ian P. Gent, Tom Kelsey, Steve Linton Presented by: Shant Karakashian.
Square n-by-n Matrix.
Slide Chapter 7 Systems and Matrices 7.1 Solving Systems of Two Equations.
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide 7- 1.
Slide 1 CSPs: Arc Consistency & Domain Splitting Jim Little UBC CS 322 – Search 7 October 1, 2014 Textbook §
Symmetry Breaking Ordering Constraints Zeynep Kiziltan Department of Information Science Uppsala University, Sweden A progress.
Copyright © 2013, 2009, 2005 Pearson Education, Inc. 1 5 Systems and Matrices Copyright © 2013, 2009, 2005 Pearson Education, Inc.
Embedding Constraint Satisfaction using Parallel Soft-Core Processors on FPGAs Prasad Subramanian, Brandon Eames, Department of Electrical Engineering,
1 1.8 © 2016 Pearson Education, Inc. Linear Equations in Linear Algebra INTRODUCTION TO LINEAR TRANSFORMATIONS.
Constraint Satisfaction CPSC 386 Artificial Intelligence Ellen Walker Hiram College.
CP Summer School Modelling for Constraint Programming Barbara Smith 3. Symmetry, Viewpoints.
10.3 Reformulation The Lex-Leader Method Shant Karakashian 1.
MULTI-DIMENSIONAL ARRAYS 1. Multi-dimensional Arrays The types of arrays discussed so far are all linear arrays. That is, they all dealt with a single.
Slide Copyright © 2009 Pearson Education, Inc. 7.4 Solving Systems of Equations by Using Matrices.
An Analysis of the n- Queens problem Saleem Karamali.
1 Constraint Satisfaction Problems (CSP). Announcements Second Test Wednesday, April 27.
Matrices Rules & Operations.
Linear Algebra review (optional)
Constraint Satisfaction Problems (CSPs)
Constraint Satisfaction Problem
LINEAR TRANSFORMATIONS
Warm Up Use scalar multiplication to evaluate the following:
Multiplying Matrices.
CSPs and Relational DBs
CSCI N207 Data Analysis Using Spreadsheet
Problem Solving with Constraints
Multiplying Matrices.
Linear Programming Problem
Problem Solving with Constraints
Problem Solving with Constraints
1.8 Matrices.
1.8 Matrices.
Multiplying Matrices.
Multiplying Matrices.
Linear Equations in Linear Algebra
Linear Equations in Linear Algebra
Multiplying Matrices.
Presentation transcript:

Alan M. Frisch Artificial Intelligence Group Department of Computer Science University of York Co-authors Ian Miguel, Toby Walsh, Pierre Flener, Brahim Hnich, Zeynep Kiziltan, Justin Pearson Acknowledgement Warwick Harvey Breaking Symmetry in Matrix Models of Constraint Satisfaction Problems

The Constraint Satisfaction Problem An instance of the CSP consists of Finite set of variables X 1,…,X n, having finite domains D 1,…,D n. Finite set of constraints. Each restricts the values that the variables can simultaneously take. Example: x neq y. x+y<z.

Solutions of a CSP Instance A total instantiation maps each variable to an element in its domain. A solution to a CSP instance is a total instantiation that satisfies all the constraints. Problem: Given an instance –Determine if it is satisfiable (has a solution) –Find a solution –Find all solutions –Find optimal solution

Partial Instantiation Search (Forward Checking) X X X ! X !! !! !

Index Symmetry in Matrix Models Many CSP Problems can be modelled by a multi-dimensional matrix of decision variables. 0 vs 72 vs 72 vs 60 vs 41 vs 63 vs 54 vs 5Period 3 0 vs 5 1 vs 4 3 vs 7 Week 5 3 vs 4 0 vs 6 1 vs 5 Week 6 1 vs 31 vs 22 vs 54 vs 66 vs 7Period 4 5 vs 65 vs 70 vs 31 vs 72 vs 3Period 2 2 vs 43 vs 64 vs 70 vs 20 vs 1Period 1 Week 7Week 4Week 3Week 2Week 1 Round Robin Tournament Schedule

Examples of Index Symmetry Balanced Incomplete Block Design –Set of Blocks  –Set of objects in each block  Rack Configuration –Set of cards (PI) –Set of rack types –Set of occurrences of each rack type 

Examples of Index Symmetry Social Golfers –Set of rounds  –Set of groups  –Set of golfers  Steel Mill Slab Design Printing Template Design Warehouse Location Progressive Party Problem …

Transforming Value Symmetry to Index Symmetry a, b, c, d are indistinguishable values {b, d}ca abcdabcd Now the rows are indistinguishable

Index Symmetry in One Dimension Indistinguishable Rows ABC DEF GHI 2 Dimensions [A B C]  lex [D E F]  lex [G H I] N Dimensions flatten([A B C])  lex flatten([D E F])  lex flatten([G H I])

Index Symmetry in Multiple Dimensions ABC DEF GHI ABC DEF GHI ABC DEF GHI ABC DEF GHI Consistent Inconsistent

Incompleteness of Double Lex Swap 2 columns Swap row 1 and 3

Completeness in Special Cases All variables take distinct values –Push largest value to a particular corner, and –Order the row and column containing that value 2 distinct values, one of which has at most one occurrence in each row or column. –Lex order the rows and the columns Each row is a different multiset of values –Multiset order the rows and lex order the columns

Enforcing Lexicographic Ordering We have developed a linear time algorithm for enforcing generalized arc-consistency on a lexicographic ordering constraint between two vectors of variables. Experiments show that in some cases it is vastly superior to previous consistency algorithms, both in time and in amount pruned.

Enforcing Lexicographic Ordering does not imply GAC(V 1  lex V 2  lex …  lex V n ) Not pair-wise decomposable Not transitive GAC(V 1  lex V 2 ) and GAC(V 2  lex V 3 ) does not imply GAC(V 1  lex V 3 )

Complete Solution for 2x3 Matrices 1.ABCDEF  ACBDFE 2.ABCDEF  BCAEFD 3.ABCDEF  BACEDF 4.ABCDEF  CABFDE 5.ABCDEF  CBAFED 6.ABCDEF  DFEACB FED CBA ABCDEF is minimal among the index symmetries 7.ABCDEF  EFDBCA 8.ABCDEF  EDFBAC 9.ABCDEF  FDECAB 10.ABCDEF  FEDCBA 11.ABCDEF  DEFABC

Simplifying the Inequalities Columns are lex ordered 1. BE  CF 3. AD  BE 1st row  all permutations of 2 nd 6. ABC  DFE 8. ABC  EDF 10. ABC  FED 11. ABC  DEF 9. ABC  FDE 7. ABCD  EFDB FED CBA

Illustration Swap 2 rows Rotate columns left Both satisfy 7. ABC  EFD Right one satisfies 7. ABCD  EFDB (1353  5133) Left one violates 7. ABCD  EFDB (1355  1353) FED CBA

Symmetry-Breaking Predicates for Search Problems [J. Crawford, M. Ginsberg, E. Luks, A. Roy, KR ~97].

Conclusion Many problems have models using a multi- dimensional matrix of decision variables in which there is index symmetry. Constraint toolkits should provide facilities to support this. We have laid some foundations towards developing such facilities. Open problems remain.