Terminological cycles in a description logic with existential restrictions

Authors:
Franz Baader
Affiliations:
Theoretical Computer Science, TU Dresden, Dresden, Germany
Venue:
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Year:
2003

Citing 6
Cited 34

Reasoning and revision in hybrid representation systems

Reasoning and revision in hybrid representation systems
Attributive concept descriptions with complements

Artificial Intelligence
Expressiveness of concept expressions in first-order description logics

Artificial Intelligence
Computing Least Common Subsumers in Description Logics with Existential Restrictions

IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Computing simulations on finite and infinite graphs

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Least common subsumers and most specific concepts in a description logic with existential restrictions and terminological cycles

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence

Automated theorem proving by resolution in non-classical logics

Annals of Mathematics and Artificial Intelligence
The Logical Difference Problem for Description Logic Terminologies

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Query Answering in the Description Logic Horn-$\mathcal{SHIQ}$

JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
A Proof-Theoretic Approach to Deciding Subsumption and Computing Least Common Subsumer in $\cal EL$ w.r.t. Hybrid TBoxes

JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Exploring Finite Models in the Description Logic ${\mathcal {EL}}_{\rm gfp}$

ICFCA '09 Proceedings of the 7th International Conference on Formal Concept Analysis
Complexity of Subsumption in the EL Family of Description Logics: Acyclic and Cyclic TBoxes

Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Unification in the Description Logic $\mathcal{EL}$

RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Least common subsumers and most specific concepts in a description logic with existential restrictions and terminological cycles

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Next steps in propositional horn contraction

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Matching in hybrid terminologies

LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
A finite basis for the set of ƐL-implications holding in a finite model

ICFCA'08 Proceedings of the 6th international conference on Formal concept analysis
Complexity analysis and variational inference for interpretation-based probabilistic description logics

UAI '09 Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence
Enriching EL-Concepts with Greatest Fixpoints

Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Secrecy-preserving query answering for instance checking in EL

RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
SAT encoding of unification in EL

LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Nominals, inverses, counting, and conjunctive queries or: why infinity is your friend!

Journal of Artificial Intelligence Research
An argumentation machinery to reason over inconsistent ontologies

IBERAMIA'10 Proceedings of the 12th Ibero-American conference on Advances in artificial intelligence
A practical approach for computing generalization inferences in EL

ESWC'11 Proceedings of the 8th extended semantic web conference on The semantic web: research and applications - Volume Part I
Generalized satisfiability for the description logic ALC

TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Unification in the description logic EL without the top concept

CADE'11 Proceedings of the 23rd international conference on Automated deduction
Using SPARQL with RDFS and OWL entailment

RW'11 Proceedings of the 7th international conference on Reasoning web: semantic technologies for the web of data
Decidability of unification in EL without top constructor

RR'11 Proceedings of the 5th international conference on Web reasoning and rule systems
Subsumption in w.r.t. hybrid TBoxes

KI'05 Proceedings of the 28th annual German conference on Advances in Artificial Intelligence
An approach to exploring description logic knowledge bases

ICFCA'10 Proceedings of the 8th international conference on Formal Concept Analysis
A graph-theoretic generalization of the least common subsumer and the most specific concept in the description logic EL

WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
UEL: unification solver for the description logic EL - system description

IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
The logical difference for the lightweight description logic EL

Journal of Artificial Intelligence Research
A sound and complete backward chaining algorithm for existential rules

RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
Axiomatizing εL⊥-expressible terminological knowledge from erroneous data

Proceedings of the seventh international conference on Knowledge capture
Generalized satisfiability for the description logic ALC

Theoretical Computer Science
Positive subsumption in fuzzy EL with general t-norms

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Compact rewritings for existential rules

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Sound, complete, and minimal query rewriting for existential rules

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Ontology based query answering with existential rules

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Cyclic definitions in description logics have until now been investigated only for description logics allowing for value restrictions. Even for the most basic language FL0, which allows for conjunction and value restrictions only, deciding subsumption in the presence of terminological cycles is a PSPACE-complete problem. This paper investigates subsumption in the presence of terminological cycles for the language EL, Which allows for conjunction, existential restrictions, and the topconcept. In contrast to the results for FL0., subsumption in EL remains polynomial, independent of whether we use least fixpoint semantics, greatest fixpoint semantics, or descriptive semantics.