AUTOMATED REASONING. Agostino Dovier. Udine, October 2, Università di Udine CLPLAB
|
|
- Margaret Miranda Nicholson
- 6 years ago
- Views:
Transcription
1 AUTOMATED REASONING Agostino Dovier Università di Udine CLPLAB Udine, October 2, 2017 AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
2 COURSE PLACEMENT International Master Degree in CS (mandatory course) This is why the course is in (a personal dialect of) English National Master Degree in Informatica (optional course for all, characterizing the path ARA, Algoritmi e ragionamento automatico ) Suggested to Mathematicians due to its roots in logic modeling 6CFUs Project + Oral exam Prerequisites? Some programming experience, some logical background. You have it! AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
3 COURSE PLACEMENT International Master Degree in CS (mandatory course) This is why the course is in (a personal dialect of) English National Master Degree in Informatica (optional course for all, characterizing the path ARA, Algoritmi e ragionamento automatico ) Suggested to Mathematicians due to its roots in logic modeling 6CFUs Project + Oral exam Prerequisites? Some programming experience, some logical background. You have it! AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
4 ACM-IEEE Reading Computer Science Curricula. Joint Task Force on Computing Curricula, ACM-IEEE, Dec we learn that there are Among them there is the area of: 18 Knowledge Areas (of C.S.) IS - Intelligent Systems AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
5 ACM-IEEE Reading Computer Science Curricula. Joint Task Force on Computing Curricula, ACM-IEEE, Dec we learn that there are Among them there is the area of: 18 Knowledge Areas (of C.S.) IS - Intelligent Systems AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
6 ACM-IEEE Reading Computer Science Curricula. Joint Task Force on Computing Curricula, ACM-IEEE, Dec we learn that there are Among them there is the area of: 18 Knowledge Areas (of C.S.) IS - Intelligent Systems AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
7 ACM-IEEE Reading Computer Science Curricula. Joint Task Force on Computing Curricula, ACM-IEEE, Dec we learn that there are Among them there is the area of: 18 Knowledge Areas (of C.S.) IS - Intelligent Systems AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
8 ACM-IEEE IS - INTELLIGENT SYSTEMS Artificial intelligence (AI) is the study of solutions for problems that are difficult or impractical to solve with traditional methods. [...] The solutions rely on a broad set of general and specialized knowledge representation schemes, problem solving mechanisms, and learning techniques. AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
9 ACM-IEEE IS - INTELLIGENT SYSTEMS. 12 SUBAREAS IS/Fundamental Issues IS/Basic Knowledge Representation and Reasoning IS/Basic Search Strategies IS/Advanced Search IS/Advanced Representation and Reasoning IS/Agents IS/Basic Machine Learning IS/Advanced Machine Learning IS/Reasoning Under Uncertainty IS/Natural Language Processing IS/Robotics IS/Perception and Computer Vision The course of Automated Reasoning will deal with the 6 subareas in the left column. AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
10 ACM-IEEE IS - INTELLIGENT SYSTEMS. 12 SUBAREAS IS/Fundamental Issues IS/Basic Knowledge Representation and Reasoning IS/Basic Search Strategies IS/Advanced Search IS/Advanced Representation and Reasoning IS/Agents IS/Basic Machine Learning IS/Advanced Machine Learning IS/Reasoning Under Uncertainty IS/Natural Language Processing IS/Robotics IS/Perception and Computer Vision The course of Automated Reasoning will deal with the 6 subareas in the left column. AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
11 COURSE PROGRAM ACCORDING TO THE 6 SUBAREAS OF IS IS/Fundamental Issues Overview of AI problems, examples of successful recent AI applications IS/Basic Knowledge Representation and Reasoning Review of propositional and predicate logic Resolution and theorem proving IS/Advanced Representation and Reasoning Knowledge representation issues Non-monotonic reasoning Reasoning about action and change Planning Argumentation AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
12 COURSE PROGRAM ACCORDING TO THE 6 SUBAREAS OF IS IS/Basic Search Strategies Problem spaces (states, goals and operators), problem solving by search Factored representation (factoring state into variables) Uninformed search (breadth-first, depth-first, depth-first with iterative deepening) IS/Agents Heuristics and informed search (hill-climbing, generic best-first, A*) Space and time efficiency of search Constraint satisfaction (backtracking and local search methods) Definitions of agents Multi-agent systems (Collaborative agents) AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
13 COURSE PROGRAM ACCORDING TO THE 6 SUBAREAS OF IS IS/Advanced Search Global constraints Large Neighborhood Search SAT and ASP solving with Learning Parallelism Students should encode and solve problems using Minizinc and Answer Set Programming (and will meet SAT, PDDL, and Picat) AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
14 COURSE PROGRAM Constraint Programming Introduction Constraint Propagation and Search Global constraints Modeling in Minizinc Logic Programming Definite programs Default Negation Answer Set Programming (ASP) Modeling in ASP SAT solving (learning) Advanced Topics AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
15 WHAT S GOING ON See International Conference on Constraint Programming (CP) International Conference on Logic Programming (ICLP) International Conference on Theory and Applications of Satisfiability Testing (SAT) (all together in Melbourne this year Logic Programming and Non Monotonic Reasoning (LPNMR) International Joint Conference on Artificial Intelligence (IJCAI)... AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
16 CONSTRAINT PROGRAMMING INTRODUCTION Constraint Programming is a declarative programming paradigm rooted in AI, suited for modeling and solving (complex) combinatorial problems Problem modeling and solution searching are clearly separated Typically, the code is very readable and easy to modify You don t have restrictions on the kind of constraint Solution search is natural to parallelize Search heuristics are crucial and easy to be added AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
17 Sketchpad: Ivan Sutherland (PhD thesis, 1963) Notion of CSP (Ugo Montanari 1972) Domain filtering (Waltz 1975) Late Seventies/Early Eighties: constraint propagation (Freuder, Mackworth, others) Late Eighties: the first Constraint-Based Language (Constraint Logic Programming, or CLP) Ninenties: Global constraints and other languages New millennium: hybrid techniques, standardization 2010: Minizinc challenge (and many more: parallelism, learning,... ) Statement by Michael Trick Read aop-cambridge-core/content/view/ 60BF5956A25C6E531BD0C5B0438CD6D5/ S a.pdf/preface.pdf AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28 CONSTRAINT PROGRAMMING BRIEF HISTORY
18 INTRODUCTION ACP ACP Schools tw/ school2013/exercises.html Videos: Pascal Van Hentenryck Peter Stuckey Material (see the web page). However, this is a reference text for this part. Handbook final.pdf AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
19 EXAMPLE 4-QUEENS 4-Queens: put 4 queens on a chessboard 4 4 in such a way as they do not attack each other AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
20 EXAMPLE 4-QUEENS 4-Queens: put 4 queens on a chessboard 4 4 in such a way as they do not attack each other AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
21 EXAMPLE 4-QUEENS 4-Queens: put 4 queens on a chessboard 4 4 in such a way as they do not attack each other AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
22 EXAMPLE 4-QUEENS 4-Queens: put 4 queens on a chessboard 4 4 in such a way as they do not attack each other AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
23 EXAMPLE 4-QUEENS 4-Queens: put 4 queens on a chessboard 4 4 in such a way as they do not attack each other AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
24 EXAMPLE 4-QUEENS Variables Domains X 1,..., X 4 X i = j means a queen is in column i, row j D(X i ) = {1,..., 4}i = 1..4 Constraints (i, j = 1..4 e i < j) X i X j (horizontal attack) X j X i j i (diagonal attack) AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
25 EXAMPLE 4-QUEENS X 1 = 1, X 2 = 1, X 3 = 1, X 4 = 1 WRONG X i X j (horizontal) X j X i j i (diagonal) AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
26 EXAMPLE 4-QUEENS X 1 = 2, X 2 = 4, X 3 = 1, X 4 = 3 CORRECT X i X j (horizontal) X j X i j i (diagonal) AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
27 CONSTRAINT SATISFACTION PROBLEM CSP (CONSTRAINT SATISFACTION PROBLEM) Set of Variables V = {V 1,..., V n } Set of domains D = {D 1,..., D n } Set of Constraints (Vincoli) C on the variables V. We look for one (or all) the admissible solutions, namely an assignment σ : V D 1 D n that satisfies all domains and constraints. No restrictions on domains and kind of constraints AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
28 CONSTRAINT OPTIMIZATION PROBLEM COP (CONSTRAINT OPTIMIZATION PROBLEM) Set of Variables V = {V 1,..., V n } Set of domains D = {D 1,..., D n } Set of Constraints (Vincoli) C on the variables V. A function f : V A We look for one (or all) the assignments σ that are admissible solutions of the CSP that minimizes (equivalently, maximizes) the value of f. No restrictions on domains, kind of constraints, and on the function f AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
29 SEARCH SPACE Given a CSP X 1 D 1,..., X n D n ; C (C denotes the set of all the constraints) The search space is the set of the n-tuples consistent with the domains D 1 D n In this set we look for the points that satisfy the C This set is commonly represented as a tree, the search tree. Let us observe that, in general, the D i can be infinite. AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
30 SEARCH SPACE 4-QUEENS AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
31 CSP/COP NAIVE SEARCH: GENERATE AND TEST Non deterministic technique in which the potential solutions are generated sequentially and verified (akin to Guess & Verify of NP). X 1 = 1, X 2 = 1, X 3 = 1, X 4 = 1 not a solution AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
32 CSP/COP NAIVE SEARCH: GENERATE AND TEST Non deterministic technique in which the potential solutions are generated sequentially and verified (akin to Guess & Verify of NP). X 1 = 1, X 2 = 1, X 3 = 1, X 4 = 1 not a solution AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
33 CSP/COP NAIVE SEARCH: GENERATE AND TEST Non deterministic technique in which the potential solutions are generated sequentially and verified (akin to Guess & Verify of NP). X 1 = 1, X 2 = 1, X 3 = 1, X 4 = 2 not a solution AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
34 CSP/COP NAIVE SEARCH: GENERATE AND TEST Non deterministic technique in which the potential solutions are generated sequentially and verified (akin to Guess & Verify of NP). X 1 = 1, X 2 = 1, X 3 = 1, X 4 = 2 not a solution AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
35 CSP/COP NAIVE SEARCH: GENERATE AND TEST Non deterministic technique in which the potential solutions are generated sequentially and verified (akin to Guess & Verify of NP). X 1 = 1, X 2 = 1, X 3 = 1, X 4 = 3 not a solution AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
36 CSP/COP NAIVE SEARCH: GENERATE AND TEST Non deterministic technique in which the potential solutions are generated sequentially and verified (akin to Guess & Verify of NP). X 1 = 1, X 2 = 1, X 3 = 1, X 4 = 3 not a solution AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
37 CSP/COP NAIVE SEARCH: GENERATE AND TEST Non deterministic technique in which the potential solutions are generated sequentially and verified (akin to Guess & Verify of NP). X 1 = 1, X 2 = 1, X 3 = 1, X 4 = 4 not a solution AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
38 CSP/COP NAIVE SEARCH: GENERATE AND TEST Non deterministic technique in which the potential solutions are generated sequentially and verified (akin to Guess & Verify of NP). X 1 = 1, X 2 = 1, X 3 = 1, X 4 = 4 not a solution AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
39 CSP/COP NAIVE SEARCH: GENERATE AND TEST Non deterministic technique in which the potential solutions are generated sequentially and verified (akin to Guess & Verify of NP). X 1 = 1, X 2 = 1, X 3 = 2, X 4 = 1 not a solution AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
40 CSP/COP NAIVE SEARCH: GENERATE AND TEST Non deterministic technique in which the potential solutions are generated sequentially and verified (akin to Guess & Verify of NP). X 1 = 1, X 2 = 1, X 3 = 2, X 4 = 1 not a solution... We are visiting all the tree. The risk is of doing 4 4 = 256 attempts AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
41 CSP/COP NAIVE SEARCH: PARTIAL ASSIGNMENTS, PARTIAL CHECK, BACKTRACKING 19 attempts. Assignments with X 1 = 3 and X 1 = 4 are symmetrical wrt those already visited. Symmetry breaking will be a crucial issue in modeling. AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
42 CSP/COP NAIVE SEARCH: PARTIAL ASSIGNMENTS, PARTIAL CHECK, BACKTRACKING 19 attempts. Assignments with X 1 = 3 and X 1 = 4 are symmetrical wrt those already visited. Symmetry breaking will be a crucial issue in modeling. AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
43 CSP/COP MAIN NON NAIVE TECHNIQUES USED FOR SOLUTION S SEARCH Local Search (Integer) Linear Programming Translation to SAT and use of a SAT solver Constraint Programming Answer Set Programming (born for KR purposes, but very effective) AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
44 CSP OR COP? COP CSP Assume to have a (black box) COP solver Given a CSP P = X 1 D 1,..., X n D n ; C Define f as a constant (e.g. f (X 1,..., X n ) = 0) call the solver of P, f. It is clear that the solution of the COP is also a solution of the CSP. AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
45 CSP OR COP? CSP COP Suppose now to have a solver (think to it as to a black box) capable of solving a CSP P = X 1 D 1,..., X n D n ; C, f (X 1,..., X n ) k Let M a (even rough) upper bound of the expected value of the function. Given P is usually easy to find an upper bound. Assume f ranges on N. Using bisection (with a number of calls limited by log 2 M) we can solve the COP riesco a risolvere il COP Eg, suppose the minimum is 15 (but we don t know it yet) and M = 205. Let s solve P with k = 205, 102, 51, 25, 12. With 12 we have the first no. Thus the minimum is between 13 and 25. Let s try (yes), (yes), (no). The doubt is now between 14 or 15. Calling the solver on P with k = 14 we discover it. If f ranges on R it is the same with some approximation considerations. AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
46 CSP OR COP? COP CSP In principle solving CSP and COP is not too much different. However, finding a solution to a even big CSP can be easy (if we are lucky) finding the minimum in very big COPs imply the visit of the whole (or, at least of a big protion of the) search space Sometimes we are happy with good solutions, not necessarily the minimum. AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
47 NP-HARDNESS OF CSP Let us recall the 3-coloring problem: does a coloring of the nodes of a graph using three colors in such a way that adjacent nodes have different colors exist? D 1 = = D 6 = {red, green, black}, X 1 X 2, X 1 X 3, X 1 X 5,..., X 5 X 6 AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
48 NP-HARDNESS OF CSP Let us recall the 3-coloring problem: does a coloring of the nodes of a graph using three colors in such a way that adjacent nodes have different colors exist? D 1 = = D 6 = {red, green, black}, X 1 X 2, X 1 X 3, X 1 X 5,..., X 5 X 6 AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
49 NP-HARDNESS OF CSP Let us recall the 3-coloring problem: does a coloring of the nodes of a graph using three colors in such a way that adjacent nodes have different colors exist? D 1 = = D 6 = {red, green, black}, X 1 X 2, X 1 X 3, X 1 X 5,..., X 5 X 6 AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
50 A FAMOUS CSP domain([x 1,1,..., X 9,9 ], 1, 9) X 1,3 = 1, X 2,3 = 2, X 2,5 = 3, X 2,9 = 4,..., X 9,7 = 5 alldifferent(x 1,1,..., X 1,9 )... alldifferent(x 9,1,..., X 9,9 ) alldifferent(x 1,1,..., X 9,1 )... alldifferent(x 1,9,..., X 9,9 ) alldifferent(x 1,1,..., X 3,3 )... alldifferent(x 7,7,..., X 9,9 ) AGOSTINO DOVIER (CLPLAB) AUTOMATED REASONING UDINE, OCTOBER 2, / 28
The core of solving constraint problems using Constraint Programming (CP), with emphasis on:
What is it about? l Theory The core of solving constraint problems using Constraint Programming (CP), with emphasis on: l Modeling l Solving: Local consistency and propagation; Backtracking search + heuristics.
More informationConstraint satisfaction search. Combinatorial optimization search.
CS 1571 Introduction to AI Lecture 8 Constraint satisfaction search. Combinatorial optimization search. Milos Hauskrecht milos@cs.pitt.edu 539 Sennott Square Constraint satisfaction problem (CSP) Objective:
More informationCPP: A Constraint Logic Programming Based Planner with Preferences
CPP: A Constraint Logic Programming Based Planner with Preferences Phan Huy Tu, Tran Cao Son, and Enrico Pontelli Computer Science Department, New Mexico State University, Las Cruces, New Mexico, USA {tphan
More informationFinding optimal configurations ( combinatorial optimization)
CS 1571 Introduction to AI Lecture 10 Finding optimal configurations ( combinatorial optimization) Milos Hauskrecht milos@cs.pitt.edu 539 Sennott Square Constraint satisfaction problem (CSP) Constraint
More informationLecture 9: Search 8. Victor R. Lesser. CMPSCI 683 Fall 2010
Lecture 9: Search 8 Victor R. Lesser CMPSCI 683 Fall 2010 ANNOUNCEMENTS REMEMBER LECTURE ON TUESDAY! EXAM ON OCTOBER 18 OPEN BOOK ALL MATERIAL COVERED IN LECTURES REQUIRED READINGS WILL MOST PROBABLY NOT
More informationFoundations of Artificial Intelligence
Foundations of Artificial Intelligence 31. Propositional Logic: DPLL Algorithm Malte Helmert and Gabriele Röger University of Basel April 24, 2017 Propositional Logic: Overview Chapter overview: propositional
More informationConstraint Programming Overview based on Examples
DM841 Discrete Optimization Part I Lecture 2 Constraint Programming Overview based on Examples Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. An
More informationarxiv: v1 [cs.cc] 5 Dec 2018
Consistency for 0 1 Programming Danial Davarnia 1 and J. N. Hooker 2 1 Iowa state University davarnia@iastate.edu 2 Carnegie Mellon University jh38@andrew.cmu.edu arxiv:1812.02215v1 [cs.cc] 5 Dec 2018
More informationMidterm Examination CS540: Introduction to Artificial Intelligence
Midterm Examination CS540: Introduction to Artificial Intelligence November 1, 2005 Instructor: Jerry Zhu CLOSED BOOK (One letter-size notes allowed. Turn it in with the exam) LAST (FAMILY) NAME: FIRST
More informationCOMP219: Artificial Intelligence. Lecture 20: Propositional Reasoning
COMP219: Artificial Intelligence Lecture 20: Propositional Reasoning 1 Overview Last time Logic for KR in general; Propositional Logic; Natural Deduction Today Entailment, satisfiability and validity Normal
More informationAlgorithms. NP -Complete Problems. Dong Kyue Kim Hanyang University
Algorithms NP -Complete Problems Dong Kyue Kim Hanyang University dqkim@hanyang.ac.kr The Class P Definition 13.2 Polynomially bounded An algorithm is said to be polynomially bounded if its worst-case
More informationArtificial Intelligence
Artificial Intelligence Constraint Satisfaction Vibhav Gogate The University of Texas at Dallas Some material courtesy of Rina Dechter, Alex Ihler and Stuart Russell Constraint Satisfaction Problems The
More informationIntroduction to Arti Intelligence
Introduction to Arti Intelligence cial Lecture 4: Constraint satisfaction problems 1 / 48 Constraint satisfaction problems: Today Exploiting the representation of a state to accelerate search. Backtracking.
More informationCompiling and Executing PDDL in Picat
Compiling and Executing PDDL in Picat Marco De Bortoli, Roman Bartak, Agostino Dovier, Neng-Fa Zhou Università degli Studi di Udine CILC 2016 Picat CILC 2016 1 / 21 Outline Introduction to classical planning
More informationName: UW CSE 473 Final Exam, Fall 2014
P1 P6 Instructions Please answer clearly and succinctly. If an explanation is requested, think carefully before writing. Points may be removed for rambling answers. If a question is unclear or ambiguous,
More informationFinal exam of ECE 457 Applied Artificial Intelligence for the Spring term 2007.
Spring 2007 / Page 1 Final exam of ECE 457 Applied Artificial Intelligence for the Spring term 2007. Don t panic. Be sure to write your name and student ID number on every page of the exam. The only materials
More informationModelling for Constraint Programming
Modelling for Constraint Programming Barbara Smith 3. Symmetry, Viewpoints Symmetry in CSPs A symmetry transforms any solution into another Sometimes symmetry is inherent in the problem (e.g. chessboard
More informationLogic: Intro & Propositional Definite Clause Logic
Logic: Intro & Propositional Definite Clause Logic Alan Mackworth UBC CS 322 Logic 1 February 27, 2013 P & M extbook 5.1 Lecture Overview Recap: CSP planning Intro to Logic Propositional Definite Clause
More informationThe exam is closed book, closed calculator, and closed notes except your one-page crib sheet.
CS 188 Fall 2018 Introduction to Artificial Intelligence Practice Final You have approximately 2 hours 50 minutes. The exam is closed book, closed calculator, and closed notes except your one-page crib
More informationTentamen TDDC17 Artificial Intelligence 20 August 2012 kl
Linköpings Universitet Institutionen för Datavetenskap Patrick Doherty Tentamen TDDC17 Artificial Intelligence 20 August 2012 kl. 08-12 Points: The exam consists of exercises worth 32 points. To pass the
More informationThe exam is closed book, closed calculator, and closed notes except your one-page crib sheet.
CS 188 Fall 2015 Introduction to Artificial Intelligence Final You have approximately 2 hours and 50 minutes. The exam is closed book, closed calculator, and closed notes except your one-page crib sheet.
More informationComputational Models
Slides modified by Benny Chor, based on original slides by Maurice Herlihy, Brown University. p. 1 Computational Models Inroduction to the Theory of Computing Instructor: Prof. Benny Chor (benny at cs
More information1. True/False (40 points) total
Name: 1 2 3 4 5 6 7 total 40 20 45 45 20 15 15 200 UMBC CMSC 671 Final Exam December 20, 2009 Please write all of your answers on this exam. The exam is closed book and has seven problems that add up to
More informationCS 662 Sample Midterm
Name: 1 True/False, plus corrections CS 662 Sample Midterm 35 pts, 5 pts each Each of the following statements is either true or false. If it is true, mark it true. If it is false, correct the statement
More informationFoundations of Artificial Intelligence
Foundations of Artificial Intelligence 8. Satisfiability and Model Construction Davis-Putnam-Logemann-Loveland Procedure, Phase Transitions, GSAT Joschka Boedecker and Wolfram Burgard and Bernhard Nebel
More informationInterleaved Alldifferent Constraints: CSP vs. SAT Approaches
Interleaved Alldifferent Constraints: CSP vs. SAT Approaches Frédéric Lardeux 3, Eric Monfroy 1,2, and Frédéric Saubion 3 1 Universidad Técnica Federico Santa María, Valparaíso, Chile 2 LINA, Université
More informationSampling from Bayes Nets
from Bayes Nets http://www.youtube.com/watch?v=mvrtaljp8dm http://www.youtube.com/watch?v=geqip_0vjec Paper reviews Should be useful feedback for the authors A critique of the paper No paper is perfect!
More informationIntroduction to Computational Complexity
Introduction to Computational Complexity Tandy Warnow October 30, 2018 CS 173, Introduction to Computational Complexity Tandy Warnow Overview Topics: Solving problems using oracles Proving the answer to
More informationExamination Artificial Intelligence Module Intelligent Interaction Design December 2014
Examination Artificial Intelligence Module Intelligent Interaction Design December 2014 Introduction This exam is closed book, you may only use a simple calculator (addition, substraction, multiplication
More informationFoundations of Artificial Intelligence
Foundations of Artificial Intelligence 32. Propositional Logic: Local Search and Outlook Martin Wehrle Universität Basel April 29, 2016 Propositional Logic: Overview Chapter overview: propositional logic
More informationArgumentative Characterisations of Non-monotonic Inference in Preferred Subtheories: Stable Equals Preferred
Argumentative Characterisations of Non-monotonic Inference in Preferred Subtheories: Stable Equals Preferred Sanjay Modgil November 17, 2017 Abstract A number of argumentation formalisms provide dialectical
More informationArgumentation-Based Models of Agent Reasoning and Communication
Argumentation-Based Models of Agent Reasoning and Communication Sanjay Modgil Department of Informatics, King s College London Outline Logic and Argumentation - Dung s Theory of Argumentation - The Added
More informationWhat we will try to do...
Constraint Satisfaction Problems (CSP) (Where we postpone making difficult decisions until they become easy to make) R&N: Chap. 5 Slides from Jean-Claude Latombe at Stanford University (used with permission)
More informationFinal. Introduction to Artificial Intelligence. CS 188 Spring You have approximately 2 hours and 50 minutes.
CS 188 Spring 2014 Introduction to Artificial Intelligence Final You have approximately 2 hours and 50 minutes. The exam is closed book, closed notes except your two-page crib sheet. Mark your answers
More informationUsing first-order logic, formalize the following knowledge:
Probabilistic Artificial Intelligence Final Exam Feb 2, 2016 Time limit: 120 minutes Number of pages: 19 Total points: 100 You can use the back of the pages if you run out of space. Collaboration on the
More informationCS221 Practice Midterm
CS221 Practice Midterm Autumn 2012 1 ther Midterms The following pages are excerpts from similar classes midterms. The content is similar to what we ve been covering this quarter, so that it should be
More informationCSCI3390-Lecture 18: Why is the P =?NP Problem Such a Big Deal?
CSCI3390-Lecture 18: Why is the P =?NP Problem Such a Big Deal? The conjecture that P is different from NP made its way on to several lists of the most important unsolved problems in Mathematics (never
More informationThe exam is closed book, closed calculator, and closed notes except your one-page crib sheet.
CS 188 Spring 2017 Introduction to Artificial Intelligence Midterm V2 You have approximately 80 minutes. The exam is closed book, closed calculator, and closed notes except your one-page crib sheet. Mark
More information1.1 P, NP, and NP-complete
CSC5160: Combinatorial Optimization and Approximation Algorithms Topic: Introduction to NP-complete Problems Date: 11/01/2008 Lecturer: Lap Chi Lau Scribe: Jerry Jilin Le This lecture gives a general introduction
More informationGeneralized Micro-Structures for Non-Binary CSP
Generalized Micro-Structures for Non-Binary CSP Achref El Mouelhi LSIS - UMR CNRS 7296 Aix-Marseille Université Avenue Escadrille Normandie-Niemen 13397 Marseille Cedex 20 (France) achref.elmouelhi@lsis.org
More informationFinal Exam December 12, 2017
Introduction to Artificial Intelligence CSE 473, Autumn 2017 Dieter Fox Final Exam December 12, 2017 Directions This exam has 7 problems with 111 points shown in the table below, and you have 110 minutes
More informationNP-complete problems. CSE 101: Design and Analysis of Algorithms Lecture 20
NP-complete problems CSE 101: Design and Analysis of Algorithms Lecture 20 CSE 101: Design and analysis of algorithms NP-complete problems Reading: Chapter 8 Homework 7 is due today, 11:59 PM Tomorrow
More informationDeciding Equivalence between Extended Datalog Programs. A Brief Survey.
Deciding Equivalence between Extended Datalog Programs. A Brief Survey. Stefan Woltran Technische Universität Wien A-1040 Vienna, Austria Joint work with: Thomas Eiter, Wolfgang Faber, Michael Fink, Hans
More informationFinal exam of ECE 457 Applied Artificial Intelligence for the Fall term 2007.
Fall 2007 / Page 1 Final exam of ECE 457 Applied Artificial Intelligence for the Fall term 2007. Don t panic. Be sure to write your name and student ID number on every page of the exam. The only materials
More informationCS154, Lecture 13: P vs NP
CS154, Lecture 13: P vs NP The EXTENDED Church-Turing Thesis Everyone s Intuitive Notion of Efficient Algorithms Polynomial-Time Turing Machines More generally: TM can simulate every reasonable model of
More informationFriday Four Square! Today at 4:15PM, Outside Gates
P and NP Friday Four Square! Today at 4:15PM, Outside Gates Recap from Last Time Regular Languages DCFLs CFLs Efficiently Decidable Languages R Undecidable Languages Time Complexity A step of a Turing
More informationCS 4100 // artificial intelligence. Recap/midterm review!
CS 4100 // artificial intelligence instructor: byron wallace Recap/midterm review! Attribution: many of these slides are modified versions of those distributed with the UC Berkeley CS188 materials Thanks
More information) (d o f. For the previous layer in a neural network (just the rightmost layer if a single neuron), the required update equation is: 2.
1 Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.034 Artificial Intelligence, Fall 2011 Recitation 8, November 3 Corrected Version & (most) solutions
More informationCISC681/481 AI Midterm Exam
CISC681/481 AI Midterm Exam You have from 12:30 to 1:45pm to complete the following four questions. Use the back of the page if you need more space. Good luck! 1. Definitions (3 points each) Define the
More informationChapter 7 Propositional Satisfiability Techniques
Lecture slides for Automated Planning: Theory and Practice Chapter 7 Propositional Satisfiability Techniques Dana S. Nau University of Maryland 12:58 PM February 15, 2012 1 Motivation Propositional satisfiability:
More informationCOMPUTATIONAL COMPLEXITY
ATHEATICS: CONCEPTS, AND FOUNDATIONS Vol. III - Computational Complexity - Osamu Watanabe COPUTATIONAL COPLEXITY Osamu Watanabe Tokyo Institute of Technology, Tokyo, Japan Keywords: {deterministic, randomized,
More information1 [15 points] Search Strategies
Probabilistic Foundations of Artificial Intelligence Final Exam Date: 29 January 2013 Time limit: 120 minutes Number of pages: 12 You can use the back of the pages if you run out of space. strictly forbidden.
More informationLogic in AI Chapter 7. Mausam (Based on slides of Dan Weld, Stuart Russell, Dieter Fox, Henry Kautz )
Logic in AI Chapter 7 Mausam (Based on slides of Dan Weld, Stuart Russell, Dieter Fox, Henry Kautz ) Knowledge Representation represent knowledge in a manner that facilitates inferencing (i.e. drawing
More informationConstraint Satisfaction
Constraint Satisfaction CS 486/686 May 16, 2006 University of Waterloo 1 Outline What are CSPs? Standard search and CSPs Improvements Backtracking Backtracking + heuristics Forward checking 2 Introduction
More informationImproving Repair-based Constraint Satisfaction Methods by Value Propagation
From: AAAI-94 Proceedings. Copyright 1994, AAAI (www.aaai.org). All rights reserved. Improving Repair-based Constraint Satisfaction Methods by Value Propagation Nobuhiro Yugami Yuiko Ohta Mirotaka Nara
More informationComplexity Theory Part II
Complexity Theory Part II Time Complexity The time complexity of a TM M is a function denoting the worst-case number of steps M takes on any input of length n. By convention, n denotes the length of the
More informationDesign and Analysis of Algorithms
Design and Analysis of Algorithms CSE 5311 Lecture 25 NP Completeness Junzhou Huang, Ph.D. Department of Computer Science and Engineering CSE5311 Design and Analysis of Algorithms 1 NP-Completeness Some
More informationChapter 7 R&N ICS 271 Fall 2017 Kalev Kask
Set 6: Knowledge Representation: The Propositional Calculus Chapter 7 R&N ICS 271 Fall 2017 Kalev Kask Outline Representing knowledge using logic Agent that reason logically A knowledge based agent Representing
More informationArtificial Intelligence Chapter 7: Logical Agents
Artificial Intelligence Chapter 7: Logical Agents Michael Scherger Department of Computer Science Kent State University February 20, 2006 AI: Chapter 7: Logical Agents 1 Contents Knowledge Based Agents
More informationNP-Completeness Part II
NP-Completeness Part II Outline for Today Recap from Last Time What is NP-completeness again, anyway? 3SAT A simple, canonical NP-complete problem. Independent Sets Discovering a new NP-complete problem.
More informationCS154, Lecture 13: P vs NP
CS154, Lecture 13: P vs NP The EXTENDED Church-Turing Thesis Everyone s Intuitive Notion of Efficient Algorithms Polynomial-Time Turing Machines More generally: TM can simulate every reasonable model of
More informationSAT, NP, NP-Completeness
CS 473: Algorithms, Spring 2018 SAT, NP, NP-Completeness Lecture 22 April 13, 2018 Most slides are courtesy Prof. Chekuri Ruta (UIUC) CS473 1 Spring 2018 1 / 57 Part I Reductions Continued Ruta (UIUC)
More informationOn the Parallel Complexity of Some Constraint Satisfaction Problems
From: AAAI-86 Proceedings. Copyright 1986, AAAI (www.aaai.org). All rights reserved. On the Parallel Complexity of Some Constraint Satisfaction Problems Simon ICasif Department of Electrical Engineering
More informationApplication: Planning as Satisfiability (SATPlan) (Pre Lecture)
Application: Planning as Satisfiability (SATPlan) (Pre Lecture) Dr. Neil T. Dantam CSCI-561, Colorado School of Mines Fall 2018 Dantam (Mines CSCI-561) Application: Planning as Satisfiability (SATPlan)
More informationFinal Exam December 12, 2017
Introduction to Artificial Intelligence CSE 473, Autumn 2017 Dieter Fox Final Exam December 12, 2017 Directions This exam has 7 problems with 111 points shown in the table below, and you have 110 minutes
More informationMin-Max Message Passing and Local Consistency in Constraint Networks
Min-Max Message Passing and Local Consistency in Constraint Networks Hong Xu, T. K. Satish Kumar, and Sven Koenig University of Southern California, Los Angeles, CA 90089, USA hongx@usc.edu tkskwork@gmail.com
More informationPythagorean Triples and SAT Solving
Pythagorean Triples and SAT Solving Moti Ben-Ari Department of Science Teaching Weizmann Institute of Science http://www.weizmann.ac.il/sci-tea/benari/ c 2017-18 by Moti Ben-Ari. This work is licensed
More informationLecture 6: Oracle TMs, Diagonalization Limits, Space Complexity
CSE 531: Computational Complexity I Winter 2016 Lecture 6: Oracle TMs, Diagonalization Limits, Space Complexity January 22, 2016 Lecturer: Paul Beame Scribe: Paul Beame Diagonalization enabled us to separate
More informationSAT-Solvers: propositional logic in action
SAT-Solvers: propositional logic in action Russell Impagliazzo, with assistence from Cameron Held October 22, 2013 1 Personal Information A reminder that my office is 4248 CSE, my office hours for CSE
More informationProbabilistic Graphical Models for Image Analysis - Lecture 1
Probabilistic Graphical Models for Image Analysis - Lecture 1 Alexey Gronskiy, Stefan Bauer 21 September 2018 Max Planck ETH Center for Learning Systems Overview 1. Motivation - Why Graphical Models 2.
More informationFinite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018
Finite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018 Lecture 15 Ana Bove May 17th 2018 Recap: Context-free Languages Chomsky hierarchy: Regular languages are also context-free; Pumping lemma
More informationFoundations of
91.304 Foundations of (Theoretical) Computer Science Chapter 3 Lecture Notes (Section 3.3: Definition of Algorithm) David Martin dm@cs.uml.edu With modifications by Prof. Karen Daniels, Fall 2012 This
More informationIntelligent Systems (AI-2)
Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 19 Oct, 23, 2015 Slide Sources Raymond J. Mooney University of Texas at Austin D. Koller, Stanford CS - Probabilistic Graphical Models D. Page,
More informationSymmetry Breaking using Value Precedence
Symmetry Breaking using Value Precedence Toby Walsh 1 Abstract. We present a comprehensive study of the use of value precedence constraints to break value symmetry. We first give a simple encoding of value
More informationConstraint Satisfaction [RN2] Sec [RN3] Sec Outline
Constraint Satisfaction [RN2] Sec 5.1-5.2 [RN3] Sec 6.1-6.3 CS 486/686 Lecture 4: Jan 12, 2012 University of Waterloo 1 Outline What are CSPs? Standard search and CSPs Improvements Backtracking Backtracking
More informationChapter 2. Reductions and NP. 2.1 Reductions Continued The Satisfiability Problem (SAT) SAT 3SAT. CS 573: Algorithms, Fall 2013 August 29, 2013
Chapter 2 Reductions and NP CS 573: Algorithms, Fall 2013 August 29, 2013 2.1 Reductions Continued 2.1.1 The Satisfiability Problem SAT 2.1.1.1 Propositional Formulas Definition 2.1.1. Consider a set of
More informationComplexity Theory Part Two
Complexity Theory Part Two Recap from Last Time The Complexity Class P The complexity class P (for polynomial time) contains all problems that can be solved in polynomial time. Formally: P = { L There
More informationMachine Learning 2007: Slides 1. Instructor: Tim van Erven Website: erven/teaching/0708/ml/
Machine 2007: Slides 1 Instructor: Tim van Erven (Tim.van.Erven@cwi.nl) Website: www.cwi.nl/ erven/teaching/0708/ml/ September 6, 2007, updated: September 13, 2007 1 / 37 Overview The Most Important Supervised
More informationIntelligent Systems (AI-2)
Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 19 Oct, 24, 2016 Slide Sources Raymond J. Mooney University of Texas at Austin D. Koller, Stanford CS - Probabilistic Graphical Models D. Page,
More informationMulti-Agent Systems. Bernhard Nebel, Felix Lindner, and Thorsten Engesser. Summer Term Albert-Ludwigs-Universität Freiburg
Multi-Agent Systems Albert-Ludwigs-Universität Freiburg Bernhard Nebel, Felix Lindner, and Thorsten Engesser Summer Term 2017 Course outline 1 Introduction 2 Agent-Based Simulation 3 Agent Architectures
More informationLogic as The Calculus of Computer Science
1 Ottobre, 2007 1 Università di Napoli Federico II What is a Logic? A Logic is a formalism with a sintax a semantics an inference mechanism for reasoning Historical Diagram The First Age of Logic: Symbolic
More informationScheduling with Constraint Programming. Job Shop Cumulative Job Shop
Scheduling with Constraint Programming Job Shop Cumulative Job Shop CP vs MIP: Task Sequencing We need to sequence a set of tasks on a machine Each task i has a specific fixed processing time p i Each
More informationFormal Verification Methods 1: Propositional Logic
Formal Verification Methods 1: Propositional Logic John Harrison Intel Corporation Course overview Propositional logic A resurgence of interest Logic and circuits Normal forms The Davis-Putnam procedure
More informationParts 3-6 are EXAMPLES for cse634
1 Parts 3-6 are EXAMPLES for cse634 FINAL TEST CSE 352 ARTIFICIAL INTELLIGENCE Fall 2008 There are 6 pages in this exam. Please make sure you have all of them INTRODUCTION Philosophical AI Questions Q1.
More informationU.C. Berkeley CS278: Computational Complexity Professor Luca Trevisan August 30, Notes for Lecture 1
U.C. Berkeley CS278: Computational Complexity Handout N1 Professor Luca Trevisan August 30, 2004 Notes for Lecture 1 This course assumes CS170, or equivalent, as a prerequisite. We will assume that the
More informationComputational Aspects of Abstract Argumentation
Computational Aspects of Abstract Argumentation PhD Defense, TU Wien (Vienna) Wolfgang Dvo ák supervised by Stefan Woltran Institute of Information Systems, Database and Articial Intelligence Group Vienna
More informationMock Exam Künstliche Intelligenz-1. Different problems test different skills and knowledge, so do not get stuck on one problem.
Name: Matriculation Number: Mock Exam Künstliche Intelligenz-1 January 9., 2017 You have one hour(sharp) for the test; Write the solutions to the sheet. The estimated time for solving this exam is 53 minutes,
More informationAutomated Program Verification and Testing 15414/15614 Fall 2016 Lecture 3: Practical SAT Solving
Automated Program Verification and Testing 15414/15614 Fall 2016 Lecture 3: Practical SAT Solving Matt Fredrikson mfredrik@cs.cmu.edu October 17, 2016 Matt Fredrikson SAT Solving 1 / 36 Review: Propositional
More information6.045: Automata, Computability, and Complexity (GITCS) Class 15 Nancy Lynch
6.045: Automata, Computability, and Complexity (GITCS) Class 15 Nancy Lynch Today: More Complexity Theory Polynomial-time reducibility, NP-completeness, and the Satisfiability (SAT) problem Topics: Introduction
More informationNP-Hardness reductions
NP-Hardness reductions Definition: P is the class of problems that can be solved in polynomial time, that is n c for a constant c Roughly, if a problem is in P then it's easy, and if it's not in P then
More informationChapter 7 Propositional Satisfiability Techniques
Lecture slides for Automated Planning: Theory and Practice Chapter 7 Propositional Satisfiability Techniques Dana S. Nau CMSC 722, AI Planning University of Maryland, Spring 2008 1 Motivation Propositional
More informationOutline What are CSPs? Standard search and CSPs Improvements. Constraint Satisfaction. Introduction. Introduction
Constraint Satisfaction CS 86/686 May 6, 006 University of Waterloo Outline What are CSPs? Standard search and CSPs Improvements acktracking acktracking + heuristics Forward checking Introduction In the
More informationThe P versus NP Problem. Ker-I Ko. Stony Brook, New York
The P versus NP Problem Ker-I Ko Stony Brook, New York ? P = NP One of the seven Millenium Problems The youngest one A folklore question? Has hundreds of equivalent forms Informal Definitions P : Computational
More informationNP-Completeness Part II
NP-Completeness Part II Recap from Last Time NP-Hardness A language L is called NP-hard iff for every L' NP, we have L' P L. A language in L is called NP-complete iff L is NP-hard and L NP. The class NPC
More informationMAL TSEV CONSTRAINTS MADE SIMPLE
Electronic Colloquium on Computational Complexity, Report No. 97 (2004) MAL TSEV CONSTRAINTS MADE SIMPLE Departament de Tecnologia, Universitat Pompeu Fabra Estació de França, Passeig de la circumval.lació,
More informationCS360 Homework 12 Solution
CS360 Homework 12 Solution Constraint Satisfaction 1) Consider the following constraint satisfaction problem with variables x, y and z, each with domain {1, 2, 3}, and constraints C 1 and C 2, defined
More informationAlgorithms and Complexity theory
Algorithms and Complexity theory Thibaut Barthelemy Some slides kindly provided by Fabien Tricoire University of Vienna WS 2014 Outline 1 Algorithms Overview How to write an algorithm 2 Complexity theory
More informationPlanning Under Uncertainty II
Planning Under Uncertainty II Intelligent Robotics 2014/15 Bruno Lacerda Announcement No class next Monday - 17/11/2014 2 Previous Lecture Approach to cope with uncertainty on outcome of actions Markov
More informationTemporal Difference Learning & Policy Iteration
Temporal Difference Learning & Policy Iteration Advanced Topics in Reinforcement Learning Seminar WS 15/16 ±0 ±0 +1 by Tobias Joppen 03.11.2015 Fachbereich Informatik Knowledge Engineering Group Prof.
More information