A Proposal for an OWL Rules Language

Embed Size (px)

Citation preview

  • 8/8/2019 A Proposal for an OWL Rules Language

    1/22

    A Proposal for an O WLR ules Language

    Choi, Cheolhee

    [email protected] Intelligent Systems Lab.

    Hanyang Univ.

    Ian Horrocks & Peter F.Patel-Schneider

    WWW2004 New York, USA

  • 8/8/2019 A Proposal for an OWL Rules Language

    2/22

    01/03/11 2

    I nt el l i g

    ent

    S y st em

    s

    Agenda

    IntroductionOverviewDirect Model-Theoretic Semantics

    The Power of RulesExample of ORLMapping To RDF Graphs

    Summary

  • 8/8/2019 A Proposal for an OWL Rules Language

    3/22

    01/03/11 3

    I nt el l i g

    ent

    S y st em

    s

    Introduction (1)

    The Owl Web Ontology Language addsconsiderable expressive power to theSemantic Web

    Limitation of OWLproperties is much weaker than class constructs

    It is impossible to capture relationships between acomposite property and another property

    Parent(x,z) ,Brother(x,y) and Uncle(y,z)

  • 8/8/2019 A Proposal for an OWL Rules Language

    4/22

    01/03/11 4

    I nt el l i g

    ent

    S y st em

    s

    Introduction (2)

    Solutions To extend OWL with a more powerful language fordescribing propertiesBut, In order to maintain decidability, the constructor issatisfied following

    To extend OWL with some form of rule language

    P Q P o

    Parent(x,z) ,Brother(x,y) and Uncle(y,z)

  • 8/8/2019 A Proposal for an OWL Rules Language

    5/22

    01/03/11 5

    I nt el l i g

    ent

    S y st em

    s

    Overview

    The basic idea of the proposal is to extendOWL DL with a form of rules whilemaintaining maximum backwards

    compatibility with OWLs existing syntax andsemanticsRule : antecedent consequentAtom: C(x), P(x,y),Q(x,y), sameAs(x,y), or

    differentFrom(x,y)

  • 8/8/2019 A Proposal for an OWL Rules Language

    6/22

    01/03/11 6

    I nt el l i g

    ent

    S y st em

    s

    Abstract Syntax

    This syntax extends the abstract syntax of OWLdescribed in the OWL Semantics and Abstract Syntaxdocument

    axiom ::= rulerule ::= Implies({annotation} antecedent consequent)antecedent ::= Antecedent({atom})consequent ::= Consequent({atom})atom ::= description ( i-object )

    | individualValuePropertyID ( i-object i-object )| datavaluedPropertyID ( i-object d-object )| sameAs ( i-object i-object )

    | differentFrom ( i-object i-object )

    i-object ::= i-variable | individualIDd-object ::= d-variable | dataLiterali-variable ::= I-variable( URIreference )d-variable ::= D-variable( URIreference )

    atom: C(x),P(x,y),Q(x,y),atom: C(x),P(x,y),Q(x,y),sameAs(x,y), orsameAs(x,y), ordifferentFrom(x,y)differentFrom(x,y)

  • 8/8/2019 A Proposal for an OWL Rules Language

    7/22

    01/03/11 7

    I nt el l i g

    ent

    S y st em

    s

    Abstract Syntax (2)

    Human Readable Syntax

    antecedent consequent

    Both antecedent and consequent are conjunctions of atoms Variables are indicated using prefixing them with a question mark

    Parent(?a,?b) Brother(?b,?c) Uncle(?a,?c)

  • 8/8/2019 A Proposal for an OWL Rules Language

    8/22

    01/03/11 8

    I nt el l i g

    ent

    S y st em

    s

    Direct Model-Theoretic Semantics

    The basic idea is that we define binding -extensions of OWL interpretationsA rule is satisfied by and interpretation iff

    every binding that satisfies the antecedentalso satisfies the consequent

  • 8/8/2019 A Proposal for an OWL Rules Language

    9/22

    01/03/11 9

    I nt el l i g

    ent

    S y st em

    s

    Interpreting Rules

    , , , , , I R EC ER L S LV =< >Atom Condition on Interpretation

    C(x)P(x,y)Q(x,z)sameAs(x,y)differentFrom(x,y)

    S(x) EC(C) ER(P) ER(Q)S(x) = S(y)S(x) S(y)

    S i s a mapping from individual names to elements of EC(owl:Thing)L is a mapping from typed literals to elements of LV

  • 8/8/2019 A Proposal for an OWL Rules Language

    10/22

    01/03/11 10

    I nt el l i g

    ent

    S y st em

    s

    Interpreting Rules (2)

    A binding B(I) satisfiesAn antecedent A iff A is empty or B(I) satisfies everyatom in AA consequent C iff C is not empty and B(I) satisfies

    A rule is satisfied !

  • 8/8/2019 A Proposal for an OWL Rules Language

    11/22

    01/03/11 11

    I nt el l i g

    ent

    S y st em

    s

    Interpreting Rules (3)

    Example

    , , ( : ).

    (( , ) ( ) ( , ) ( ))

    ( , ) ( )

    a b c EC owl Thing

    a b ER parent b c ER brother a c ER uncle

  • 8/8/2019 A Proposal for an OWL Rules Language

    12/22

    01/03/11 12

    I nt el l i g

    ent

    S y st em

    s

    XML Concrete Syntax(1)

    Person(x1)

    Persons having at least one parent who is a Physician(x2)Atom:Atom:C(x)C(x) P(x,y)P(x,y)Q(x,y)Q(x,y)sameAs(x,y)sameAs(x,y)differentFrom(x,y)differentFrom(x,y)

    I

  • 8/8/2019 A Proposal for an OWL Rules Language

    13/22

    01/03/11 13

    I nt el l i g

    ent

    S y st em

    s

    XML Concrete Syntax(2)

    4

    hasParent(x1, John)

    grade(x1, 4)

    Atom:Atom:C(x)C(x)P(x,y)P(x,y)Q(x,y)Q(x,y)sameAs(x,y)sameAs(x,y)differentFrom(x,y)differentFrom(x,y)

    I

  • 8/8/2019 A Proposal for an OWL Rules Language

    14/22

    01/03/11 14

    I nt el l i g

    ent

    S y st em

    s

    XML Concrete Syntax(3)

    sameIndividualAtom(Clinton, Bill_Clinton)

    Atom:Atom:C(x)C(x)P(x,y)P(x,y)Q(x,y)Q(x,y)

    sameAs(x,y)sameAs(x,y)differentFrom(x,y)differentFrom(x,y)

    I

  • 8/8/2019 A Proposal for an OWL Rules Language

    15/22

    01/03/11 15

    I nt el l i g

    ent

    S y st em

    s

    XML Concrete Syntax(4)

    parent(?a, ?b)

    brother(?b, ?c)

    -> uncle(?a,?c)

    I

  • 8/8/2019 A Proposal for an OWL Rules Language

    16/22

    01/03/11 16

    I nt el l i g

    ent

    S y st em

    s

    The Power of Rules

    In OWL, the only relationship that can beasserted between properties is subsumption between atomic property names

    By using rules, we have increased expressivepowerFor extensions of language such as OWL DL,the undecidability of the consistency problem

    is often proved

    I

  • 8/8/2019 A Proposal for an OWL Rules Language

    17/22

    01/03/11 17

    I nt el l i g

    ent

    S y st em

    s

    The Power of Rules(3)

    The proposed form of OWL rules seem to gobeyond basic Horn clauses in allowing:

    Conjunctive consequents

    Class description as well as class names aspredicated in class atomsEqualities and inequalities

    I

  • 8/8/2019 A Proposal for an OWL Rules Language

    18/22

    01/03/11 18

    I nt el l i g

    ent

    S y st em

    s

    The Power of Rules(4)

    These are syntactic sugar Conjunctive consequents

    Class descriptions

    Equalities and inequalities(? ) (? ,? )Thing x Eq x x

    1 2 A C C 1

    2

    A C

    A C

    ( , )( ) ( )

    differentFrom x yC x D y

    ( , ) EquivalentClasses D d

    I

  • 8/8/2019 A Proposal for an OWL Rules Language

    19/22

    01/03/11 19

    I nt el l i g

    ent

    S y st em

    s

    Example of ORL

    Artist(?x) Style(?y) artistSyle(?x,?y) Creator(?x,?z)

    -> sytle/period(?z,?y)

    I

  • 8/8/2019 A Proposal for an OWL Rules Language

    20/22

    01/03/11 20

    I nt el l i g

    ent

    S y st em

    s

    Mapping to RDF Graph

    The semantic Web will be based on ahierarchy of language with RDF/XML providingthe syntactic and semantic foundation

    Unlike OWL, rules have variables so treatingthem as a semantic extension of RDF is verydifficult

    Provide an RDF syntax for rules

    I

  • 8/8/2019 A Proposal for an OWL Rules Language

    21/22

    01/03/11 21

    I nt el l i g

    ent

    S y st em

    s

    Mapping to RDF Graph (2)

  • 8/8/2019 A Proposal for an OWL Rules Language

    22/22

    01/03/11 22

    I nt el l i g

    ent

    S y st em

    s

    Summary

    A proposed extension to OWL to include asimple form of Horn-style rules

    Simplicity and tight integration with the existingOWL language

    ORL extends OWL with the most basic kind of Horn rulePredicates are limited to being OWL classes andpropertiesno disjunctions or negations of atomsno built-in predicate

    no non-monotonic featuresrules are given a standard first order semanticsORL is defined as a syntactic and semantic extension of OWL DL