Using Rules Chapter 6. 2 Logic Programming (Definite) logic program: A  B 1, B 2, …, B m program clause (Horn) head body  A 1, A 2, …, A n goal clause.

Slides:



Advertisements
Similar presentations
More Sophisticated Behaviour 1 Using library classes to implement more advanced functionality.
Advertisements

Methods of Proof Chapter 7, second half.. Proof methods Proof methods divide into (roughly) two kinds: Application of inference rules: Legitimate (sound)
Logic CPSC 386 Artificial Intelligence Ellen Walker Hiram College.
UNIT spelling SOFT C – HARD C.
The true story. I like diving. I want to go to England. She hopes to pass this exam. My brother started crying.
1 Logical reasoning systems Theorem provers and logic programming languages Production systems Frame systems and semantic networks Description logic systems.
Formal Logic Mathematical Structures for Computer Science Chapter 1 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesFormal Logic.
AI Defined Textbook definition:
Artificial Intelligence. AIM Turing –The Turing Machine (a universal computing machine) –Bletchley (Bombe) –The Turing test for AI –Arrested for homosexuality,
1 AI - Introduction Bertil Ekdahl
Perfect Square Trinomials. Form for Perfect Square Trinomials: a 2 + 2ab + b 2 OR a 2 – 2ab + b 2.
1 Chapter 3 Knowledge Representation AI & ESChapter 3 2 Knowledge Representation Semantic Network Network Representation Conceptual Graph Frame.
Technology / Engineering Teacher Mr. Jordan Burton.
CS147 - Terry Winograd - 1 Lecture 14 – Agents and Natural Language Terry Winograd CS147 - Introduction to Human-Computer Interaction Design Computer Science.
1 Pertemuan 8 Representing Knowledge Using Rules Matakuliah: T0264/Inteligensia Semu Tahun: 2005 Versi: 1.
Alice Variables Pepper. Set to Java look Edit / preferences restart.
CMSC 723 / LING 645: Intro to Computational Linguistics September 8, 2004: Monz Regular Expressions and Finite State Automata (J&M 2) Prof. Bonnie J. Dorr.
Conversational Agent 1.Two layers: Dialogue manager and Conversational agent. 2.Rule-Based Translator (ELIZA and PARRY) 3. Layer one: Dialogue Manager.
Pattern matching and unification ובקיצור - עליזה יעל נצר בינה מלאכותית מכללת אשקלון.
CS 4705 Regular Expressions and Automata in Natural Language Analysis CS 4705 Julia Hirschberg.
CS120: Lecture 17 MP Johnson Hunter
CHA2555 Week2: Knowledge Representation, Logic and Prolog Lee McCluskey First term:
CMSC 723: Intro to Computational Linguistics Lecture 2: February 4, 2004 Regular Expressions and Finite State Automata Professor Bonnie J. Dorr Dr. Nizar.
0 1 Todays Topics Resolution – top down and bottom up j-DREW BU procedure Subsumption – change to procedure Infinite Loops RuleML input – Prolog output.
The first step is to teach the student the alphabet
Verb Tenses PresentFuturePast Present Progressive Future progressive Past progressive Present PerfectFuture perfectPast perfect Present Perfect Progressive.
Propositional Logic Reasoning correctly computationally Chapter 7 or 8.
M ULTI - PART VERBS 2 Aim: to learn some common phrasal (multi-part) verbs with GET.
Artificial Intelligence PSY 152 5/17/2007. Preliminary Questions Will this material be on the test? –Yes. Is this material in the textbook? –No. Will.
What is Intelligence? Let’s try to define intelligence Definition (Merriam Webster): –Capacity for learning, reasoning, understanding and similar forms.
Production Systems A production system is –a set of rules (if-then or condition-action statements) –working memory the current state of the problem solving,
Chapter 2. Regular Expressions and Automata From: Chapter 2 of An Introduction to Natural Language Processing, Computational Linguistics, and Speech Recognition,
Knowledge based Humans use heuristics a great deal in their problem solving. Of course, if the heuristic does fail, it is necessary for the problem solver.
1 Human-Computer Interaction Web Interface & Natural Language.
My goals were to: To be a more effective listener Opinionated More Open Minded Open up more to the class Not just for the sake of being heard Have something.
Chapter 9: Rules and Expert Systems Lora Streeter.
CS 100Lecture 281 CS100J Lecture 27 n Previous Lecture –Interfaces –Comparable –Reflection –super –Re-Reading: n Lewis & Loftus, Section 5.5 n Savitch,
Informal transactional letter
Definition: The process of ending a conflict by cooperating and problem solving.
1 Prolog and Logic Languages Aaron Bloomfield CS 415 Fall 2005.
CIS2326 Week2: Logic and Prolog Lee McCluskey First term:
CS4026 Formal Models of Computation Part II The Logic Model Lecture 2 – Prolog: History and Introduction.
© 2015 albert-learning.com Phrases For Business English.
Automated Reasoning Early AI explored how to automated several reasoning tasks – these were solved by what we might call weak problem solving methods as.
1 Logic Programming Robert Kowalski’s equation: Algorithm = Logic + Control Definite logic program: A  B 1, B 2, …, B m (program clause) headbody  A.
Taking Turns. I love playing with toys! Sometimes when I play with toys I want to grab a toy that someone else has. This is not the best choice and can.
Concept. Example 1 Use Corresponding Angles Postulate A. In the figure, m  11 = 51. Find m  15. Tell which postulates (or theorems) you used. Answer:
Happiness By Sadie Crowe. What makes your life complete?
Decisions in Python Boolean functions. A Boolean function This is a function which returns a bool result (True or False). The function can certainly work.
1. Mastering the Art of the Difficult Conversation Marilyn Bushey, Coach to Leaders PowerPAC, Inc.
AD Lab Andrews-Dalkilic Data Exploration. AD Lab Outline Architecture What is Bioinformatics? Explore some bioinformatics problems and tools Talk about.
1 Pertemuan 8 Representing Knowledge Using Rules Matakuliah: T0264/Inteligensia Semu Tahun: Juli 2006 Versi: 2/1.
Chapter 4: Logic as The Art of Arts By Kasey Fitzpatrick.
“OH…. SO ALL ALONE” BY: ME (AUTHOR UNKNOWN A.K.A. “LONELY”)
WHAT IS A CHATTERBOT? A chatterbot is a computer program that simulates a conversation between two people. That is, one person writes something and the.
Chapter 6 Representing Knowledge Using Rules Artificial Intelligence ดร. วิภาดา เวทย์ประสิทธิ์ ภาควิชาวิทยาการคอมพิวเตอร์ คณะ วิทยาศาสตร์ มหาวิทยาลัยสงขลานครินทร์
OBJECTIVE (SWBAT): EVALUATE SCIENTIFIC EXPLANATIONS Initial Activity: A new species of crab has been discovered on the Galapagos Islands. Here we have.
Introduction to Artificial Intelligence
Writing a job application (cover) letter
Rules: Knowledge Representation & Manipulation
CSC 515 – Applied AI 1. Origins of AI conference.
Phrases For Business English
AI Defined Textbook definition:
Hi, DON here again.
Alice Variables Pepper.
the title of the presentation to go here
Captain Argument – loves agreeing and disagreeing
Ask Listen Do Space for your logo here
A User study on Conversational Software
INFORMATION RETRIEVAL
Presentation transcript:

