853 instances from the 2008 CP Solver Competition. Real full lookahead cl+proj-wR(*,m)C, which enforces R(*, m)C on each cluster, adds projection of constraints.

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

Constraint Based Reasoning over Mutex Relations in Graphplan Algorithm Pavel Surynek Charles University, Prague Czech Republic.
ICS-271:Notes 5: 1 Lecture 5: Constraint Satisfaction Problems ICS 271 Fall 2008.
IJCAI Russian Doll Search with Tree Decomposition Martí Sànchez, David Allouche, Simon de Givry, and Thomas Schiex INRA Toulouse, FRANCE.
Computing Kemeny and Slater Rankings Vincent Conitzer (Joint work with Andrew Davenport and Jayant Kalagnanam at IBM Research.)
Foundations of Constraint Processing More on Constraint Consistency 1 Foundations of Constraint Processing CSCE421/821, Spring
Practical Tractability of CSPs by Higher Level Consistency and Tree Decomposition Shant Karakashian Dissertation Defense Collaborations: Bessiere, Geschwender,
Dynamic State-Space Partitioning in External-Memory Graph Search Rong Zhou † and Eric A. Hansen ‡ † Palo Alto Research Center ‡ Mississippi State University.
Then Adaptive Parameterized Consistency for Non-Binary CSPs by Counting Supports R.J.Woodward 1,2, A.Schneider 1, B.Y.Choueiry 1, and C.Bessiere 2 1 Constraint.
A First Practical Algorithm for High Levels of Relational Consistency Shant Karakashian, Robert Woodward, Christopher Reeson, Berthe Y. Choueiry & Christian.
A Constraint Satisfaction Problem (CSP) is a combinatorial decision problem defined by a set of variables {A,B,C,…}, a set of domain values for these variables,
Constraint Processing Techniques for Improving Join Computation: A Proof of Concept Anagh Lal & Berthe Y. Choueiry Constraint Systems Laboratory Department.
1 Refining the Basic Constraint Propagation Algorithm Christian Bessière and Jean-Charles Régin Presented by Sricharan Modali.
Foundations of Constraint Processing, Spring 2008 Evaluation to BT SearchApril 16, Foundations of Constraint Processing CSCE421/821, Spring 2008:
Improving Backtrack Search For Solving the TCSP Lin Xu and Berthe Y. Choueiry Constraint Systems Laboratory Department of Computer Science and Engineering.
A Constraint Satisfaction Problem (CSP) is a combinatorial decision problem defined by a set of variables, a set of domain values for these variables,
 i may require adding new constraints, except for… o i =1  domain filtering o i =   constraint filtering Robert Woodward & Berthe Y. Choueiry Constraint.
