1 Structures and Strategies for State Space Search 3 3.0Introduction 3.1Graph Theory 3.2Strategies for State Space Search 3.3Using the State Space to Represent.

Slides:



Advertisements
Similar presentations
CSC411Artificial Intelligence 1 Chapter 3 Structures and Strategies For Space State Search Contents Graph Theory Strategies for Space State Search Using.
Advertisements

Review Binary Search Trees Operations on Binary Search Tree
May 2006CLINT-LN Parsing1 Computational Linguistics Introduction Approaches to Parsing.
Predicate Calculus Formal Methods in Verification of Computer Systems Jeremy Johnson.
Structures and Strategies For Space State Search
GRAMMAR & PARSING (Syntactic Analysis) NLP- WEEK 4.
1 CALCULUS Even more graphing problems
Structures and Strategies for State Space Search
Structures and Strategies for State Space Search
Inference and Resolution for Problem Solving
1 Heuristic Search 4 4.0Introduction 4.1An Algorithm for Heuristic Search 4.2Admissibility, Monotonicity, and Informedness 4.3Using Heuristics in Games.
1 Structures and Strategies for State Space Search 3 3.0Introduction 3.1Graph Theory 3.2Strategies for State Space Search 3.3Using the State Space to Represent.
Structures and Strategies For Space State Search
Lecture 9UofH - COSC Dr. Verma 1 COSC 3340: Introduction to Theory of Computation University of Houston Dr. Verma Lecture 9.
Automated Reasoning ARTIFICIAL INTELLIGENCE 6th edition George F Luger
1 Structures and Strategies for State Space Search 3 3.0Introduction 3.1Graph Theory 3.2Strategies for State Space Search 3.3Using the State Space to Represent.
Chapter 2 The Basic Concepts of Set Theory © 2008 Pearson Addison-Wesley. All rights reserved.
Grammar Rules- Clauses There are two types of clauses: Independent Clauses and Dependent Clauses. Independent clauses do not have any special punctuation.
Strong Method Problem Solving.
Copyright © Cengage Learning. All rights reserved.
Formal Description of a Problem In AI, we will formally define a problem as –a space of all possible configurations where each configuration is called.
Objective 6.01 Objective 6.01 Explain the abilities to communicate effectively in a technological world Technical Report Writing List the part of a technical.
The Predicate Calculus
KU NLP Structures and Strategies for State Space Search Depth-First and Breadth-First Search q A search algorithm must determine the order in which.
Knowledge Representation CPTR 314. The need of a Good Representation  The representation that is used to represent a problem is very important  The.
Building Control Algorithms For State Space Search.
1 CS 385 Fall 2006 Chapter 3 Structures and Strategies for State Space Search.
ENGLISH SYNTAX Introduction to Transformational Grammar.
Copyright © 2014 Curt Hill Sets Introduction to Set Theory.
COSC 2007 Data Structures II Chapter 14 Graphs I.
Sets Goal: Introduce the basic terminology of set theory.
Do Now 1) Solve and graph. 3t – 7 ≥ 5 and 2t – 6 ≤ 10.
EMIS 8373: Integer Programming Combinatorial Relaxations and Duals Updated 8 February 2005.
THEORY OF COMPUTATION Komate AMPHAWAN 1. 2.
10-1 An Introduction to Systems A _______ is a set of sentences joined by the word ____ or by a ________________. Together these sentences describe a ______.
George F Luger ARTIFICIAL INTELLIGENCE 5th edition Structures and Strategies for Complex Problem Solving Structures and Strategies For Space State Search.
George F Luger ARTIFICIAL INTELLIGENCE 5th edition Structures and Strategies for Complex Problem Solving HEURISTIC SEARCH Luger: Artificial Intelligence,
HEURISTIC SEARCH 4 4.0Introduction 4.1An Algorithm for Heuristic Search 4.2Admissibility, Monotonicity, and Informedness 4.3Using Heuristics in Games 4.4Complexity.
STRUCTURES AND STRATEGIES FOR STATE SPACE SEARCH 3 3.0Introduction 3.1Graph Theory 3.2Strategies for State Space Search 3.3Using the State Space to Represent.
STRUCTURES AND STRATEGIES FOR STATE SPACE SEARCH 3 3.0Introduction 3.1Graph Theory 3.2Strategies for State Space Search 3.3Using the State Space to Represent.
Artificial Intelligence Midterm 고려대학교 컴퓨터학과 자연어처리 연구실 임 해 창.
Copyright © Curt Hill Other Trees Applications of the Tree Structure.
Representation and Search The function of a representation is to capture the critical features of the problem domain –and make the information accessible.
The Basic Concepts of Set Theory. Chapter 1 Set Operations and Cartesian Products.
Functions 4-6 I can determine whether a relation is a function and find function values. S. Calahan 2008.
English for Economic Informatics I Tomáš Foltýnek Theoretical Foundations of Informatics.
CS344 : Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 4- Logic.
Parsing with Context Free Grammars. Slide 1 Outline Why should you care? Parsing Top-Down Parsing Bottom-Up Parsing Bottom-Up Space (an example) Top -
CS-7081 Application - 1. CS-7082 Example - 2 CS-7083 Simplifying a Statement – 3.
Graphs Chapter 20.
BCT 2083 DISCRETE STRUCTURE AND APPLICATIONS
Formal Language & Automata Theory
The Basic Concepts of Set Theory
Order Pairs An introduction.
The Basic Concepts of Set Theory
Thinking about grammars
Branch and Bound.
C H A P T E R N I N E Logic Programming.
Graph of the derived function
Search Exercise Search Tree? Solution (Breadth First Search)?
Miniconference on the Mathematics of Computation
Example 1: Identifying Functions
COSC 3340: Introduction to Theory of Computation
Two – One Problem Legal Moves: Slide Rules: 1s’ move right Hop
Subject’s, Predicates & Sentences
Two – One Problem Legal Moves: Slide Rules: 1s’ move right Hop
Ordered Pair – (11 - 2) CS-708.
Thinking about grammars
Chapter 14 Graphs © 2011 Pearson Addison-Wesley. All rights reserved.
Faculty of Computer Science and Information System
Presentation transcript:

1 Structures and Strategies for State Space Search 3 3.0Introduction 3.1Graph Theory 3.2Strategies for State Space Search 3.3Using the State Space to Represent Reasoning with the Predicate Calculus 3.4Epilogue and References 3.5Exercises

2 State space graph of a set of implications in propositional calculus

3 And/or graph of the expression q  r  p

4 Hypergraph A hypergraph consists of: N: a set of nodes. H: a set of hyperarcs. Hyperarcs are defined by ordered pairs in which the first element of the pairs is a single node from N and the second element is a subset of N. An ordinary graph is a special case of hypergraph in which all the sets of descendant nodes have a cardinality of 1.

5 And/or graph of the expression q  r  p

6 And/or graph of a set of propositional calculus expressions

7

8 And/or graph of the part of the state space for integrating a function (Nilsson 1971)

9 The solution subgraph showing that fred is at the museum

10 Facts and rules for the example

11 Five rules for a simple subset of English grammar

12 Figure 3.25:And/or graph for the grammar of Example Some of the nodes (np, art, etc.) have been written more than once to simplify drawing the graph.

13 Parse tree for the sentence