COMPUTING LOCAL UNIFIERS IN THE DESCRIPTION LOGIC EL WITHOUT THE TOP CONCEPT
|
|
- Ethel Sherman
- 6 years ago
- Views:
Transcription
1 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 Wrocław, July 31st, 2011
2 The Description Logic EL concept name role name Syntax A N C r N R Wrocław, July 31st, 2011 Local Unifiers in EL Without Top 2
3 The Description Logic EL Syntax interpretation I = ( I, I ) concept name A N C A I I role name r N R r I I I Wrocław, July 31st, 2011 Local Unifiers in EL Without Top 2
4 The Description Logic EL Syntax interpretation I = ( I, I ) concept name A N C A I I role name r N R r I I I conjunction C D C I D I Wrocław, July 31st, 2011 Local Unifiers in EL Without Top 2
5 The Description Logic EL Syntax interpretation I = ( I, I ) concept name A N C A I I role name r N R r I I I conjunction C D C I D I existential restriction r.c {x y : (x, y) r I y C I } Wrocław, July 31st, 2011 Local Unifiers in EL Without Top 2
6 The Description Logic EL Syntax interpretation I = ( I, I ) concept name A N C A I I role name r N R r I I I conjunction C D C I D I EL existential restriction r.c {x y : (x, y) r I y C I } top concept I Wrocław, July 31st, 2011 Local Unifiers in EL Without Top 2
7 The Description Logic EL Syntax interpretation I = ( I, I ) concept name A N C A I I role name r N R r I I I conjunction C D C I D I EL existential restriction r.c {x y : (x, y) r I y C I } top concept I EL Wrocław, July 31st, 2011 Local Unifiers in EL Without Top 2
8 The Description Logic EL Syntax interpretation I = ( I, I ) concept name A N C A I I role name r N R r I I I conjunction C D C I D I EL existential restriction r.c {x y : (x, y) r I y C I } top concept I EL subsumption C D C I D I equivalence C D C I = D I Wrocław, July 31st, 2011 Local Unifiers in EL Without Top 2
9 The Description Logic EL Syntax interpretation I = ( I, I ) concept name A N C A I I role name r N R r I I I conjunction C D C I D I EL existential restriction r.c {x y : (x, y) r I y C I } top concept I EL subsumption C D C I D I equivalence C D C I = D I Description logics are used to formulate ontologies SNOMED CT is based on EL, but does not use Unification can be used to detect redundancies Wrocław, July 31st, 2011 Local Unifiers in EL Without Top 2
10 Unification in EL ( ) Some concept names are variables (X N v ), all others are constants (A N c). unification problem: Γ = {C 1? D 1,..., C n? D n} Wrocław, July 31st, 2011 Local Unifiers in EL Without Top 3
11 Unification in EL ( ) Some concept names are variables (X N v ), all others are constants (A N c). unification problem: Γ = {C 1? D 1,..., C n? D n} A unifier σ substitutes variables with concept terms such that σ(c 1 ) σ(d 1 ),..., σ(c n) σ(d n). Wrocław, July 31st, 2011 Local Unifiers in EL Without Top 3
12 Unification in EL ( ) Some concept names are variables (X N v ), all others are constants (A N c). unification problem: Γ = {C 1? D 1,..., C n? D n} A unifier σ substitutes variables with concept terms such that σ(c 1 ) σ(d 1 ),..., σ(c n) σ(d n). Unification modulo the equational theory of bounded semilattices with monotone operators: A free constant X variable binary associative, commutative, idempotent operator r.c unary monotone operator constant; unit for Wrocław, July 31st, 2011 Local Unifiers in EL Without Top 3
13 Previous Results Unification in EL is NP-complete: Matching is NP-hard [Baader, Küsters 2000]. Unification is in NP [Baader, Morawska 2009, 2010]. We can restrict the search to local unifiers of polynomial size. Wrocław, July 31st, 2011 Local Unifiers in EL Without Top 4
14 Previous Results Unification in EL is NP-complete: Matching is NP-hard [Baader, Küsters 2000]. Unification is in NP [Baader, Morawska 2009, 2010]. We can restrict the search to local unifiers of polynomial size. Unification in EL is PSPACE-complete [CADE 2011]. Wrocław, July 31st, 2011 Local Unifiers in EL Without Top 4
15 Previous Results Unification in EL is NP-complete: Matching is NP-hard [Baader, Küsters 2000]. Unification is in NP [Baader, Morawska 2009, 2010]. We can restrict the search to local unifiers of polynomial size. Unification in EL is PSPACE-complete [CADE 2011]. In this talk: Local unifiers in EL may be of exponential size. Wrocław, July 31st, 2011 Local Unifiers in EL Without Top 4
16 Preliminaries Atom: concept name or existential restriction Non-variable atom: concept constant or existential restriction Flat atom: atom of depth 1 Flat unification problem: All equations are of the form C 1 C n? D 1 D m for flat atoms C 1,..., C n, D 1,..., D m. Wrocław, July 31st, 2011 Local Unifiers in EL Without Top 5
17 Preliminaries Atom: concept name or existential restriction Non-variable atom: concept constant or existential restriction Flat atom: atom of depth 1 Flat unification problem: All equations are of the form C 1 C n? D 1 D m for flat atoms C 1,..., C n, D 1,..., D m. Subsumption in EL (and EL ): The only atom subsumed by a concept name A is A itself. Wrocław, July 31st, 2011 Local Unifiers in EL Without Top 5
18 Preliminaries Atom: concept name or existential restriction Non-variable atom: concept constant or existential restriction Flat atom: atom of depth 1 Flat unification problem: All equations are of the form C 1 C n? D 1 D m for flat atoms C 1,..., C n, D 1,..., D m. Subsumption in EL (and EL ): The only atom subsumed by a concept name A is A itself. All atoms subsumed by an existential restriction r.e are of the form r.e with E E. Wrocław, July 31st, 2011 Local Unifiers in EL Without Top 5
19 Preliminaries Atom: concept name or existential restriction Non-variable atom: concept constant or existential restriction Flat atom: atom of depth 1 Flat unification problem: All equations are of the form C 1 C n? D 1 D m for flat atoms C 1,..., C n, D 1,..., D m. Subsumption in EL (and EL ): The only atom subsumed by a concept name A is A itself. All atoms subsumed by an existential restriction r.e are of the form r.e with E E. All concept terms subsumed by a conjunction of atoms D 1 D m are conjunctions of atoms C 1 C n such that for every D j there is a C i with C i D j. Wrocław, July 31st, 2011 Local Unifiers in EL Without Top 5
20 EL vs. EL Particle: atom of the form r r n.a If C is an EL -concept term and B is a particle, then B C implies B C. Part(C): Part(A r.(a r.b)) = {A, r.a, r. r.b} Wrocław, July 31st, 2011 Local Unifiers in EL Without Top 6
21 EL vs. EL Particle: atom of the form r r n.a If C is an EL -concept term and B is a particle, then B C implies B C. Part(C): Part(A r.(a r.b)) = {A, r.a, r. r.b} In EL, it suffices to check for local unifiers σ: σ(x ) = σ(d 1 ) σ(d m), where D 1,..., D m are non-variable atoms of the unification problem. Wrocław, July 31st, 2011 Local Unifiers in EL Without Top 6
22 EL vs. EL Particle: atom of the form r r n.a If C is an EL -concept term and B is a particle, then B C implies B C. Part(C): Part(A r.(a r.b)) = {A, r.a, r. r.b} In EL, it suffices to check for local unifiers σ: σ(x ) = σ(d 1 ) σ(d m), where D 1,..., D m are non-variable atoms of the unification problem. Example: Γ : X? Y A, r.x? Y local EL-unifier σ 1 := {X A, Y } Wrocław, July 31st, 2011 Local Unifiers in EL Without Top 6
23 EL vs. EL Particle: atom of the form r r n.a If C is an EL -concept term and B is a particle, then B C implies B C. Part(C): Part(A r.(a r.b)) = {A, r.a, r. r.b} In EL, it suffices to check for local unifiers σ: σ(x ) = σ(d 1 ) σ(d m), where D 1,..., D m are non-variable atoms of the unification problem. Example: Γ : X? Y A, r.x? Y local EL-unifier σ 1 := {X A, Y } allow also particles of σ(d) to occur: local EL -unifier σ 2 := {X A r.a, Y r.a} Wrocław, July 31st, 2011 Local Unifiers in EL Without Top 6
24 Reduction to Linear Language Inclusions NP reduction to a system of linear language inclusions X i L 0 L 1 X 1 L nx n (L 0,..., L n are subsets of N R {ε}) A solution θ maps variables to languages over N R such that θ(x i ) L 0 L 1 θ(x 1 ) L nθ(x n). Wrocław, July 31st, 2011 Local Unifiers in EL Without Top 7
25 Reduction to Linear Language Inclusions NP reduction to a system of linear language inclusions X i L 0 L 1 X 1 L nx n (L 0,..., L n are subsets of N R {ε}) A solution θ maps variables to languages over N R such that θ(x i ) L 0 L 1 θ(x 1 ) L nθ(x n). Γ : X? Y A, r.x? Y Y A X A, X A {ε} Y A, Y A {r}x A Wrocław, July 31st, 2011 Local Unifiers in EL Without Top 7
26 Local Solutions A solution θ is local if every w θ(x A ) \ {ε} occurs on the right-hand side of some inclusion: Y A X A, X A {ε} Y A, Y A {r}x A θ(x A ) = {ε, r}, θ(y A ) = {r} Wrocław, July 31st, 2011 Local Unifiers in EL Without Top 8
27 Local Solutions A solution θ is local if every w θ(x A ) \ {ε} occurs on the right-hand side of some inclusion: Y A X A, X A {ε} Y A, Y A {r}x A θ(x A ) = {ε, r}, θ(y A ) = {r} A solution θ is admissible if for every concept variable X there is a concept constant A such that θ(x A ) is non-empty. Wrocław, July 31st, 2011 Local Unifiers in EL Without Top 8
28 Local Solutions A solution θ is local if every w θ(x A ) \ {ε} occurs on the right-hand side of some inclusion: Y A X A, X A {ε} Y A, Y A {r}x A θ(x A ) = {ε, r}, θ(y A ) = {r} A solution θ is admissible if for every concept variable X there is a concept constant A such that θ(x A ) is non-empty. From any finite, local, admissible solution θ we can construct a local EL -unifier of size exponential in Γ and polynomial in θ. Wrocław, July 31st, 2011 Local Unifiers in EL Without Top 8
29 Automata Construction Finite, local solutions are closed under union. Check for all X whether there is A and a finite, local solution θ such that θ(x A ) is non-empty. Wrocław, July 31st, 2011 Local Unifiers in EL Without Top 9
30 Automata Construction Finite, local solutions are closed under union. Check for all X whether there is A and a finite, local solution θ such that θ(x A ) is non-empty. We construct an alternating automaton that accepts the maximal solution for X A : s 1 : s 2 : s 3 : Y A X A X A {ε} Y A Y A {r}x A ε ε s 1 ε X A s 2 ε ε Y A ε A s 3 r Wrocław, July 31st, 2011 Local Unifiers in EL Without Top 9
31 The Size of Local EL -Unifiers Emptiness of this automaton can be checked in PSPACE [Jiang, Ravikumar 1991]. If it is not empty, we can even construct a finite, local solution θ of size at most exponential in Γ : ε ε s 1 ε X A s 2 ε ε Y A ε A s 3 r Wrocław, July 31st, 2011 Local Unifiers in EL Without Top 10
32 The Size of Local EL -Unifiers Emptiness of this automaton can be checked in PSPACE [Jiang, Ravikumar 1991]. If it is not empty, we can even construct a finite, local solution θ of size at most exponential in Γ : Construct an equivalent nondeterministic automaton using a powerset construction {X A, s 2, A} {X A, s 2, Y A, s 1, s 3 } r r Wrocław, July 31st, 2011 Local Unifiers in EL Without Top 10
33 The Size of Local EL -Unifiers Emptiness of this automaton can be checked in PSPACE [Jiang, Ravikumar 1991]. If it is not empty, we can even construct a finite, local solution θ of size at most exponential in Γ : Construct an equivalent nondeterministic automaton using a powerset construction Find a shortest accepting path (of possibly exponential length) Extract a local solution (of exponential size) from this path {X A, s 2, A} {X A, s 2, Y A, s 1, s 3 } r r Wrocław, July 31st, 2011 Local Unifiers in EL Without Top 10
34 Summary If Γ has an EL -unifier, we can always construct a local EL -unifier of size exponential in Γ. Wrocław, July 31st, 2011 Local Unifiers in EL Without Top 11
35 Summary If Γ has an EL -unifier, we can always construct a local EL -unifier of size exponential in Γ. On the other hand, the size of all local EL -unifiers of Γ may grow exponentially in Γ. Wrocław, July 31st, 2011 Local Unifiers in EL Without Top 11
36 Summary If Γ has an EL -unifier, we can always construct a local EL -unifier of size exponential in Γ. On the other hand, the size of all local EL -unifiers of Γ may grow exponentially in Γ. Future Work EL ( ) with general concept inclusion axioms? Other concept constructors? Implementation of a practical algorithm? Wrocław, July 31st, 2011 Local Unifiers in EL Without Top 11
37 Thank You Franz Baader and Ralf Küsters. Matching concept descriptions with existential restrictions. In Proc. KR2000, pages Morgan Kaufmann, Franz Baader and Barbara Morawska. SAT encoding of unification in EL. In Proc. LPAR 10, volume 6397 of LNCS, pages Springer, Franz Baader, Nguyen Thanh Binh, Stefan Borgwardt, and Barbara Morawska. Unification in the description logic EL without the top concept. LTCS-Report 11-01, TU Dresden, See Tao Jiang and Bala Ravikumar. A note on the space complexity of some decision problems for finite automata. Inform. Process. Lett., 40:25 31, Frank Wolter and Michael Zakharyaschev. Undecidability of the unification and admissibility problems for modal and description logics. ACM Trans. Comput. Log., 9(4), Wrocław, July 31st, 2011 Local Unifiers in EL Without Top 12
Dismatching 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 informationA Goal-Oriented Algorithm for Unification in EL w.r.t. Cycle-Restricted TBoxes
A Goal-Oriented Algorithm for Unification in EL w.r.t. Cycle-Restricted TBoxes Franz Baader, Stefan Borgwardt, and Barbara Morawska {baader,stefborg,morawska}@tcs.inf.tu-dresden.de Theoretical Computer
More informationExtending Unification in EL towards General TBoxes
Extending Unification in EL towards General TBoxes Franz Baader and Stefan Borgwardt and Barbara Morawska Theoretical Computer Science, TU Dresden, Germany {baader,stefborg,morawska}@tcs.inf.tu-dresden.de
More informationUnification in Description Logic EL without top constructor
Fakultät Informatik EMCL Master Thesis Unification in Description Logic EL without top constructor by Nguyen Thanh Binh born on March 25 th 1984, Cao Bang, Vietnam S upervisor : Prof.Dr.-Ing. Franz Baader
More informationHybrid Unification in the Description Logic EL
Hybrid Unification in the Description Logic EL Franz Baader, Oliver Fernández Gil, and Barbara Morawska {baader,morawska}@tcs.inf.tu-dresden.de, fernandez@informatik.uni-leipzig.de Theoretical Computer
More informationLeast Common Subsumers and Most Specific Concepts in a Description Logic with Existential Restrictions and Terminological Cycles*
Least Common Subsumers and Most Specific Concepts in a Description Logic with Existential Restrictions and Terminological Cycles* Franz Baader Theoretical Computer Science TU Dresden D-01062 Dresden, Germany
More informationTechnische Universität Dresden. Fakultät Informatik EMCL Master s Thesis on. Hybrid Unification in the Description Logic EL
Technische Universität Dresden Fakultät Informatik EMCL Master s Thesis on Hybrid Unification in the Description Logic EL by Oliver Fernández Gil born on June 11 th 1982, in Pinar del Río, Cuba Supervisor
More informationRestricted role-value-maps in a description logic with existential restrictions and terminological cycles
Restricted role-value-maps in a description logic with existential restrictions and terminological cycles Franz Baader Theoretical Computer Science, Dresden University of Technology D-01062 Dresden, Germany
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 informationLTCS Report. Decidability and Complexity of Threshold Description Logics Induced by Concept Similarity Measures. LTCS-Report 16-07
Technische Universität Dresden Institute for Theoretical Computer Science Chair for Automata Theory LTCS Report Decidability and Complexity of Threshold Description Logics Induced by Concept Similarity
More informationRole-depth Bounded Least Common Subsumers by Completion for EL- and Prob-EL-TBoxes
Role-depth Bounded Least Common Subsumers by Completion for EL- and Prob-EL-TBoxes Rafael Peñaloza and Anni-Yasmin Turhan TU Dresden, Institute for Theoretical Computer Science Abstract. The least common
More informationUNIF 2011 The 25th International Workshop on Unification
CADE 23 the 23rd International Conference on Automated Deduction University of Wroc law, Wroc law, Poland 31 July - 5 August 2011 UNIF 2011 The 25th International Workshop on Unification Proceedings Editors:
More informationLTCS Report. Subsumption in Finitely Valued Fuzzy EL. Stefan Borgwardt Marco Cerami Rafael Peñaloza. LTCS-Report 15-06
Technische Universität Dresden Institute for Theoretical Computer Science Chair for Automata Theory LTCS Report Subsumption in Finitely Valued Fuzzy EL Stefan Borgwardt Marco Cerami Rafael Peñaloza LTCS-Report
More informationSubsumption of concepts in FL 0 for (cyclic) terminologies with respect to descriptive semantics is PSPACE-complete.
Subsumption of concepts in FL 0 for (cyclic) terminologies with respect to descriptive semantics is PSPACE-complete. Yevgeny Kazakov and Hans de Nivelle MPI für Informatik, Saarbrücken, Germany E-mail:
More informationFuzzy DLs over Finite Lattices with Nominals
Fuzzy DLs over Finite Lattices with Nominals Stefan Borgwardt Theoretical Computer Science, TU Dresden, Germany stefborg@tcs.inf.tu-dresden.de Abstract. The complexity of reasoning in fuzzy description
More informationten into an \related better" description E by using (some of) the names dened in T? In this paper, related will mean equivalent, and better will mean
Rewriting Concepts Using Terminologies Franz Baader, Ralf Kusters, and Ralf Molitor Theoretical Computer Science, RWTH Aachen Ahornstrae 55, 52074 Aachen, Germany email: fbaader,kuesters,molitorg@informatik.rwth-aachen.de
More informationFuzzy Ontologies over Lattices with T-norms
Fuzzy Ontologies over Lattices with T-norms Stefan Borgwardt and Rafael Peñaloza Theoretical Computer Science, TU Dresden, Germany {stefborg,penaloza}@tcs.inf.tu-dresden.de 1 Introduction In some knowledge
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 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 informationRewriting Concepts Using Terminologies Revisited Franz Baader, Ralf Kusters, and Ralf Molitor LuFg Theoretical Computer Science, RWTH Aachen fb
LTCS{Report Aachen University of Technology Research group for Theoretical Computer Science Revised Version of LTCS-Report 99-12: Rewriting Concepts Using Terminologies - Revisited Franz Baader, Ralf Kusters,
More informationLTCS Report. A finite basis for the set of EL-implications holding in a finite model
Dresden University of Technology Institute for Theoretical Computer Science Chair for Automata Theory LTCS Report A finite basis for the set of EL-implications holding in a finite model Franz Baader, Felix
More informationThe Complexity of Subsumption in Fuzzy EL
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence (IJCAI 2015) Stefan Borgwardt Chair for Automata Theory Technische Universität Dresden Germany Stefan.Borgwardt@tu-dresden.de
More informationGödel Negation Makes Unwitnessed Consistency Crisp
Gödel Negation Makes Unwitnessed Consistency Crisp Stefan Borgwardt, Felix Distel, and Rafael Peñaloza Faculty of Computer Science TU Dresden, Dresden, Germany [stefborg,felix,penaloza]@tcs.inf.tu-dresden.de
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 informationComputing Least Common Subsumers in Description Logics with Existential Restrictions*
Computing Least Common Subsumers in Description Logics with Existential Restrictions* Franz Baader, Ralf Kiisters, Ralf Molitor LuFg Theoretische Informatik, RWTH Aachen email: {baader,kuesters,molitor}@infonnatik.rwth-aachcn.dc
More informationFrom Tableaux to Automata for Description Logics
From Tableaux to Automata for Description Logics Franz Baader 1, Jan Hladik 1, Carsten Lutz 1, and Frank Wolter 2 1 Theoretical Computer Science, TU Dresden, D-01062 Dresden, Germany, {baader,hladik,lutz}@tcs.inf.tu-dresden.de
More informationThe Inclusion Problem for Weighted Automata on Infinite Trees
The Inclusion Problem for Weighted Automata on Infinite Trees Stefan Borgwardt and Rafael Peñaloza Theoretical Computer Science, TU Dresden, Germany {penaloza,stefborg}@tcs.inf.tu-dresden.de Abstract Weighted
More informationReasoning in ELH w.r.t. General Concept Inclusion Axioms
Reasoning in ELH w.r.t. General Concept Inclusion Axioms Sebastian Brandt Theoretical Computer Science TU Dresden brandt@tcs.inf.tu-dresden.de Abstract In the area of Description Logic (DL) based knowledge
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 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 informationNon-Gödel Negation Makes Unwitnessed Consistency Undecidable
Non-Gödel Negation Makes Unwitnessed Consistency Undecidable Stefan Borgwardt and Rafael Peñaloza {stefborg,penaloza}@tcs.inf.tu-dresden.de Theoretical Computer Science, TU Dresden, Germany Abstract. Recent
More informationComputing the Least Common Subsumer w.r.t. a Background Terminology
Computing the Least Common Subsumer w.r.t. a Background Terminology Franz Baader, Baris Sertkaya, and Anni-Yasmin Turhan Theoretical Computer Science, TU Dresden, Germany {baader,sertkaya,turhan}@tcs.inf.tu-dresden.de
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 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 informationDecidable Description Logics of Context with Rigid Roles
Decidable Description Logics of Context with Rigid Roles Stephan Böhme and Marcel Lippmann Institute for Theoretical Computer Science, Technische Universität Dresden, {stephan.boehme,marcel.lippmann}@tu-dresden.de
More informationReasoning About Typicality in ALC and EL
Reasoning About Typicality in ALC and EL Laura Giordano 1, Valentina Gliozzi 2, Nicola Olivetti 3, and Gian Luca Pozzato 2 1 Dipartimento di Informatica - Università del Piemonte Orientale A. Avogadro
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 informationComplexity of Axiom Pinpointing in the DL-Lite Family
Proc. 23rd Int. Workshop on Description Logics (DL2010), CEUR-WS 573, Waterloo, Canada, 2010. Complexity of Axiom Pinpointing in the DL-Lite Family Rafael Peñaloza 1 and Barış Sertkaya 2 1 Theoretical
More informationŁukasiewicz Fuzzy EL is Undecidable
Łukasiewicz Fuzzy EL is Undecidable Stefan Borgwardt 1, Marco Cerami 2, and Rafael Peñaloza 3 1 Chair for Automata Theory, Theoretical Computer Science, TU Dresden, Germany stefan.borgwardt@tu-dresden.de
More informationHierarchical Combination of Unification Algorithms (Extended Abstract)
of Unification Algorithms (Extended Abstract) Serdar Erbatur 5, Deepak Kapur 1, Andrew M Marshall 2, Paliath Narendran 3 and Christophe Ringeissen 4 1 University of New Mexico (USA) 2 Naval Research Laboratory
More informationAn Introduction to Description Logic VIII Inherent intractability of terminological reasoning
An Introduction to Description Logic VIII Inherent intractability of terminological reasoning Marco Cerami Palacký University in Olomouc Department of Computer Science Olomouc, Czech Republic Olomouc,
More informationAbout Subsumption in Fuzzy EL
About Subsumption in Fuzzy EL Stefan Borgwardt 1 and Rafael Peñaloza 1,2 1 Theoretical Computer Science, TU Dresden, Germany 2 Center for Advancing Electronics Dresden {stefborg,penaloza}@tcs.inf.tu-dresden.de
More informationReasoning with Annotated Description Logic Ontologies
Reasoning with Annotated Description Logic Ontologies an Stelle einer Habilitationsschrift vorgelegt an der Technischen Universität Dresden Fakultät Informatik eingereicht von Dr. rer. nat. Rafael Peñaloza
More informationKeys, Nominals, and Concrete Domains
Keys, Nominals, and Concrete Domains Carsten Lutz 1 Carlos Areces 2 Ian Horrocks 3 Ulrike Sattler 1 1 Inst. for Theoretical Computer Science 2 INRIA Lorraine 3 Dept. of Computer Science Technical University
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 Subsumption and Instance Problem in ELH w.r.t. General TBoxes
On Subsumption and Instance Problem in ELH w.r.t. General TBoxes Sebastian Brandt Institut für Theoretische Informatik TU Dresden, Germany brandt@tcs.inf.tu-dresden.de Abstract Recently, it was shown for
More informationTight Complexity Bounds for Reasoning in the Description Logic BEL
Tight Complexity Bounds for Reasoning in the Description Logic BEL İsmail İlkan Ceylan1 and Rafael Peñaloza 1,2 1 Theoretical Computer Science, TU Dresden, Germany 2 Center for Advancing Electronics Dresden
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 informationAn Automata-Based Approach for Subsumption w.r.t. General Concept Inclusions in the Description Logic FL 0
Master s Thesis An Automata-Based Approach for Subsumption w.r.t. General Concept Inclusions in the Description Logic FL 0 Maximilian Pensel November 30, 2015 Technische Universität Dresden Faculty of
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 informationPushing the EL Envelope Further
Pushing the EL Envelope Further Franz Baader 1, Sebastian Brandt 2, Carsten Lutz 1 1: TU Dresden 2: Univ. of Manchester Abstract. We extend the description logic EL ++ with reflexive roles and range restrictions,
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 informationLTCS Report. Exploring finite models in the Description Logic EL gfp. Franz Baader, Felix Distel. LTCS-Report 08-05
Dresden University of Technology Institute for Theoretical Computer Science Chair for Automata Theory LTCS Report Exploring finite models in the Description Logic EL gfp Franz Baader, Felix Distel LTCS-Report
More informationComplexity of language equations with one-sided concatenation and all Boolean operations
Complexity of language equations with one-sided concatenation and all Boolean operations Franz Baader 1 and Alexander Okhotin 2,3 1 Theoretical Computer Science, Technical University of Dresden, Germany,
More informationMatching Trace Patterns With Regular Policies
Matching Trace Patterns With Regular Policies Franz Baader 1, Andreas Bauer 2, and Alwen Tiu 2 1 TU Dresden, Germany, baader@inf.tu-dresden.de 2 The Australian National University, {baueran, alwen.tiu}@rsise.anu.edu.au
More informationOn Decidability and Tractability of Querying in Temporal EL
On Decidability and Tractability of Querying in Temporal EL Víctor Gutiérrez-Basulto 1, Jean Christoph Jung 1, and Roman Kontchakov 2 1 Department of Computer Science, Universität Bremen, Germany 2 Dept.
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 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 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 informationProof-theoretic Approach to Deciding Subsumption and Computing Least Common Subsumer in EL w.r.t. Hybrid TBoxes
Technical University Dresden Department of Computer Science Master s Thesis on Proof-theoretic Approach to Deciding Subsumption and Computing Least Common Subsumer in EL w.r.t. Hybrid TBoxes by Novak Novaković
More informationThe Complexity of Computing the Behaviour of Lattice Automata on Infinite Trees
The Complexity of Computing the Behaviour of Lattice Automata on Infinite Trees Karsten Lehmann a, Rafael Peñaloza b a Optimisation Research Group, NICTA Artificial Intelligence Group, Australian National
More informationHandbook of Logic and Proof Techniques for Computer Science
Steven G. Krantz Handbook of Logic and Proof Techniques for Computer Science With 16 Figures BIRKHAUSER SPRINGER BOSTON * NEW YORK Preface xvii 1 Notation and First-Order Logic 1 1.1 The Use of Connectives
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 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 informationTree Automata for Non-Linear Arithmetic
Tree Automata for Non-Linear Arithmetic Naoki Kobayashi 1 and Hitoshi Ohsaki 2 1 Tohoku University, Japan koba@ecei.tohoku.ac.jp 2 National Institute of Advanced Industrial Science and Technology, Japan
More informationAxiom Pinpointing in General Tableaux
Axiom Pinpointing in General Tableaux Franz Baader 1 and Rafael Peñaloza 2 1 Theoretical Computer Science, TU Dresden, Germany baader@inf.tu-dresden.de 2 Intelligent Systems, University of Leipzig, Germany
More informationA Closer Look at the Probabilistic Description Logic Prob-EL
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence A Closer Look at the Probabilistic Description Logic Prob-EL Víctor Gutiérrez-Basulto Universität Bremen, Germany victor@informatik.uni-bremen.de
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 informationBayesian Description Logics
Bayesian Description Logics İsmail İlkan Ceylan1 and Rafael Peñaloza 1,2 1 Theoretical Computer Science, TU Dresden, Germany 2 Center for Advancing Electronics Dresden {ceylan,penaloza}@tcs.inf.tu-dresden.de
More informationTheoretical Foundations of the UML
Theoretical Foundations of the UML Lecture 17+18: A Logic for MSCs Joost-Pieter Katoen Lehrstuhl für Informatik 2 Software Modeling and Verification Group moves.rwth-aachen.de/teaching/ws-1718/fuml/ 5.
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 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 informationDownloaded from: Usage Guidelines
Artale, A. and Kontchakov, Roman and Ryzhikov, V. and Zakharyaschev, Michael (2013) The complexity of clausal fragments of LTL. In: McMillan, K. and Middeldorp, A. and Voronkov, A. (eds.) Logic for Programming,
More informationCS256/Spring 2008 Lecture #11 Zohar Manna. Beyond Temporal Logics
CS256/Spring 2008 Lecture #11 Zohar Manna Beyond Temporal Logics Temporal logic expresses properties of infinite sequences of states, but there are interesting properties that cannot be expressed, e.g.,
More informationThe Concept Difference for EL-Terminologies using Hypergraphs
The Concept Difference for EL-Terminologies using Hypergraphs Andreas Ecke Theoretical Computer Science TU Dresden, Germany ecke@tcs.inf.tudresden.de Michel Ludwig Theoretical Computer Science TU Dresden,
More informationTemporal Query Answering in the Description Logic EL
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence (IJCAI 2015) Temporal Query Answering in the Description Logic EL Stefan Borgwardt and Veronika Thost Technische
More informationOn language equations with one-sided concatenation
Fundamenta Informaticae 126 (2013) 1 34 1 IOS Press On language equations with one-sided concatenation Franz Baader Alexander Okhotin Abstract. Language equations are equations where both the constants
More informationLecturecise 22 Weak monadic second-order theory of one successor (WS1S)
Lecturecise 22 Weak monadic second-order theory of one successor (WS1S) 2013 Reachability in the Heap Many programs manipulate linked data structures (lists, trees). To express many important properties
More informationPositive Subsumption in Fuzzy EL with General t-norms
Proceedings of the wenty-hird International Joint Conference on Artificial Intelligence Positive Subsumption in Fuzzy EL with General t-norms Stefan Borgwardt U Dresden, Germany stefborg@tcs.inf.tu-dresden.de
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 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 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 informationLocality and subsumption testing in EL and some of its extensions
Locality and subsumption testing in EL and some of its extensions Viorica Sofronie-Stokkermans abstract. In this paper we show that subsumption problems in many lightweight description logics (including
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 informationDescription Logics with Concrete Domains and Functional Dependencies
Description Logics with Concrete Domains and Functional Dependencies Carsten Lutz and Maja Miličić 1 Abstract. Description Logics (DLs) with concrete domains are a useful tool in many applications. To
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 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 informationExact Learning of TBoxes in EL and DL-Lite
Exact Learning of TBoxes in EL and DL-Lite Boris Konev 1 and Carsten Lutz 2 and Frank Wolter 1 1 Department of Computer Science, University of Liverpool, UK 2 Department of Computer Science, University
More informationThe Combined Approach to Query Answering in DL-Lite
The Combined Approach to Query Answering in DL-Lite Roman Kontchakov Department of Computer Science and Inf. Systems, Birkbeck College, London http://www.dcs.bbk.ac.uk/~roman joint work with Carsten Lutz,
More informationForgetting and uniform interpolation in large-scale description logic terminologies
Forgetting and uniform interpolation in large-scale description logic terminologies Boris Konev, Dirk Walther, and Frank Wolter Department of Computer Science University of Liverpool, UK {konev, dwalther,
More informationUnification in modal logic Alt 1
Unification in modal logic Alt 1 Philippe Balbiani 1 Institut de recherche en informatique de Toulouse Toulouse University Tinko Tinchev 2 Department of Mathematical Logic and Applications Sofia University
More informationModular Combination of Reasoners for Ontology Classification
Modular Combination of Reasoners for Ontology Classification Ana Armas Romero, Bernardo Cuenca Grau, Ian Horrocks Department of Computer Science. University of Oxford Abstract. Classification is a fundamental
More informationTemporal Conjunctive Queries in Expressive Description Logics with Transitive Roles
Temporal Conjunctive Queries in Expressive Description Logics with Transitive Roles Franz Baader, Stefan Borgwardt, and Marcel Lippmann Theoretical Computer Science, TU Dresden, Germany firstname.lastname@tu-dresden.de
More informationSecond-Order Description Logics: Semantics, Motivation, and a Calculus
Proc. 23rd Int. Workshop on Description Logics (DL2010), CEUR-WS 573, Waterloo, Canada, 2010. Second-Order Description Logics: Semantics, Motivation, and a Calculus Simona Colucci 1, Tommaso Di Noia 1,
More informationPSpace Automata for Description Logics
PSpace Automata for Description Logics Jan Hladik Rafael Peñaloza Abstract Tree automata are often used for satisfiability testing in the area of description logics, which usually yields ExpTime complexity
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 informationA SHORT GUIDE TO FUZZY DESCRIPTION LOGICS
Institute of Theoretical Computer Science Chair of Automata Theory A SHORT GUIDE TO FUZZY DESCRIPTION LOGICS Stefan Borgwardt Oxford, December 9th, 2014 Zadeh Introduction Trivial Fuzzy DLs Go del [0,
More informationFoundations for the Logical Difference of EL-TBoxes
EPiC Series in Computer Science Volume 36, 2015, Pages 93 112 GCAI 2015. Global Conference on Artificial Intelligence Foundations for the Logical Difference of EL-TBoxes Shasha Feng 1, Michel Ludwig 2,
More informationFinite Model Theory: First-Order Logic on the Class of Finite Models
1 Finite Model Theory: First-Order Logic on the Class of Finite Models Anuj Dawar University of Cambridge Modnet Tutorial, La Roche, 21 April 2008 2 Finite Model Theory In the 1980s, the term finite model
More informationPartially Ordered Two-way Büchi Automata
Partially Ordered Two-way Büchi Automata Manfred Kufleitner Alexander Lauser FMI, Universität Stuttgart, Germany {kufleitner, lauser}@fmi.uni-stuttgart.de June 14, 2010 Abstract We introduce partially
More information