Foundations of Constraint Processing Evaluation to BT Search 1 Foundations of Constraint Processing CSCE421/821, Spring
Efficient Techniques for Searching the Temporal CSP Lin Xu and Berthe Y. Choueiry Constraint Systems Laboratory Department of Computer Science and Engineering.
Foundations of Constraint Processing, Fall 2005 Sep 20, 2005BT: A Theoretical Evaluation1 Foundations of Constraint Processing CSCE421/821, Fall 2005:
A New Efficient Algorithm for Solving the Simple Temporal Problem Lin Xu & Berthe Y. Choueiry Constraint Systems Laboratory University of Nebraska-Lincoln.
A Constraint Satisfaction Problem (CSP) is a combinatorial decision problem defined by a set of variables, a set of domain values for these variables,
1.A finer version of PPC. 2.Cheaper than PPC and F-W. 3.Guarantees the minimal network. 4.Automatically decomposes the graph into its bi-connected components:
Constraint Systems Laboratory March 26, 2007Reeson–Undergraduate Thesis1 Using Constraint Processing to Model, Solve, and Support Interactive Solving of.
A game of logic where the player must assign the numbers 1..9 to cells on a 9x9 grid. The placement of the numbers must be such that every number must.
Constraint Systems Laboratory April 21, 2005Lal: M.S. thesis defense1 Neighborhood Interchangeability (NI) for Non-Binary CSPs & Application to Databases.
Ryan Kinworthy 2/26/20031 Chapter 7- Local Search part 2 Ryan Kinworthy CSCE Advanced Constraint Processing.
Tractable Symmetry Breaking Using Restricted Search Trees Colva M. Roney-Dougal, Ian P. Gent, Tom Kelsey, Steve Linton Presented by: Shant Karakashian.
Constraint Satisfaction Problem:  Used to model constrained combinatorial problems  Important real-world applications: hardware & software verification,
Exploiting Automatically Inferred Constraint-Models for Building Identification in Satellite Imagery Research funded by the AFSOR, grant numbers FA
Because the localized R(*,m)C does not consider combinations of relations across clusters, propagation between clusters is hindered. Synthesizing a global.
Constraint Systems Laboratory 10/24/2015Bayer–MS Thesis Defense1 Reformulating Constraint Satisfaction Problems with Application to Geospatial Reasoning.
Towards real-time camera based logos detection Mathieu Delalandre Laboratory of Computer Science, RFAI group, Tours city, France Osaka Prefecture Partnership.
CP Summer School Modelling for Constraint Programming Barbara Smith 2. Implied Constraints, Optimization, Dominance Rules.
Collection Depots Facility Location Problems in Trees R. Benkoczi, B. Bhattacharya, A. Tamir 陳冠伶‧王湘叡‧李佳霖‧張經略 Jun 12, 2007.
Constraint Systems Laboratory Presented by: Robert J. Woodward, Amanda Swearngin 1 Berthe Y. Choueiry 2 Eugene C. Freuder 3 1 ESQuaReD Laboratory, University.
Constraint Systems Laboratory R.J. Woodward 1, S. Karakashian 1, B.Y. Choueiry 1 & C. Bessiere 2 1 Constraint Systems Laboratory, University of Nebraska-Lincoln.
Stochastic greedy local search Chapter 7 ICS-275 Spring 2009.
Foundations of Constraint Processing, Fall 2004 October 3, 2004Interchangeability in CSPs1 Foundations of Constraint Processing CSCE421/821, Fall 2004:
Constraint Systems Laboratory Robert J. Woodward Joint work with Shant Karakashian, Daniel Geschwender, Christopher Reeson, and Berthe Y. UNL.
Constraint Systems Laboratory Robert J. Woodward Constraint Systems Laboratory Department of Computer Science & Engineering University of Nebraska-Lincoln.
Optimizing the Location Obfuscation in Location-Based Mobile Systems Iris Safaka Professor: Jean-Pierre Hubaux Tutor: Berker Agir Semester Project Security.
IBM Labs in Haifa © 2005 IBM Corporation Assumption-based Pruning in Conditional CSP Felix Geller and Michael Veksler.
Clustering Data Streams A presentation by George Toderici.
Hybrid BDD and All-SAT Method for Model Checking
Consistency Methods for Temporal Reasoning
A First Practical Algorithm for High Levels of Relational Consistency
An Empirical Study of the Performance
Empirical Comparison of Preprocessing and Lookahead Techniques for Binary Constraint Satisfaction Problems Zheying Jane Yang & Berthe Y. Choueiry Constraint.
Intelligent Backtracking Algorithms: A Theoretical Evaluation
Evaluation of (Deterministic) BT Search Algorithms
Constraints and Search
Evaluation of (Deterministic) BT Search Algorithms
Intelligent Backtracking Algorithms: A Theoretical Evaluation
Intelligent Backtracking Algorithms: A Theoretical Evaluation
Constraint Satisfaction Problems & Its Application in Databases
Intelligent Backtracking Algorithms: A Theoretical Evaluation
Intelligent Backtracking Algorithms: A Theoretical Evaluation
Evaluation of (Deterministic) BT Search Algorithms
Intelligent Backtracking Algorithms: A Theoretical Evaluation
Solving Sudoku with Consistency: A Visual and Interactive Approach
Revisiting Neighborhood Inverse Consistency on Binary CSPs
A Qualitative Analysis of Search Behavior: A Visual Approach
Improving the Performance of Consistency Algorithms by Localizing and Bolstering Propagation in a Tree Decomposition Shant Karakashian, Robert J. Woodward.
A Reactive Strategy for High-Level Consistency During Search
PrePeak+ = PrePeak + ‘How Much’
Revisiting Neighborhood Inverse Consistency on Binary CSPs
Solving Inequalities Using Addition and Subtraction
Reformulating the Dual Graphs of CSPs
Presentation transcript:

