Results 1  10
of
73
Description Logics as Ontology Languages for the Semantic Web
 Festschrift in honor of Jörg Siekmann, Lecture Notes in Artificial Intelligence
, 2003
"... The vision of a Semantic Web has recently drawn considerable attention, both from academia and industry. Description logics are often named as one of the tools that can support the Semantic Web and thus help to make this vision reality. ..."
Abstract

Cited by 126 (5 self)
 Add to MetaCart
The vision of a Semantic Web has recently drawn considerable attention, both from academia and industry. Description logics are often named as one of the tools that can support the Semantic Web and thus help to make this vision reality.
Least Common Subsumers and Most Specific Concepts in a Description Logic with Existential Restrictions and Terminological Cycles
, 2003
"... Computing least common subsumers (Ics) and most specific concepts (msc) are inference tasks that can support the bottomup construction of knowledge bases in description logics. In description logics with existential restrictions, the most specific concept need not exist if one restricts the attenti ..."
Abstract

Cited by 72 (17 self)
 Add to MetaCart
Computing least common subsumers (Ics) and most specific concepts (msc) are inference tasks that can support the bottomup construction of knowledge bases in description logics. In description logics with existential restrictions, the most specific concept need not exist if one restricts the attention to concept descriptions or acyclic TBoxes. In this paper, we extend the notions les and msc to cyclic TBoxes. For the description logic EC (which allows for conjunctions, existential restrictions, and the topconcept), we show that the les and msc always exist and can be computed in polynomial time if we interpret cyclic definitions with greatest fixpoint semantics.
Rewriting concepts using terminologies
 Proceedings of the Seventh International Conference on Knowledge Representation and Reasoning (KR2000
, 2000
"... The problem of rewriting a concept given a terminology can informally be stated as follows: given a terminology T (i.e., a set of concept definitions) and a concept description C that does not contain concept names defined in T, can this description be rewritten into a "related better " de ..."
Abstract

Cited by 42 (6 self)
 Add to MetaCart
The problem of rewriting a concept given a terminology can informally be stated as follows: given a terminology T (i.e., a set of concept definitions) and a concept description C that does not contain concept names defined in T, can this description be rewritten into a "related better " description E by using (some of) the names defined in T? In this paper, we first introduce a general framework for the rewriting problem in description logics, and then concentrate on one specific instance of the framework, namely the minimal rewriting problem (where "better " means shorter, and "related " means equivalent). We investigate the complexity of the decision problem induced by the minimal rewriting problem for the languages FL 0, ALN, ALE, and ALC, and then introduce an algorithm for computing (minimal) rewritings for the language ALE. (In the full paper, a similar algorithm is also developed for ALN.) Finally, we sketch other interesting instances of the framework.
Computing the Least Common Subsumer w.r.t. a Background Terminology
 Journal of Applied Logic
, 2004
"... Methods for computing the least common subsumer (lcs) are usually restricted to rather inexpressive DLs whereas existing knowledge bases are written in very expressive DLs. In order to allow the user to reuse concepts defined in such terminologies and still support the definition of new concepts ..."
Abstract

Cited by 36 (9 self)
 Add to MetaCart
Methods for computing the least common subsumer (lcs) are usually restricted to rather inexpressive DLs whereas existing knowledge bases are written in very expressive DLs. In order to allow the user to reuse concepts defined in such terminologies and still support the definition of new concepts by computing the lcs, we extend the notion of the lcs of concept descriptions to the notion of the lcs w.r.t. a background terminology.
Deciding inseparability and conservative extensions in the description logic EL
, 2008
"... We study the problem of deciding whether two ontologies are inseparable w.r.t. a signature Σ, i.e., whether they have the same consequences in the signature Σ. A special case is to decide whether an extension of an ontology is conservative. By varying the language in which ontologies are formulated ..."
Abstract

Cited by 34 (15 self)
 Add to MetaCart
We study the problem of deciding whether two ontologies are inseparable w.r.t. a signature Σ, i.e., whether they have the same consequences in the signature Σ. A special case is to decide whether an extension of an ontology is conservative. By varying the language in which ontologies are formulated and the query language that is used to describe consequences, we obtain different versions of the problem. We focus on the lightweight description logic EL as an ontology language, and consider query languages based on (i) subsumption queries, (ii) instance queries over ABoxes, (iii) conjunctive queries over ABoxes, and (iv) secondorder logic. For query languages (i) to (iii), we establish ExpTimecompleteness of both inseparability and conservative extensions. Case (iv) is equivalent to a modeltheoretic version of inseparability and conservative extensions, and we prove it to be undecidable. We also establish a number of robustness properties for inseparability.
Approximation and difference in description logics
 Proc. of KR02
, 2002
"... Approximation is a new inference service in Description Logics first mentioned by Baader, Küsters, and Molitor. Approximating a concept, defined in one Description Logic, means to translate this concept to another concept, defined in a second typically less expressive Description Logic, such that bo ..."
Abstract

Cited by 29 (6 self)
 Add to MetaCart
Approximation is a new inference service in Description Logics first mentioned by Baader, Küsters, and Molitor. Approximating a concept, defined in one Description Logic, means to translate this concept to another concept, defined in a second typically less expressive Description Logic, such that both concepts are as closely related as possible with respect to subsumption. The present paper provides the first indepth investigation of this inference task. We prove that approximations from the Description Logic ALC to ALE always exist and propose an algorithm computing them. As a measure for the accuracy of the approximation, we introduce a syntaxoriented difference operator, which yields a concept that contains all aspects of the approximated concept that are not present in the approximation. It is also argued that a purely semantical difference operator, as introduced by Teege, is less suited for this purpose. Finally, for the logics under consideration, we propose an algorithm computing the difference.
Matching in Description Logics with Existential Restrictions
 In Proc. of KR2000
, 2000
"... Matching of concepts against patterns is a new inference task in Description Logics, which was originally motivated by applications of the Classic system. Consequently, the work on this problem was until now mostly concerned with sublanguages of the Classic language, which does not allow for existen ..."
Abstract

Cited by 21 (14 self)
 Add to MetaCart
Matching of concepts against patterns is a new inference task in Description Logics, which was originally motivated by applications of the Classic system. Consequently, the work on this problem was until now mostly concerned with sublanguages of the Classic language, which does not allow for existential restrictions. This paper extends the existing work on matching in two directions. On the one hand, the question of what are the most "interesting " solutions of matching problems is explored in more detail. On the other hand, for languages with existential restrictions both, the complexity of deciding the solvability of matching problems and the complexity of actually computing sets of "interesting " matchers are determined. The results show that existential restrictions make these computational tasks more complex. Whereas for sublanguages of Classic both problems could be solved in polynomial time, this is no longer possible for languages with existential restrictions.
Computing Least Common Subsumers in ALEN
, 2001
"... Computing the least common subsumer (lcs) has proved to be useful in a variety of different applications. Previous work on the lcs has concentrated on description logics that either allow for number restrictions or for existential restrictions. Many applications, however, require to combine the ..."
Abstract

Cited by 16 (4 self)
 Add to MetaCart
Computing the least common subsumer (lcs) has proved to be useful in a variety of different applications. Previous work on the lcs has concentrated on description logics that either allow for number restrictions or for existential restrictions. Many applications, however, require to combine these constructors. In this work, we present an lcs algorithm for the description logic ALEN , which allows for both constructors, thereby correcting previous algorithms proposed in the literature. 1
Approximating Most Specific Concepts in Description Logics with Existential Restrictions
, 2001
"... . Computing the most specic concept (msc) is an inference task that allows to abstract from individuals dened in description logic (DL) knowledge bases. For DLs that allow for existential restrictions or number restrictions, however, the msc need not exist unless one allows for cyclic concepts i ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
. Computing the most specic concept (msc) is an inference task that allows to abstract from individuals dened in description logic (DL) knowledge bases. For DLs that allow for existential restrictions or number restrictions, however, the msc need not exist unless one allows for cyclic concepts interpreted with the greatest xedpoint semantics. Since such concepts cannot be handled by current DLsystems, we propose to approximate the msc. We show that for the DL ALE , which has concept conjunction, a restricted form of negation, existential restrictions, and value restrictions as constructors, approximations of the msc always exist and can eectively be computed. 1