Introduction to AI & AI Principles (Semester 1) WEEK 7 (07/08) [Barnden’s slides only] John Barnden Professor of Artificial Intelligence School of Computer.

Slides:



Advertisements
Similar presentations
Lecture Notes on AI & NN Chapter 1 Introduction to Intelligence Theory Section 2 Intelligence Theory & Information Science.
Advertisements

Artificial Intelligence
1 Knowledge Representation Introduction KR and Logic.
Logic Use mathematical deduction to derive new knowledge.
Knowledge Representation
Knowledge Representation
Introduction to AI & AI Principles (Semester 1) WEEK 6 (07/08) John Barnden Professor of Artificial Intelligence School of Computer Science University.
So What Does it All Mean? Geospatial Semantics and Ontologies Dr Kristin Stock.
F22H1 Logic and Proof Week 7 Clausal Form and Resolution.
CPSC 322 Introduction to Artificial Intelligence November 5, 2004.
Fundamentals/ICY: Databases 2013/14 Week 6: Monday John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham,
Knowledge Representation Methods
Introduction to AI & AI Principles (Semester 1) WEEK 8 Introduction to AI & AI Principles (Semester 1) WEEK 8 (2008/09) John Barnden Professor of Artificial.
Introduction to AI & AI Principles (Semester 1) WEEK 6 John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham,
Introduction to AI & AI Principles (Semester 1) WEEK 11 (Wed) – Wrap-Up (2008/09) John Barnden Professor of Artificial Intelligence School of Computer.
Introduction to AI & AI Principles (Semester 1) WEEK 8 (07/08) [Barnden’s slides only] John Barnden Professor of Artificial Intelligence School of Computer.
1 Lecture 34 Introduction to Knowledge Representation & Expert Systems Overview  Lecture Objective  Introduction to Knowledge Representation  Knowledge.
Introduction to AI & AI Principles (Semester 1) WEEK 9 - Wednesday Introduction to AI & AI Principles (Semester 1) WEEK 9 - Wednesday (2008/09) John Barnden.
Introduction to AI & AI Principles (Semester 1) REVISION LECTURES (Term 3) John Barnden Professor of Artificial Intelligence School of Computer Science.
CSCI 5582 Fall 2006 CSCI 5582 Artificial Intelligence Lecture 9 Jim Martin.
Knowledge Representation using First-Order Logic (Part II) Reading: Chapter 8, First lecture slides read: Second lecture slides read:
Introduction to AI & AI Principles (Semester 1) REVISION LECTURES (Term 3) John Barnden Professor of Artificial Intelligence School of Computer Science.
Introduction to AI & AI Principles (Semester 1) WEEK 10 (07/08) [John Barnden’s slides only] School of Computer Science University of Birmingham, UK.
November 5, 2009Introduction to Cognitive Science Lecture 16: Symbolic vs. Connectionist AI 1 Symbolism vs. Connectionism There is another major division.
Introduction to AI & AI Principles (Semester 1) WEEK 7 John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham,
Introduction to AI & AI Principles (Semester 1) WEEK 11 John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham,
Introduction to AI & AI Principles (Semester 1) WEEK 1 Introduction to AI & AI Principles (Semester 1) WEEK 1 (2008/09) Tuesday (b): Exercises John Barnden.
Introduction to AI & AI Principles (Semester 1) WEEK 1 – Wednesday Introduction to AI & AI Principles (Semester 1) WEEK 1 – Wednesday (2008/09) John Barnden.
Data manipulation techniques for adaptation Alexandra I. Cristea USI intensive course “Adaptive Systems” April-May 2003.
Introduction to AI & AI Principles (Semester 1) WEEK 8 – Wednesday Introduction to AI & AI Principles (Semester 1) WEEK 8 – Wednesday (2008/09) John Barnden.
CSE115/ENGR160 Discrete Mathematics 01/20/11 Ming-Hsuan Yang UC Merced 1.
Introduction to AI & AI Principles (Semester 1) WEEK 3 – Tuesday part B Introduction to AI & AI Principles (Semester 1) WEEK 3 – Tuesday part B (2008/09)
Introduction to AI & AI Principles (Semester 1) WEEK 5 – Wednesday Introduction to AI & AI Principles (Semester 1) WEEK 5 – Wednesday (2008/09) John Barnden.
Introduction to AI & AI Principles (Semester 1) WEEK 3 – Tuesday part A Introduction to AI & AI Principles (Semester 1) WEEK 3 – Tuesday part A (2008/09)
THEORIES OF MIND: AN INTRODUCTION TO COGNITIVE SCIENCE Jay Friedenberg and Gordon Silverman.
Intro to Maths for CS: 2013/14 Sets (2) – OPTIONAL MATERIAL John Barnden Professor of Artificial Intelligence School of Computer Science University of.
Εισαγωγή στη Μουσική Πληροφορική Περίληψη: Μάθημα 1 και 2 Christina Anagnostopoulou Οι διαφάνειες αυτές είναι στα Αγγλικά.
Knowledge representation
Artificial Intelligence
Fundamentals/ICY: Databases 2013/14 Week 10 –Monday –Normalization, contd John Barnden Professor of Artificial Intelligence School of Computer Science.
Declarative vs Procedural Programming  Procedural programming requires that – the programmer tell the computer what to do. That is, how to get the output.
1 Predicate (Relational) Logic 1. Introduction The propositional logic is not powerful enough to express certain types of relationship between propositions.
1 Introduction to Computational Linguistics Eleni Miltsakaki AUTH Spring 2006-Lecture 8.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Fundamentals/ICY: Databases 2013/14 WEEK 9 –Friday John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham,
KNOWLEDGE BASED SYSTEMS
Knowledge Representation
Propositional Logic Predicate Logic
CS 285- Discrete Mathematics Lecture 4. Section 1.3 Predicate logic Predicate logic is an extension of propositional logic that permits concisely reasoning.
1 CSC384: Intro to Artificial Intelligence Lecture 5.  Knowledge Representation.
First-Order Logic Semantics Reading: Chapter 8, , FOL Syntax and Semantics read: FOL Knowledge Engineering read: FOL.
Artificial Intelligence Knowledge Representation.
COMPUTER SYSTEM FUNDAMENTAL Genetic Computer School INTRODUCTION TO ARTIFICIAL INTELLIGENCE LESSON 11.
Artificial Intelligence Lecture No. 14 Dr. Asad Ali Safi ​ Assistant Professor, Department of Computer Science, COMSATS Institute of Information Technology.
Artificial Intelligence Logical Agents Chapter 7.
Knowledge Representation Lecture 2 out of 5. Last Week Intelligence needs knowledge We need to represent this knowledge in a way a computer can process.
Knowledge Representation Techniques
CHAPTER 1 Introduction BIC 3337 EXPERT SYSTEM.
Fundamentals/ICY: Databases 2010/11 WEEK 1
CS201: Data Structures and Discrete Mathematics I
Logic Use mathematical deduction to derive new knowledge.
KNOWLEDGE REPRESENTATION
Artificial Intelligence: Logic agents
TA : Mubarakah Otbi, Duaa al Ofi , Huda al Hakami
Discrete Mathematics Lecture 4 & 5: Predicate and Quantifier
Discrete Mathematics Lecture 4 & 5: Predicate and Quantifier
CS201: Data Structures and Discrete Mathematics I
ece 720 intelligent web: ontology and beyond
Introduction to Computational Linguistics
Habib Ullah qamar Mscs(se)
Presentation transcript:

Introduction to AI & AI Principles (Semester 1) WEEK 7 (07/08) [Barnden’s slides only] John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham, UK

Entities vs Properties vs Relationships (review) uPartly a matter of taste and convenience whether you think of something as being a property of one or more things or a relationship between things. l X being stupid at time T: timed property of X, or a relationship between X and T. l X having 2 legs: a property of X, or a relationship between X and 2. l X and Y being friends as a relationship between X and Y, or a property of X and/or a property of Y, or a property of the group consisting of X and Y uProperties and relationships are also, in principle, entities. But usually the entities are confined to those that we want to state properties of or relationships between.

Groups of Entities: Some Examples uA group of people going out together. uThe set of prime numbers less than 100. uA couple’s children. uThe thoughts you had yesterday. uThe industrial strikes that have occurred in the UK in the last ten years. uThe set of time instants between now and a minute from now. uYour limbs.

Groups versus Entities uAny conceivable group is in principle an entity. But it may not be included in the set of entities of interest. uWhen a group is regarded as an entity, it is possible for its members to be entities in their own right as well. uIt’s largely a matter of taste/convenience whether you regard a complex object as one entity or a group of entities or both. l Extreme example: a person could be regarded as the set of molecules in his/her body. Usually it’s not convenient to do this!

Generalization/Quantification  Don't want to refer only to particular entities.Need to have representations that are about, for example, everyone in a room, without having to list them all some unidentified buildings in a city an unidentified pen in your bag a few, several or many places you have been five of the lecturers in the School and so forth.  Case of referring to every thing with particular characteristics: UNIVERSAL generalization/quantification.  Case of referring to a or some things with particular characteristics: EXISTENTIAL generalization/quantification.

Propositional Structure  Want to be able to join statements together in various ways. John is happy AND Mary is sad John is happy OR Mary is sad IF John is happy THEN Mary is sad Mary is sad BECAUSE John is happy AFTER Mary cried, John was happy and so forth.  Need to able to negate statements. It's NOT the case that John is happy.  AND (  ), OR (  ), IF-THEN (  ), negation (  ) and some closely related things are (to some extent) captured by “Propositional" (or “Sentential”) Logic … … and that's all it captures (in its basic forms).

A Taste of “Predicate Logic”  Predicate logic adds ability to deal also with entities, properties and relationships explicitly, as well as universal generalization (  ) and existential generalization (  ).  Some examples of predicate logic expressions: happy(TheodosiaKirkbride) taller-than(TheodosiaKirkbride, MaryPoppins) criticizes(TheodosiaKirkbride, MaryPoppins, 14feb05) happy(TheodosiaKirkbride)  sad(MaryPoppins) happy(TheodosiaKirkbride)  sad(MaryPoppins)  x (is-person(x)  rich(x)   happy(x))  y (is-person(y)  rich(y)  sad(y)) uStandard predicate logic has no inbuilt facilities for other sorts of generalization or propositional structure.

Predicate Logic—The Meat uPredicate logic itself just consists of special symbols such as:        ( )  and the syntax (grammar)—how to structure expressions …  and general rules about the semantics of expressions (their meanings) …  and general procedures for doing deductive inference.  The particular symbols for entities, properties and relationships (e.g., TheodosiaKirkbride, happy, taller-than ), and their meanings,  are up to the particular representation-developer.

Aside: “Symbolic” Systems  “Neural network” systems (= “connectionist” systems) are usually contrasted to “symbolic” systems. Though the real truth is much more complex: for example, a software implementation of an NN is a symbolic system. Some types of NN systems are said to be “subsymbolic”.  But what are “symbolic” systems? One example: systems that represent and reason about things by means of predicate logic. Closely related: systems that use “semantic networks” and “frames” [next major topic in my lectures]. Another example: “rule-based systems” – these manipulate data structures of various sorts (incl. lists and logic-like expressions).