853 instances from the 2008 CP Solver Competition. Real full lookahead cl+proj-wR(*,m)C, which enforces R(*, m)C on each cluster, adds projection of constraints to cluster separators to bolster propagation, and uses the minimal dual graph to reduce the number of combinations. m = 2,3,4, |(cl)| (i.e., minimal clusters) 2 hours and 8 GB per instance, 853 total instances. Improving Relational Consistency Algorithms Using Dynamic Relation Partitioning A.Schneider 1, R.J.Woodward 1,2, B.Y.Choueiry 1, and C.Bessiere 2 1 Constraint Systems Laboratory University of Nebraska-Lincoln USA 2 LIRMM-CNRS University of Montpellier France Contributions From P ER T UPLE To P ER FB Experiments were conducted on the equipment of the Holland Computing Center at the University of Nebraska-Lincoln. This research was supported by NSF Grant No. RI and EU project ICON (FP ). Woodward was supported by an NSF GRF Grant No and a Chateaubriand Fellowship. Empirical Evaluation Paper: CP September 4 t h, 2014 Relational Consistency R( ∗,m)C, m-wise consistency, ensures that every combination of m relations is minimal. Partitions: Coarse, Fine, Intermediate Future Research Extend our approach to A LL S OL, our other algorithm for enforcing minimality of m relations [Karakashian PhD 13] 1.Designed P ER FB, an algorithm for enforcing R(*,m)C, exploiting the fact that constraints in dual CSP are piecewise functional. 2.Compared performance of P ER FB and P ER T UPLE (previous algorithm) to empirically establish improvements. Piecewise Functional Constraints [Lecoutre+ ] Cumulative Charts Summary Results CPU Time (s) Number of instances completed Experimental Setup CPU Time (s) Number of instances completed For m=2,3,4, |(cl)|, P ER FB dominates P ER T UPLE m=3 performs the best, m=|(cl)| trails closely behind [Karakashian+ AAAI 13] ABE fb fb fb fb fb fb CF fb fb fb R5R5 R2R2 ABCDG fb 1 t1t t2t fb 2 t3t fb 3 t4t fb 4 t5t t5t fb 5 t7t R1R1 Samaras & Stergiou [JAIR 05] noted that the constraints in the dual CSP are piecewise functional 1.Each relation can be partitioned into blocks of equivalent tuples 2.Each block is supported by at most one other block They used above property to design PW-AC algorithm (m=2) t1t1 titi t2t2 t3t3 P ER T UPLE enforces R(*,m)C [Karakshian+ AAAI10] Given all combinations of m relations For each relation in each combination - S EARCH S UPPORT (a backtrack search with FC) ensures each tuple can be extended to the other m-1 relations - If no solution is found, tuple is removed The “subscope equality constraint” {A,B} between R 1 and R 2 determines the partition of R 1. What partition do two subscopes (e.g., {A,B}, {C}) induce on R 1 ? What partition do all the subscopes with R 1 ’s neighbors (i.e., R 2, R 3, R 4, and R 5 ) induce on R 1 ? How do those various partitions relate? How to exploit them in P ER T UPLE ? R2R2 R1R1 A,B,C,D,G A,B,E A,B,FC,FB,E,G A,B R3R3 R4R4 R5R5 We compute and store fine and coarse blocks at preprocessing. o1o1 cb 1 t1t1 t2t2 t3t3 t4t4 cb 2 t5t5 t6t6 cb 3 t7t7 o2o2 cb 4 t1t1 t2t2 t3t3 cb 5 t4t4 cb 6 t5t5 t6t6 t7t7 o3o3 cb 7 t1t1 t2t2 cb 8 t3t3 t4t4 t5t5 t6t6 t7t7 o1∪o2∪o3o1∪o2∪o3 fb 1 t1t1 t2t2 fb 2 t3t3 fb 3 t4t4 fb 4 t5t5 t6t6 fb 5 t7t7 o1∪o3o1∪o3 ib 1 t1t1 t2t2 ib 2 t3t3 t4t4 ib 3 t5t5 t6t6 ib 4 t7t7 C1C1 o1o1 C3C3 C5C5 C2C2 o2o2 o1o1 C4C4 o3o3 R1R1 t1t1 t2t2 t3t3 t4t4 t5t5 t6t6 t7t7 R 1 : coarse blocks R 1 : fine R 1 : intermediate The considered set of subscopes determines the partition of R 1. ABCDG t1t t2t t3t t4t t5t t6t t7t ABE ✗ ✗ R1R1 R2R2 ∀ m-1 relations..… ∀ tuple ∀ relation m = 2m = 3m = 4m = |(cl)| Total: 853 instances P ER T UPLE P ER FB P ER T UPLE P ER FB P ER T UPLE P ER FB P ER T UPLE P ER FB #Completed … only by … by both Avg. CPU (sec) SearchSupport Calls ratio 〈 R 1,fb 1 〉 has support 〈 R 2,fb 6 〉, 〈 R 5,fb 20 〉. 〈 R 1,fb 2 〉 has support 〈 R 2,fb 6 〉, 〈 R 5,fb 22 〉. fb 2, fb 3 have the same signature (intermediate block {fb 2,fb 3 }). S EARCH S UPPORT is not called on fb 3.