S.C. Shapiro An Introduction to SNePS 3 Stuart C. Shapiro Department of Computer Science and Engineering and Center for Cognitive Science State.

Slides:



Advertisements
Similar presentations
Artificial Intelligence in the 21 st Century S. Lucci / D. Kopec Chapter 5: Logic in Artificial Intelligence 1.
Advertisements

The Logic of Intelligence Pei Wang Department of Computer and Information Sciences Temple University.
SPECIFYING MODALITIES IN THE MGLAIR ARCHITECTURE Stuart C. Shapiro and Jonathan P. Bona Department of Computer Science and Engineering And Center for Cognitive.
S.C. Shapiro Knowledge Representation and Reasoning Stuart C. Shapiro Professor, CSE Director, SNePS Research Group Member, Center for Cognitive.
Knowledge Representation
Research in Knowledge Representation and Reasoning Stuart C. Shapiro Department of Computer Science & Engineering Center for MultiSource Information.
INTRODUCTION TO ARTIFICIAL INTELLIGENCE Massimo Poesio LECTURE 4: Semantic Networks and Description Logics.
Research topics Semantic Web - Spring 2007 Computer Engineering Department Sharif University of Technology.
CPSC 322, Lecture 19Slide 1 Propositional Logic Intro, Syntax Computer Science cpsc322, Lecture 19 (Textbook Chpt ) February, 23, 2009.
The GLAIR Architecture for Cognitive Robotics Stuart C. Shapiro Department of Computer Science & Engineering and Center for Cognitive Science.
The GLAIR Cognitive Architecture and Prospects for Consciousness Stuart C. Shapiro Department of Computer Science & Engineering and Center.
A Categorization of Contextual Constraints Michael Kandefer and Stuart C. Shapiro University at Buffalo Department of Computer Science and Engineering.
Ontologies and the Semantic Web by Ian Horrocks presented by Thomas Packer 1.
The GLAIR Cognitive Architecture Stuart C. Shapiro and Jonathan P. Bona Department of Computer Science & Engineering Center for Cognitive Science.
The GLAIR Architecture for Cognitive Robots Stuart C. Shapiro Department of Computer Science & Engineering and 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.
Combining Numeric and Symbolic Reasoning in SNePS Stuart C. Shapiro Department of Computer Science & Engineering Center for MultiSource Information.
S.C. Shapiro Endowing Agents with a Personal Sense of Time Haythem O. Ismail & Stuart C. Shapiro Department of Computer Science and Engineering.
Symbolic Representation and Reasoning an Overview Stuart C. Shapiro Department of Computer Science and Engineering, Center for Multisource.
S.C. Shapiro Knowledge Representation for Natural Language Competence Stuart C. Shapiro Department of Computer Science and Engineering and.
Cassie as a Self-Aware SNePS/GLAIR Agent Stuart C. Shapiro Department of Computer Science and Engineering, and Center for Cognitive Science.
Research in Knowledge Representation, Reasoning, and Acting Stuart C. Shapiro Professor, CSE Affiliated Professor, Linguistics, Philosophy.
S.C. Shapiro Knowledge Representation and Reasoning Stuart C. Shapiro Professor, CSE Director, SNePS Research Group Member, Center for Cognitive.
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.
S.C. Shapiro Symbol-Anchoring in Cassie Stuart C. Shapiro and Haythem O. Ismail Department of Computer Science and Engineering and Center for.
© 2002 Franz J. Kurfess Introduction 1 CPE/CSC 481: Knowledge-Based Systems Dr. Franz J. Kurfess Computer Science Department Cal Poly.
Description Logics. Outline Knowledge Representation Knowledge Representation Ontology Language Ontology Language Description Logics Description Logics.
A Logic of Arbitrary and Indefinite Objects Stuart C. Shapiro Department of Computer Science and Engineering, and Center for Cognitive Science.
Lecture 32 Inheritance COMP1681 / SE15 Introduction to Programming.
Semantics For the Semantic Web: The Implicit, the Formal and The Powerful Amit Sheth, Cartic Ramakrishnan, Christopher Thomas CS751 Spring 2005 Presenter:
S.C. Shapiro Symbol Anchoring in a Grounded Layered Architecture with Integrated Reasoning Stuart C. Shapiro Department of Computer Science.
SNePS 3 for Ontologies Stuart C. Shapiro Department of Computer Science and Engineering, and Center for Cognitive Science University at Buffalo,
S.C. Shapiro The SNePS Approach to Cognitive Robotics Stuart C. Shapiro Department of Computer Science and Engineering and Center for Cognitive.
Research in Knowledge Representation, Reasoning, and Acting Stuart C. Shapiro Professor, CSE Director, Center for Cognitive Science Director,
© 2001 Franz J. Kurfess Introduction 1 CPE/CSC 580: Knowledge Management Dr. Franz J. Kurfess Computer Science Department Cal Poly.
A Logic of Arbitrary and Indefinite Objects Stuart C. Shapiro Department of Computer Science and Engineering, and Center for Cognitive Science.
Research in Knowledge Representation, Reasoning, and Acting Stuart C. Shapiro Professor, CSE Affiliated Professor, Linguistics, Philosophy.
Chapter 6: Objections to the Physical Symbol System Hypothesis.
Knowledge Representation and Reasoning University "Politehnica" of Bucharest Department of Computer Science Fall 2010 Adina Magda Florea
CSE4/563: Knowledge Representation Recitation September 13, 2010 “Intelligence is the art of good guesswork.” –H.B. Barlow.
Ming Fang 6/12/2009. Outlines  Classical logics  Introduction to DL  Syntax of DL  Semantics of DL  KR in DL  Reasoning in DL  Applications.
Inference Graphs: A Roadmap Daniel R. Schlegel and Stuart C. Department of Computer Science and Engineering L A – Logic of Arbitrary.
1 Knowledge Based Systems (CM0377) Lecture 4 (Last modified 5th February 2001)
NATURAL LANGUAGE UNDERSTANDING FOR SOFT INFORMATION FUSION Stuart C. Shapiro and Daniel R. Schlegel Department of Computer Science and Engineering Center.
LOGIC AND ONTOLOGY Both logic and ontology are important areas of philosophy covering large, diverse, and active research projects. These two areas overlap.
Concurrent Inference Graphs Daniel R. Schlegel Department of Computer Science and Engineering Problem Summary Inference graphs 2 in their current form.
Computing & Information Sciences Kansas State University Wednesday, 20 Sep 2006CIS 490 / 730: Artificial Intelligence Lecture 12 of 42 Wednesday, 20 September.
COGNITIVE SEMANTICS: INTRODUCTION DANA RETOVÁ CSCTR2010 – Session 1.
Kansas State University Department of Computing and Information Sciences CIS 730: Introduction to Artificial Intelligence Lecture 11 of 41 Wednesday, 15.
Kansas State University Department of Computing and Information Sciences CIS 730: Introduction to Artificial Intelligence Lecture 13 of 41 Monday, 20 September.
Computing & Information Sciences Kansas State University Lecture 13 of 42 CIS 530 / 730 Artificial Intelligence Lecture 13 of 42 William H. Hsu Department.
Formal Methods in Software Engineering 1
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Programming Languages and Design Lecture 3 Semantic Specifications of Programming Languages Instructor: Li Ma Department of Computer Science Texas Southern.
Artificial Intelligence 2004 Ontology
Knowledge Representation and Reasoning in SNePS for Bioinformatics Stuart C. Shapiro Department of Computer Science and Engineering, and Center.
Computing & Information Sciences Kansas State University Monday, 25 Sep 2006CIS 490 / 730: Artificial Intelligence Lecture 14 of 42 Monday, 25 September.
Basic Concepts of Logic An Overview of Introduction to Logic Yingrui Yang
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?
Computing & Information Sciences Kansas State University Lecture 12 of 42 CIS 530 / 730 Artificial Intelligence Lecture 12 of 42 William H. Hsu Department.
1-1 1 Introduction  Programming linguistics: concepts and paradigms syntax, semantics, and pragmatics language processors.  Historical development of.
Definition and Technologies Knowledge Representation.
Computing & Information Sciences Kansas State University Monday, 18 Sep 2006CIS 490 / 730: Artificial Intelligence Lecture 11 of 42 Monday, 18 September.
Ontology From Wikipedia, the free encyclopedia
Probabilistic Horn abduction and Bayesian Networks
CSE 4705 Artificial Intelligence
MGLAIR Modal Grounded Layered Architecture with Integrated Reasoning
Representations & Reasoning Systems (RRS) (2.2)
Presentation transcript:

S.C. Shapiro An Introduction to SNePS 3 Stuart C. Shapiro Department of Computer Science and Engineering and Center for Cognitive Science State University of New York at Buffalo

S.C. Shapiro Outline Setting Basic SNePS Principles Examples 4 Kinds of Inference Summary

S.C. Shapiro Parentage of SNePS 3 SNePS 2.5 ANALOG –Structured (Conceptually Complete) Variables Currently being implemented –in CLOS and/or Java.

S.C. Shapiro SNePS KRR Style Network-based Logic-based Intended as the LOT of a NL-competent cognitive agent.

S.C. Shapiro Outline Setting Basic SNePS Principles Examples 4 Kinds of Inference Summary

S.C. Shapiro Basic SNePS Principles A Summary of Syntax and Semantics Propositional Semantic Network Term Logic Intensional Representation Uniqueness Principle Paraconsistent Logic.

S.C. Shapiro Propositional Semantic Network The only well-formed SNePS expressions are nodes. –Arcs do not have semantics Do not have assertional import

S.C. Shapiro Term Logic Every well-formed SNePS expression is a term. –Even propositions are denoted by terms. –Propositions can be arguments without leaving first- order logic.

S.C. Shapiro Intensional Representation SNePS terms represent (denote) intensional (mental) entities. –Cognitively distinct entities denoted by distinct terms Even if co-extensional –Every term denotes a mental entity. No term for purely technical reasons

