Combining Numeric and Symbolic Reasoning in SNePS Stuart C. Shapiro Department of Computer Science & Engineering Center for MultiSource Information.

Slides:



Advertisements
Similar presentations
Artificial Intelligence
Advertisements

ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Artificial Intelligence in the 21 st Century S. Lucci / D. Kopec Chapter 5: Logic in Artificial Intelligence 1.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
An F-Measure for Context-Based Information Retrieval Michael Kandefer and Stuart C. Shapiro University at Buffalo Department of Computer Science and Engineering.
CHAPTER 13 Inference Techniques. Reasoning in Artificial Intelligence n Knowledge must be processed (reasoned with) n Computer program accesses knowledge.
Artificial Intelligence CS482, CS682, MW 1 – 2:15, SEM 201, MS 227 Prerequisites: 302, 365 Instructor: Sushil Louis,
Agents That Reason Logically Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 7 Spring 2004.
Chapter Eleven Artificial Intelligence II: Operational Perspective.
Research in Knowledge Representation and Reasoning Stuart C. Shapiro Department of Computer Science & Engineering Center for MultiSource Information.
AI – CS364 Uncertainty Management Introduction to Uncertainty Management 21 st September 2006 Dr Bogdan L. Vrusias
CPSC 322 Introduction to Artificial Intelligence September 15, 2004.
M.I. Jaime Alfonso Reyes ´Cortés.  The basic task for any probabilistic inference system is to compute the posterior probability distribution for a set.
The GLAIR Cognitive Architecture Stuart C. Shapiro and Jonathan P. Bona Department of Computer Science & Engineering Center for Cognitive Science.
Knowledge Representation for Self-Aware Computer Systems Stuart C. Shapiro Department of Computer Science and Engineering, and Center for Cognitive.
S.C. Shapiro Development of a Cognitive Agent Stuart C. Shapiro Department of Computer Science and Engineering and Center for Cognitive Science.
S.C. Shapiro Endowing Agents with a Personal Sense of Time Haythem O. Ismail & Stuart C. Shapiro Department of Computer Science and Engineering.
Cassie as a Self-Aware SNePS/GLAIR Agent Stuart C. Shapiro Department of Computer Science and Engineering, and Center for Cognitive Science.
Knowledge Representation I (Propositional Logic) CSE 473.
S.C. Shapiro An Intelligent Interface to a GIS Stuart C. Shapiro Professor, CSE Director, SNePS Research Group Member, Center for Cognitive.
Semantics of a Propositional Network Stuart C. Shapiro Department of Computer Science & Engineering Center for MultiSource Information Fusion.
November 5, 2009Introduction to Cognitive Science Lecture 16: Symbolic vs. Connectionist AI 1 Symbolism vs. Connectionism There is another major division.
S.C. Shapiro Symbol-Anchoring in Cassie Stuart C. Shapiro and Haythem O. Ismail Department of Computer Science and Engineering and Center for.
Rules and Expert Systems
© 2002 Franz J. Kurfess Introduction 1 CPE/CSC 481: Knowledge-Based Systems Dr. Franz J. Kurfess Computer Science Department Cal Poly.
Theories of Mind: An Introduction to Cognitive Science Jay Friedenberg Gordon Silverman.
SNePS 3 for Ontologies Stuart C. Shapiro Department of Computer Science and Engineering, and Center for Cognitive Science University at Buffalo,
Formal Aspects of Computer Science – Week 12 RECAP Lee McCluskey, room 2/07
S.C. Shapiro An Introduction to SNePS 3 Stuart C. Shapiro Department of Computer Science and Engineering and Center for Cognitive Science State.
Artificial Intelligence Lecture No. 15 Dr. Asad Ali Safi ​ Assistant Professor, Department of Computer Science, COMSATS Institute of Information Technology.
Artificial Intelligence: Definition “... the branch of computer science that is concerned with the automation of intelligent behavior.” (Luger, 2009) “The.
Notes for Chapter 12 Logic Programming The AI War Basic Concepts of Logic Programming Prolog Review questions.
CS 4100 Artificial Intelligence Prof. C. Hafner Class Notes March 13, 2012.
Knowledge Representation Use of logic. Artificial agents need Knowledge and reasoning power Can combine GK with current percepts Build up KB incrementally.
Logical Agents Logic Propositional Logic Summary
6/4/2016 Department of Computer Science, University of Agriculture, Abeokuta, Nigeria. CSC 427:ARTIFICIAL INTELLIGENCE BY DR. A. F. ADEKOYA.
Artificial Intelligence: Introduction Department of Computer Science & Engineering Indian Institute of Technology Kharagpur.
Uncertainty Management in Rule-based Expert Systems
Uncertainty in Expert Systems
The AI War LISP and Prolog Basic Concepts of Logic Programming
Knowledge Representation and Reasoning in SNePS for Bioinformatics Stuart C. Shapiro Department of Computer Science and Engineering, and Center.
Logical Agents Chapter 7. Outline Knowledge-based agents Logic in general Propositional (Boolean) logic Equivalence, validity, satisfiability.
Artificial Intelligence CIS 342 The College of Saint Rose David Goldschmidt, Ph.D.
KNOWLEDGE BASED SYSTEMS
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
11 Artificial Intelligence CS 165A Thursday, October 25, 2007  Knowledge and reasoning (Ch 7) Propositional logic 1.
Chapter 7. Propositional and Predicate Logic Fall 2013 Comp3710 Artificial Intelligence Computing Science Thompson Rivers University.
Artificial Intelligence Knowledge Representation.
March 3, 2016Introduction to Artificial Intelligence Lecture 12: Knowledge Representation & Reasoning I 1 Back to “Serious” Topics… Knowledge Representation.
Lecture 14. Recap Problem Solving GA Simple GA Examples of Mutation and Crossover Application Areas.
Artificial Intelligence Logical Agents Chapter 7.
Knowledge Representation Techniques
Chapter 7. Propositional and Predicate Logic
TECHNOLOGY GUIDE FOUR Intelligent Systems.
CS 4700: Foundations of Artificial Intelligence
Introduction to Prolog
Knowledge Representation
EA C461 – Artificial Intelligence Logical Agent
CSE 4705 Artificial Intelligence
Biointelligence Lab School of Computer Sci. & Eng.
Artificial Intelligence: Logic agents
MGLAIR Modal Grounded Layered Architecture with Integrated Reasoning
Back to “Serious” Topics…
Biointelligence Lab School of Computer Sci. & Eng.
Chapter 7. Propositional and Predicate Logic
28th September 2005 Dr Bogdan L. Vrusias
CSC 427: ARTIFICIAL INTELLIGENCE
Representations & Reasoning Systems (RRS) (2.2)
Habib Ullah qamar Mscs(se)
basic probability and bayes' rule
Presentation transcript:

Combining Numeric and Symbolic Reasoning in SNePS Stuart C. Shapiro Department of Computer Science & Engineering Center for MultiSource Information Fusion Center for Cognitive Science University at Buffalo, The State University of New York

IF Workshop 2006S. C. Shapiro2 SNePS SNePS is a Logic-Based Frame-Based Network-Based knowledge representation, reasoning, and acting system.

IF Workshop 2006S. C. Shapiro3 This Talk The logic-based view of SNePS The SNePSLOG user interface. The recently added procedural attachment to combine numeric with symbolic reasoning.

IF Workshop 2006S. C. Shapiro4 Some SNePSLOG Syntax P(a,b) The proposition that P is true of a and b. P({a1, …, an}, {b1, …, bm}) The proposition that P is true of each ai and bj. andor(i,j){P1, …, Pn} The proposition that at least i and at most j of the Pi are true. andor(1,1){P1, …, Pn} The proposition that exactly 1 of the Pi are true. andor(0,0){P1, …, Pn} The proposition that none of the Pi are true. ~P The proposition that P is false, abbreviation of andor(0,0){P}. all(x,y,)(P(x,y) => Q(x,y)) The proposition that for every x and y, if P(x,y) then Q(x,y). all(x,y,)(P(x,y) => {Q1(x,y), … Qn(x,y)}) The proposition that for every x and y, if P(x,y) then Qi(x,y), for each i. {P1, …, Pn} &=> Q The conjunction of the Pi (solved in parallel) implies Q. P1 => (… (Pn => Q)…) The conjunction of the Pi (solved in serial) implies Q.

IF Workshop 2006S. C. Shapiro5 Procedural Attachment A predicate (proposition-forming function) symbol may be attached to a procedure so instances may be computed in the underlying programming language.

IF Workshop 2006S. C. Shapiro6 Example of Procedural Attachment : Diff(7,3,?x)? wff24!: Diff(7,3,4) : Diff(10,?x,7)? wff25!: Diff(10,3,7) : Diff(?x,5,7)? wff26!: Diff(12,5,7) : Diff(15,8,7)? wff314!: Diff(15,8,7) : Diff(15,8,9)? wff316!: ~Diff(15,8,9)

IF Workshop 2006S. C. Shapiro7 Illustration Implementing a Bayesian Network in SNePS using combined symbolic and numeric reasoning

IF Workshop 2006S. C. Shapiro8 Some Facts of Bayesian Probability in SNePSLOG P(x,p): The prior probability of x is p. Bel(x,p); The posterior probability of x is p. calculatedBel(x,p):The calculated posterior probability of x is p. all(x,p)(P(x,p) => Bel(x,p)). all(x,p)(Bel(~x,p) => all(q)(Diff(1,p,q) => Bel(x,q))). all(x,y)(andor(1,1){x,y} => all(p)(Bel(x,p) => all(q)(Diff(1,p,q) => Bel(y,q)))). all(x,p)(calculatedBel(x,p) => Bel(x,p)).

