From OWL to Description Logics. U. Straccia (ISTI - CNR) DLs & SW / 170
|
|
- Annis Tate
- 6 years ago
- Views:
Transcription
1 From OWL to Description Logics U. Straccia (ISTI - CNR) DLs & SW / 170
2 What Are Description Logics? ( A family of logic-based knowledge representation formalisms Descendants of semantic networks and KL-ONE Describe domain in terms of concepts (classes), roles (properties, relationships) and individuals Distinguished by: Formal semantics (typically model theoretic) Decidable fragments of FOL Closely related to Propositional Modal & Dynamic Logics Closely related to Guarded Fragment of FOL, L2 and C2 Provision of inference services Decision procedures for key problems (e.g., satisfiability, subsumption) Implemented systems (highly optimised) U. Straccia (ISTI - CNR) DLs & SW / 170
3 Short History of Description Logics Phase 1: Mostly system development (early eighties) Incomplete systems (Back, Classic, Loom, Kandor,...) Based on structural algorithms Phase 2: first tableaux algorithms and complexity results (mid-eighties - mid-nineties) Development of tableaux algorithms and complexity results Tableaux-based systems (Kris, Crack) Investigation of optimization techniques Phase 3: Optimized systems for very expressive DLs (mid-nineties -... ) Tableaux algorithms for very expressive DLs Highly optimised tableau systems (FaCT, DLP, Racer) Relationship to modal logic and decidable fragments of FOL U. Straccia (ISTI - CNR) DLs & SW / 170
4 Latest developments Phase 4: Mature implementations Mainstream applications and Tools Databases consistency of conceptual schema (EER, UML) using e.g. DLR (n-ary DL) schema integration Query subsumptiion (w.r.t. a conceptual schema) Ontologies and the Semantic Web (and Grid) Ontology engineering (design, maintenance, integration) Reasoing with ontology-based markup (metadata) Service description and discovery Commercial implemenations Cerebra, Racer U. Straccia (ISTI - CNR) DLs & SW / 170
5 Description Logics Basics Concept/Class: names are equivalent to unary predicates In general, concepts equiv to formulae with one free variable Role or attribute: names are equivalent to binary predicates In general, roles equiv to formulae with two free variables Taxonomy: Concept and role hierarchies can be expressed Individual: names are equivalent to constants Operators: restricted so that: Language is decidable and, if possible, of low complexity No need for explicit use of variables Restricted form of and Features such as counting can be succinctly expressed U. Straccia (ISTI - CNR) DLs & SW / 170
6 The DL Family A given DL is defined by set of concept and role forming operators Smallest propositionally closed DL is ALC (Attributive Language with Complement) Concepts constructed using,,, and Syntax Example C, D (top concept) (bottom concept) A (atomic concept) Human C D (concept conjunction) Human Male C D (concept disjunction) Nice Rich C (concept negation) Meat R.C (existential quantification) haschild.blond R.C (universal quantification) haschild.human U. Straccia (ISTI - CNR) DLs & SW / 170
7 General inclusion axioms: are of the form C D concept D subsumes concept C" HappyFather Man haschild.female Concept definitions: are of the form A = C (equivalent to A C, C A) Primitive concept definitions: are of the form A C Sometimes, a we have primitive and concept definitions only, where no atom can be defined more than once and no recursion is allowed in that case the concept definitions can be unfolded Assertions: are of the form a:c and (a, b):r individual a is an instance of concept C individual a is related to b by means of R John:Happy_Father (John, Mary):has_child (In)Equality Axioms: are of the form a = b and a b U. Straccia (ISTI - CNR) DLs & SW / 170
8 DL Semantics Semantics is given in terms of an interpretation I = ( I, I), where I is the domain (a non-empty set) I is an interpretation function that maps: Concept (class) name A into a subset A I of I Role (property) name R into a subset R I of I I Individual name a into an element of I Interpretation function I is extended to concept expressions: I = I I = (C 1 C 2 ) I = C I I 1 C 2 (C 1 C 2 ) I = C I I 1 C 2 ( C) I = I \ C I ( R.C) I = {x I y. x, y R I y C I } ( R.C) I = {x I y. x, y R I y C I } U. Straccia (ISTI - CNR) DLs & SW / 170
9 Example: assume I = ( I, I) such that I = {a, b, c, d, e, f, 1, 2, 4, 5, 8} Person I = {a, b, c, d} Blonde I = {b, d} haschild I = { a, b, a, c, c, d, b, c } What is the interpretation of Person haschild.blond? (Person haschild.blond) I = Person I {x y. x, y haschild I y Blond I } = {a, b, c, d} {x y. x, y { a, b, a, c, c, d, b, c } y {b, d}} = {a, b, c, d} {a, c} = {a, c} Finally, we say that I is a model of C D, written I = C D, iff C I D I I is a model of a:c, written I = a:c, iff a I C I I is a model of (a, b):r, written I = (a, b):r, iff a I, b I R I I is a model of a = b, written I = a = b, iff a I = b I I is a model of a b, written I = a b, iff ai b I U. Straccia (ISTI - CNR) DLs & SW / 170
10 Excerpt of pizza ontology... (according to University of Manchester) PizzaFruttiDiMare = Pizza hastopping.mixedseafoodtopping hastopping.garlictopping hastopping.tomatotopping hastopping.(mixedseafoodtopping GarlicTopping TomatoTopping) hasbase.pizzabase PizzaBase = DeepPanBase ThinAndCrispyBase MixedSeafoodTopping FishTopping FishTopping PizzaTopping hasspiceness.mild disjoint(fishtopping, MeatTopping, HerbSpiceTopping) functional(hasspiciness) Topping hasspiciness.(hot Medium Mild) U. Straccia (ISTI - CNR) DLs & SW / 170
11 Note: Simplification of acyclic ontologies Acyclic TBoxes can be unfolded or expanded Replace each A C with A = C A, where A is a new atom Given A = C, replace each occurrence of A with C Example: parent = person haschild.person woman = person femal mother = parent femal Original TBox parent = person haschild.person woman = person femal mother = person haschild.person femal Unfolded TBox U. Straccia (ISTI - CNR) DLs & SW / 170
12 DLs and First-Order-Logic Satisfiability preserving ALC mapping to FOL: introduce a unary predicate A for an atomic concept A a binary predicate R for a role R Translate as follows t(, x) true t(, x) false t(a, x) A(x) t(c 1 C 2, x) t(c 1, x) t(c 2, x) t(c 1 C 2, x) t(c 1, x) t(c 2, x) t( C, x) t(c, x) t( R.C, x) y.r(x, y) t(c, y) t( R.C, x) y.r(x, y) t(c, y) t(c D) x.t(c, x) t(d, x) t(a:c) t(c, a) t((a, b):r) R(a, b) Example: t(happyfather Man haschild.female) = x.happyfather(x) (Man(x) ( y.haschild(x, y) Female(y))) t(a:man haschild.female) = Man(a) ( y.haschild(a, y) Female(y)) U. Straccia (ISTI - CNR) DLs & SW / 170
13 Note on DL naming For instance, AL: C, D A C D A R. R.C C: Concept negation, C. Thus, ALC = AL + C S: Used for ALC with transitive roles R + U: Concept disjunction, C 1 C 2, e.g. Male Female E: Existential quantification, R.C, e.g. haspart.wheel H: Role inclusion axioms, R 1 R 2, e.g. iscomponentof ispartof N : Number restrictions, ( n R) and ( n R), e.g. ( 3 has_child) (has at least 3 children) Q: Qualified number restrictions, ( n R.C) and ( n R.C), e.g. ( 2 haschild.adult) (has at most 2 adult children) O: Nominals (singleton class), {a}, e.g. haschild.{mary}. Note: a:c equiv to {a} C and (a, b):r equiv to {a} R.{b} I: Inverse role, R, e.g. ispartof = haspart F: Functional role, f, e.g. fun(hasage) R +: transitive role, e.g. trans(ispartof ) SHIF = S + H + I + F = ALCR +HIF OWL-Lite (EXPTIME) SHOIN = S + H + O + I + N = ALCR +HOIN OWL-DL (NEXPTIME) U. Straccia (ISTI - CNR) DLs & SW / 170
14 Semantics of additional constructs: H: Role inclusion axioms, I = R 1 R 2 iff R 1 I R 2 I N : Number restrictions, ( n R) I = {x I : {y x, y R I } n}, ( n R) I = {x I : {y x, y R I } n} Q: Qualified number restrictions, ( n R.C) I = {x {y x, y R I y C I } n}, ( n R.C) I = {x I : {y x, y R I y C I } n} O: Nominals (singleton class), {a} I = {a I } I: Inverse role, (R ) I = { x, y y, x R I } F: Functional role, I = fun(f ) iff z y z if x, y f I and x, z f I the y = z R +: transitive role, (R +) I = { x, y z such that x, z R I z, y R I } U. Straccia (ISTI - CNR) DLs & SW / 170
15 Lisp-like Syntax of DLs formulae In many systems the syntax is Lisp-like *top* *bottom* C (not C) C D (and C D) C D (or C D) R.C (some R C) R.C (all R C) ( n R) (at-least n R) ( n R) (at-most n R) ( n R.C) (at-least n R C) ( n R.C) (at-most n R C) {a} (one-of a) R (inv R) C D (implies C D) A = C (define-concept A C) R P (implies-role R P) fun(f ) (functional f) trans(r) (transitive R) a:c (instance a C) (a, b):r (related a b R) Example: (define-concept Man (and Human Male)) (define-concept Happy_Father (and Man (some has_child Female))) (instance john Happy_Father) (related john mary has_child) U. Straccia (ISTI - CNR) DLs & SW / 170
16 Concrete domains Concrete domains: reals, integers, strings,... (tim, 14):hasAge (sf, SoftComputing ):hasacronym (source1, ComputerScience ):isabout (service2, InformationRetrievalTool ):Matches Minor = Person hasage. 18 Semantics: a clean separation between object classes and concrete domains D = D, Φ D D is an interpretation domain ΦD is the set of concrete domain predicates d with a predefined arity n and fixed interpretation d D n D Concrete properties: R I I D Notation: (D). E.g., ALC(D) is ALC + concrete domains U. Straccia (ISTI - CNR) DLs & SW / 170
17 Example: assume I = ( I, I) such that I = {a, b, c, d, e, f, 1, 2, 4, 5, 8} Person I = {a, b, c, d} Consider the following concrete domain with of some unary predicates (n = 1) over reals D = R, Φ D = {= m, m, m, > m, < m m R} the fixed interpretation of the predicates is (= m) D = {m} ( m) D = {k k m} ( m) D = {k k m} (> m) D = {k k > m} (< m) D = {k k < m} Concrete properties: hasage I I R hasage I = { a, 9, c, 20, b, 12 } What is the interpretation of Person hasage. 18? (Person hasage. 18 ) I = Person I {x y R such that x, y hasage I y ( 18 ) I = {a, b, c, d} {x y. x, y { a, 9, c, 20, b, 12 } y 18} = {a, b, c, d} {a, b} = {a, b} U. Straccia (ISTI - CNR) DLs & SW / 170
18 DL Knowledge Base A DL Knowledge Base is a pair K = T, A, where T is a TBox containing general inclusion axioms of the form C D, concept definitions of the form A = C primitive concept definitions of the form A C role inclusions of the form R P role equivalence of the form R = P A is a ABox containing assertions of the form a:c containing assertions of the form (a, b):r containing (in) equality Axioms of the form a = b and a b An interpretation I is a model of K, written I = K iff I = T and I = A, where I = T (I is a model of T ) iff I is a model of each element in T I = A (I is a model of A) iff I is a model of each element in A U. Straccia (ISTI - CNR) DLs & SW / 170
19 OWL DL as Description Logic Concept/Class constructors: Abstract Syntax DL Syntax Example Descriptions (C) A (URI reference) A Conference owl:thing owl:nothing intersectionof(c 1 C 2...) C 1 C 2 Reference Journal unionof(c 1 C 2...) C 1 C 2 Organization Institution complementof(c) C MasterThesis oneof(o 1...) {o 1,...} {"WISE","ISWC",...} restriction(r somevaluesfrom(c)) R.C parts.incollection restriction(r allvaluesfrom(c)) R.C date.date restriction(r hasvalue(o)) R.{o} date.{2005} restriction(r mincardinality(n)) ( n R) ( 1 location) restriction(r maxcardinality(n)) ( n R) ( 1 publisher) restriction(u somevaluesfrom(d)) U.D issue.integer restriction(u allvaluesfrom(d)) U.D name.string restriction(u hasvalue(v)) U. = v } series.= LNCS restriction(u mincardinality(n)) ( n U) ( 1 title) restriction(u maxcardinality(n)) ( n U) ( 1 author) Note: R is an abstract role, while U is a concrete property of arity two. U. Straccia (ISTI - CNR) DLs & SW / 170
20 Axioms: Axioms Abstract Syntax DL Syntax Example Class(A partial C 1... C n) A C 1... C n Human Animal Biped Class(A complete C 1... C n) A = C 1... C n Man = Human Male EnumeratedClass(A o 1... o n) A = {o 1 }... {o n} RGB = {r} {g} {b} SubClassOf(C 1 C 2 ) C 1 C 2 EquivalentClasses(C 1... C n) C 1 =... = C n DisjointClasses(C 1... C n) C i C j =, i j Male Female ObjectProperty(R super (R 1 )... super (R n) R R i HasDaughter haschild domain(c 1 )... domain(c n) ( 1 R) C i ( 1 haschild) Human range(c 1 )... range(c n) R.C i haschild.human [inverseof(p)] R = P haschild = hasparent [symmetric] R = R similar = similar [functional] ( 1 R) ( 1 hasmother) [Inversefunctional] ( 1 R ) [Transitive]) Tr(R) Tr(ancestor) SubPropertyOf(R 1 R 2 ) R 1 R 2 EquivalentProperties(R 1... R n) R 1 =... = R n cost = price AnnotationProperty(S) U. Straccia (ISTI - CNR) DLs & SW / 170
21 Abstract Syntax DL Syntax Example DatatypeProperty(U super (U 1 )... super (U n) U U i domain(c 1 )... domain(c n) ( 1 U) C i ( 1 hasage) Human range(d 1 )... range(d n) U.D i hasage.posinteger [functional]) ( 1 U) ( 1 hasage) SubPropertyOf(U 1 U 2 ) U 1 U 2 hasname hasfirstname EquivalentProperties(U 1... U n) U 1 =... = U n Individuals Individual(o type (C 1 )... type (C n)) o:c i tim:human value(r 1 o 1 )... value(r no n) (o, o i ):R i (tim, mary):haschild value(u 1 v 1 )... value(u nv n) (o, v 1 ):U i (tim, 14):hasAge SameIndividual(o 1... o n) o 1 =... = o n president_bush = G.W.Bush DifferentIndividuals(o 1... o n) o i o j, i j john peter Symbols Object Property R (URI reference) R haschild Datatype Property U (URI reference) U hasage Individual o (URI reference) U tim Data Value v (RDF literal) U International Conference on Semantic Web U. Straccia (ISTI - CNR) DLs & SW / 170
22 XML representation of OWL statements Example: Person haschild.(doctor haschild.doctor) intersectionof( Person restriction(haschild allvaluesfrom(unionof(doctor restriction(haschild somevaluesfrom(doctor))))) U. Straccia (ISTI - CNR) DLs & SW / 170
23 OWL Lite as Description Logic Prohibits union and complements Restricts intersection to implicit intersections in the frame-like class axioms Limits all embedded descriptions to concept names Does not allow individuals to show up in description or class axioms Limits role filler cardinalities to 0 or 1 U. Straccia (ISTI - CNR) DLs & SW / 170
24 Concept/Class constructors: Abstract Syntax DL Syntax Example Descriptions (C) A (URI reference) A Conference owl:thing owl:nothing restriction(r somevaluesfrom(c)) R.C parts.incollection restriction(r allvaluesfrom(c)) R.C date.date restriction(r mincardinality(n)) ( n R), n {0, 1} ( 1 location) restriction(r maxcardinality(n)) ( n R), n {0, 1} ( 1 publisher) restriction(u somevaluesfrom(d)) U.D issue.integer restriction(u allvaluesfrom(d)) U.D name.string restriction(u mincardinality(n)) ( n U), n {0, 1} ( 1 title) restriction(u maxcardinality(n)) ( n U), n {0, 1} ( 1 author) Note: R is an abstract role, while U is a concrete property of arity two. U. Straccia (ISTI - CNR) DLs & SW / 170
25 Axioms: Axioms Abstract Syntax DL Syntax Example Class(A partial C 1... C n) A C 1... C n Human Animal Biped Class(A complete C 1... C n) A = C 1... C n Man = Human Male EquivalentClasses(C 1... C n) C 1 =... = C n ObjectProperty(R super (R 1 )... super (R n) R R i HasDaughter haschild domain(c 1 )... domain(c n) ( 1 R) C i ( 1 haschild) Human range(c 1 )... range(c n) R.C i haschild.human [inverseof(p)] R = P haschild = hasparent [symmetric] R = R similar = similar [functional] ( 1 R) ( 1 hasmother) [Inversefunctional] ( 1 R ) [Transitive]) Tr(R) Tr(ancestor) SubPropertyOf(R 1 R 2 ) R 1 R 2 EquivalentProperties(R 1... R n) R 1 =... = R n cost = price AnnotationProperty(S) U. Straccia (ISTI - CNR) DLs & SW / 170
26 Abstract Syntax DL Syntax Example DatatypeProperty(U super (U 1 )... super (U n) U U i domain(c 1 )... domain(c n) ( 1 U) C i ( 1 hasage) Human range(d 1 )... range(d n) U.D i hasage.posinteger [functional]) ( 1 U) ( 1 hasage) SubPropertyOf(U 1 U 2 ) U 1 U 2 hasname hasfirstname EquivalentProperties(U 1... U n) U 1 =... = U n Individuals Individual(o type (C 1 )... type (C n)) o:c i tim:human value(r 1 o 1 )... value(r no n) (o, o i ):R i (tim, mary):haschild value(u 1 v 1 )... value(u nv n) (o, v 1 ):U i (tim, 14):hasAge SameIndividual(o 1... o n) o 1 =... = o n president_bush = G.W.Bush DifferentIndividuals(o 1... o n) o i o j, i j john peter Symbols Object Property R (URI reference) R haschild Datatype Property U (URI reference) U hasage Individual o (URI reference) U tim Data Value v (RDF literal) U International Conference on Semantic Web U. Straccia (ISTI - CNR) DLs & SW / 170
27 Use Case: Semantic Shopping Agent Suppose we would like to buy a sporty car, 1 which costs at most about euro 2 who s color is metallic blue 3 in case there are leather seats then we want also air conditioning 4... In todays Web, we have manually 1 to search for car selling web sites, e.g. using Google, 2 to select the most promising sites, 3 to browse through them and query them to see about the cars each site sells and match them with our requirements 4 select the offers in each web site, which match our requirements 5 eventually to merge all the best offers from each site together and select the best ones U. Straccia (ISTI - CNR) DLs & SW / 170
28 Suppose that among the web sites we found U. Straccia (ISTI - CNR) DLs & SW / 170
29 Suppose I select the sporty car link... U. Straccia (ISTI - CNR) DLs & SW / 170
30 The list is not in the right order: let s order it by invoice price... U. Straccia (ISTI - CNR) DLs & SW / 170
31 Now, let s see the properties of the Mazda MX-5 Miata... U. Straccia (ISTI - CNR) DLs & SW / 170
32 Limitations As we can see, the whole process is rather tedious and time consuming I ve to visit many sites Browsing in each site is very time consuming Finding the right information in a site, which has to match the requirements is not simple The way of browsing and querying may differ from site to site U. Straccia (ISTI - CNR) DLs & SW / 170
33 Better Solution: Use a Software Agent Why not use a software agent doing automatically all these steps? 1 to search for car selling web sites 2 to select the most promising sites, 3 to browse through them and query them to see about the cars each site sells and match them with the requirements 4 select the offers in each web site, which match our requirements 5 eventually to merge all the best offers from each site together and select the best ones and present them to the user U. Straccia (ISTI - CNR) DLs & SW / 170
34 Today s problems for a Software Agent The major problem to automatize the process is that Web information resources are not meant for automatic information processing Web pages are in HTML. Extracting information by wrapping is difficult Query language not standardized. Querying automatically is difficult U. Straccia (ISTI - CNR) DLs & SW / 170
35 Possible Solution: Semantic Shopping Agent The content of a shopping site is encoded as a Knowledge base: It contains an ontology describing all the classes and properties of the vehicles it sells It contains all the instances of the classes U. Straccia (ISTI - CNR) DLs & SW / 170
36 Possible Solution: Semantic Shopping Agent The content of a shopping site is encoded as a Knowledge base: It contains an ontology describing all the classes and properties of the vehicles it sells It contains all the instances of the classes U. Straccia (ISTI - CNR) DLs & SW / 170
37 Possible Solution: Semantic Shopping Agent The content of a shopping site is encoded as a Knowledge base: It contains an ontology describing all the classes and properties of the vehicles it sells It contains all the instances of the classes U. Straccia (ISTI - CNR) DLs & SW / 170
38 Possible Solution: Semantic Shopping Agent The content of a shopping site is encoded as a Knowledge base: It contains an ontology describing all the classes and properties of the vehicles it sells It contains all the instances of the classes We can query the sites by asking Find sporty cars, whose price is 20000, and... In Description Logic, we are looking for all instances of the class MyQuery = SportyCars ( hasprice ) ( hascolor. = blue ) ( ( hasseats.leatherseats) ( hasairconditioning.airconditioning))... KB = MyQuery(MazdaMX 5Miata) U. Straccia (ISTI - CNR) DLs & SW / 170
Description 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 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 informationThomas Lukasiewicz. Computing Laboratory, University of Oxford
Managing and Vagueness in Description Logics for the Semantic Web Scuola di Dottorato in Ingegneria dell Informazione Napoli 2009 Thomas Lukasiewicz Computing Laboratory, University of Oxford thomas.lukasiewicz@comlab.ox.ac.uk
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 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 informationTranslating SWRL FOL, SWRL, and OWL DL to the Universal Policy Logic
Translating SWRL FOL, SWRL, and OWL DL to the Universal Policy Logic Version 0.1 ICS-16763-TR-07-004 SRI Project No. 16763 Contract No. FA8750-05-C-0230 Prepared by Daniel Elenius SRI International 333
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. 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 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. 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 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 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 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 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 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 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 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 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 RESOLUTION DECISION PROCEDURE FOR SHOIQ
A RESOLUTION DECISION PROCEDURE FOR SHOIQ Yevgeny Kazakov and Boris Motik The University of Manchester August 20, 2006 SHOIQ IS A DESCRIPTION LOGIC! Yevgeny Kazakov and Boris Motik A Resolution Decision
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 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 informationOWL Basics. Technologies for the Semantic Web. Building a Semantic Web. Ontology
Technologies for the Semantic Web OWL Basics COMP60421 Sean Bechhofer University of Manchester sean.bechhofer@manchester.ac.uk Metadata Resources are marked-up with descriptions of their content. No good
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 informationOWL 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 informationPrinciples of Knowledge Representation and Reasoning
Principles of Knowledge Representation and Semantic Networks and Description Logics II: Description Logics Terminology and Notation Bernhard Nebel, Felix Lindner, and Thorsten Engesser November 23, 2015
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 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 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: an Introductory Course on a Nice Family of Logics. Day 2: Tableau Algorithms. Uli Sattler
Description Logics: an Introductory Course on a Nice Family of Logics Day 2: Tableau Algorithms Uli Sattler 1 Warm up Which of the following subsumptions hold? r some (A and B) is subsumed by r some A
More informationRelations to first order logic
An Introduction to Description Logic IV Relations to first order logic Marco Cerami Palacký University in Olomouc Department of Computer Science Olomouc, Czech Republic Olomouc, November 6 th 2014 Marco
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 informationQuasi-Classical Semantics for Expressive Description Logics
Quasi-Classical Semantics for Expressive Description Logics Xiaowang Zhang 1,4, Guilin Qi 2, Yue Ma 3 and Zuoquan Lin 1 1 School of Mathematical Sciences, Peking University, Beijing 100871, China 2 Institute
More informationA Zadeh-Norm Fuzzy Description Logic for Handling Uncertainty: Reasoning Algorithms and the Reasoning System
1 / 31 A Zadeh-Norm Fuzzy Description Logic for Handling Uncertainty: Reasoning Algorithms and the Reasoning System Judy Zhao 1, Harold Boley 2, Weichang Du 1 1. Faculty of Computer Science, University
More informationTranslating Ontologies from Predicate-based to Frame-based Languages
1/18 Translating Ontologies from Predicate-based to Frame-based Languages Jos de Bruijn and Stijn Heymans Digital Enterprise Research Institute (DERI) University of Innsbruck, Austria {jos.debruijn,stijn.heymans}@deri.org
More informationA Crisp Representation for Fuzzy SHOIN with Fuzzy Nominals and General Concept Inclusions
A Crisp Representation for Fuzzy SHOIN with Fuzzy Nominals and General Concept Inclusions Fernando Bobillo Miguel Delgado Juan Gómez-Romero Department of Computer Science and Artificial Intelligence University
More informationOntology and Database Systems: Knowledge Representation and Ontologies Part 2: Description Logics
Ontology and Database Systems: Knowledge Representation and Ontologies Diego Calvanese Faculty of Computer Science European Master in Computational Logic A.Y. 2014/2015 Part 2 Description Logics D. Calvanese
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 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 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 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 informationKnowledge Representation and Reasoning Logics for Artificial Intelligence
Knowledge Representation and Reasoning Logics for Artificial Intelligence Stuart C. Shapiro Department of Computer Science and Engineering and Center for Cognitive Science University at Buffalo, The State
More informationInverting Proof Systems for Secrecy under OWA
Inverting Proof Systems for Secrecy under OWA Giora Slutzki Department of Computer Science Iowa State University Ames, Iowa 50010 slutzki@cs.iastate.edu May 9th, 2010 Jointly with Jia Tao and Vasant Honavar
More informationUniversity of Oxford. Consequence-based Datatype Reasoning in EL: Identifying the Tractable Fragments
University of Oxford Consequence-based Datatype Reasoning in EL: Identifying the Tractable Fragments by Despoina Magka St. Peter s College under joint supervision by Prof. Ian Horrocks and Dr. Yevgeny
More informationKnowledge Representation and Ontologies Part 2: Description Logics
Knowledge Representation and Ontologies Diego Calvanese Faculty of Computer Science Master of Science in Computer Science A.Y. 2011/2012 Part 2 Description Logics D. Calvanese (FUB) KRO 2011/2012 (1/95)
More informationThe Complexity of Lattice-Based Fuzzy Description Logics
Noname manuscript No (will be inserted by the editor) The Complexity of Lattice-Based Fuzzy Description Logics From ALC to SHI Stefan Borgwardt Rafael Peñaloza the date of receipt and acceptance should
More informationTranslating XML Web Data into Ontologies
Translating XML Web Data into Ontologies Yuan An and John Mylopoulos University of Toronto, Canada {yuana,jm}@cs.toronto.edu Abstract. Translating XML data into ontologies is the problem of finding an
More informationA Description Logic with Concrete Domains and a Role-forming Predicate Operator
A Description Logic with Concrete Domains and a Role-forming Predicate Operator Volker Haarslev University of Hamburg, Computer Science Department Vogt-Kölln-Str. 30, 22527 Hamburg, Germany http://kogs-www.informatik.uni-hamburg.de/~haarslev/
More informationFirst Order Logic (FOL)
First Order Logic (FOL) CE417: Introduction to Artificial Intelligence Sharif University of Technology Spring 2013 Soleymani Course material: Artificial Intelligence: A Modern Approach, 3 rd Edition, Chapter
More informationExtensions to Description Logics
6 Extensions to Description Logics Franz Baader Ralf Küsters Frank Wolter Abstract This chapter considers, on the one hand, extensions of Description Logics by features not available in the basic framework,
More informationAn Introduction to Description Logics: Techniques, Properties, and Applications. NASSLLI, Day 2, Part 2. Reasoning via Tableau Algorithms.
An Introduction to Description Logics: Techniques, Properties, and Applications NASSLLI, Day 2, Part 2 Reasoning via Tableau Algorithms Uli Sattler 1 Today relationship between standard DL reasoning problems
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 informationUncertainty and Description Logic Programs: A Proposal for Expressing Rules and Uncertainty on Top of Ontologies
Uncertainty and Description Logic Programs: A Proposal for Expressing Rules and Uncertainty on Top of Ontologies Umberto Straccia ISTI-CNR, Via G. Moruzzi 1, I-56124 Pisa ITALY Umberto.Straccia@isti.cnr.it
More informationInconsistency-Tolerant Reasoning with OWL DL
Inconsistency-Tolerant Reasoning with OWL DL Xiaowang Zhang a,, Guohui Xiao b, Zuoquan Lin c, Jan Van den Bussche a a Hasselt University and transnational University of Limburg, 3590 Diepenbeek, Belgium
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 informationLightweight Description Logics: DL-Lite A and EL ++
Lightweight Description Logics: DL-Lite A and EL ++ Elena Botoeva 1 KRDB Research Centre Free University of Bozen-Bolzano January 13, 2011 Departamento de Ciencias de la Computación Universidad de Chile,
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 informationDecidability of SHI with transitive closure of roles
1/20 Decidability of SHI with transitive closure of roles Chan LE DUC INRIA Grenoble Rhône-Alpes - LIG 2/20 Example : Transitive Closure in Concept Axioms Devices have as their direct part a battery :
More informationKnowledge Bases in Description Logics
(1/23) Description Logics Knowledge Bases in Description Logics Enrico Franconi franconi@cs.man.ac.uk http://www.cs.man.ac.uk/ franconi Department of Computer Science, University of Manchester (2/23) Understanding
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 informationLogic and Reasoning in the Semantic Web (part II OWL)
Logic and Reasoning in the Semantic Web (part II OWL) Fulvio Corno, Laura Farinetti Politecnico di Torino Dipartimento di Automatica e Informatica e-lite Research Group http://elite.polito.it Outline Reasoning
More informationReasoning in the SHOQ(D n ) Description Logic
Reasoning in the SHOQ(D n ) Description Logic Jeff Z. Pan and Ian Horrocks Information Management Group Department of Computer Science University of Manchester Oxford Road, Manchester M13 9PL, UK {pan,horrocks}@cs.man.ac.uk
More informationModular Reuse of Ontologies: Theory and Practice
Journal of Artificial Intelligence Research 31 (2008) 273-318 Submitted 07/07; published 02/08 Modular Reuse of Ontologies: Theory and Practice Bernardo Cuenca Grau Ian Horrocks Yevgeny Kazakov Oxford
More informationOn Axiomatic Rejection for the Description Logic ALC
On Axiomatic Rejection for the Description Logic ALC Hans Tompits Vienna University of Technology Institute of Information Systems Knowledge-Based Systems Group Joint work with Gerald Berger Context The
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 informationSemantic Web Uncertainty Management
1 Semantic Web Uncertainty Management Volker Haarslev Concordia University, Canada S Hsueh-leng Pai Concordia University, Canada Nematollaah Shiri Concordia University, Canada INTRODUCTION Since the introduction
More informationComplexity of Subsumption in the EL Family of Description Logics: Acyclic and Cyclic TBoxes
Complexity of Subsumption in the EL Family of Description Logics: Acyclic and Cyclic TBoxes Christoph Haase 1 and Carsten Lutz 2 Abstract. We perform an exhaustive study of the complexity of subsumption
More informationDescription Logics: a Nice Family of Logics. Day 4: More Complexity & Undecidability ESSLLI Uli Sattler and Thomas Schneider
Description Logics: a Nice Family of Logics Day 4: More Complexity & Undecidability ESSLLI 2016 Uli Sattler and Thomas Schneider 1 Next Some complexity results: TBox internalisation makes a DL ExpTime-hard
More informationExtended Decision Procedure for a Fragment of HL with Binders
Extended Decision Procedure for a Fragment of HL with Binders Marta Cialdea Mayer Università di Roma Tre, Italy This is a draft version of a paper appearing on the Journal of Automated Reasoning. It should
More informationMathematical Logics Description Logic: Tbox and Abox
Mathematical Logics Description Logic: Tbox and Abox Fausto Giunchiglia and Mattia Fumagallli University of Trento *Originally by Luciano Serafini and Chiara Ghidini Modified by Fausto Giunchiglia and
More informationKnowledge Representation and Description Logic Part 3
Knowledge Representation and Description Logic Part 3 Renata Wassermann renata@ime.usp.br Computer Science Department University of São Paulo September 2014 IAOA School Vitória Renata Wassermann Knowledge
More informationOWL 2 Rules (Part 1) Tutorial at ESWC2009 May 31, Pascal Hitzler. AIFB, Universität Karlsruhe (TH) Markus Krötzsch
OWL 2 Rules (Part 1) Tutorial at ESWC2009 May 31, 2009 Pascal Hitzler AIFB, Universität Karlsruhe (TH) Markus Krötzsch Sebastian Rudolph http://www.pascal-hitzler.de http://korrekt.org http://www.sebastian-rudolph.de
More informationFuzzy OWL: Uncertainty and the Semantic Web
Fuzzy OWL: Uncertainty and the Semantic Web Giorgos Stoilos 1, Giorgos Stamou 1, Vassilis Tzouvaras 1, Jeff Z. Pan 2 and Ian Horrocks 2 1 Department of Electrical and Computer Engineering, National Technical
More informationAn Introduction to Description Logic IX Tableau-based algorithm
An Introduction to Description Logic IX Tableau-based algorithm Marco Cerami Palacký University in Olomouc Department of Computer Science Olomouc, Czech Republic Olomouc, March 26 th 2015 Marco Cerami
More informationConservative Extensions in Expressive Description Logics
Conservative Extensions in Expressive Description Logics Carsten Lutz 1, Dirk Walther 2, Frank Wolter 2 1 Institut für Theoretische Informatik, TU Dresden, Germany 2 Department of Computer Science, University
More informationOn the Decidability Status of Fuzzy ALC with General Concept Inclusions
J Philos Logic manuscript No. (will be inserted by the editor) On the Decidability Status of Fuzzy ALC with General Concept Inclusions Franz Baader Stefan Borgwardt Rafael Peñaloza Received: date / Accepted:
More informationAlgebraic Tableau Reasoning for the Description Logic SHOQ
Algebraic Tableau Reasoning for the Description Logic SHOQ Jocelyne Faddoul and Volker Haarslev Department of Computer Science and Software Engineering, Concordia University, 1455 de Maisonneuve Blvd.
More informationRole Conjunctions in Expressive Description Logics
Role Conjunctions in Expressive Description Logics Birte Glimm and Yevgeny Kazaov Abstract. We show that adding role conjunctions to the prominent DLs SHIF and SHOIN causes a jump in the computational
More informationAdding ternary complex roles to ALCRP(D)
Adding ternary complex roles to ALCRP(D) A.Kaplunova, V. Haarslev, R.Möller University of Hamburg, Computer Science Department Vogt-Kölln-Str. 30, 22527 Hamburg, Germany Abstract The goal of this paper
More informationExistential Second-Order Logic and Modal Logic with Quantified Accessibility Relations
Existential Second-Order Logic and Modal Logic with Quantified Accessibility Relations preprint Lauri Hella University of Tampere Antti Kuusisto University of Bremen Abstract This article investigates
More informationAn Introduction to Description Logics: Techniques, Properties, and Applications. NASSLLI, Day 3, Part 2. Computational Complexity.
An Introduction to Description Logics: Techniques, Properties, and Applications NASSLLI, Day 3, Part 2 Computational Complexity Uli Sattler 1 Today We will discuss basic notions of computational complexity
More informationNext. Description Logics: a Nice Family of Logics. Some
Next Description Logics: a Nice Family of Logics Day 4: More Complexity & Undecidability ESSLLI 2016 Some complexity results: TBox internalisation makes a DL ExpTime-hard undecidability results: closing
More informationAll Elephants are Bigger than All Mice
Wright State University CORE Scholar Computer Science and Engineering Faculty Publications Computer Science & Engineering 5-2008 All Elephants are Bigger than All Mice Sebastian Rudolph Markus Krotzsch
More informationThe DL-Lite Family of Languages A FO Perspective
The DL-Lite Family of Languages A FO Perspective Alessandro Artale KRDB Research Centre Free University of Bozen-Bolzano Joint work with D. Calvanese, R. Kontchakov, M. Zakharyaschev TU Dresden. December
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 Barış Sertkaya, 1 and Ulrike Sattler 2 1 TU Dresden, Germany and 2 The University of Manchester,
More informationBasic Concepts and Techniques for Managing Uncertainty and Vagueness in Semantic Web Languages. Lecture at Reasoning Web 2008
Basic Concepts and Techniques for Managing Uncertainty and Vagueness in Semantic Web Languages Lecture at Reasoning Web 2008 Umberto Straccia ISTI-CNR, Pisa, Italy straccia@isti.cnr.it 1 Concepts and Techniques
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 informationA METRIC INTERVAL-BASED TEMPORAL DESCRIPTION LOGIC
A METRIC INTERVAL-BASED TEMPORAL DESCRIPTION LOGIC A METRIC INTERVAL-BASED TEMPORAL DESCRIPTION LOGIC By MORTEZA YOUSEF SANATI, B.Sc., M.Sc. A Thesis Submitted to the School of Graduate Studies in Partial
More informationTractable Extensions of the Description Logic EL with Numerical Datatypes
Tractable Extensions of the Description Logic EL with Numerical Datatypes Despoina Magka, Yevgeny Kazakov, and Ian Horrocks Oxford University Computing Laboratory Wolfson Building, Parks Road, OXFORD,
More informationOn the satisfiability problem for a 4-level quantified syllogistic and some applications to modal logic
On the satisfiability problem for a 4-level quantified syllogistic and some applications to modal logic Domenico Cantone and Marianna Nicolosi Asmundo Dipartimento di Matematica e Informatica Università
More informationExpressive number restrictions in Description Logics
Expressive number restrictions in Description Logics Franz Baader and Ulrike Sattler August 12, 1999 Abstract Number restrictions are concept constructors that are available in almost all implemented Description
More informationAdaptive ALE-TBox for Extending Terminological Knowledge
Adaptive ALE-TBox for Extending Terminological Knowledge Ekaterina Ovchinnikova 1 and Kai-Uwe Kühnberger 2 1 University of Tübingen, Seminar für Sprachwissenschaft e.ovchinnikova@gmail.com 2 University
More informationKnowledge Base Exchange: The Case of OWL 2 QL
Knowledge Base Exchange: The Case of OWL 2 QL Marcelo Arenas Pontificia Universidad Católica de Chile, Chile Elena Botoeva, Diego Calvanese, Vladislav Ryzhikov Free University of Bozen-Bolzano, Italy Abstract
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 informationTwo Types of Key Constraints in Description Logics with Concrete Domains. Dũng Dinh-Khac
Master s Thesis on Two Types of Key Constraints in Description Logics with Concrete Domains by Dũng Dinh-Khac born on 31 st August 1980 in Hanoi, Vietnam Advisor: Maja Miličić Supervising Professor: Prof.
More informationThe Description Logic ABox Update Problem Revisited
Dresden University of Technology Department of Computer Science Institute for Theoretical Computer Science Master s Thesis on The Description Logic ABox Update Problem Revisited by Yusri Bong born on February
More informationReasoning with Very Expressive Fuzzy Description Logics
Journal of Artificial Intelligence Research? (????)?-? Submitted 10/05; published?/?? Reasoning with Very Expressive Fuzzy Description Logics Giorgos Stoilos gstoil@image.ece.ntua.gr Giorgos Stamou gstam@softlab.ece.ntua.gr
More informationComplexities of Horn Description Logics
Complexities of Horn Description Logics MARKUS KRÖTZSCH Department of Computer Science, University of Oxford, United Kingdom SEBASTIAN RUDOLPH Institute AIFB, Karlsruhe Institute of Technology, Germany
More informationCombining First-Order Logic Knowledge Bases and Logic Programming using fol-programs Master Thesis
Combining First-Order Logic Knowledge Bases and Logic Programming using fol-programs Master Thesis Michael Felderer, 9655655 July 2006 supervised by Univ.-Prof. Dr. Thomas Strang under co-supervision of
More informationA Tableau Algorithm for Fuzzy Description Logics over Residuated De Morgan Lattices
A Tableau Algorithm for Fuzzy Description Logics over Residuated De Morgan Lattices Stefan Borgwardt and Rafael Peñaloza Theoretical Computer Science, TU Dresden, Germany {stefborg,penaloza}@tcs.inf.tu-dresden.de
More informationDL-LITE R in the Light of Propositional Logic for Decentralized Data Management
DL-LITE R in the Light of Propositional Logic for Decentralized Data Management N. Abdallah and F. Goasdoué LRI: Univ. Paris-Sud, CNRS, and INRIA {nada,fg}@lri.fr M.-C. Rousset LIG: Univ. of Grenoble,
More information