Using Rules Chapter 6

2 Logic Programming (Definite) logic program: A  B 1, B 2, …, B m program clause (Horn) head body  A 1, A 2, …, A n goal clause

3 Logic Programming PROLOG (Alain Colmerauer 1972): apartmentpet(X) :- pet(X), small(X) pet(X) :- cat(X) pet(X) :- dog(X) dog(X) :- poodle(X) small(X) :- poodle(X) poodle(fluffy) pet(mittens) ?- apartmentpet(X)

4 Forward vs. Backward Reasoning Forward: from the start states. Backward: from the goal states.

5 Forward vs. Backward Reasoning Forward rules: to encode knowledge about how to respond to certain input. Backward rules: to encode knowledge about how to achieve particular goals.

6 Forward vs. Backward Reasoning Combining forward and backward reasoning  A 1, …, A k-1, A k, A k+1, …, A n achieved by forward reasoning backward reasoning

7 Production Systems Working memory: {A(1), A(2), B(2), B(3), B(4), C(5)} Rule memory: A(x)  B(x)  C(y)  add D(x) A(x)  B(y)  D(x)  add E(x) A(x)  B(x)  E(x)  delete A(x)

8 Production Systems A B D A=BC E A=Dadd E add D delete A RETE network (Forgy, 1982) A(1), A(2)B(2), B(3), B(4) A(2) B(2) C(5)D(2)

9 Production Systems Conflict resolution: Preferences based on rules: Specificity of rules Physical order of rules Preferences based on objects: Importance of objects Position of objects Preferences based on states: Evaluation of states

10 Matching ELIZA (Weizenbaum, 1966): Person: Men all are alike. ELIZA: In what way? Person: They're always bugging us about something or other. ELIZA: Can you think of specific example? Person: Well, my boyfriend made me come here. ELIZA: Your boyfriend made you come here. Person: He says I'm depressed much of the time. ELIZA: I am sorry to hear you are depressed. Person: It's true. I am unhappy. ELIZA: Do you think coming here will help you not to be unhappy?

11 Matching ELIZA (Weizenbaum, 1966): Person: I need some help, that much seems certain. ELIZA: What would it mean to you if you got some help? Person: Perhaps I could learn to get along with my brother. ELIZA: Tell me more about your family.....

12 Matching ELIZA (Weizenbaum, 1966): (X me Y)  (X you Y) (I remember X)  (Why do you remember X just now?) (My {family-member} is Y)  (Who else in your family is Y?) (X {family-member} Y)  (Tell me more about your family).... Person: My brother is mean to me. ELIZA: Who else in your family is mean to you?....