Reasoning Systems For Categories By Franklyn O. Reasoning Systems For Categories Categories are the primary building blocks of any large-scale knowledge.

Slides:



Advertisements
Similar presentations
Dr. David A Ferrucci -- Logic Programming and AI Lecture Notes Knowledge Structures Building the Perfect Object.
Advertisements

Modal Logic with Variable Modalities & its Applications to Querying Knowledge Bases Evgeny Zolin The University of Manchester
Artificial Intelligence Description Logics - Background and Motivation for DL Relation between DL and FOPL (extensional Semantics) Example.
Knowledge Representation
Artificial Intelligence Knowledge Representation
Mathematics of Cryptography Part II: Algebraic Structures
Graphical Models BRML Chapter 4 1. the zoo of graphical models Markov networks Belief networks Chain graphs (Belief and Markov ) Factor graphs =>they.
Knowledge Representation
1 Knowledge Representation We’ve discussed generic search techniques. Usually we start out with a generic technique and enhance it to take advantage of.
Semantic Nets, Frames, World Representation. Knowledge Representation as a medium for human expression An intelligent system must have KRs that can be.
Background information Formal verification methods based on theorem proving techniques and model­checking –to prove the absence of errors (in the formal.
Artificial Intelligence Lecture No. 12 Dr. Asad Ali Safi ​ Assistant Professor, Department of Computer Science, COMSATS Institute of Information Technology.
PR-OWL: A Framework for Probabilistic Ontologies by Paulo C. G. COSTA, Kathryn B. LASKEY George Mason University presented by Thomas Packer 1PR-OWL.
Objects Objects are at the heart of the Object Oriented Paradigm What is an object?
Part 6: Description Logics. Languages for Ontologies In early days of Artificial Intelligence, ontologies were represented resorting to non-logic-based.
RDF (Resource Description Framework) Why?. XML XML is a metalanguage that allows users to define markup XML separates content and structure from formatting.
Knowledge Representation Semantic Network dan Frame.
Numbers, Operations, and Quantitative Reasoning.
Ming Fang 6/12/2009. Outlines  Classical logics  Introduction to DL  Syntax of DL  Semantics of DL  KR in DL  Reasoning in DL  Applications.
Alternative representations: Semantic networks
10/17/2012ISC471/HCI571 Isabelle Bichindaritz 1 Technologies Databases.
Lecture 1 Computation and Languages CS311 Fall 2012.
Temporal Reasoning and Planning in Medicine Frame-Based Representations and Description Logics Yuval Shahar, M.D., Ph.D.
Lectures on Artificial Intelligence – CS435 Conceptual Graphs
Structured Knowledge Chapter 7. 2 Logic Notations Does logic represent well knowledge in structures?
©Ian Sommerville 2004Software Engineering, 7th edition. Chapter 14 Slide 1 Object-oriented Design.
1 Advanced Software Architecture Muhammad Bilal Bashir PhD Scholar (Computer Science) Mohammad Ali Jinnah University.
Artificial Intelligence Chapter 18. Representing Commonsense Knowledge.
Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Knowledge Representation Semantic Web - Fall 2005 Computer.
Ontology-Based Computing Kenneth Baclawski Northeastern University and Jarg.
Semantic Nets, Frames, World Representation CS – W February, 2004.
1 CS 2710, ISSP 2610 Chapter 12 Knowledge Representation.
1 Introduction to Abstract Mathematics Sets Section 2.1 Basic Notions of Sets Section 2.2 Operations with sets Section 2.3 Indexed Sets Instructor: Hayk.
Ch. 12 – Knowledge Representation Supplemental slides for CSE 327 Prof. Jeff Heflin.
Knowledge Representation
1 Logic Notations Frege’s Begriffsschrift (concept writing) : assert P not P if P then Q for every x, P(x) P P Q P P(x) x.
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?
Class Diagram Chapter 21 Applying UML and Patterns Craig Larman.
1 CS 385 Fall 2006 Chapter 7 Knowledge Representation 7.1.1, 7.1.5, 7.2.
Chapter Relations and Their Properties
ece 627 intelligent web: ontology and beyond
Christopher M. Bishop, Pattern Recognition and Machine Learning 1.
Knowledge Representation Fall 2013 COMP3710 Artificial Intelligence Computing Science Thompson Rivers University.
Formal Verification. Background Information Formal verification methods based on theorem proving techniques and model­checking –To prove the absence of.
DCMI Abstract Model Analysis Resource Model Jorge Morato– Information Ingeneering Universidad Carlos III de Madrid
Of 29 lecture 15: description logic - introduction.
Knowledge Representation. So far... The previous chapters described the technology for knowledge-based agents: – the syntax, semantics, and proof theory.
Definition and Technologies Knowledge Representation.
Math 3121 Abstract Algebra I Lecture 6 Midterm back over+Section 7.
1 Representing and Reasoning on XML Documents: A Description Logic Approach D. Calvanese, G. D. Giacomo, M. Lenzerini Presented by Daisy Yutao Guo University.
Knowledge Representation
Ch. 12 – Knowledge Representation
Ch. 10 – Knowledge Representation
Ch. 12 – Knowledge Representation
Main issues: • What do we want to build • How do we write this down
ece 720 intelligent web: ontology and beyond
Semantic Web Foundations
2. Specification and Modeling
ARTIFICIAL INTELLIGENCE
Knowledge Representation and Inference
Object-Oriented Knowledge Representation
ARTIFICIAL INTELLIGENCE
TA : Mubarakah Otbi, Duaa al Ofi , Huda al Hakami
Weak Slot-and-Filler Structures
Requirement Analysis using
Planning longer answers:
Knowledge Representation
Semantic Nets and Frames
Deniz Beser A Fundamental Tradeoff in Knowledge Representation and Reasoning Hector J. Levesque and Ronald J. Brachman.
CIS Monthly Seminar – Software Engineering and Knowledge Management IS Enterprise Modeling Ontologies Presenter : Dr. S. Vasanthapriyan Senior Lecturer.
Presentation transcript:

Reasoning Systems For Categories By Franklyn O

Reasoning Systems For Categories Categories are the primary building blocks of any large-scale knowledge representation scheme. Categories are the primary building blocks of any large-scale knowledge representation scheme. This topic describes systems specially designed for organizing and reasoning with category. This topic describes systems specially designed for organizing and reasoning with category. There are two types of Reasoning Systems There are two types of Reasoning Systems Semantic networks and description logic. Semantic networks and description logic.

Types of Reasoning Systems Semantic networks. Semantic networks provides graphical aids for visualizing a knowledge base in patterns of interconnected nodes and arcs. Semantic networks provides graphical aids for visualizing a knowledge base in patterns of interconnected nodes and arcs. It has an efficient algorithms for inferring of and object on the basis of its category membership. It has an efficient algorithms for inferring of and object on the basis of its category membership. In 1909 Charles Peirce proposed a graphical notation of nodes and arcs called existential graphs that is a visual notation for logical expressions In 1909 Charles Peirce proposed a graphical notation of nodes and arcs called existential graphs that is a visual notation for logical expressions

Semantic networks. A typical graphical notation displays objects or categories names in oval or boxes and connects them with labeled arcs. A typical graphical notation displays objects or categories names in oval or boxes and connects them with labeled arcs. For example a MemberOf link between Mary and female persons corresponds to the logical assertion Mary E (element) of female person. For example a MemberOf link between Mary and female persons corresponds to the logical assertion Mary E (element) of female person. We can connect categories using SubsetOf of links We can connect categories using SubsetOf of links A single box used to assert properties of every member of a category. A single box used to assert properties of every member of a category.

Semantic networks Semantic network notation makes it very convenient to perform inheritance reasoning. Semantic network notation makes it very convenient to perform inheritance reasoning. For example by virtue of being a person marry inherits the property of having two legs. For example by virtue of being a person marry inherits the property of having two legs. The simplicity and efficiency of this inference mechanism, compared with logical theorem has been one of the main attractions of semantic networks. The simplicity and efficiency of this inference mechanism, compared with logical theorem has been one of the main attractions of semantic networks. Inheritance becomes complicated when an object belong to more than one category Inheritance becomes complicated when an object belong to more than one category And also when a category can be a subset of more than one other category which is called multiple inheritance. And also when a category can be a subset of more than one other category which is called multiple inheritance.

Semantic networks multiple inheritance can cause the algorithm to find two or more conflicting values answering a query. multiple inheritance can cause the algorithm to find two or more conflicting values answering a query. For this reason multiple inheritance is banned in some object oriented programming like Java. For this reason multiple inheritance is banned in some object oriented programming like Java. Another form of inference is the use of inverse links. Another form of inference is the use of inverse links. For example HasSister is the inverse of SisterOf. For example HasSister is the inverse of SisterOf. Its ok to have inverse links as long as they are made into objects in their own right( Its ok to have inverse links as long as they are made into objects in their own right(

Semantic networks Semantic network provide direct indexing only for objects, categories and the links emanating from them Semantic network provide direct indexing only for objects, categories and the links emanating from them The drawback is that links between bubbles represent only one binary relation. The drawback is that links between bubbles represent only one binary relation.

Description logics They are logics notations that are designed to make it easier to describe definition and properties of categories. They are logics notations that are designed to make it easier to describe definition and properties of categories. It evolved from semantic network It evolved from semantic network The principal inference task for description logic are checking if one category is a subset of another by comparing their definition. The principal inference task for description logic are checking if one category is a subset of another by comparing their definition. By cheecking whether the membership criteria are logically certifiable. By cheecking whether the membership criteria are logically certifiable.

Description logics CLASSIC language is a typical description logic CLASSIC language is a typical description logic Any CLASSIC can be written in First Order Logic Any CLASSIC can be written in First Order Logic Description logics emphasis on tractability of inference Description logics emphasis on tractability of inference Hard problems cannot be stated or require large descrptions. Hard problems cannot be stated or require large descrptions.

ANY QUESTIONS ANY QUESTIONS