Introduction to AI & AI Principles (Semester 1) WEEK 7 John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham,

Slides:



Advertisements
Similar presentations
Basic Terms in Logic Michael Jhon M. Tamayao.
Advertisements

1 Knowledge Representation Introduction KR and Logic.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Truth Tables The aim of this tutorial is to help you learn to construct truth tables and use them to test the validity of arguments. Go To Next Slide.
Logic Use mathematical deduction to derive new knowledge.
Knowledge Representation
Computation and representation Joe Lau. Overview of lecture What is computation? Brief history Computational explanations in cognitive science Levels.
Philosophy 120 Symbolic Logic I H. Hamner Hill CSTL-CLA.SEMO.EDU/HHILL/PL120.
Copyright © Cengage Learning. All rights reserved. CHAPTER 1 SPEAKING MATHEMATICALLY SPEAKING MATHEMATICALLY.
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.
Formalizing Alpha: Soundness and Completeness Bram van Heuveln Dept. of Cognitive Science RPI.
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 7 (07/08) [Barnden’s slides only] John Barnden Professor of Artificial Intelligence School of Computer.
1 Chapter 7 Propositional and Predicate Logic. 2 Chapter 7 Contents (1) l What is Logic? l Logical Operators l Translating between English and Logic l.
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.
Introduction to AI & AI Principles (Semester 1) WEEK 11 John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham,
Theories of Mind: An Introduction to Cognitive Science Jay Friedenberg Gordon Silverman.
Propositional Logic Reasoning correctly computationally Chapter 7 or 8.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Knowledge representation
Introduction to Proofs
Artificial Intelligence 4. Knowledge Representation Course V231 Department of Computing Imperial College, London © Simon Colton.
1 Chapter 7 Propositional and Predicate Logic. 2 Chapter 7 Contents (1) l What is Logic? l Logical Operators l Translating between English and Logic l.
1 Knowledge Based Systems (CM0377) Lecture 4 (Last modified 5th February 2001)
Declarative vs Procedural Programming  Procedural programming requires that – the programmer tell the computer what to do. That is, how to get the output.
CMPF144 FUNDAMENTALS OF COMPUTING THEORY Module 5: Classical Logic.
LOGIC AND ONTOLOGY Both logic and ontology are important areas of philosophy covering large, diverse, and active research projects. These two areas overlap.
Artificial Intelligence By Michelle Witcofsky And Evan Flanagan.
Course Overview and Road Map Computability and Logic.
1 Predicate (Relational) Logic 1. Introduction The propositional logic is not powerful enough to express certain types of relationship between propositions.
Albert Gatt LIN3021 Formal Semantics Lecture 4. In this lecture Compositionality in Natural Langauge revisited: The role of types The typed lambda calculus.
Programming Languages and Design Lecture 3 Semantic Specifications of Programming Languages Instructor: Li Ma Department of Computer Science Texas Southern.
Copyright © Cengage Learning. All rights reserved.
Great Theoretical Ideas in Computer Science.
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.
Some Thoughts to Consider 8 How difficult is it to get a group of people, or a group of companies, or a group of nations to agree on a particular ontology?
Incompleteness. System Relativity Soundness and completeness are properties of particular logical systems. There’s no sense to be made of the claim that.
Chapter 7. Propositional and Predicate Logic Fall 2013 Comp3710 Artificial Intelligence Computing Science Thompson Rivers University.
1 Lecture 3 The Languages of K, T, B and S4. 2 Last time we extended the language PC to the language S5 by adding two new symbols ‘□’ (for ‘It is necessary.
From NARS to a Thinking Machine Pei Wang Temple University.
Artificial Intelligence Knowledge Representation.
COMPUTER SYSTEM FUNDAMENTAL Genetic Computer School INTRODUCTION TO ARTIFICIAL INTELLIGENCE LESSON 11.
Section 1.7. Section Summary Mathematical Proofs Forms of Theorems Direct Proofs Indirect Proofs Proof of the Contrapositive Proof by Contradiction.
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 7. Propositional and Predicate Logic
CS 4700: Foundations of Artificial Intelligence
A I (Artificial Intelligence)
The function of knowledge representation scheme is
CS 4700: Foundations of Artificial Intelligence
Knowledge Representation
Philosophy of Mathematics 1: Geometry
Great Theoretical Ideas in Computer Science
Course Instructor: knza ch
Logic Use mathematical deduction to derive new knowledge.
TA : Mubarakah Otbi, Duaa al Ofi , Huda al Hakami
Chapter 7. Propositional and Predicate Logic
CSNB234 ARTIFICIAL INTELLIGENCE
ece 720 intelligent web: ontology and beyond
Deniz Beser A Fundamental Tradeoff in Knowledge Representation and Reasoning Hector J. Levesque and Ronald J. Brachman.
Representations & Reasoning Systems (RRS) (2.2)
Habib Ullah qamar Mscs(se)
Presentation transcript:

Introduction to AI & AI Principles (Semester 1) WEEK 7 John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham, UK

REVIEW

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.

NEW for Week 7

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.

Truth Values in Logic (Part of the Semantics)  Each formula (i.e., expression that makes a statement) is considered to be either TRUE (T) or FALSE (F).  This is the formula's truth value (sometimes called its valuation).  Formulas with propositional structure have their truth values determined rigorously by the truth values of their subformulas.  Related principles handle generalization.  There is no middle ground between TRUE and FALSE.  Clearly, this definiteness is a problem, in the case of many types of statement.

Representing States at Different Times  Standard logic has no inbuilt facility for changes of truth value because of changes in the represented world.  So, the formulas are either about matters that are unchanging by their very nature (“eternal” matters): 91 is prime  or are implicitly about some particular “time-slice” of the represented world: Mary has three cars  or are explicitly about some particular time-slice: On 22 Feb 2005 at 10am, Mary had three cars.

Changing One’s Mind  Equally, standard logic does not itself contain any mechanism for a system changing its mind about the truth of something, e.g changing its mind about whether 91 is a prime number or not, or about whether Mary has three cars at 10am on 22 Feb  However, in an AI system, formulas can be made to change in truth-value (either because of world change or system changing its mind, or both), if special, extra mechanisms are added.

Why Logic Has Been Proposed uDesire to capture human rationality. uDesire for general-purpose representation/reasoning approach. l General purpose in terms of both subject matter and role in cognition (info from vision, sentence meanings, internal memory, …)  Desire for common format for explaining what is going on in other representation/reasoning approaches.

Rationality uMuch concentration in history on people as (in part) rational beings. uRationality as involving sound reasoning (deduction) l i.e. reasoning where truth of outputs is guaranteed by truth of inputs. uAnalysis of deduction, leading to development of standard logics as (supposedly) important descriptors of human thought. uSpillover of the results, and some of the thinking behind it, into AI. uStandard logic does not have inbuilt facilities for unsound reasoning (involving uncertainty, assumptions, abduction, induction, analogy, …) even though this is crucial in real life … uIt’s quite difficult to add such facilities, but there have been many proposals.

“General-Purpose” Aim  Reaction to: completely ad hoc, special-purpose representations, and representation styles, created for specific tasks, specific types of task or specific types of information. Consequence of such representations: Duplication of representational design effort when approaching a new problem. Difficulty of learning transferrable lessons about representational design. Need for creating tailored reasoning methods to cope with the specialized representations.  A single AI system may need to deal with a wide variety of tasks and types of information, perhaps all mixed up together. Having disparate representation styles for different types of information causes problems

“General-Purpose” Aim: Caveats  But this doesn't mean that AI systems should not use specialized approaches at all, or that you can't have mixes of styles. Could well be a good idea. NB: human use of different representational styles for different things: natural language, specialized (e.g., technical) forms of natural language, mathematical notation, diagrams, pictures, musical notation,..., and we're quite used to mixing these with each other … even mixing different natural languages.  Logic has quite severe limitations as regards both representation and reasoning, and is more suited to some things than others. So, “general purpose” is merely an aspiration.

“Common Format” Aim  The variety of proposed special-purpose representations, and the complications in some of them,  make it convenient to have a relatively simple, relatively standard language into which to (theoretically) translate them, in order to see how well conceived they are compare their advantages and disadvantages find, possibly, a quicker route to developing meaning principles, reasoning schemes and mathematical results about them.  Having a standard representation/reasoning style eases communication between researchers.

Now for “Semantic Networks” and “Frames”: see Bullinaria’s slides for week 6 uApart from readings mentioned there, see pp in Callan.