S.C. Shapiro Uniqueness Principle No two SNePS terms denote the same entity. –Syntactically distinct terms are semantically distinct. –Full structure sharing.

S.C. Shapiro Paraconsistent Logic A contradiction does not imply anything whatsoever. –A contradiction in one subdomain does not corrupt another.

S.C. Shapiro Outline Setting Basic SNePS Principles Examples 4 Kinds of Inference Summary

S.C. Shapiro Example: Term Logic & Conceptual Relations

S.C. Shapiro Example SNePS Ontology

S.C. Shapiro Example SNePS Ontology

S.C. Shapiro Example SNePS Ontology

S.C. Shapiro Example SNePS Ontology

S.C. Shapiro Example SNePS Ontology

S.C. Shapiro Example SNePS Ontology

S.C. Shapiro Cassie talks to Stu

S.C. Shapiro Outline Setting Basic SNePS Principles Examples 4 Kinds of Inference Summary

S.C. Shapiro Wire-Based Inference

S.C. Shapiro Wire-Based Inference

S.C. Shapiro Path-Based Inference

S.C. Shapiro Path-Based Inference member class

S.C. Shapiro Path-Based Inference

S.C. Shapiro Node-Based Inference If B1 is a talking robot, then B1 is intelligent.

S.C. Shapiro Node-Based Inference

S.C. Shapiro Node-Based Inference

S.C. Shapiro Node-Based Inference

S.C. Shapiro SNePS 2.5 Generic Version

S.C. Shapiro Subsumption Inference

S.C. Shapiro Outline Setting Basic SNePS Principles Examples 4 Kinds of Inference Summary

S.C. Shapiro Summary SNePS: a Logic- and Network-Based KRR with its own Syntax, Semantics, Proof Theory SNePS 3 has 4 kinds of inference –Wire-based –Path-based –Node-based –Subsumption SNePS 3 is currently being implemented.

S.C. Shapiro SNeRG Home Page

S.C. Shapiro Wire-Based Inference Assume (define-relation :name“member” :typeentity :adjustreduce :limit1)

S.C. Shapiro Path-Based Inference Assume (define-path class (compose class (kstar (compose subclass- ! superclass)))

S.C. Shapiro Node-Based Inference E.g. Using and-entailment {P 1, …, P n } &=> {Q 1, …, Q m }