Constraint Networks. Constraint networks. Definition. Normalized. Constraint Networks. Deduction. Constraint. Networks and Graphs. Solving.
|
|
- Peter Barker
- 6 years ago
- Views:
Transcription
1 1 Satisfaction Problems Albert-Ludwigs-Universität Freiburg networks networks and Stefan Wölfl, Christian Becker-Asano, and Bernhard Nebel October 27, 2014 October 27, 2014 Wölfl, Nebel and Becker-Asano Satisfaction Problems 3 / 27 networks networks A constraint network is a triple If we assume some ordering of the variables in V, we can write networks more compactly: where: N = V,dom,C V is a non-empty and finite set of variables; dom is a function that assigns to each variable v V a non-empty set dom(v) (dom(v) is called the domain of v, elements of dom(v) are called values); C is a set of relations over variables of V (called constraints), i.e., each constraint is a relation R x1,...,x m over some scheme S = (x 1,...,x m ) of variables in V. networks and A constraint network is a triple N = V,D,C where: V = {,...,v n } is a non-empty and finite orde set of variables (assume order (,...,v n )); D = (D 1,...,D n ) is a sequence of domains for V (with D i the domain of variable v i and D N = D 1 D n is the domain of N); C is a set of constraints (x,r) where x = (v i1,...,v im ) is a scheme of variables in V and R D i1 D im. networks and The set of constraint schemes {S 1,...S t } is called network scheme. Notice: any ordering of the variables suffices. network that differ only in the variable ordering are conside equal. October 27, 2014 Wölfl, Nebel and Becker-Asano Satisfaction Problems 4 / 27 October 27, 2014 Wölfl, Nebel and Becker-Asano Satisfaction Problems 5 / 27
2 networks Example: 4-queens problem Note that we consider finitely many variables only, but (e.g., for theoretical studies) this could be relaxed. In the 2nd definition we assumed that the relations of the constraint are embedded in the domain of the network: R D i1 D im. Such networks are called embedded networks (see Bessiere, 2006). The definition does not require that constraint relations are given explicitly (in extension, i.e. by a set of its tuples; table constraint). A constraint relation R could be specified by any Boolean function f R : a tuple satisfies the constraint R iff f R applied on the tuple gives 1. If not stated otherwise, we will always assume that the domains of the variables are given in extension. networks and The 4-queens problem can be represented as a constraint network. For example, consider variables,...,v 4 (each associated to a column of the 4 4-chess board). Each variable v i has as its domain D i = {1,...,4} (conceived of as the row positions of a queen in column i) v 2 v 4 Define then binary constraints (thus encoding non-attacking queen positions ): R v1,v 2 := {(1,3),(1,4),(2,4),(3,1), (4,1),(4,2)} R v1, := {(1,2),(1,4),(2,1),(2,3), (3,2),(3,4),(4,1),(4,3)}... networks and October 27, 2014 Wölfl, Nebel and Becker-Asano Satisfaction Problems 6 / 27 October 27, 2014 Wölfl, Nebel and Becker-Asano Satisfaction Problems 7 / 27 Example: colorability of a constraint network k-colorability of a graph G can be represented as a constraint network of the following form: v 2 V = {v i : v i is a vertex in G} D i = {1,...,k} (v i V) C = {((v i,v j ),) : {v i,v j } is an edge of G} Binary constraint networks can be represented by a directed labeled graph (or even: by an undirected graph if all constraints are symmetric). October 27, 2014 Wölfl, Nebel and Becker-Asano Satisfaction Problems 8 / 27 networks and A solution of a constraint network N = V,D,C is a (variable) assignment a: V such that: (a) a(v i ) D i, for each v i V, i : v i V (b) (a(x 1 ),...,a(x m )) R for each constraint R x1,...,x m in C. N is called satisfiable if N has a solution. sol(n) denotes the set of all solutions of N. sol(n) can also be written as: sol(n) = {(d 1,...,d n ) D 1 D n : the assignment D i d 1,...,v n d n defines a solution} Notice: October 27, 2014 sol(n) Wölfl, is anebel relation and Becker-Asano... Satisfaction Problems 9 / 27 networks and
3 Instantiation, partial solution Instantiation, solution Let N = V,D,C be a constraint network. (a) An instantiation of a subset V V is an assignment a : V i : v i V D i with a(v i ) D i. (b) An instantiation a of V is called partial solution if a satisfies each constraint R S in C with S V. In this case a is called locally consistent. (c) Shortcut notation: for an instantiation a of V = {x 1,...,x m } and constraint R S with scope S V, set networks and Note: (a) An instantiation of V V, a, is a partial solution (locally consistent) iff a[s] R, for each constraint R with scope S V. (b) Not every partial solution is part of a (full) solution, i.e., there may be partial solutions of a constraint network that cannot be extended to a solution. For the 4-queens problem, for example: 4 q 3 q networks and a[s] := (a(x 1 ),...,a(x m )). 2 Hence, a solution is an instantiation of all variables in V that is locally consistent. 1 q October 27, 2014 Wölfl, Nebel and Becker-Asano Satisfaction Problems 10 / 27 v 2 v 4 October 27, 2014 Wölfl, Nebel and Becker-Asano Satisfaction Problems 11 / 27 Nogoods constraint network Let N = V,D,C be a constraint network. Let N = V,D,C be a constraint network. Due to our definition it is possible that C contains constraints networks R vi1,...,v ik and S vj1,...,v jk networks An instantiation a of subset V V is called a nogood (of N) if a cannot be extended to a (full) solution of N, i.e., there exists no solution a: V i D i such that a V = a. Instantiations that are no nogoods are sometimes called consistent or globally consistent (to emphasize the difference to locally consistent assignments). Later, we will also introduce the notion of globally consistent networks. and where (j 1,...,j k ) is just a permutation of (i 1,...,i k ). Without changing the set of solutions, we can simplify the network by deleting S vj1,...,v jk from C and rewriting R vi1,...,v ik as follows: R vi1,...,v ik R vi1,...,v ik π vi1,...,v ik (S vj1,...,v jk ). Given a fixed order on the set of variables V, we can systematically delete-and-refine constraints. This results in a constraint network that contains at most one constraint for each subset of variables. Such a network is called a normalized constraint network. and October 27, 2014 Wölfl, Nebel and Becker-Asano Satisfaction Problems 12 / 27 October 27, 2014 Wölfl, Nebel and Becker-Asano Satisfaction Problems 13 / 27
4 Equivalence Tightness Let N and N be constraint networks on the same set of variables and on the same domains for each variable. N and N are called equivalent if they have the same set of solutions. Example: networks and Let N and N be (normalized) constraint networks on the same set of variables and on the same domains for each variable. N is as tight as N if for each constraint R S of N, (a) N has no constraint with the same scope as R S, or (b) R π S (R S ), where R S is the constraint of N with the same scope as R S. networks and < v 2 v 2 October 27, 2014 Wölfl, Nebel and Becker-Asano Satisfaction Problems 14 / 27 = v 2 v 2 October 27, 2014 Wölfl, Nebel and Becker-Asano Satisfaction Problems 15 / 27 Intersection of networks The intersection of N and N, N N, is the network defined by intersecting for each scope the constraints R S C and R S C with the same scope, i.e., modulo a suitable permutation of the constraint schemes, R S := R S R S. If for a scope S only one of the networks contains a constraint, then we set: R S := R S (or := R S, resp.) networks and Clearly, if N is as tight as N, then sol(n ) sol(n). tightness has a large influence on the efficiency of constraint satisfaction. Warning: Different concepts of tightness can be found in the literature Here: Tightness does not account for comparing constraints with different arities 2 and Primal Dual and Primal Dual Lemma If N and N are equivalent networks, then N N is equivalent to both networks and as tight as both networks. October 27, 2014 Wölfl, Nebel and Becker-Asano Satisfaction Problems 16 / 27 October 27, 2014 Wölfl, Nebel and Becker-Asano Satisfaction Problems 18 / 27
5 Primal constraint graphs Primal constraint graph: Example Let N = V,D,C be a (normalized) constraint network. The primal constraint graph of a network N = V,D,C is the undirected graph G N := V,E N where and Primal Dual Consider a constraint network with variables,...,v 5 and two ternary constraints R v1,v 2, and S v3,v 4,v 5. Then the primal constraint graph of the network has the form: v 2 and Primal Dual {u,v} E N {u,v} is a subset of the scope of some constraint in N. v 4 v 5 Absence of an edge between two variables/nodes means that there is no explicit constraint in which both variables participate. October 27, 2014 Wölfl, Nebel and Becker-Asano Satisfaction Problems 19 / 27 October 27, 2014 Wölfl, Nebel and Becker-Asano Satisfaction Problems 20 / 27 Dual constraint graphs hypergraph The dual constraint graph of a constraint network N = V,D,C is the labeled graph with D N := V,E N,l X V X is the scope of some constraint in N {X,Y} E N X Y /0 l : E N 2 V, {X,Y} X Y In the example above, the dual constraint graph is: and Primal Dual The constraint hypergraph of a constraint network N = V,D,C is the hypergraph H N := V,E N with X E N X is the scope of some constraint in N. In the example above (constraint network with variables,...,v 5 and two ternary constraints R v1,v 2, and S v3,v 4,v 5 ) the hypeges of the constraint hypergraph are: and Primal Dual,v 2,,v 4,v 5 E N = {{,v 2, },{,v 4,v 5 }}. October 27, 2014 Wölfl, Nebel and Becker-Asano Satisfaction Problems 21 / 27 October 27, 2014 Wölfl, Nebel and Becker-Asano Satisfaction Problems 22 / 27
6 3 Simple solution strategy: Backtracking search and Backtracking: search systematically for locally consistent partial instantiations in a depth-first manner: forward phase: extend the current partial solution by assigning a consistent value to some new variable (if possible) backward phase: if no consistent instantiation for the current variable exists, return to the previous variable. and October 27, 2014 Wölfl, Nebel and Becker-Asano Satisfaction Problems 24 / 27 October 27, 2014 Wölfl, Nebel and Becker-Asano Satisfaction Problems 25 / 27 Backtracking algorithm Literature Backtracking(N, a): Input: a constraint network N = V, D, C and a partial assignment a of N (e.g., the empty instantiation a = {}) Output: a solution of N or inconsistent if a is not locally consistent with N: return inconsistent if a is defined for all variables in V: return a select some variable v i for which a is not defined for each value x from D i : a := a {v i x} a Backtracking(N,a ) if a is not inconsistent : return a return inconsistent and Rina Dechter. Processing, Chapter 2, Morgan Kaufmann, 2003 and October 27, 2014 Wölfl, Nebel and Becker-Asano Satisfaction Problems 26 / 27 October 27, 2014 Wölfl, Nebel and Becker-Asano Satisfaction Problems 27 / 27
Constraint Satisfaction Problems. Constraint Satisfaction Problems. Constraint networks. 1 Constraint Networks. 1 Constraint Networks
Constraint Satisfaction Problems May 7, 2012 Constraint Satisfaction Problems Bernhard Nebel, Julien Hué, and Stefan Wölfl Albert-Ludwigs-Universität Freiburg May 7, 2012 1 2 3 and Graphs 4 Solving Nebel,
More informationConstraint Satisfaction Problems
Constraint Satisfaction Problems Search and Lookahead Bernhard Nebel, Julien Hué, and Stefan Wölfl Albert-Ludwigs-Universität Freiburg June 4/6, 2012 Nebel, Hué and Wölfl (Universität Freiburg) Constraint
More informationConstraint Satisfaction Problems
Constraint Satisfaction Problems Constraint Optimization Bernhard Nebel, Julien Hué, and Stefan Wölfl Albert-Ludwigs-Universität Freiburg July 17, 2012 Nebel, Hué and Wölfl (Universität Freiburg) Constraint
More informationConstraint Satisfaction Problems
Constraint Satisfaction Problems Look-Back Malte Helmert and Stefan Wölfl Albert-Ludwigs-Universität Freiburg June 5, 2007 S. Wölfl, M. Helmert (Universität Freiburg) Constraint Satisfaction Problems June
More informationConstraint Satisfaction Problems
Constraint Satisfaction Problems Bernhard Nebel, Julien Hué, and Stefan Wölfl Albert-Ludwigs-Universität Freiburg April 23, 2012 Nebel, Hué and Wölfl (Universität Freiburg) Constraint Satisfaction Problems
More informationClass2: Constraint Networks Rina Dechter
Algorithms for Reasoning with graphical models Class2: Constraint Networks Rina Dechter dechter1: chapters 2-3, Dechter2: Constraint book: chapters 2 and 4 Text Books Road Map Graphical models Constraint
More informationIntroduction. Bernhard Nebel, Julien Hué, and Stefan Wölfl. April 23, 2012
Bernhard Nebel, Julien Hué, and Stefan Wölfl Albert-Ludwigs-Universität Freiburg April 23, 2012 s s What is a constraint? 1 a: the act of constraining b: the state of being checked, restricted, or compelled
More informationConstraint Satisfaction Problems (CSPs)
Constraint Satisfaction Problems (CSPs) CPSC 322 CSP 1 Poole & Mackworth textbook: Sections 4.0-4.2 Lecturer: Alan Mackworth September 28, 2012 Problem Type Static Sequential Constraint Satisfaction Logic
More informationConstraint Satisfaction Problems
Albert-Ludwigs-Universität Freiburg Stefan Wölfl, Christian Becker-Asano, and Bernhard Nebel October 20, 2014 1 October 20, 2014 Wölfl, Nebel and Becker-Asano 3 / 34 s What is a constraint? 1 a: the act
More informationFoundations of Artificial Intelligence
Foundations of Artificial Intelligence 5. Constraint Satisfaction Problems CSPs as Search Problems, Solving CSPs, Problem Structure Wolfram Burgard, Bernhard Nebel, and Martin Riedmiller Albert-Ludwigs-Universität
More informationUnifying and extending hybrid tractable classes of CSPs
Journal of Experimental & Theoretical Artificial Intelligence Vol. 00, No. 00, Month-Month 200x, 1 16 Unifying and extending hybrid tractable classes of CSPs Wady Naanaa Faculty of sciences, University
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 informationArtificial Intelligence
Torralba and Wahlster Artificial Intelligence Chapter 8: Constraint Satisfaction Problems, Part I 1/48 Artificial Intelligence 8. CSP, Part I: Basics, and Naïve Search What to Do When Your Problem is to
More informationCONSTRAINT Networks Chapters 1-2
CONSTRAINT Networks Chapters 1-2 Compsci-275 Fall 2010 Fall 2010 1 Class Information Instructor: Rina Dechter Days: Time: Tuesday & Thursday 11:00-12:20 pm Class page: http://www.ics.uci.edu/~dechter/ics-275a/fall-2010/
More informationSet Intersection and Consistency in Constraint Networks
Journal of Artificial Intelligence Research 27 (2006) 441-464 Submitted 03/06; published 12/06 Set Intersection and Consistency in Constraint Networks Yuanlin Zhang Department of Computer Science, Texas
More informationArtificial Intelligence
Torralba and Wahlster Artificial Intelligence Chapter 8: Constraint Satisfaction Problems, Part I 1/48 Artificial Intelligence 8. CSP, Part I: Basics, and Naïve Search What to Do When Your Problem is to
More informationCSPs: Search and Arc Consistency
CSPs: Search and Arc Consistency CPSC 322 CSPs 2 Textbook 4.3 4.5 CSPs: Search and Arc Consistency CPSC 322 CSPs 2, Slide 1 Lecture Overview 1 Recap 2 Search 3 Consistency 4 Arc Consistency CSPs: Search
More informationClass2: Constraint Networks Rina Dechter
Algorithms for Reasoning with graphical models Class2: Constraint Networks Rina Dechter Dbook: chapter 2-3, Constraint book: chapters 2 and 4 Text Books Road Map Graphical models Constraint networks Model
More informationThese notes present some properties of chordal graphs, a set of undirected graphs that are important for undirected graphical models.
Undirected Graphical Models: Chordal Graphs, Decomposable Graphs, Junction Trees, and Factorizations Peter Bartlett. October 2003. These notes present some properties of chordal graphs, a set of undirected
More informationLecture 7. s.t. e = (u,v) E x u + x v 1 (2) v V x v 0 (3)
COMPSCI 632: Approximation Algorithms September 18, 2017 Lecturer: Debmalya Panigrahi Lecture 7 Scribe: Xiang Wang 1 Overview In this lecture, we will use Primal-Dual method to design approximation algorithms
More informationConstraint (Logic) Programming
Constraint (Logic) Programming Roman Barták Faculty of Mathematics and Physics, Charles University in Prague, Czech Republic bartak@ktiml.mff.cuni.cz Sudoku Combinatorial puzzle, whose goal is to enter
More informationEfficient Algorithms for Functional Constraints
Efficient Algorithms for Functional Constraints Yuanlin Zhang 1, Roland HC Yap 2, Chendong Li 1, and Satyanarayana Marisetti 1 1 Texas Tech University, USA 2 National University of Singapore, Singapore
More informationPermutation Matrices. Permutation Matrices. Permutation Matrices. Permutation Matrices. Isomorphisms of Graphs. 19 Nov 2015
9 Nov 25 A permutation matrix is an n by n matrix with a single in each row and column, elsewhere. If P is a permutation (bijection) on {,2,..,n} let A P be the permutation matrix with A ip(i) =, A ij
More informationArtificial Intelligence
Contents Artificial Intelligence 5. Constraint Satisfaction Problems CSPs as Search Problems, Solving CSPs, Problem Structure Wolfram Burgard, Andreas Karwath, Bernhard Nebel, and Martin Riedmiller What
More informationArtificial Intelligence
Artificial Intelligence 5. Constraint Satisfaction Problems CSPs as Search Problems, Solving CSPs, Problem Structure Wolfram Burgard, Andreas Karwath, Bernhard Nebel, and Martin Riedmiller SA-1 Contents
More informationConstraint Satisfaction Problems. Chapter 6
Constraint Satisfaction Problems Chapter 6 Constraint Satisfaction Problems A constraint satisfaction problem consists of three components, X, D, and C: X is a set of variables, {X 1,..., X n }. D is a
More informationMaximal Tractable Fragments of the Region Connection Calculus: A Complete Analysis
Maximal Tractable Fragments of the Region Connection Calculus: A Complete Analysis Jochen Renz Institut fiir Informatik, Albert-Ludwigs-Universitat Am Flughafen 17, 79110 Freiburg, Germany Abstract We
More informationConstraint Satisfaction. AI Slides (5e) c Lin
Constraint Satisfaction 4 AI Slides (5e) c Lin Zuoquan@PKU 2003-2018 4 1 4 Constraint Satisfaction 4.1 Constraint satisfaction problems 4.2 Backtracking search 4.3 Constraint propagation 4.4 Local search
More information1 Inference for Boolean theories
Scribe notes on the class discussion on consistency methods for boolean theories, row convex constraints and linear inequalities (Section 8.3 to 8.6) Speaker: Eric Moss Scribe: Anagh Lal Corrector: Chen
More informationA CSP Search Algorithm with Reduced Branching Factor
A CSP Search Algorithm with Reduced Branching Factor Igor Razgon and Amnon Meisels Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, 84-105, Israel {irazgon,am}@cs.bgu.ac.il
More informationA Comparison of Structural CSP Decomposition Methods
A Comparison of Structural CSP Decomposition Methods Georg Gottlob Institut für Informationssysteme, Technische Universität Wien, A-1040 Vienna, Austria. E-mail: gottlob@dbai.tuwien.ac.at Nicola Leone
More informationCSC Discrete Math I, Spring Sets
CSC 125 - Discrete Math I, Spring 2017 Sets Sets A set is well-defined, unordered collection of objects The objects in a set are called the elements, or members, of the set A set is said to contain its
More informationCS473-Algorithms I. Lecture 13-A. Graphs. Cevdet Aykanat - Bilkent University Computer Engineering Department
CS473-Algorithms I Lecture 3-A Graphs Graphs A directed graph (or digraph) G is a pair (V, E), where V is a finite set, and E is a binary relation on V The set V: Vertex set of G The set E: Edge set of
More informationGeneral Methods and Search Algorithms
DM811 HEURISTICS AND LOCAL SEARCH ALGORITHMS FOR COMBINATORIAL OPTIMZATION Lecture 3 General Methods and Search Algorithms Marco Chiarandini 2 Methods and Algorithms A Method is a general framework for
More informationDirected Model Checking for PROMELA with Relaxation-Based Distance Functions
Directed Model Checking for PROMELA with Relaxation-Based Distance Functions Ahmad Siyar Andisha and Martin Wehrle 2 and Bernd Westphal Albert-Ludwigs-Universität Freiburg, Germany {andishaa,westphal}@informatik.uni-freiburg.de
More informationIntegrating Constraint Models for Sequential and Partial-Order Planning
Integrating Constraint Models for Sequential and Partial-Order Planning Roman Barták*, Daniel Toropila* {roman.bartak, daniel.toropila}@mff.cuni.cz *Charles University, Faculty of Mathematics and Physics
More informationBinary vs. non-binary constraints
Artificial Intelligence 140 (2002) 1 37 www.elsevier.com/locate/artint Binary vs. non-binary constraints Fahiem Bacchus a, Xinguang Chen b, Peter van Beek c,, Toby Walsh d a Department of Computer Science,
More informationSpace of Search Strategies. CSE 573: Artificial Intelligence. Constraint Satisfaction. Recap: Search Problem. Example: Map-Coloring 11/30/2012
/0/0 CSE 57: Artificial Intelligence Constraint Satisfaction Daniel Weld Slides adapted from Dan Klein, Stuart Russell, Andrew Moore & Luke Zettlemoyer Space of Search Strategies Blind Search DFS, BFS,
More informationSets MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Sets Fall / 31
Sets MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Sets Fall 2014 1 / 31 Outline 1 Sets Introduction Cartesian Products Subsets Power Sets Union, Intersection, Difference
More informationBranch & Bound (B&B) and Constraint Satisfaction Problems (CSPs)
Branch & Bound (B&B) and Constraint Satisfaction Problems (CSPs) Alan Mackworth UBC CS 322 CSP 1 January 25, 2013 P&M textbook 3.7.4 & 4.0-4.2 Lecture Overview Recap Branch & Bound Wrap up of search module
More informationPrinciples of AI Planning. Principles of AI Planning. 8.1 Parallel plans. 8.2 Relaxed planning graphs. 8.3 Relaxation heuristics. 8.
Principles of AI Planning June th, 8. Planning as search: relaxation heuristics Principles of AI Planning 8. Planning as search: relaxation heuristics alte Helmert and Bernhard Nebel Albert-Ludwigs-Universität
More informationRelational Database: The Relational Data Model; Operations on Database Relations
Relational Database: The Relational Data Model; Operations on Database Relations Greg Plaxton Theory in Programming Practice, Spring 2005 Department of Computer Science University of Texas at Austin Overview
More informationDiscrete Mathematics Lecture 4. Harper Langston New York University
Discrete Mathematics Lecture 4 Harper Langston New York University Sequences Sequence is a set of (usually infinite number of) ordered elements: a 1, a 2,, a n, Each individual element a k is called a
More information05 - Constraints Programming
05 - Constraints Programming Artificial Intelligence J. BUISINE 1 1 IT Student at ULCO Calais February 22, 2018 J. BUISINE (ULCO Calais) 05 - Constraints Programming February 22, 2018 1 / 48 Summary 1
More informationLocal Search for CSPs
Local Search for CSPs Alan Mackworth UBC CS CSP February, 0 Textbook. Lecture Overview Domain splitting: recap, more details & pseudocode Local Search Time-permitting: Stochastic Local Search (start) Searching
More information2.1 Sets 2.2 Set Operations
CSC2510 Theoretical Foundations of Computer Science 2.1 Sets 2.2 Set Operations Introduction to Set Theory A set is a structure, representing an unordered collection (group, plurality) of zero or more
More informationA Greedy Approach to Establish Singleton Arc Consistency
A Greedy Approach to Establish Singleton Arc Consistency Christophe Lecoutre and Stéphane Cardon CRIL-CNRS FRE 2499, Université d Artois Lens, France {lecoutre, cardon}@cril.univ-artois.fr Abstract In
More informationChapter-6 Backtracking
Chapter-6 Backtracking 6.1 Background Suppose, if you have to make a series of decisions, among various choices, where you don t have enough information to know what to choose. Each decision leads to a
More information9/19/12. Why Study Discrete Math? What is discrete? Sets (Rosen, Chapter 2) can be described by discrete math TOPICS
What is discrete? Sets (Rosen, Chapter 2) TOPICS Discrete math Set Definition Set Operations Tuples Consisting of distinct or unconnected elements, not continuous (calculus) Helps us in Computer Science
More informationConsistency and Set Intersection
Consistency and Set Intersection Yuanlin Zhang and Roland H.C. Yap National University of Singapore 3 Science Drive 2, Singapore {zhangyl,ryap}@comp.nus.edu.sg Abstract We propose a new framework to study
More informationNogood-FC for Solving Partitionable Constraint Satisfaction Problems
Nogood-FC for Solving Partitionable Constraint Satisfaction Problems Montserrat Abril, Miguel A. Salido, Federico Barber Dpt. of Information Systems and Computation, Technical University of Valencia Camino
More informationComputer Science and Mathematics. Part I: Fundamental Mathematical Concepts Winfried Kurth
Computer Science and Mathematics Part I: Fundamental Mathematical Concepts Winfried Kurth http://www.uni-forst.gwdg.de/~wkurth/csm17_home.htm 1. Mathematical Logic Propositions - can be either true or
More informationOn Combinations of Binary Qualitative Constraint Calculi
On Combinations of Binary Qualitative Constraint Calculi Stefan Wölfl and Matthias Westphal Department of Computer Science, University of Freiburg Georges-Köhler-Allee, 79110 Freiburg, Germany {woelfl,
More informationLATIN SQUARES AND THEIR APPLICATION TO THE FEASIBLE SET FOR ASSIGNMENT PROBLEMS
LATIN SQUARES AND THEIR APPLICATION TO THE FEASIBLE SET FOR ASSIGNMENT PROBLEMS TIMOTHY L. VIS Abstract. A significant problem in finite optimization is the assignment problem. In essence, the assignment
More informationBinary vs. Non-Binary Constraints
Binary vs. Non-Binary Constraints Fahiem Bacchus Department of Computer Science University of Toronto Toronto, Canada fbacchus@cs.toronto.edu Xinguang Chen Department of Computing Science University of
More information4 Integer Linear Programming (ILP)
TDA6/DIT37 DISCRETE OPTIMIZATION 17 PERIOD 3 WEEK III 4 Integer Linear Programg (ILP) 14 An integer linear program, ILP for short, has the same form as a linear program (LP). The only difference is that
More informationLecture Notes 2: The Simplex Algorithm
Algorithmic Methods 25/10/2010 Lecture Notes 2: The Simplex Algorithm Professor: Yossi Azar Scribe:Kiril Solovey 1 Introduction In this lecture we will present the Simplex algorithm, finish some unresolved
More informationConsistency Enforcing and Constraint. Propagation: Path consistency and. i-consistency. i-consistency. Path. Consistency.
Summary Basic Concepts x, y, z,r x,y, R y,z, R x,z Arc : every consistent value of x can be extended to y every consistent couple of values for x, y can be extended to z : Example Example ( ) x, y, z,
More informationBinary Encodings of Non-binary Constraint Satisfaction Problems: Algorithms and Experimental Results
Journal of Artificial Intelligence Research 24 (2005) 641-684 Submitted 04/05; published 11/05 Binary Encodings of Non-binary Constraint Satisfaction Problems: Algorithms and Experimental Results Nikolaos
More informationConstraint Satisfaction
Constraint Satisfaction Philipp Koehn 1 October 2015 Outline 1 Constraint satisfaction problems (CSP) examples Backtracking search for CSPs Problem structure and problem decomposition Local search for
More informationPrinciples of Knowledge Representation and Reasoning
Principles of Knowledge Representation and Semantic Networks and Description Logics II: Description Logics Terminology and Notation Albert-Ludwigs-Universität Freiburg Bernhard Nebel, Stefan Wölfl, and
More informationThe Tractability of Global Constraints
The Tractability of Global Constraints Christian Bessiere ½, Emmanuel Hebrard ¾, Brahim Hnich ¾, and Toby Walsh ¾ ¾ ½ LIRMM-CNRS, Montpelier, France. bessiere@lirmm.fr Cork Constraint Computation Center,
More informationToday. Types of graphs. Complete Graphs. Trees. Hypercubes.
Today. Types of graphs. Complete Graphs. Trees. Hypercubes. Complete Graph. K n complete graph on n vertices. All edges are present. Everyone is my neighbor. Each vertex is adjacent to every other vertex.
More informationProcessing Probabilistic and Deterministic Graphical Models. Rina Dechter DRAFT
Processing Probabilistic and Deterministic Graphical Models Rina Dechter DRAFT May 1, 2013 c Rina Dechter 2 Contents 1 Introduction 7 1.1 Probabilistic vs Deterministic Models..................... 7 1.2
More informationModels and Tools for Improving Efficiency in Constraint Logic Programming. Antoni Ligęza
Decision Making in Manufacturing and Services Vol. 5 2011 No. 1 2 pp. 69 78 Models and Tools for Improving Efficiency in Constraint Logic Programming Antoni Ligęza Abstract. Constraint Satisfaction Problems
More information2-C3OP: An Improved Version of 2-Consistency
-COP: An Improved Version of -Consistency Marlene Arangú, Miguel A. Salido, Federico Barber Instituto de Automática e Informática Industrial Universidad Politécnica de Valencia. Valencia, Spain Abstract
More informationDiscrete Mathematics
Discrete Mathematics Lecture 2: Basic Structures: Set Theory MING GAO DaSE@ ECNU (for course related communications) mgao@dase.ecnu.edu.cn Sep. 18, 2017 Outline 1 Set Concepts 2 Set Operations 3 Application
More informationCHAPTER 3 FUZZY RELATION and COMPOSITION
CHAPTER 3 FUZZY RELATION and COMPOSITION Crisp relation! Definition (Product set) Let A and B be two non-empty sets, the prod uct set or Cartesian product A B is defined as follows, A B = {(a, b) a A,
More informationA Parameterized Local Consistency for Redundant Modeling in Weighted CSPs
A Parameterized Local Consistency for Redundant Modeling in Weighted CSPs Y.C. Law, J.H.M. Lee, and M.H.C. Woo Department of Computer Science and Engineering The Chinese University of Hong Kong, Shatin,
More informationA Uniform View of Backtracking
A Uniform View of Backtracking Fahiem Bacchus 1 Department. of Computer Science, 6 Kings College Road, University Of Toronto, Toronto, Ontario, Canada, M5S 1A4, fbacchus@cs.toronto.edu? Abstract. Backtracking
More informationConstraint Satisfaction Problems
Constraint Satisfaction Problems Frank C. Langbein F.C.Langbein@cs.cf.ac.uk Department of Computer Science Cardiff University 13th February 2001 Constraint Satisfaction Problems (CSPs) A CSP is a high
More informationBinary Relations McGraw-Hill Education
Binary Relations A binary relation R from a set A to a set B is a subset of A X B Example: Let A = {0,1,2} and B = {a,b} {(0, a), (0, b), (1,a), (2, b)} is a relation from A to B. We can also represent
More informationCONSTRAINT SATISFACTION PROBLEM: A CASE STUDY
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 4, Issue. 5, May 2015, pg.33
More information1 Variations of the Traveling Salesman Problem
Stanford University CS26: Optimization Handout 3 Luca Trevisan January, 20 Lecture 3 In which we prove the equivalence of three versions of the Traveling Salesman Problem, we provide a 2-approximate algorithm,
More informationMethods for Interactive Constraint Satisfaction
JEPPE NEJSUM MADSEN nejsum@diku.dk Methods for Interactive Constraint Satisfaction MASTER S THESIS February 14, 2003 DEPARTMENT OF COMPUTER SCIENCE University of Copenhagen Abstract A constraint satisfaction
More informationCMU-Q Lecture 7: Searching in solution space Constraint Satisfaction Problems (CSPs) Teacher: Gianni A. Di Caro
CMU-Q 15-381 Lecture 7: Searching in solution space Constraint Satisfaction Problems (CSPs) Teacher: Gianni A. Di Caro AI PLANNING APPROACHES SO FAR Goal: Find the (best) sequence of actions that take
More informationIV/IV B.Tech (Regular) DEGREE EXAMINATION. Design and Analysis of Algorithms (CS/IT 414) Scheme of Evaluation
IV/IV B.Tech (Regular) DEGREE EXAMINATION Design and Analysis of Algorithms (CS/IT 414) Scheme of Evaluation Maximum: 60 Marks 1. Write briefly about the following 1*12= 12 Marks a) Give the characteristics
More informationCS675: Convex and Combinatorial Optimization Spring 2018 Consequences of the Ellipsoid Algorithm. Instructor: Shaddin Dughmi
CS675: Convex and Combinatorial Optimization Spring 2018 Consequences of the Ellipsoid Algorithm Instructor: Shaddin Dughmi Outline 1 Recapping the Ellipsoid Method 2 Complexity of Convex Optimization
More informationGQR A Fast Reasoner for Binary Qualitative Constraint Calculi
GQR A Fast Reasoner for Binary Qualitative Constraint Calculi Zeno Gantner Information Systems and Machine Learning Lab, University of Hildesheim, Samelsonplatz 1, 31141 Hildesheim, Germany gantner@ismll.uni-hildesheim.de
More informationNP-Completeness. Algorithms
NP-Completeness Algorithms The NP-Completeness Theory Objective: Identify a class of problems that are hard to solve. Exponential time is hard. Polynomial time is easy. Why: Do not try to find efficient
More information10/11/2017. Constraint Satisfaction Problems II. Review: CSP Representations. Heuristic 1: Most constrained variable
//7 Review: Constraint Satisfaction Problems Constraint Satisfaction Problems II AIMA: Chapter 6 A CSP consists of: Finite set of X, X,, X n Nonempty domain of possible values for each variable D, D, D
More informationCSE 473: Artificial Intelligence
CSE 473: Artificial Intelligence Constraint Satisfaction Luke Zettlemoyer Multiple slides adapted from Dan Klein, Stuart Russell or Andrew Moore What is Search For? Models of the world: single agent, deterministic
More informationClass 2 Constraint Networks
Class 2 Constraint Networks The constraint network model Inference. 1 Road Map (classes 2 3) The constraint network model Inference Search Hybrids of search and inference 2 Constraint Networks A Example:
More informationCS 771 Artificial Intelligence. Constraint Satisfaction Problem
CS 771 Artificial Intelligence Constraint Satisfaction Problem Constraint Satisfaction Problems So far we have seen a problem can be solved by searching in space of states These states can be evaluated
More informationConstraint Acquisition
Constraint Acquisition Christian Bessiere University of Montpellier, France Frédéric Koriche University of Artois, France Nadjib Lazaar University of Montpellier, France Barry O Sullivan University College
More informationPrinciples of AI Planning. Principles of AI Planning. 7.1 How to obtain a heuristic. 7.2 Relaxed planning tasks. 7.1 How to obtain a heuristic
Principles of AI Planning June 8th, 2010 7. Planning as search: relaxed planning tasks Principles of AI Planning 7. Planning as search: relaxed planning tasks Malte Helmert and Bernhard Nebel 7.1 How to
More informationarxiv:math/ v3 [math.co] 24 Dec 1999
arxiv:math/9911125v3 [math.co] 24 Dec 1999 Dynamic Monopolies of Constant Size Eli Berger February 8, 2008 Abstract The paper deals with a polling game on a graph. Initially, each vertex is colored white
More informationLecture 9 Arc Consistency
Computer Science CPSC 322 Lecture 9 Arc Consistency (4.5, 4.6) Slide 1 Lecture Overview Recap of Lecture 8 Arc Consistency for CSP Domain Splitting 2 Problem Type Static Sequential Constraint Satisfaction
More informationMath 170- Graph Theory Notes
1 Math 170- Graph Theory Notes Michael Levet December 3, 2018 Notation: Let n be a positive integer. Denote [n] to be the set {1, 2,..., n}. So for example, [3] = {1, 2, 3}. To quote Bud Brown, Graph theory
More informationPath Consistency on Triangulated Constraint Graphs*
Path Consistency on Triangulated Constraint Graphs* Christian Bliek ILOG 1681 Route des Dolines 06560 Valbonne, France bliekqilog.fr Djamila Sam-Haroud Artificial Intelligence Laboratory Swiss Federal
More informationDual-fitting analysis of Greedy for Set Cover
Dual-fitting analysis of Greedy for Set Cover We showed earlier that the greedy algorithm for set cover gives a H n approximation We will show that greedy produces a solution of cost at most H n OPT LP
More informationDIT411/TIN175, Artificial Intelligence. Peter Ljunglöf. 30 January, 2018
DIT411/TIN175, Artificial Intelligence Chapter 7: Constraint satisfaction problems CHAPTER 7: CONSTRAINT SATISFACTION PROBLEMS DIT411/TIN175, Artificial Intelligence Peter Ljunglöf 30 January, 2018 1 TABLE
More informationCONSTRAINT SATISFACTION
9// CONSRAI ISFACION oday Reading AIMA Chapter 6 Goals Constraint satisfaction problems (CSPs) ypes of CSPs Inference Search + Inference 9// 8-queens problem How would you go about deciding where to put
More informationModelling for Constraint Programming
Modelling for Constraint Programming Barbara M. Smith Cork Constraint Computation Centre, University College Cork, Ireland September 2005 1 Introduction Constraint programming can be a successful technology
More informationBacktracking and Branch-and-Bound
Backtracking and Branch-and-Bound Usually for problems with high complexity Exhaustive Search is too time consuming Cut down on some search using special methods Idea: Construct partial solutions and extend
More informationLars Schmidt-Thieme, Information Systems and Machine Learning Lab (ISMLL), University of Hildesheim, Germany, Course on Artificial Intelligence,
Course on Artificial Intelligence, winter term 2012/2013 0/35 Artificial Intelligence Artificial Intelligence 3. Constraint Satisfaction Problems Lars Schmidt-Thieme Information Systems and Machine Learning
More informationComputability Theory
CS:4330 Theory of Computation Spring 2018 Computability Theory Other NP-Complete Problems Haniel Barbosa Readings for this lecture Chapter 7 of [Sipser 1996], 3rd edition. Sections 7.4 and 7.5. The 3SAT
More informationCMSC 380. Graph Terminology and Representation
CMSC 380 Graph Terminology and Representation GRAPH BASICS 2 Basic Graph Definitions n A graph G = (V,E) consists of a finite set of vertices, V, and a finite set of edges, E. n Each edge is a pair (v,w)
More informationArtificial Intelligence Constraint Satisfaction Problems
Artificial Intelligence Constraint Satisfaction Problems Recall Search problems: Find the sequence of actions that leads to the goal. Sequence of actions means a path in the search space. Paths come with
More informationAcyclic Network. Tree Based Clustering. Tree Decomposition Methods
Summary s Join Tree Importance of s Solving Topological structure defines key features for a wide class of problems CSP: Inference in acyclic network is extremely efficient (polynomial) Idea: remove cycles
More information