IF Workshop 2006S. C. Shapiro9 An Example Bayesian Network P(P=L) 0.90 CP(X=pos|C) T0.90 F0.20 Pollution Smoker Cancer XRay Dyspnoea From: Kevin B. Korb & Ann E. Nicholson, Bayesian Artificial Intelligence, Chapman & Hall/CRC, 2004, p. 31 ff. P(S=T) Joe: 0.30 Jane: 0.50 CP(D=T|C) T0.65 F0.30 P SP(C=T|P,S) H T0.05 H F0.02 L T0.03 L F0.001

IF Workshop 2006S. C. Shapiro10 The Patient-Independent CPTs CP(x,y,p): The conditional probability of x given y is p. JCP(x,y,z,p):The conditional probability of x given y and z is p. ExposedTo(x,v,f): x has been exposed to a v level of factor f. Does(x,a):x engages in the activity a. Has(x,d): x has the disease d. Positive(x): The procedure x gave a positive result all(x)(andor(1,1){ExposedTo(x,low,pollution), ExposedTo(x,high,pollution)}). all(x)(Patient(x) => {JCP(Has(x,cancer), ExposedTo(x,high,pollution), Does(x,smoke), 0.05), JCP(Has(x,cancer), ExposedTo(x,high,pollution), ~Does(x,smoke), 0.02), JCP(Has(x,cancer), ExposedTo(x,low,pollution), Does(x,smoke), 0.03), JCP(Has(x,cancer), ExposedTo(x,low,pollution), ~Does(x,smoke), 0.001), CP(Positive(X-ray(x)), Has(x,cancer), 0.90), CP(Positive(X-ray(x)), ~Has(x,cancer), 0.20), CP(Has(x,dyspnoea), Has(x,cancer), 0.65), CP(Has(x,dyspnoea), ~Has(x,cancer), 0.30)}).

IF Workshop 2006S. C. Shapiro11 Algorithm for calculatedBel Given an X, To find the p such that calculatedBel(X,p): Infer from the KB all Ei, pi s.t. CP(X,Ei,pi). Infer from the KB the qi s.t. Bel(Ei,qi). Set pcp to Σ i (pi * qi). Infer from the KB all E1i, E2i, pi s.t. JCP(X,E1i,E2i,pi). Infer from the KB the q1i s.t. Bel(E1i,q1i). and the q2i s.t. Bel(E2i,q2i). Set pjcp to Σ i (pi * q1i * q2i). Set p to pcp + pjcp.

IF Workshop 2006S. C. Shapiro12 The Patients and Their Priors Patient(x):x is a patient. Patient({Joe,Jane}). P(ExposedTo(Joe,low,pollution), 0.90). P(Does(Joe,smoke), 0.30). P(ExposedTo(Jane,low,pollution), 0.90). P(Does(Jane,smoke), 0.50).

IF Workshop 2006S. C. Shapiro13 Inferring Posteriors : Bel(ExposedTo(Joe,low,pollution), ?p)?; should be 0.9 wff12!: Bel(ExposedTo(Joe,low,pollution),0.9) : Bel(~Does(Joe,smoke), ?p)?; should be 0.7 wff32!: Bel(~Does(Joe,smoke),0.7) : Bel(ExposedTo(Joe,high,pollution), ?p)?; should be 0.1 wff46!: Bel(ExposedTo(Joe,high,pollution),0.1) : Bel(Has(Joe,cancer), ?p)?; should be wff90!: Bel(Has(Joe,cancer),0.011) : Bel(Positive(X-ray(Joe)), ?p)?; should be wff104!: Bel(Positive(X-ray(Joe)),0.208) : Bel(Has(Joe, dyspnoea), ?p)?; should be wff126!: Bel(Has(Joe,dyspnoea),0.304) : Bel(Has(Jane,cancer), ?p)?; should be wff280!: Bel(Has(Jane,cancer),0.017) : Bel(Positive(X-ray(Jane)), ?p)? ; should be wff294!: Bel(Positive(X-ray(Jane)),0.212) : Bel(Has(Jane, dyspnoea), ?p)?; should be wff377!: Bel(Has(Jane,dyspnoea),0.306)

IF Workshop 2006S. C. Shapiro14 Conclusions SNePS uses procedural attachment to combine numeric with symbolic reasoning. –New attached procedures may be added by the KE. Strengths of symbolic reasoning: –Representation of, and reasoning about general cases. –Instantiating multiple specific cases. –Clarity of declarative statements. Strengths of numerical reasoning: –Complicated numerical calculations. –Especially sums and products of series. –Sometimes faster than logical deduction.