OWL Basics. Technologies for the Semantic Web. Building a Semantic Web. Ontology
|
|
- Kellie Bruce
- 5 years ago
- Views:
Transcription
1 Technologies for the Semantic Web OWL Basics COMP60421 Sean Bechhofer University of Manchester Metadata Resources are marked-up with descriptions of their content. No good unless everyone speaks the same language; Terminologies provide shared and common vocabularies of a domain, so search engines, agents, authors and users can communicate. No good unless everyone means the same thing; Ontologies provide a shared and common understanding of a domain that can be communicated across people and applications, and will play a major role in supporting information exchange and discovery. 1 2 Building a Semantic Web Ontology Annotation Associating metadata with resources Integration Integrating information sources Inference Reasoning over the information we have. Could be light-weight (taxonomy) Could be heavy-weight (logic-style) Interoperation and Sharing are key goals A representation of the shared background knowledge for a community Providing the intended meaning of a formal vocabulary used to describe a certain conceptualisation of objects in a domain of interest In CS, ontology taken to mean an engineering artefact A vocabulary of terms plus explicit characterisations of the assumptions made in interpreting those terms Nearly always includes some notion of hierarchical classification (is-a) Richer languages allow the definition of classes through description of their characteristics Introduce the possibility of using inference to help in management and deployment of the knowledge. 3 4
2 Toward Formalization What is a Taxonomy? Acquisition Process Elicit tacit knowledge A Set of terms/concepts More explicit information Hierarchy and other relations Categorizing (modifiers) Constraints and definitions An organisation of entities Typically hierarchical subclass relationships Organisationally Rigid Things must be put in their proper place. Multiple places for things? Mammal Animal Domestic Hierarchical Relations Nodes/Arcs representing a relationship (default IS-A) What IS-A Is and Isn t: An Analysis of Taxonomic Links in Semantic Networks (Brachman) 5 Cat Cow Dog Person Pet Farmed Impoverished descriptions Cats are carnivores Why? What is it to be a Carnivore? Cat Dog Cow What if we say something is a Carnivore and a Herbivore? 6 More Expressivity Structure of an Ontology Not just term-term relationships Definitions A carnivore is an an animal that eats only meat Constraints Carnivores are not herbivores (and vice versa) What Entailments can we make? Carnivores eat only Meat Cats eat only Mice Mice are Meat Thus Cats are Carnivores! Ontologies typically have two distinct components: Names for important concepts in the domain Paper is a concept whose members are papers. Person is a concept whose members are persons Background knowledge/constraints on the domain A Paper is a kind of ArgumentativeDocument All participants in a Workshop must be Persons. No individual can be both an InProceedings and a Journal Syntax required to allow us to state/express/write down this information Operators that allow us to describe complex expressions 7 8
3 Object Oriented Models Formal Languages Many languages use an object oriented model with Objects/Instances/Individuals Elements of the domain of discourse Possibly allowing descriptions of classes Types/Classes/Concepts Sets of objects sharing certain characteristics Relations/Properties/Roles Sets of pairs (tuples) of objects Such languages are/can be: Well understood Formally specified (Relatively) easy to use Amenable to machine processing The degree of formality of ontology languages varies widely Increased formality makes languages more amenable to machine processing (e.g. automated reasoning). The formal semantics provides an unambiguous interpretation of the descriptions Why Semantics? What does an expression in an ontology language mean? The semantics of a language can tell us precisely how to interpret a complex expression. Well defined semantics are vital if we are to support machine interpretability They remove ambiguities in the interpretation of the descriptions. Telephone? Black 11 OWL: The Web Ontology Language The W3C OWL 2 Web Ontology Language (OWL) is a Semantic Web language designed to represent rich and complex knowledge about things, groups of things, and relations between things. OWL is a computational logicbased language such that knowledge expressed in OWL can be reasoned with by computer programs either to verify the consistency of that knowledge or to make implicit knowledge explicit. OWL documents, known as ontologies, can be published in the World Wide Web and may refer to or be referred from other OWL ontologies. OWL is part of the W3C's Semantic Web technology stack, which includes RDF [RDF Concepts] and SPARQL [SPARQL]. 12
4 OWL Ontologies Diversion: Semantics and Model Theories Classes, Properties and Individuals Individuals Elements in the domain Things, objects Classes Collections of things Primitive, named classes Class descriptions built up from other classes using class forming operators. Properties (Binary) Relations between objects Axioms represent background knowledge/constraints Ontology/KR languages aim to model (part of) world Terms in language correspond to entities in world Meaning given by, e.g.: Mapping to another formalism, such as FOL, with own well defined semantics or a bespoke Model Theory (MT) MT defines relationship between syntax and interpretations Can be many interpretations (models) of one piece of syntax Models supposed to be analogue of (part of) world! E.g., elements of model correspond to objects in world Formal relationship between syntax and models! Structure of models reflect relationships specified in syntax Inference can then be defined in terms of this Model Theory Set Based Model Theory Set Based Model Theory Example Many logics (including standard First Order Logic) use a model theory based on Zermelo-Frankel set theory The domain of discourse (i.e., the part of the world being modelled) is represented as a set (often referred to as!) Objects in the world are interpreted as elements of! Classes/concepts (unary predicates) are subsets of! Properties/roles (binary predicates) are subsets of!!! (i.e.,! 2 ) Ternary predicates are subsets of! 3 etc. The sub-class relationship between classes can be interpreted as set inclusion World Model Daisy:Cow Cow kindof Animal Mary: Person Person kindof Animal Interpretation a! Z123ABC: Car Mary drives Z123ABC b {"a,b#, } $!!! 15 16
5 Set Based Model Theory Example Formally, the vocabulary is the set of names we use in our model of (part of) the world {Daisy, Cow, Animal, Mary, Person, Z123ABC, Car, drives, } An interpretation I is a tuple <!,I>! is the domain (a set) I is a mapping that maps! Names of objects to elements of!! Names of unary predicates (classes/concepts) to subsets of!! Names of binary predicates (properties/roles) to subsets of! X!! And so on for higher arity predicates (if any) Direct OWL Semantics OWL semantics defined by interpretations: <!,I>, where! is the domain (a non-empty set) I is an interpretation function that maps:! Class name A % subset A I of!! Property name R % binary relation R I over!! Individual name i % i I element of! Interpretation function I tells us how to interpret atomic classes, properties and individuals. The semantics of class operators is given by extending the interpretation function in an obvious way OWL Class Constructors OWL Class Constructors Constructor Example Interpretation Constructor Example Interpretation Atomic Class Human Human I and Human and Male Human I & Male I or Doctor or Lawyer Doctor I ' Lawyer I R some C haschild some Lawyer {x (y."x,y#)haschild I * y)lawyer I } R only C haschild only Doctor {x +y."x,y#)haschild I, y)doctor I } R min n haschild min 2 {x #"x,y#)haschild I - 2} not not Male! \ Male I R max n haschild max 2 {x #"x,y#)haschild I. 2} {} {john,mary} {john I, mary I } 19 20
6 Interpretation Example OWL Knowledge Bases (Ontologies) A I = {v, w, x} B I = {x, y} R I = {(v, w), (v, x), (y, x), (x, z)} not B = A and B = not A or B = R some B = R only B = R some (R some A) = R some not(a or B) = R min 1 = R max 1 = y v x w z A I B I An OWL ontology is a collection of axioms that describe the model. Axioms allow us to add further statements about arbitrary concept expressions and properties An Ontology/Knowledge Base is often split into two parts T-box is a set of axioms of the form:! C SubClassOf D (subclass)! C EquivalentTo D (class equivalence)! R SubPropertyOf S (subproperty)! R EquivalentTo S (property equivalence)!... A-box is a set of axioms of the form! x Type: C (concept instantiation)! "x,y# ) R (role instantiation) OWL doesn t formally make this distinction Ontology Semantics OWL Class Axioms The interpretation function I can be extended to axioms. An interpretation I then satisfies (models) an axiom A iff the interpretation of the axiom holds in the interpretation I satisfies an ontology O iff I satisfies every axiom A in O Axiom Example Interpretation SubClassOf Human subclassof: Animal Human I $ Animal I The collection of axioms constrain the possible interpretations that can be made. EquivalentTo Man EquivalentTo: Human and Male Man I = Human I & Male I DisjointWith Animal DisjointWith: Plant Animal I & Plant I = / 23 24
7 OWL Individual Axioms OWL Property Axioms Axiom Example Interpretation Axiom Example Interpretation Types Sean Types: Human Sean I ) Human I SubPropertyOf: hasmother SubPropertyOf: hasparent hasmother I $ hasparent I Facts Sean Facts: workswith Bijan "Sean I,Bijan I #)workswith I functional employedby Characteristics: Functional +x,y,z. ("x,y#)employedby I * "x,z#)employedby I ), y = z DifferentFrom Sean DifferentFrom: Bijan Sean I " Bijan I domain owns Domain: Person +x."x,y#)owns I, x)person I SameAs GeorgeWBush SameAs: PresidentBush GeorgeWBush I = PresidentBush I range employs Range: Person +y."x,y#)employs I, y)person I transitivity haspart Characteristics: Transitive +x,y,z. ("x,y#)haspart I * "y,z#)haspart I ), "x,z#)haspart I Multiple Models -v- Single Model Example of Multiple Models KB = {} An OWL Ontology doesn t define a single model, it is a set of constraints that define a set of possible models No constraints (empty Ontology) means any model is possible More constraints means fewer models Too many constraints may mean no possible model (inconsistent Ontology) In contrast, DBs (and frame/rule KR systems) make assumptions such that DB/KB defines a single model Unique name assumption! Different names always interpreted as different individuals Closed world assumption! Domain consists only of individuals named in the DB/KB Minimal models! Extensions are as small as possible KB = {a:c, b:d, c:c, d:e} KB = {a:c, b:d, c:c, d:e, b:c} KB = {a:c, b:d, c:c, d:e, b:c D subclassof C} KB = {a:c, b:d, c:c, d:e, b:c D subclassof C, E subclassof C} KB = {a:c, b:d, c:c, d:e, b:c D subclassof C E subclassof C, d: not C} I 1 : C I = {v, w, y} D I = {x, y} E I = {z} a I = v b I = x c I = w d I = y I 3 : C I = {v, w, y} D I = {x, y} E I = {z} a I = v b I = y c I = w d I = z I 2 : C I = {v, w, y} D I = {x, y} E I = {z} a I = v b I = x c I = w d I = z I 4 : C I = {v, w, x, y} D I = {x, y} E I = {z} a I = v b I = x c I = y d I = z 27 28
8 Example of Single Model Single Model -v- Multiple Model KB = {} KB = {a:c, b:d, c:c, d:e} KB = {a:c, b:d, c:c, d:e, b:c} KB = {a:c, b:d, c:c, d:e, b:c E subclassof C} I:! = {} I:! = {a, b, c, d} C I = {a, b, c} D I = {b} E I = {d} a I = a b I = b c I = c d I = d I:! = {a, b, c, d} C I = {a, c} D I = {b} E I = {d} a I = a b I = b c I = c d I = d I:! = {a, b, c, d} C I = {a, b, c, d} D I = {b} E I = {d} a I = a b I = b c I = c d I = d Multiple models: Expressively powerful Boolean connectives, including not and or Can capture incomplete information E.g., using or and some Monotonic Adding information preserves truth Reasoning (e.g., querying) is hard/slow Queries may give counterintuitive results in some cases Single model: Expressively weaker (in most respects) No negation or disjunction Can t capture incomplete information Nonmonotonic Adding information does not preserve truth Reasoning (e.g., querying) is easy/fast Queries may give counterintuitive results in some cases Inference Reasoning An OWL Ontology is a set of constraints that define a set of possible models We may be able to determine that particular properties must hold of this set of models. This allows us to draw inferences. Knowledge is correct (captures intuitions) D subsumes C w.r.t. O iff for every model I of O, C I $ D I Knowledge is minimally redundant (no unintended synonyms) C is equivalent to D w.r.t. O iff for every model I of O, C I = D I Knowledge is meaningful (classes can have instances) C is satisfiable w.r.t. O iff there exists some model I of O s.t. C I " / Querying knowledge x is an instance of C w.r.t. O iff for every model I of O, x I ) C I <x,y> is an instance of R w.r.t. K iff for, every model I of O, (x I,y I ) ) R I Ontology consistency An ontology O is consistent iff there exists some model I of O 31 Tableau algorithms used to test satisfiability (consistency) Try to build a tree-like model I of the input concept C Decompose C syntactically Apply tableau expansion rules Infer constraints on elements of model Tableau rules correspond to constructors in logic (and, or etc) Some rules are nondeterministic (e.g., or, min) In practice, this means search Stop when no more rules applicable or clash occurs Clash is an obvious contradiction, e.g., A(x), not A(x) Cycle check (blocking) may be needed for termination C satisfiable iff rules can be applied such that a fully expanded clash free tree is constructed 32
9 Defining OWL OWL Resources OWL is defined via a Structural Specification Defines language independently of concrete syntaxes Conceptual structure and abstract syntax UML diagrams and functional-style syntax used to define the language Mappings to concrete syntaxes then given. The structural specification provides the foundation for implementations (e.g. OWL API as discussed later) The OWL Technical Documentation is all available online from the W3C site. All the OWL documents are relevant, but in particular the Overview, Primer, Reference Guide and Manchester Syntax Guide will help you in the initial stages
OWL Semantics. COMP60421 Sean Bechhofer University of Manchester
OWL Semantics COMP60421 Sean Bechhofer University of Manchester sean.bechhofer@manchester.ac.uk 1 Technologies for the Semantic Web Metadata Resources are marked-up with descriptions of their content.
More informationOWL Semantics COMP Sean Bechhofer Uli Sattler
OWL Semantics COMP62342 Sean Bechhofer sean.bechhofer@manchester.ac.uk Uli Sattler uli.sattler@manchester.ac.uk 1 Toward Knowledge Formalization Acquisition Process Elicit tacit knowledge A set of terms/concepts
More informationTeil III: Wissensrepräsentation und Inferenz. Kap.11: Beschreibungslogiken
Vorlesung Künstliche Intelligenz Wintersemester 2006/07 Teil III: Wissensrepräsentation und Inferenz Kap.11: Beschreibungslogiken Mit Material von Carsten Lutz, Uli Sattler: http://www.computationallogic.org/content/events/iccl-ss-
More informationWeek 4. COMP62342 Sean Bechhofer, Uli Sattler
Week 4 COMP62342 Sean Bechhofer, Uli Sattler sean.bechhofer@manchester.ac.uk, uli.sattler@manchester.ac.uk Today Some clarifications from last week s coursework More on reasoning: extension of the tableau
More informationFirst Order Logic: Syntax and Semantics
CS1081 First Order Logic: Syntax and Semantics COMP30412 Sean Bechhofer sean.bechhofer@manchester.ac.uk Problems Propositional logic isn t very expressive As an example, consider p = Scotland won on Saturday
More informationIntroduzione alle logiche descrittive
Introduzione alle logiche descrittive I principali formalismi di KR Reti semantiche Sistemi a Frame Sistemi di Produzione FOL (First Order Logic) e vari altri linguaggi logici Logiche descrittive Le logiche
More informationAn Introduction to Description Logics
An Introduction to Description Logics Marco Cerami Palacký University in Olomouc Department of Computer Science Olomouc, Czech Republic Olomouc, 21.11.2013 Marco Cerami (UPOL) Description Logics 21.11.2013
More informationDescription logics. Description Logics. Applications. Outline. Syntax - AL. Tbox and Abox
Description Logics Description logics A family of KR formalisms, based on FOPL decidable, supported by automatic reasoning systems Used for modelling of application domains Classification of concepts and
More informationWeb Ontology Language (OWL)
Web Ontology Language (OWL) Need meaning beyond an object-oriented type system RDF (with RDFS) captures the basics, approximating an object-oriented type system OWL provides some of the rest OWL standardizes
More informationPhase 1. Phase 2. Phase 3. History. implementation of systems based on incomplete structural subsumption algorithms
History Phase 1 implementation of systems based on incomplete structural subsumption algorithms Phase 2 tableau-based algorithms and complexity results first tableau-based systems (Kris, Crack) first formal
More informationFirst Order Logic: Syntax and Semantics
irst Order Logic: Syntax and Semantics COMP30412 Sean Bechhofer sean.bechhofer@manchester.ac.uk Logic Recap You should already know the basics of irst Order Logic (OL) It s a prerequisite of this course!
More informationOntology Engineering for the Semantic Web
What s the Problem? Ontology Engineering for the Semantic Web COMP60421 Robert Stevens and Sean Bechhofer University of Manchester sean.bechhofer@manchester.ac.uk 1 Typical web page markup consists of:
More informationDESCRIPTION LOGICS. Paula Severi. October 12, University of Leicester
DESCRIPTION LOGICS Paula Severi University of Leicester October 12, 2009 Description Logics Outline Introduction: main principle, why the name description logic, application to semantic web. Syntax and
More informationDescription Logics (DLs)
OWL Three species of OWL OWL full is union of OWL syntax and RDF (Undecidable) OWL DL restricted to FOL fragment (decidable in NEXPTIME) OWL Lite is easier to implement subset of OWL DL (decidable in EXPTIME)
More informationDescription Logics. an introduction into its basic ideas
Description Logics an introduction into its basic ideas A. Heußner WS 2003/2004 Preview: Basic Idea: from Network Based Structures to DL AL : Syntax / Semantics Enhancements of AL Terminologies (TBox)
More informationFuzzy Description Logics
Fuzzy Description Logics 1. Introduction to Description Logics Rafael Peñaloza Rende, January 2016 Literature Description Logics Baader, Calvanese, McGuinness, Nardi, Patel-Schneider (eds.) The Description
More informationKnowledge representation DATA INFORMATION KNOWLEDGE WISDOM. Figure Relation ship between data, information knowledge and wisdom.
Knowledge representation Introduction Knowledge is the progression that starts with data which s limited utility. Data when processed become information, information when interpreted or evaluated becomes
More informationAn Introduction to Description Logic III
An Introduction to Description Logic III Knowledge Bases and Reasoning Tasks Marco Cerami Palacký University in Olomouc Department of Computer Science Olomouc, Czech Republic Olomouc, November 6 th 2014
More informationA Survey of Temporal Knowledge Representations
A Survey of Temporal Knowledge Representations Advisor: Professor Abdullah Tansel Second Exam Presentation Knowledge Representations logic-based logic-base formalisms formalisms more complex and difficult
More informationDescription Logics. Adrian Groza. Department of Computer Science Technical University of Cluj-Napoca
Description Logics Adrian Groza Department of Computer Science Technical University of Cluj-Napoca Outline 1 The World as a Graph 2 Description Logics Family Ontology Description Logics How far can we
More informationKnowledge Representation and Reasoning
Knowledge Representation and Reasoning Geraint A. Wiggins Professor of Computational Creativity Department of Computer Science Vrije Universiteit Brussel Objectives Knowledge Representation in Logic The
More informationA Logic Primer. Stavros Tripakis University of California, Berkeley
EE 144/244: Fundamental Algorithms for System Modeling, Analysis, and Optimization Fall 2015 A Logic Primer Stavros Tripakis University of California, Berkeley Stavros Tripakis (UC Berkeley) EE 144/244,
More informationTHE LANGUAGE OF FIRST-ORDER LOGIC (FOL) Sec2 Sec1(1-16)
THE LANGUAGE OF FIRST-ORDER LOGIC (FOL) Sec2 Sec1(1-16) FOL: A language to formulate knowledge Logic is the study of entailment relationslanguages, truth conditions and rules of inference. FOL or Predicate
More informationOWL, Patterns, & FOL COMP Sean Bechhofer Uli Sattler
OWL, Patterns, & FOL COMP62342 Sean Bechhofer sean.bechhofer@manchester.ac.uk Uli Sattler uli.sattler@manchester.ac.uk 1 A reminder: quotations and citations and Your coursework: check feedback & ask if
More informationCOMP9414: Artificial Intelligence Propositional Logic: Automated Reasoning
COMP9414, Monday 26 March, 2012 Propositional Logic 2 COMP9414: Artificial Intelligence Propositional Logic: Automated Reasoning Overview Proof systems (including soundness and completeness) Normal Forms
More informationDescription Logics. Deduction in Propositional Logic. franconi. Enrico Franconi
(1/20) Description Logics Deduction in Propositional Logic Enrico Franconi franconi@cs.man.ac.uk http://www.cs.man.ac.uk/ franconi Department of Computer Science, University of Manchester (2/20) Decision
More informationKnowledge Representation for the Semantic Web Lecture 2: Description Logics I
Knowledge Representation for the Semantic Web Lecture 2: Description Logics I Daria Stepanova slides based on Reasoning Web 2011 tutorial Foundations of Description Logics and OWL by S. Rudolph Max Planck
More informationTruth-Functional Logic
Truth-Functional Logic Syntax Every atomic sentence (A, B, C, ) is a sentence and are sentences With ϕ a sentence, the negation ϕ is a sentence With ϕ and ψ sentences, the conjunction ϕ ψ is a sentence
More informationLogics for Data and Knowledge Representation
Logics for Data and Knowledge Representation 4. Introduction to Description Logics - ALC Luciano Serafini FBK-irst, Trento, Italy October 9, 2012 Origins of Description Logics Description Logics stem from
More informationKnowledge Sharing. A conceptualization is a map from the problem domain into the representation. A conceptualization specifies:
Knowledge Sharing A conceptualization is a map from the problem domain into the representation. A conceptualization specifies: What sorts of individuals are being modeled The vocabulary for specifying
More informationDescription Logics. Foundations of Propositional Logic. franconi. Enrico Franconi
(1/27) Description Logics Foundations of Propositional Logic Enrico Franconi franconi@cs.man.ac.uk http://www.cs.man.ac.uk/ franconi Department of Computer Science, University of Manchester (2/27) Knowledge
More informationALC Concept Learning with Refinement Operators
ALC Concept Learning with Refinement Operators Jens Lehmann Pascal Hitzler June 17, 2007 Outline 1 Introduction to Description Logics and OWL 2 The Learning Problem 3 Refinement Operators and Their Properties
More informationINTEGRITY CONSTRAINTS FOR THE SEMANTIC WEB: AN OWL 2 DL EXTENSION
INTEGRITY CONSTRAINTS FOR THE SEMANTIC WEB: AN OWL 2 DL EXTENSION By Jiao Tao A Thesis Submitted to the Graduate Faculty of Rensselaer Polytechnic Institute in Partial Fulfillment of the Requirements for
More informationDeliberative Agents Knowledge Representation I. Deliberative Agents
Deliberative Agents Knowledge Representation I Vasant Honavar Bioinformatics and Computational Biology Program Center for Computational Intelligence, Learning, & Discovery honavar@cs.iastate.edu www.cs.iastate.edu/~honavar/
More informationLogic for Computer Science - Week 4 Natural Deduction
Logic for Computer Science - Week 4 Natural Deduction 1 Introduction In the previous lecture we have discussed some important notions about the semantics of propositional logic. 1. the truth value of a
More informationA Logic Primer. Stavros Tripakis University of California, Berkeley. Stavros Tripakis (UC Berkeley) EE 144/244, Fall 2014 A Logic Primer 1 / 35
EE 144/244: Fundamental Algorithms for System Modeling, Analysis, and Optimization Fall 2014 A Logic Primer Stavros Tripakis University of California, Berkeley Stavros Tripakis (UC Berkeley) EE 144/244,
More informationSemantics and Pragmatics of NLP
Semantics and Pragmatics of NLP Alex Ewan School of Informatics University of Edinburgh 28 January 2008 1 2 3 Taking Stock We have: Introduced syntax and semantics for FOL plus lambdas. Represented FOL
More informationOrdering, Indexing, and Searching Semantic Data: A Terminology Aware Index Structure
Ordering, Indexing, and Searching Semantic Data: A Terminology Aware Index Structure by Jeffrey Pound A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree
More informationCS1021. Why logic? Logic about inference or argument. Start from assumptions or axioms. Make deductions according to rules of reasoning.
3: Logic Why logic? Logic about inference or argument Start from assumptions or axioms Make deductions according to rules of reasoning Logic 3-1 Why logic? (continued) If I don t buy a lottery ticket on
More informationTeil III: Wissensrepräsentation und Inferenz. Kap.10: Beschreibungslogiken
Vorlesung Künstliche Intelligenz Wintersemester 2008/09 Teil III: Wissensrepräsentation und Inferenz Kap.10: Beschreibungslogiken Mit Material von Carsten Lutz, Uli Sattler: http://www.computationallogic.org/content/events/iccl-ss-2005/lectures/lutz/index.php?id=24
More informationCOMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR 1 Overview Last time Expert Systems and Ontologies Today Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof
More information7. Propositional Logic. Wolfram Burgard and Bernhard Nebel
Foundations of AI 7. Propositional Logic Rational Thinking, Logic, Resolution Wolfram Burgard and Bernhard Nebel Contents Agents that think rationally The wumpus world Propositional logic: syntax and semantics
More informationCompleting Description Logic Knowledge Bases using Formal Concept Analysis
Completing Description Logic Knowledge Bases using Formal Concept Analysis Franz Baader 1, Bernhard Ganter 1, Ulrike Sattler 2 and Barış Sertkaya 1 1 TU Dresden, Germany 2 The University of Manchester,
More informationIntroduction to Description Logic and Ontology Languages
CS6999 Presentation Introduction to Description Logic and Ontology Languages Jidi (Judy) Zhao October 21, 2009 Talk Outline Introduction to Ontologies Introduction to Description Logic (DL) Reasoning in
More informationINTRODUCTION TO NONMONOTONIC REASONING
Faculty of Computer Science Chair of Automata Theory INTRODUCTION TO NONMONOTONIC REASONING Anni-Yasmin Turhan Dresden, WS 2017/18 About the Course Course Material Book "Nonmonotonic Reasoning" by Grigoris
More informationStructured Descriptions & Tradeoff Between Expressiveness and Tractability
5. Structured Descriptions & Tradeoff Between Expressiveness and Tractability Outline Review Expressiveness & Tractability Tradeoff Modern Description Logics Object Oriented Representations Key Representation
More informationA conceptualization is a map from the problem domain into the representation. A conceptualization specifies:
Knowledge Sharing A conceptualization is a map from the problem domain into the representation. A conceptualization specifies: What sorts of individuals are being modeled The vocabulary for specifying
More informationIntroduction to Kleene Algebras
Introduction to Kleene Algebras Riccardo Pucella Basic Notions Seminar December 1, 2005 Introduction to Kleene Algebras p.1 Idempotent Semirings An idempotent semiring is a structure S = (S, +,, 1, 0)
More informationChapter 2 Background. 2.1 A Basic Description Logic
Chapter 2 Background Abstract Description Logics is a family of knowledge representation formalisms used to represent knowledge of a domain, usually called world. For that, it first defines the relevant
More informationFOUNDATIONS OF SEMANTIC WEB TECHNOLOGIES
FOUNDATIONS OF SEMANTIC WEB TECHNOLOGIES OWL & Description Logics Markus Krötzsch Dresden, 16 May 2014 Content Overview & XML Introduction into RDF RDFS Syntax & Intuition Tutorial 1 RDFS Semantics RDFS
More informationA Tableau Calculus for Minimal Modal Model Generation
M4M 2011 A Tableau Calculus for Minimal Modal Model Generation Fabio Papacchini 1 and Renate A. Schmidt 2 School of Computer Science, University of Manchester Abstract Model generation and minimal model
More informationPropositional Logic: Methods of Proof (Part II)
Propositional Logic: Methods of Proof (Part II) You will be expected to know Basic definitions Inference, derive, sound, complete Conjunctive Normal Form (CNF) Convert a Boolean formula to CNF Do a short
More informationThe Lambek-Grishin calculus for unary connectives
The Lambek-Grishin calculus for unary connectives Anna Chernilovskaya Utrecht Institute of Linguistics OTS, Utrecht University, the Netherlands anna.chernilovskaya@let.uu.nl Introduction In traditional
More informationProseminar on Semantic Theory Fall 2013 Ling 720 Propositional Logic: Syntax and Natural Deduction 1
Propositional Logic: Syntax and Natural Deduction 1 The Plot That Will Unfold I want to provide some key historical and intellectual context to the model theoretic approach to natural language semantics,
More informationCOMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR 1 Overview Last time Expert Systems and Ontologies Today Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof
More informationBridging the Gap Between OWL and Relational Databases
Bridging the Gap Between OWL and Relational Databases Boris Motik Ian Horrocks Ulrike Sattler Computing Laboratory, University of Oxford, UK Department of Computer Science, University of Manchester, UK
More informationClassical Propositional Logic
The Language of A Henkin-style Proof for Natural Deduction January 16, 2013 The Language of A Henkin-style Proof for Natural Deduction Logic Logic is the science of inference. Given a body of information,
More informationLogic: Propositional Logic (Part I)
Logic: Propositional Logic (Part I) Alessandro Artale Free University of Bozen-Bolzano Faculty of Computer Science http://www.inf.unibz.it/ artale Descrete Mathematics and Logic BSc course Thanks to Prof.
More informationLogic. Readings: Coppock and Champollion textbook draft, Ch
Logic Readings: Coppock and Champollion textbook draft, Ch. 3.1 3 1. Propositional logic Propositional logic (a.k.a propositional calculus) is concerned with complex propositions built from simple propositions
More informationOPPA European Social Fund Prague & EU: We invest in your future.
OPPA European Social Fund Prague & EU: We invest in your future. Description Logics Petr Křemen petr.kremen@fel.cvut.cz FEL ČVUT 39 / 157 Our plan Towards Description Logics ALC Language 40 / 157 Towards
More informationDescription Logics. Glossary. Definition
Title: Description Logics Authors: Adila Krisnadhi, Pascal Hitzler Affil./Addr.: Wright State University, Kno.e.sis Center 377 Joshi Research Center, 3640 Colonel Glenn Highway, Dayton OH 45435, USA Phone:
More informationUsing C-OWL for the Alignment and Merging of Medical Ontologies
Using C-OWL for the Alignment and Merging of Medical Ontologies Heiner Stuckenschmidt 1, Frank van Harmelen 1 Paolo Bouquet 2,3, Fausto Giunchiglia 2,3, Luciano Serafini 3 1 Vrije Universiteit Amsterdam
More informationFirst-Order Logic. 1 Syntax. Domain of Discourse. FO Vocabulary. Terms
First-Order Logic 1 Syntax Domain of Discourse The domain of discourse for first order logic is FO structures or models. A FO structure contains Relations Functions Constants (functions of arity 0) FO
More informationContexts for Quantification
Contexts for Quantification Valeria de Paiva Stanford April, 2011 Valeria de Paiva (Stanford) C4Q April, 2011 1 / 28 Natural logic: what we want Many thanks to Larry, Ulrik for slides! Program Show that
More informationPropositional Logic: Methods of Proof (Part II)
Propositional Logic: Methods of Proof (Part II) This lecture topic: Propositional Logic (two lectures) Chapter 7.1-7.4 (previous lecture, Part I) Chapter 7.5 (this lecture, Part II) (optional: 7.6-7.8)
More informationMotivation. CS389L: Automated Logical Reasoning. Lecture 10: Overview of First-Order Theories. Signature and Axioms of First-Order Theory
Motivation CS389L: Automated Logical Reasoning Lecture 10: Overview of First-Order Theories Işıl Dillig Last few lectures: Full first-order logic In FOL, functions/predicates are uninterpreted (i.e., structure
More informationClassical First-Order Logic
Classical First-Order Logic Software Formal Verification Maria João Frade Departmento de Informática Universidade do Minho 2008/2009 Maria João Frade (DI-UM) First-Order Logic (Classical) MFES 2008/09
More informationAnnouncements. CS243: Discrete Structures. Propositional Logic II. Review. Operator Precedence. Operator Precedence, cont. Operator Precedence Example
Announcements CS243: Discrete Structures Propositional Logic II Işıl Dillig First homework assignment out today! Due in one week, i.e., before lecture next Tuesday 09/11 Weilin s Tuesday office hours are
More informationRDF and Logic: Reasoning and Extension
RDF and Logic: Reasoning and Extension Jos de Bruijn Faculty of Computer Science, Free University of Bozen-Bolzano, Italy debruijn@inf.unibz.it Stijn Heymans Digital Enterprise Research Institute (DERI),
More informationFirst-Order Theorem Proving and Vampire. Laura Kovács (Chalmers University of Technology) Andrei Voronkov (The University of Manchester)
First-Order Theorem Proving and Vampire Laura Kovács (Chalmers University of Technology) Andrei Voronkov (The University of Manchester) Outline Introduction First-Order Logic and TPTP Inference Systems
More informationSemantics and Inference for Probabilistic Ontologies
Semantics and Inference for Probabilistic Ontologies Fabrizio Riguzzi, Elena Bellodi, Evelina Lamma, and Riccardo Zese ENDIF University of Ferrara, Italy, email: {fabrizio.riguzzi, elena.bellodi, evelina.lamma}@unife.it,
More informationFoundations of Artificial Intelligence
Foundations of Artificial Intelligence 7. Propositional Logic Rational Thinking, Logic, Resolution Wolfram Burgard, Maren Bennewitz, and Marco Ragni Albert-Ludwigs-Universität Freiburg Contents 1 Agents
More informationFoundations of Artificial Intelligence
Foundations of Artificial Intelligence 7. Propositional Logic Rational Thinking, Logic, Resolution Joschka Boedecker and Wolfram Burgard and Bernhard Nebel Albert-Ludwigs-Universität Freiburg May 17, 2016
More informationarxiv: v2 [cs.lo] 21 Jul 2014
ExpTime Tableaux with Global Caching for the Description Logic SHOQ Linh Anh Nguyen 1,2 and Joanna Golińska-Pilarek 3 1 Institute of Informatics, University of Warsaw Banacha 2, 02-097 Warsaw, Poland nguyen@mimuw.edu.pl
More informationEXPLANATION AND DIAGNOSIS SERVICES FOR UNSATISFIABILITY AND INCONSISTENCY IN DESCRIPTION LOGICS
EXPLANATION AND DIAGNOSIS SERVICES FOR UNSATISFIABILITY AND INCONSISTENCY IN DESCRIPTION LOGICS Xi Deng A thesis in The Department of Computer Science and Software Engineering Presented in Partial Fulfillment
More informationcis32-ai lecture # 18 mon-3-apr-2006
cis32-ai lecture # 18 mon-3-apr-2006 today s topics: propositional logic cis32-spring2006-sklar-lec18 1 Introduction Weak (search-based) problem-solving does not scale to real problems. To succeed, problem
More informationMathematical Logics Description Logic: Introduction
Mathematical Logics Description Logic: Introduction Fausto Giunchiglia and Mattia Fumagallli University of Trento *Originally by Luciano Serafini and Chiara Ghidini Modified by Fausto Giunchiglia and Mattia
More informationOn Terminological Default Reasoning about Spatial Information: Extended Abstract
On Terminological Default Reasoning about Spatial Information: Extended Abstract V. Haarslev, R. Möller, A.-Y. Turhan, and M. Wessel University of Hamburg, Computer Science Department Vogt-Kölln-Str. 30,
More informationA Refined Tableau Calculus with Controlled Blocking for the Description Logic SHOI
A Refined Tableau Calculus with Controlled Blocking for the Description Logic Mohammad Khodadadi, Renate A. Schmidt, and Dmitry Tishkovsky School of Computer Science, The University of Manchester, UK Abstract
More informationCS 730/730W/830: Intro AI
CS 730/730W/830: Intro AI 1 handout: slides 730W journal entries were due Wheeler Ruml (UNH) Lecture 9, CS 730 1 / 16 Logic First-Order Logic The Joy of Power Wheeler Ruml (UNH) Lecture 9, CS 730 2 / 16
More informationKnowledge base (KB) = set of sentences in a formal language Declarative approach to building an agent (or other system):
Logic Knowledge-based agents Inference engine Knowledge base Domain-independent algorithms Domain-specific content Knowledge base (KB) = set of sentences in a formal language Declarative approach to building
More informationKnowledge Representation and Description Logic Part 2
Knowledge Representation and Description Logic Part 2 Renata Wassermann renata@ime.usp.br Computer Science Department University of São Paulo September 2014 IAOA School Vitória Renata Wassermann Knowledge
More informationPřednáška 12. Důkazové kalkuly Kalkul Hilbertova typu. 11/29/2006 Hilbertův kalkul 1
Přednáška 12 Důkazové kalkuly Kalkul Hilbertova typu 11/29/2006 Hilbertův kalkul 1 Formal systems, Proof calculi A proof calculus (of a theory) is given by: A. a language B. a set of axioms C. a set of
More informationPropositional Logic: Methods of Proof. Chapter 7, Part II
Propositional Logic: Methods of Proof Chapter 7, Part II Inference in Formal Symbol Systems: Ontology, Representation, ti Inference Formal Symbol Systems Symbols correspond to things/ideas in the world
More informationPrice: $25 (incl. T-Shirt, morning tea and lunch) Visit:
Three days of interesting talks & workshops from industry experts across Australia Explore new computing topics Network with students & employers in Brisbane Price: $25 (incl. T-Shirt, morning tea and
More informationLing 130 Notes: Predicate Logic and Natural Deduction
Ling 130 Notes: Predicate Logic and Natural Deduction Sophia A. Malamud March 7, 2014 1 The syntax of Predicate (First-Order) Logic Besides keeping the connectives from Propositional Logic (PL), Predicate
More informationDesigning and Evaluating Generic Ontologies
Designing and Evaluating Generic Ontologies Michael Grüninger Department of Industrial Engineering University of Toronto gruninger@ie.utoronto.ca August 28, 2007 1 Introduction One of the many uses of
More informationComputing Least Common Subsumers in Description Logics with Existential Restrictions*
Computing Least Common Subsumers in Description Logics with Existential Restrictions* Franz Baader, Ralf Kiisters, Ralf Molitor LuFg Theoretische Informatik, RWTH Aachen email: {baader,kuesters,molitor}@infonnatik.rwth-aachcn.dc
More informationProbabilistic Ontologies: Logical Approach
Probabilistic Ontologies: Logical Approach Pavel Klinov Applied Artificial Intelligence Lab ECE Department University of Cincinnati Agenda Why do we study ontologies? Uncertainty Probabilistic ontologies
More informationFirst-Order Theorem Proving and Vampire
First-Order Theorem Proving and Vampire Laura Kovács 1,2 and Martin Suda 2 1 TU Wien 2 Chalmers Outline Introduction First-Order Logic and TPTP Inference Systems Saturation Algorithms Redundancy Elimination
More informationReasoning. Inference. Knowledge Representation 4/6/2018. User
Reasoning Robotics First-order logic Chapter 8-Russel Representation and Reasoning In order to determine appropriate actions to take, an intelligent system needs to represent information about the world
More informationWhy Knowledge Representation?
CSE 3401: Intro to AI & LP Knowledge Representation & First-Order Logic Required Readings: R & N Chapter 8 Optional: If you need more background: 7.1-7.3 Motivation for logic, basic introduction to semantics.
More informationTheoretical Computer Science. The loop formula based semantics of description logic programs
Theoretical Computer Science 415 (2012) 60 85 Contents lists available at SciVerse ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs The loop formula based semantics
More informationCHAPTER 11. Introduction to Intuitionistic Logic
CHAPTER 11 Introduction to Intuitionistic Logic Intuitionistic logic has developed as a result of certain philosophical views on the foundation of mathematics, known as intuitionism. Intuitionism was originated
More informationLogic. (Propositional Logic)
Logic (Propositional Logic) 1 REPRESENTING KNOWLEDGE: LOGIC Logic is the branch of mathematics / philosophy concerned with knowledge and reasoning Aristotle distinguished between three types of arguments:
More informationDescription Logics. decidable, supported by automatic reasoning systems
Description logics Description Logics q A family of KR formalisms, based on FOPL decidable, supported by automatic reasoning systems q Used for modelling of application domains q Classification of concepts
More informationACLT: Algebra, Categories, Logic in Topology - Grothendieck's generalized topological spaces (toposes)
ACLT: Algebra, Categories, Logic in Topology - Grothendieck's generalized topological spaces (toposes) Steve Vickers CS Theory Group Birmingham 2. Theories and models Categorical approach to many-sorted
More informationIntelligent Agents. First Order Logic. Ute Schmid. Cognitive Systems, Applied Computer Science, Bamberg University. last change: 19.
Intelligent Agents First Order Logic Ute Schmid Cognitive Systems, Applied Computer Science, Bamberg University last change: 19. Mai 2015 U. Schmid (CogSys) Intelligent Agents last change: 19. Mai 2015
More informationMAI0203 Lecture 7: Inference and Predicate Calculus
MAI0203 Lecture 7: Inference and Predicate Calculus Methods of Artificial Intelligence WS 2002/2003 Part II: Inference and Knowledge Representation II.7 Inference and Predicate Calculus MAI0203 Lecture
More informationFoundations of Artificial Intelligence
Foundations of Artificial Intelligence 7. Propositional Logic Rational Thinking, Logic, Resolution Joschka Boedecker and Wolfram Burgard and Frank Hutter and Bernhard Nebel Albert-Ludwigs-Universität Freiburg
More information