A RESOLUTION DECISION PROCEDURE FOR SHOIQ
|
|
- Eileen Terry
- 5 years ago
- Views:
Transcription
1 A RESOLUTION DECISION PROCEDURE FOR SHOIQ Yevgeny Kazakov and Boris Motik The University of Manchester August 20, 2006
2 SHOIQ IS A DESCRIPTION LOGIC! Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 2/18
3 DESCRIPTION LOGICS: a family language for knowledge representation: HappyFather Human ( 2 haschild) haschild.(famous Rich) Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 2/18
4 DESCRIPTION LOGICS: a family language for knowledge representation: HappyFather Human ( 2 haschild) haschild.(famous Rich) Distinguished by: Formal semantics (set-theoretic) Decidability for key reasoning problems (satisfiability, subsumption, instance) Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 2/18
5 DESCRIPTION LOGICS: a family language for knowledge representation: HappyFather Human ( 2 haschild) haschild.(famous Rich) Distinguished by: Formal semantics (set-theoretic) Decidability for key reasoning problems (satisfiability, subsumption, instance) Related to: (Multi-) Modal Logics, Dynamic Logics Fragments of First-Order Logic (guarded, two-variable) Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 2/18
6 APPLICATION OF DESCRIPTION LOGICS Databases (Schema Integration) Ontologies (Knowledge Bases): Rigorous description of terms in specific domains (Anatomy, Food, Cars) Access information by performing queries:?- Car hastransmittion.automatic haspart.(engene ( 6 haspart.cylider)) Semantic Web: Ontology Web Language OWL (W3C standard) Annotation of enteries using semantic mark-up Provide the meaning of entries <owl:class rdf:id="http: // Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 3/18
7 WHAT IS IT ABOUT SHOIQ? Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 4/18
8 WHAT IS IT ABOUT SHOIQ? DL SHOIQ is a logical counterpart of OWL DL Development of OWL DL-ontologies requires reasoning: computation of class trees (Heart Organ) evaluation of queries (?- Car... ) reasoning (OWL) = theorem proving (SHOIQ) Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 4/18
9 WHAT IS IT ABOUT SHOIQ? DL SHOIQ is a logical counterpart of OWL DL Development of OWL DL-ontologies requires reasoning: computation of class trees (Heart Organ) evaluation of queries (?- Car... ) reasoning (OWL) = theorem proving (SHOIQ) Reasoning in SHOIQ can be reduced to C 2 (the two variable fragment with counting) C 2 is decidable [Grädel et al., 1997] C 2 is NExpTime-compete [Pacholski et al., 2000], [Pratt-Hartmann, 2005] Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 4/18
10 WHAT IS IT ABOUT SHOIQ? DL SHOIQ is a logical counterpart of OWL DL Development of OWL DL-ontologies requires reasoning: computation of class trees (Heart Organ) evaluation of queries (?- Car... ) reasoning (OWL) = theorem proving (SHOIQ) Reasoning in SHOIQ can be reduced to C 2 (the two variable fragment with counting) C 2 is decidable [Grädel et al., 1997] C 2 is NExpTime-compete [Pacholski et al., 2000], [Pratt-Hartmann, 2005] but these procedures are not practical ( guess-and-check ) Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 4/18
11 WHAT IS IT ABOUT SHOIQ? DL SHOIQ is a logical counterpart of OWL DL Development of OWL DL-ontologies requires reasoning: computation of class trees (Heart Organ) evaluation of queries (?- Car... ) reasoning (OWL) = theorem proving (SHOIQ) Reasoning in SHOIQ can be reduced to C 2 (the two variable fragment with counting) C 2 is decidable [Grädel et al., 1997] C 2 is NExpTime-compete [Pacholski et al., 2000], [Pratt-Hartmann, 2005] but these procedures are not practical ( guess-and-check ) [Horrocks & Sattler, 2005] the first (and the only up until now) goal-directed procedure for SHOIQ Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 4/18
12 WHAT IS IT ABOUT SHOIQ? DL SHOIQ is a logical counterpart of OWL DL Development of OWL DL-ontologies requires reasoning: computation of class trees (Heart Organ) evaluation of queries (?- Car... ) reasoning (OWL) = theorem proving (SHOIQ) Reasoning in SHOIQ can be reduced to C 2 (the two variable fragment with counting) C 2 is decidable [Grädel et al., 1997] C 2 is NExpTime-compete [Pacholski et al., 2000], [Pratt-Hartmann, 2005] but these procedures are not practical ( guess-and-check ) [Horrocks & Sattler, 2005] the first (and the only up until now) goal-directed procedure for SHOIQ Now we can decide SHOIQ also by resolution! Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 4/18
13 WHY A RESOLUTION-BASED DECISION PROCEDURE FOR SHOIQ? Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 5/18
14 WHY A RESOLUTION-BASED DECISION PROCEDURE FOR SHOIQ? different from the tableau-based approach search for proofs vs. search for models Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 5/18
15 WHY A RESOLUTION-BASED DECISION PROCEDURE FOR SHOIQ? different from the tableau-based approach search for proofs vs. search for models likely to behave differently for different types of problems: Tableau is good for reasoning with large schema (terminologies) Resolution is useful for reasoning with large data (assertions) [Hustadt, Motik & Sattler, 2004] Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 5/18
16 Description Logics and Ontologies DLs: Basics DESCRIPTION LOGICS: SYNTAX AXIOMS Researcher Human produce.paper Researcher (Rob) Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 6/18
17 Description Logics and Ontologies DLs: Basics DESCRIPTION LOGICS: SYNTAX AXIOMS Researcher Human produce.paper Researcher (Rob) Terminology Assertions Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 6/18
18 Description Logics and Ontologies DLs: Basics DESCRIPTION LOGICS: SYNTAX AXIOMS Researcher Human produce.paper Researcher (Rob) Terminology Assertions Basic building blocks of DLs: Concept names Role names Individuals Operators Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 6/18
19 Description Logics and Ontologies DLs: Basics DESCRIPTION LOGICS: SYNTAX AXIOMS Researcher Human produce.paper Researcher (Rob) Terminology Assertions Basic building blocks of DLs: Concept names sets: Researcher, Human, Paper Role names Individuals Operators Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 6/18
20 Description Logics and Ontologies DLs: Basics DESCRIPTION LOGICS: SYNTAX AXIOMS Researcher Human produce.paper Researcher (Rob) Terminology Assertions Basic building blocks of DLs: Concept names sets: Role names binary relations: Researcher, Human, Paper produces Individuals Operators Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 6/18
21 Description Logics and Ontologies DLs: Basics DESCRIPTION LOGICS: SYNTAX AXIOMS Researcher Human produce.paper Researcher (Rob) Terminology Assertions Basic building blocks of DLs: Concept names sets: Role names binary relations: Individuals constants: Researcher, Human, Paper produces Rob Operators Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 6/18
22 Description Logics and Ontologies DLs: Basics DESCRIPTION LOGICS: SYNTAX AXIOMS Researcher Human produce.paper Researcher (Rob) Terminology Assertions Basic building blocks of DLs: Concept names sets: Role names binary relations: Individuals constants: Researcher, Human, Paper produces Rob Operators logical constructors: C 1 C 2, r.c, A C Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 6/18
23 Description Logics and Ontologies DLs: Basics DESCRIPTION LOGICS: SEMANTICS AXIOMS Researcher Human produces.paper Researcher (Rob) Basic building blocks of DLs: Concept names Role names Individuals Researcher, Human, Paper produces Rob Operators C 1 C 2, r.c, A C Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 7/18
24 Description Logics and Ontologies DLs: Basics DESCRIPTION LOGICS: SEMANTICS AXIOMS Researcher Human produces.paper Researcher (Rob) Basic building blocks of DLs: Concept names unary atoms: Role names Individuals Researcher, Human, Paper Researcher(x), Human(x), Paper(x) produces Rob Operators C 1 C 2, r.c, A C Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 7/18
25 Description Logics and Ontologies DLs: Basics DESCRIPTION LOGICS: SEMANTICS AXIOMS Researcher Human produces.paper Researcher (Rob) Basic building blocks of DLs: Concept names unary atoms: Role names binary atoms: Individuals Researcher(x), Human(x), Paper(x) produces produces(x,y) Rob Operators C 1 C 2, r.c, A C Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 7/18
26 Description Logics and Ontologies DLs: Basics DESCRIPTION LOGICS: SEMANTICS AXIOMS Researcher Human produces.paper Researcher (Rob) Basic building blocks of DLs: Concept names unary atoms: Researcher(x), Human(x), Paper(x) Role names binary atoms: produces(x,y) Individuals Rob constants: Rob Operators C 1 C 2, r.c, A C Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 7/18
27 Description Logics and Ontologies DLs: Basics DESCRIPTION LOGICS: SEMANTICS AXIOMS Researcher Human produces.paper Researcher (Rob) Basic building blocks of DLs: Concept names unary atoms: Researcher(x), Human(x), Paper(x) Role names binary atoms: produces(x,y) Individuals constants: Rob Operators C 1 C 2, r.c, A C constructors: C 1 (x) C 2 (x), y.[r(x, y) C(y)], x.[a(x) C(x)] Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 7/18
28 Description Logics and Ontologies DLs: Basics DESCRIPTION LOGICS: SEMANTICS AXIOMS Researcher(x) Human(x) y.[produces(x, y) Paper(y)] Researcher (Rob) Basic building blocks of DLs: Concept names unary atoms: Researcher(x), Human(x), Paper(x) Role names binary atoms: produces(x,y) Individuals constants: Rob Operators constructors: C 1 (x) C 2 (x), y.[r(x, y) C(y)], x.[a(x) C(x)] Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 7/18
29 Description Logics and Ontologies DLs: Basics HIERARCHY OF DLS Basic Description Logic ALC:,,, r.c, r.c, Transitive Roles: Transitive(r) S Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 8/18
30 Description Logics and Ontologies DLs: Basics HIERARCHY OF DLS Basic Description Logic ALC:,,, r.c, r.c, Transitive Roles: Transitive(r) S Role Hierarchies: r 1 r 2 H Inverse Roles: r 2 I Qualified Number Restrictions: ( n r.c), ( n r.c) Q = SHIQ Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 8/18
31 Description Logics and Ontologies DLs: Basics HIERARCHY OF DLS Basic Description Logic ALC:,,, r.c, r.c, Transitive Roles: Transitive(r) S Role Hierarchies: r 1 r 2 H Inverse Roles: r 2 I Qualified Number Restrictions: ( n r.c), ( n r.c) Q = SHIQ Nominals: {i} O = SHOIQ Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 8/18
32 Description Logics and Ontologies SHOIQ EXPRESSIVE POWER OF SHOIQ Cardinality restrictions: C n C {i 1 } {i 2 } {i n } C n Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 9/18
33 Description Logics and Ontologies SHOIQ EXPRESSIVE POWER OF SHOIQ Cardinality restrictions: C n, C n C {i 1 } {i 2 } {i n } C {i 1 } {i 2 } {i n } {i p } {i q }, p < q C n C n Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 9/18
34 Description Logics and Ontologies SHOIQ EXPRESSIVE POWER OF SHOIQ Cardinality restrictions: C n, C n Large cardinality restrictions: C 0 {i} C 0 ( 2 r.c 1 ) i C 0 C 0 1 C 1 2 C 1 Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 9/18
35 Description Logics and Ontologies SHOIQ EXPRESSIVE POWER OF SHOIQ Cardinality restrictions: C n, C n Large cardinality restrictions: C 0 {i} C 0 ( 2 r.c 1 ) C 1 ( 2 r.c 2 ) C n 1 ( 2 r.c n ) i C 0 C 0 1 C 1 2 C 1 C 2 Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 9/18
36 Description Logics and Ontologies SHOIQ EXPRESSIVE POWER OF SHOIQ Cardinality restrictions: C n, C n Large cardinality restrictions: C 0 {i} C 0 ( 2 r.c 1 ) C 1 ( 2 r.c 2 ) C n 1 ( 2 r.c n ) ( 1 r. ) i C 0 C 0 1 C 1 2 C 1 C 2 Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 9/18
37 Description Logics and Ontologies SHOIQ EXPRESSIVE POWER OF SHOIQ Cardinality restrictions: C n, C n Large cardinality restrictions: C 2 n C 0 {i} C 0 ( 2 r.c 1 ) C 1 ( 2 r.c 2 ) C n 1 ( 2 r.c n ) ( 1 r. ) i C 0 C 0 1 C 1 2 C 1 C n 2 n C 2 Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 9/18
38 Description Logics and Ontologies SHOIQ EXPRESSIVE POWER OF SHOIQ Cardinality restrictions: C n, C n Large cardinality restrictions: C 2 n, C 2 n C 0 {i} C 0 ( 2 r.c 1 ) C 1 ( 2 r.c 2 ) C n 1 ( 2 r.c n ) ( 1 r. ) C 0 {i} C 1 ( 1 r.c 0 ) C 2 ( 1 r.c 1 ) C n ( 1 r.c n 1 ) ( 2 r. ) i C 0 C 0 1 C 1 2 C 1 C n 2 n C 2 i C 0 C 0 1 C 1 2 C 1 C n 2 n C 2 Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 9/18
39 Description Logics and Ontologies SHOIQ EXPRESSIVE POWER OF SHOIQ Cardinality restrictions: C n, C n Large cardinality restrictions: C 2 n, C 2 n C 0 {i} C 0 ( 2 r.c 1 ) C 1 ( 2 r.c 2 ) C n 1 ( 2 r.c n ) ( 1 r. ) C 0 {i} C 1 ( 1 r.c 0 ) C 2 ( 1 r.c 1 ) C n ( 1 r.c n 1 ) ( 2 r. ) i C 0 C 0 1 C 1 2 C 1 C n 2 n C 2 i C 0 C 0 1 C 1 2 C 1 C n 2 n C 2 Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 9/18
40 Description Logics and Ontologies SHOIQ EXPRESSIVE POWER OF SHOIQ Cardinality restrictions: C n, C n Large cardinality restrictions: C 2 n, C 2 n Huge cardinality restrictions: C 2 2n, C 2 2n Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 9/18
41 Description Logics and Ontologies SHOIQ EXPRESSIVE POWER OF SHOIQ Cardinality restrictions: C n, C n Large cardinality restrictions: C 2 n, C 2 n Huge cardinality restrictions: C 2 2n, C 2 2n B n B 0 {i} ( 1 r. ) i B n B 1 B 0 = 0 B n B 1 B 0 = 1 ( 2 r. ) B n B 1 B 0 = 2... B 0 r. B 0 = 2 B 0 r. B 0 B i+1 B i r. B i+1 bits count over r B i+1 B i r. B i+1 B i+1 B i r.[ ( B i+1 B i ) ( B i+1 B i ) ] B i+1 B i r.[ ( B i+1 B i ) ( B i+1 B i ) ] Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 9/18
42 Resolution Decision Procedures RESOLUTION-BASED PROCEDURES: THE BASIC PRINCIPLES Invented by Joyner Jr. (1976) Allows one to use existing automated theorem provers (SPASS, VAMPIRE) as decision procedures The general idea is as follows: 1 Define a clause class for the target fragment 2 Show that this class is closed under inferences 3 Show the class is finite for a fixed signature Many decision procedures are based on this principle: clause classes E, S +, E +, etc. [Fermüller et al., 1993] modal logics [Schmidt, 1997], [Hustadt, 1999], fragments of first-order logic [Bachmair et al., 1993], [Ganzinger & de Nivelle, 1999]. Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 10/18
43 Resolution Decision Procedures HOW TO TURN RESOLUTION INTO A DECISION PROCEDURE? Tweak the parameters of a prover (ordering and selection function) so that the size of clauses does not grow Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 11/18
44 Resolution Decision Procedures HOW TO TURN RESOLUTION INTO A DECISION PROCEDURE? Tweak the parameters of a prover (ordering and selection function) so that the size of clauses does not grow Problematic situations: EXAMPLE A(c) A r.a A(c) A(x) A(f(x)) A(f(c)) A(f(f(c))) Problem: the depth grows Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 11/18
45 Resolution Decision Procedures HOW TO TURN RESOLUTION INTO A DECISION PROCEDURE? Tweak the parameters of a prover (ordering and selection function) so that the size of clauses does not grow Problematic situations: EXAMPLE A(c) A r.a A(c) A(x) A(f(x)) A(f(c)) A(f(f(c))) Problem: the depth grows The reason: the selected literal is not the deepest one Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 11/18
46 Resolution Decision Procedures HOW TO TURN RESOLUTION INTO A DECISION PROCEDURE? Tweak the parameters of a prover (ordering and selection function) so that the size of clauses does not grow Problematic situations: EXAMPLE A(c) A r.a A(c) A(x) A(f(x)) A(f(c)) A(f(f(c))) Problem: the depth grows The reason: the selected literal is not the deepest one Solution: resolve on the depest literal Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 11/18
47 Resolution Decision Procedures HOW TO TURN RESOLUTION INTO A DECISION PROCEDURE? Tweak the parameters of a prover (ordering and selection function) so that the size of clauses does not grow Problematic situations: EXAMPLE A(c) A R.A A(c) A(x) R(x, y) A(y) R(c, y 1 ) A(y 1 ) R(c, y 1 ) R(y 1, y 2 ) A(y 2 )... Problem: variables got duplicated Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 11/18
48 Resolution Decision Procedures HOW TO TURN RESOLUTION INTO A DECISION PROCEDURE? Tweak the parameters of a prover (ordering and selection function) so that the size of clauses does not grow Problematic situations: EXAMPLE A(c) A R.A A(c) A(x) R(x, y) A(y) R(c, y 1 ) A(y 1 ) R(c, y 1 ) R(y 1, y 2 ) A(y 2 )... Problem: variables got duplicated The reason: the unified expression does not contain all variables of the clause Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 11/18
49 Resolution Decision Procedures HOW TO TURN RESOLUTION INTO A DECISION PROCEDURE? Tweak the parameters of a prover (ordering and selection function) so that the size of clauses does not grow Problematic situations: EXAMPLE A(c) A R.A A(c) A(x) R(x, y) A(y) R(c, y 1 ) A(y 1 ) R(c, y 1 ) R(y 1, y 2 ) A(y 2 )... Problem: variables got duplicated The reason: the unified expression does not contain all variables of the clause Solution: resolve on the expression with all variables Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 11/18
50 Resolution Decision Procedures HOW TO TURN RESOLUTION INTO A DECISION PROCEDURE? Tweak the parameters of a prover (ordering and selection function) so that the size of clauses does not grow Problematic situations: depth or no. of variables grows Decidability is typically a consequence that all expressions in clauses are covering: Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 11/18
51 Resolution Decision Procedures HOW TO TURN RESOLUTION INTO A DECISION PROCEDURE? Tweak the parameters of a prover (ordering and selection function) so that the size of clauses does not grow Problematic situations: depth or no. of variables grows Decidability is typically a consequence that all expressions in clauses are covering: every functional term of an expression contains all variables EXAMPLE A(x) r(x, f(x, y)) A(x) x c term f(x, y) is covering term c is not covering Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 11/18
52 Deciding SHOIQ by Resolution DIFFICULTIES WITH SHOIQ IN RESOLUTION EXAMPLE O {i} 1. O(x) x i O r.o 2. O(x) r(x, f (x)) 3. O(x) O(f (x)) 1 r. 4. r(x, y) x g(y) i Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 12/18
53 Deciding SHOIQ by Resolution DIFFICULTIES WITH SHOIQ IN RESOLUTION EXAMPLE O {i} 1. O(x) x i not covering O r.o 2. O(x) r(x, f (x)) 3. O(x) O(f (x)) 1 r. 4. r(x, y) x g(y) not covering Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 12/18
54 Deciding SHOIQ by Resolution DIFFICULTIES WITH SHOIQ IN RESOLUTION EXAMPLE O {i} 1. O(x) x i O r.o 2. O(x) r(x, f (x)) 3. O(x) O(f (x)) 1 r. 4. r(x, y) x g(y) OR[1; 3] : 5. O(x) f (x) i OR[2; 4] : 6. O(x) x g(f (x)) OP[5; 6] : 7. O(x) x g(i) Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 12/18
55 Deciding SHOIQ by Resolution DIFFICULTIES WITH SHOIQ IN RESOLUTION EXAMPLE O {i} 1. O(x) x i O r.o 2. O(x) r(x, f (x)) 3. O(x) O(f (x)) 1 r. 4. r(x, y) x g(y) OR[1; 3] : 5. O(x) f (x) i OR[2; 4] : 6. O(x) x g(f (x)) OP[5; 6] : 7. O(x) x g(i) of the same form Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 12/18
56 Deciding SHOIQ by Resolution DIFFICULTIES WITH SHOIQ IN RESOLUTION EXAMPLE O {i} 1. O(x) x i O r.o 2. O(x) r(x, f (x)) 3. O(x) O(f (x)) 1 r. 4. r(x, y) x g(y) OR[1; 3] : 5. O(x) f (x) i OR[2; 4] : 6. O(x) x g(f (x)) OP[5; 6] : 7. O(x) x g(i) O(x) x g(g(i)) O(x) x g(g(g(i))) of the same form produces deeper clauses Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 12/18
57 Deciding SHOIQ by Resolution DIFFICULTIES WITH SHOIQ IN RESOLUTION EXAMPLE O {i} 1. O(x) x i O r.o 2. O(x) r(x, f (x)) 3. O(x) O(f (x)) 1 r. 4. r(x, y) x g(y) OR[1; 3] : 5. O(x) f (x) i OR[2; 4] : 6. O(x) x g(f (x)) OP[5; 6] : 7. O(x) x g(i) add new: 8. O(x) i g(i) consequence of 1 and 7 Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 12/18
58 Deciding SHOIQ by Resolution DIFFICULTIES WITH SHOIQ IN RESOLUTION EXAMPLE O {i} 1. O(x) x i O r.o 2. O(x) r(x, f (x)) REDUNDANCY FOR CLAUSES 3. O(x) O(f (x)) 1 r. A4. r(x, clausey) is redundant x g(y) if it follows from smaller clauses OR[1; 3] : 5. O(x) f (x) i OR[2; 4] : 6. O(x) x g(f (x)) OP[5; 6] : 7. O(x) x g(i) follows from 1 and 8 8. O(x) i g(i) consequence of 1 and 7 Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 12/18
59 Deciding SHOIQ by Resolution DIFFICULTIES WITH SHOIQ IN RESOLUTION EXAMPLE O {i} 1. O(x) x i O r.o 2. O(x) r(x, f (x)) REDUNDANCY FOR CLAUSES 3. O(x) O(f (x)) 1 r. A4. r(x, clausey) is redundant x g(y) if it follows from smaller clauses OR[1; 3] : 5. O(x) f (x) i OR[2; 4] : 6. O(x) x g(f (x)) OP[5; 6] : 7. O(x) x g(i) follows from 1 and 8 larger than 1, 8. O(x) i g(i) Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 12/18
60 Deciding SHOIQ by Resolution DIFFICULTIES WITH SHOIQ IN RESOLUTION EXAMPLE O {i} 1. O(x) x i O r.o 2. O(x) r(x, f (x)) REDUNDANCY FOR CLAUSES 3. O(x) O(f (x)) 1 r. A4. r(x, clausey) is redundant x g(y) if it follows from smaller clauses OR[1; 3] : 5. O(x) f (x) i OR[2; 4] : 6. O(x) x g(f (x)) OP[5; 6] : 7. O(x) x g(i) follows from 1 and 8 larger than 1, but not larger than 8! 8. O(x) i g(i) Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 12/18
61 Deciding SHOIQ by Resolution DIFFICULTIES WITH SHOIQ IN RESOLUTION EXAMPLE O {i} 1. O(x) x i O r.o 2. O(x) r(x, f (x)) REDUNDANCY FOR CLAUSES 3. O(x) O(f (x)) 1 r. A4. r(x, clausey) is redundant x g(y) if it follows from smaller clauses OR[1; 3] : 5. O(x) f (x) i OR[2; 4] : 6. O(x) x g(f (x)) OP[5; 6] : 7. O(x) x g(i) Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 12/18
62 Deciding SHOIQ by Resolution DIFFICULTIES WITH SHOIQ IN RESOLUTION EXAMPLE O {i} 1. O(x) x i O r.o 2. O(x) r(x, f (x)) REDUNDANCY FOR CLAUSES 3. O(x) O(f (x)) 1 r. A4. r(x, clausey) is redundant x g(y) if it follows from smaller clauses OR[1; 3] : 5. O(x) f (x) i OR[2; 4] : 6. O(x) x g(f (x)) OP[5; 6] : 7. O(x) x g(i) wait a bit... OR[7; 3] : 8. O(x) f (x) g(i) Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 12/18
63 Deciding SHOIQ by Resolution DIFFICULTIES WITH SHOIQ IN RESOLUTION EXAMPLE O {i} 1. O(x) x i O r.o 2. O(x) r(x, f (x)) REDUNDANCY FOR CLAUSES 3. O(x) O(f (x)) 1 r. A4. r(x, clausey) is redundant x g(y) if it follows from smaller clauses OR[1; 3] : 5. O(x) f (x) i OR[2; 4] : 6. O(x) x g(f (x)) OP[5; 6] : 7. O(x) x g(i) wait a bit... OR[7; 3] : 8. O(x) f (x) g(i) add: 9. O(x) i g(i) consequence of 5 and 8 Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 12/18
64 Deciding SHOIQ by Resolution DIFFICULTIES WITH SHOIQ IN RESOLUTION EXAMPLE O {i} 1. O(x) x i O r.o 2. O(x) r(x, f (x)) REDUNDANCY FOR CLAUSES 3. O(x) O(f (x)) 1 r. A4. r(x, clausey) is redundant x g(y) if it follows from smaller clauses OR[1; 3] : 5. O(x) f (x) i OR[2; 4] : 6. O(x) x g(f (x)) OP[5; 6] : 7. O(x) x g(i) wait a bit... OR[7; 3] : 8. O(x) f (x) g(i) follows from 5 and 9 larger than 5, and larger than 9! 9. O(x) i g(i) consequence of 5 and 8 Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 12/18
65 Deciding SHOIQ by Resolution DIFFICULTIES WITH SHOIQ IN RESOLUTION EXAMPLE O {i} 1. O(x) x i O r.o 2. O(x) r(x, f (x)) REDUNDANCY FOR CLAUSES 3. O(x) O(f (x)) 1 r. A4. r(x, clausey) is redundant x g(y) if it follows from smaller clauses OR[1; 3] : 5. O(x) f (x) i OR[2; 4] : 6. O(x) x g(f (x)) OP[5; 6] : 7. O(x) x g(i) wait a bit... OR[7; 3] : 8. O(x) f (x) g(i) remove! 9. O(x) i g(i) The saturation procedure terminates! consequence of 5 and 8 Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 12/18
66 Deciding SHOIQ by Resolution NOMINAL GENERATION The idea is developed into a new simplification rule that introduces constants NOMINAL GENERATION α(x) n i=1 f (x) t i α(x) n i=1 f (x) c i α(x) n j=1 c i t j 1 i n where (i) c i are fresh constants for t i and α Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 13/18
67 Deciding SHOIQ by Resolution NOMINAL GENERATION The idea is developed into a new simplification rule that introduces constants the constants are reused when the rule has been applied to α(x) and f (x) before. NOMINAL GENERATION α(x) n i=1 f (x) t i α(x) k i=1 f (x) c i α(x) n j=1 c i t j 1 i k where (i) c i are fresh constants for t i and α, (ii) k=n for the first application of rule for α(x) and f (x), otherwise k and c i are reused Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 13/18
68 Deciding SHOIQ by Resolution NOMINAL GENERATION The idea is developed into a new simplification rule that introduces constants the constants are reused when the rule has been applied to α(x) and f (x) before. there is a second variant of this rule for a different type of clauses NOMINAL GENERATION 1 α(x) n i=1 f (x) t i α(x) k i=1 f (x) c i α(x) n j=1 c i t j 1 i k where (i) c i are fresh constants for t i and α, (ii) k=n for the first application of rule for α(x) and f (x), otherwise k and c i are reused NOMINAL GENERATION 2 α(x) n i=1 f (x) t i n i=1 x c i Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 13/18
69 Deciding SHOIQ by Resolution TERMINATION AND COMPLEXITY ANALYSIS Every application of the rule can increase the number of constants by at most a polynomial factor NOMINAL GENERATION α(x) n i=1 f (x) t i α(x) k i=1 f (x) c i α(x) n j=1 c i t j 1 i k where (i) c i are fresh constants for t i and α, (ii) k=n for the first application of rule for α(x) and f (x), otherwise k and c i are reused Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 14/18
70 Deciding SHOIQ by Resolution TERMINATION AND COMPLEXITY ANALYSIS Every application of the rule can increase the number of constants by at most a polynomial factor There are at most exponentially many applications possible (exponentially many pairs α(x) and f (x)) NOMINAL GENERATION α(x) n i=1 f (x) t i α(x) k i=1 f (x) c i α(x) n j=1 c i t j 1 i k where (i) c i are fresh constants for t i and α, (ii) k=n for the first application of rule for α(x) and f (x), otherwise k and c i are reused Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 14/18
71 Deciding SHOIQ by Resolution TERMINATION AND COMPLEXITY ANALYSIS Every application of the rule can increase the number of constants by at most a polynomial factor There are at most exponentially many applications possible (exponentially many pairs α(x) and f (x)) Hence the procedure terminates, with the upper bound: 3EXPTIME NOMINAL GENERATION α(x) n i=1 f (x) t i α(x) k i=1 f (x) c i α(x) n j=1 c i t j 1 i k where (i) c i are fresh constants for t i and α, (ii) k=n for the first application of rule for α(x) and f (x), otherwise k and c i are reused Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 14/18
72 Deciding SHOIQ by Resolution WHY IS IT SO HARD? In SHOIQ it is possible to express very large cardinality restrictions like C 2 2n, D 2 2m. Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 15/18
73 Deciding SHOIQ by Resolution WHY IS IT SO HARD? In SHOIQ it is possible to express very large cardinality restrictions like C 2 2n, D 2 2m. Hence, it is possible to encode combinatorial constraints involving very big numbers: EXAMPLE A B 2 2n, A C 2 2m +k, B C 2 2k, C 2 n Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 15/18
74 Deciding SHOIQ by Resolution WHY IS IT SO HARD? In SHOIQ it is possible to express very large cardinality restrictions like C 2 2n, D 2 2m. Hence, it is possible to encode combinatorial constraints involving very big numbers Such problems (in particular, the pigeon hole principle) are known to be hard for resolution since it is not really capable to deal with numbers Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 15/18
75 Conclusions CONCLUSIONS We have found a decision procedure for SHOIQ based on basic superposition calculus which runs in 3ExpTime High complexity is due to combination of: nominals + number restrictions + inverse roles The restriction of the procedure to simpler languages (SHOIQ, ALC) behaves like procedures known before hence it exhibits pay as you go behaviour The restricted version for SHIQ has proved itself in practice in system KAON2 1 No additional degree of non-determinism is introduced by NOMINAL GENERATION rules Future developments: Integration of algebraic reasoning into resolution? 1 Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 16/18
76 Conclusions Thank You! Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 17/18
77 COMPARISON WITH THE TABLEAU PROCEDURE Constants introduced by Nominal Generation correspond (in some way) to nominal nodes. The exact number of different constants is not guessed, but equality constraints are generated Blocking is native in resolution by subsumption deletion No yo-yo effect in resolution, since deletion of clauses is permanent (A picture from the presentation by Horrocks & Sattler on A Tableau Decision Procedure for SHOIQ [2005]) Yevgeny Kazakov and Boris Motik A Resolution Decision Procedure for SHOIQ 18/18
Structured 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 informationA Resolution Decision Procedure for the Guarded Fragment with Transitive Guards
A Resolution Decision Procedure for the Guarded Fragment with Transitive Guards Yevgeny Kazakov MPI für Informatik, Saarbrücken, Germany ykazakov@mpi-sb.mpg.de Abstract. We show how well-known refinements
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 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 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 informationConsequence-Based Reasoning beyond Horn Ontologies
Consequence-Based Reasoning beyond Horn Ontologies František Simančík and Yevgeny Kazakov and Ian Horrocks The Department of Computer Science, University of Oxford { frantisek.simancik, yevgeny.kazakov,
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 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 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 informationFinite Model Reasoning in Horn-SHIQ
Finite Model Reasoning in Horn-SHIQ Yazmín Ibañez-García 1, Carsten Lutz 2, and Thomas Schneider 2 1 KRDB Research Centre, Free Univ. of Bozen-Bolzano, Italy,{ibanezgarcia@inf.unibz.it} 2 Univ. Bremen,
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 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 informationReasoning in Description Logics with a Concrete Domain in the Framework of Resolution
Reasoning in Description Logics with a Concrete Domain in the Framework of Resolution Ullrich Hustadt 1 and Boris Motik 2 and Ulrike Sattler 3 Abstract. In description logics, concrete domains are used
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 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 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 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 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 informationExtracting Modules from Ontologies: A Logic-based Approach
Extracting Modules from Ontologies: A Logic-based Approach Bernardo Cuenca Grau, Ian Horrocks, Yevgeny Kazakov and Ulrike Sattler The University of Manchester School of Computer Science Manchester, M13
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 informationA Polynomial Translation from the Two-Variable Guarded Fragment with Number Restrictions to the Guarded Fragment
A Polynomial Translation from the Two-Variable Guarded Fragment with Number Restrictions to the Guarded Fragment Yevgeny Kazakov MPI für Informatik, D-66123 Saarbrücken, Germany ykazakov@mpi-sb.mpg.de
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 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 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 informationConsequence-based Reasoning for Description Logics with Disjunction, Inverse Roles, Number Restrictions, and Nominals
Consequence-based Reasoning for Description Logics with Disjunction, Inverse Roles, Number Restrictions, and Nominals David Tena Cucala, Bernardo Cuenca Grau and Ian Horrocks Department of Computer Science,
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 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 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 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 informationReducing SHIQ Description Logic to Disjunctive Datalog Programs
Reducing SHIQ Description Logic to Disjunctive Datalog Programs Ullrich Hustadt Department of Computer Science University of Liverpool Liverpool, UK U.Hustadt@csc.liv.ac.uk Boris Motik FZI Research Center
More informationModeling Ontologies Using OWL, Description Graphs, and Rules
Modeling Ontologies Using OWL, Description Graphs, and Rules Boris Motik 1, Bernardo Cuenca Grau 1, Ian Horrocks 1, and Ulrike Sattler 2 1 University of Oxford, UK 2 University of Manchester, UK 1 Introduction
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 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 informationA Logical Framework for Modularity of Ontologies
A Logical Framework for Modularity of Ontologies Bernardo Cuenca Grau, Ian Horrocks, Yevgeny Kazakov and Ulrike Sattler The University of Manchester School of Computer Science Manchester, M13 9PL, UK {bcg,
More informationExtending Consequence-Based Reasoning to SHIQ
Extending Consequence-Based Reasoning to SHIQ Andrew Bate, Boris Motik, Bernardo Cuenca Grau, František Simančík, and Ian Horrocks University of Oxford Oxford, United Kingdom first.last@cs.ox.ac.uk 1 Introduction
More informationDecidability of Description Logics with Transitive Closure of Roles in Concept and Role Inclusion Axioms
Proc. 23rd Int. Workshop on Description Logics (DL2010), CEUR-WS 573, Waterloo, Canada, 2010. Decidability of Description Logics with Transitive Closure of Roles in Concept and Role Inclusion Axioms Chan
More informationComplexity of Reasoning in Entity Relationship Models
Complexity of Reasoning in Entity Relationship Models A. Artale 1, D. Calvanese 1, R. Kontchakov 2, V. Ryzhikov 1, M. Zakharyaschev 2 1 Faculty of Computer Science Free University of Bozen-Bolzano I-39100
More informationReasoning in Expressive Gödel Description Logics
Reasoning in Expressive Gödel Description Logics Stefan Borgwardt 1 and Rafael Peñaloza 2 1 Chair for Automata Theory, Theoretical Computer Science, TU Dresden, Germany stefan.borgwardt@tu-dresden.de 2
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 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 informationQuery Answering in the Horn Fragments of the Description Logics SHOIQ and SROIQ
Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence Query Answering in the Horn Fragments of the Description Logics SHOIQ and SROIQ Magdalena Ortiz and Sebastian
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 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 informationDeveloping Modal Tableaux and Resolution Methods via First-Order Resolution
Developing Modal Tableaux and Resolution Methods via First-Order Resolution Renate Schmidt University of Manchester Reference: Advances in Modal Logic, Vol. 6 (2006) Modal logic: Background Established
More informationRepresenting Structured Objects using Description Graphs
Representing Structured Objects using Description Graphs Boris Motik, Bernardo Cuenca Grau, Ian Horrocks University of Oxford Oxford, UK Ulrike Sattler University of Manchester Manchester, UK Abstract
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 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 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 informationCombining description and similarity logics
Combining description and similarity logics M. Sheremet, 1 D. Tishkovsky, 2 F. Wolter, 2 and M. Zakharyaschev 1 1 School of Computer Science and 2 Department of Computer Science Information Systems, Birkbeck
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 informationA Tractable Rule Language in the Modal and Description Logics that Combine CPDL with Regular Grammar Logic
A Tractable Rule Language in the Modal and Description Logics that Combine CPDL with Regular Grammar Logic Linh Anh Nguyen Institute of Informatics, University of Warsaw Banacha 2, 02-097 Warsaw, Poland
More informationConsequence-Based Reasoning for Ontology Classification
Consequence-Based Reasoning for Ontology Classification František Simančík Worcester College University of Oxford A thesis submitted for the degree of Doctor of Philosophy Trinity 2013 Abstract Description
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 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 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 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 informationOptimisation of Terminological Reasoning
Optimisation of Terminological Reasoning Ian Horrocks Department of Computer Science University of Manchester, UK horrocks@cs.man.ac.uk Stephan Tobies LuFG Theoretical Computer Science RWTH Aachen, Germany
More informationNonmonotonic Reasoning in Description Logic by Tableaux Algorithm with Blocking
Nonmonotonic Reasoning in Description Logic by Tableaux Algorithm with Blocking Jaromír Malenko and Petr Štěpánek Charles University, Malostranske namesti 25, 11800 Prague, Czech Republic, Jaromir.Malenko@mff.cuni.cz,
More informationUsing Tableau to Decide Expressive Description Logics with Role Negation
Using Tableau to Decide Expressive Description Logics with Role Negation Renate A. Schmidt and Dmitry Tishkovsky School of Computer Science, The University of Manchester {renate.schmidt,dmitry.tishkovsky}@manchester.ac.uk
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 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 informationOn the Complexity of the Reflected Logic of Proofs
On the Complexity of the Reflected Logic of Proofs Nikolai V. Krupski Department of Math. Logic and the Theory of Algorithms, Faculty of Mechanics and Mathematics, Moscow State University, Moscow 119899,
More informationReasoning in Description Logics using Resolution and Deductive Databases
Zur Erlangung des akademischen Grades eines Doktors der Wirtschaftswissenschaften (Dr. rer. pol.) von der Fakultät für Wirtschaftswissenschaften der Universität Fridericiana zu Karlsruhe genehmigte Dissertation.
More informationOptimized Description Logic Reasoning via Core Blocking
Optimized Description Logic Reasoning via Core Blocking Birte Glimm, Ian Horrocks, and Boris Motik Oxford University Computing Laboratory, UK Abstract. State of the art reasoners for expressive description
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 informationExtending Logic Programs with Description Logic Expressions for the Semantic Web
Extending Logic Programs with Description Logic Expressions for the Semantic Web Yi-Dong Shen 1 and Kewen Wang 2 1 State Key Laboratory of Computer Science, Institute of Software Chinese Academy of Sciences,
More informationOn the Properties of Metamodeling in OWL
On the Properties of Metamodeling in OWL Boris Motik FZI Research Center for Information Technologies at the University of Karlsruhe Karlsruhe, Germany motik@fzi.de Abstract. A common practice in conceptual
More informationJust: a Tool for Computing Justifications w.r.t. ELH Ontologies
Just: a Tool for Computing Justifications w.r.t. ELH Ontologies Michel Ludwig Theoretical Computer Science, TU Dresden, Germany michel@tcs.inf.tu-dresden.de Abstract. We introduce the tool Just for computing
More informationCTL-RP: A Computational Tree Logic Resolution Prover
1 -RP: A Computational Tree Logic Resolution Prover Lan Zhang a,, Ullrich Hustadt a and Clare Dixon a a Department of Computer Science, University of Liverpool Liverpool, L69 3BX, UK E-mail: {Lan.Zhang,
More informationDid I Damage my Ontology?
Did I Damage my Ontology? A Case for Conservative Extensions in Description Logic Silvio Ghilardi 1, Carsten Lutz 2 and Frank Wolter 3 1 Dept. of Computer Science 2 Institut für Theoretische Informatik
More informationQuine s Fluted Fragment is Non-elementary
Quine s Fluted Fragment is Non-elementary Ian Pratt-Hartmann Wies law Szwast Lidia Tendera University of Manchester/University of Opole 25th EACSL Annual Conference on Computer Science Logic 1 st September,
More informationDismatching and Local Disunification in EL
Dismatching and Local Disunification in EL (Extended Abstract) Franz Baader, Stefan Borgwardt, and Barbara Morawska Theoretical Computer Science, TU Dresden, Germany {baader,stefborg,morawska}@tcs.inf.tu-dresden.de
More informationImproved Algorithms for Module Extraction and Atomic Decomposition
Improved Algorithms for Module Extraction and Atomic Decomposition Dmitry Tsarkov tsarkov@cs.man.ac.uk School of Computer Science The University of Manchester Manchester, UK Abstract. In recent years modules
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 informationA Principle for Incorporating Axioms into the First-Order Translation of Modal Formulae
A Principle for Incorporating Axioms into the First-Order Translation of Modal Formulae Renate A. Schmidt 1 and Ullrich Hustadt 2 1 University of Manchester, schmidt@cs.man.ac.uk Max Planck Institute for
More informationA Modal-Layered Resolution Calculus for K
A Modal-Layered Resolution Calculus for K Cláudia Nalon 1, Ullrich Hustadt 2, and Clare Dixon 2 1 Departament of Computer Science, University of Brasília C.P. 4466 CEP:70.910-090 Brasília DF Brazil nalon@unb.br
More informationThe Axiomatic Translation Principle for Modal Logic
The Axiomatic Translation Principle for Modal Logic RENATE A. SCHMIDT University of Manchester and ULLRICH HUSTADT University of Liverpool In this paper we present a translation principle, called the axiomatic
More informationAutomated Synthesis of Tableau Calculi
Automated Synthesis of Tableau Calculi Renate A. Schmidt 1 and Dmitry Tishkovsky 1 School of Computer Science, The University of Manchester Abstract This paper presents a method for synthesising sound
More informationComputational Logic. Davide Martinenghi. Spring Free University of Bozen-Bolzano. Computational Logic Davide Martinenghi (1/30)
Computational Logic Davide Martinenghi Free University of Bozen-Bolzano Spring 2010 Computational Logic Davide Martinenghi (1/30) Propositional Logic - sequent calculus To overcome the problems of natural
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 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 informationOptimized Description Logic Reasoning via Core Blocking
Optimized Description Logic Reasoning via Core Blocking Birte Glimm, Ian Horrocks, and Boris Motik Oxford University Computing Laboratory, UK Abstract. State of the art reasoners for expressive description
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 informationReasoning about concepts and similarity
Reasoning about concepts and similarity Carsten Lutz, Frank Wolter and Michael Zakharyaschev Fakultät Informatik, TU Dresden, Germany email: lutz@tcs.inf.tu-dresden.de Department of Computer Science, University
More informationCEX and MEX: Logical Diff and Semantic Module Extraction in a Fragment of OWL
CEX and MEX: Logical Diff and Semantic Module Extraction in a Fragment of OWL Boris Konev 1, Carsten Lutz 2, Dirk Walther 1, and Frank Wolter 1 1 University of Liverpool, UK, {konev, dwalther, wolter}@liverpool.ac.uk
More informationOntology Reuse: Better Safe than Sorry
Ontology Reuse: Better Safe than Sorry Bernardo Cuenca Grau, Ian Horrocks, Yevgeny Kazakov and Ulrike Sattler The University of Manchester School of Computer Science Manchester, M13 9PL, UK {bcg, horrocks,
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. 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 informationOptimization Techniques for Fuzzy Description Logics
Proc. 23rd Int. Workshop on Description Logics (DL2010), CEUR-WS 573, Waterloo, Canada, 2010. Optimization Techniques for Fuzzy Description Logics Nikolaos Simou 1, Theofilos Mailis 1, Giorgos Stoilos
More informationExtending Consequence-Based Reasoning to SRIQ
Extending Consequence-Based Reasoning to SRIQ Andrew Bate, Boris Motik, Bernardo Cuenca Grau, František Simančík, Ian Horrocks Department of Computer Science, University of Oxford, Oxford, United Kingdom
More informationThe Bayesian Ontology Language BEL
Journal of Automated Reasoning manuscript No. (will be inserted by the editor) The Bayesian Ontology Language BEL İsmail İlkan Ceylan Rafael Peñaloza Received: date / Accepted: date Abstract We introduce
More information27 Managing Change in Graph-structured Data Using Description Logics
27 Managing Change in Graph-structured Data Using Description Logics SHQIPONJA AHMETAJ, TU Wien DIEGO CALVANESE, Free University of Bozen-Bolzano MAGDALENA ORTIZ and MANTAS ŠIMKUS, TU Wien In this paper,
More informationOn the Complexity of (Restricted) ALCIr
On the Complexity of (Restricted ALCIr Milenko Mosurovic and Michael Zakharyaschev Communicated by Abstract. We consider a new description logic ALCIr that extends ALCI with role inclusion axioms of the
More informationLethe: Saturation-Based Reasoning for Non-Standard Reasoning Tasks
Lethe: Saturation-Based Reasoning for Non-Standard Reasoning Tasks Patrick Koopmann, Renate A. Schmidt The University of Manchester, UK {koopmanp, schmidt}@cs.man.ac.uk Abstract. We present the saturation-based
More informationTheTwo-VariableGuardedFragmentwith Transitive Guards Is 2EXPTIME-Hard
TheTwo-VariableGuardedFragmentwith Transitive Guards Is 2EXPTIME-Hard Emanuel Kieroński Institute of Computer Science University of Wroc law ul. Przesmyckiego 20, 51-151 Wroc law, Poland kiero@ii.uni.wroc.pl
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 informationCOMPUTING LOCAL UNIFIERS IN THE DESCRIPTION LOGIC EL WITHOUT THE TOP CONCEPT
Institute of Theoretical Computer Science Chair of Automata Theory COMPUTING LOCAL UNIFIERS IN THE DESCRIPTION LOGIC EL WITHOUT THE TOP CONCEPT Franz Baader Nguyen Thanh Binh Stefan Borgwardt Barbara Morawska
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 information