#### Filter Results:

- Full text PDF available (71)

#### Publication Year

1983

2017

- This year (7)
- Last 5 years (45)
- Last 10 years (58)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Franz Baader, Baris Sertkaya, Anni-Yasmin Turhan
- Description Logics
- 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 re-use 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… (More)

Similarity measures for concepts written in Description Logics (DLs) are often devised based on the syntax of concepts or simply by adjusting them to a set of instance data. These measures do not take the semantics of the concepts into account and can thus lead to unintuitive results. It even remains unclear how these measures behave if applied to new… (More)

- Anni-Yasmin Turhan, Benjamin Zarrieß
- Description Logics
- 2013

Recently, exact conditions for the existence of the least common subsumer (lcs) computed w.r.t. general EL-TBoxes have been devised [13]. This paper extends these results and provides necessary and suffcient conditions for the existence of the lcs w.r.t. EL-TBoxes. We show decidability of the existence in PTime and polynomial bounds on the maximal… (More)

- Sebastian Brandt, Ralf Küsters, Anni-Yasmin Turhan
- Description Logics
- 2002

- Andreas Ecke, Rafael Peñaloza, Anni-Yasmin Turhan
- J. Applied Logic
- 2015

In Description Logics (DL) knowledge bases (KBs), information is typically captured by clear-cut concepts. For many practical applications querying the KB by crisp concepts is too restrictive; a user might be willing to lose some precision in the query, in exchange of a larger selection of answers. Similarity measures can offer a controlled way of gradually… (More)

- Volker Haarslev, Ralf Möller, Anni-Yasmin Turhan
- IJCAR
- 2001

This paper investigates optimization techniques and data structures exploiting the use of so-called pseudo models. These techniques are applied to speed up TBox and ABox reasoning for the description logics ALCNHR+ and ALC(D). The advances are demonstrated by an empirical analysis using the description logic system RACE that implements TBox and ABox… (More)

- Franz Baader, Anni-Yasmin Turhan
- KI
- 2002

- Anni-Yasmin Turhan
- Reasoning Web
- 2010

Description Logics (DLs) are the formalism underlying the standard web ontology language OWL 2. DLs have formal semantics which are the basis for powerful reasoning services. In this paper, we introduce the basic notions of DLs and the techniques that realize subsumption—the fundamental reasoning service of DL systems. We discuss two reasoning methods for… (More)

- Volker Haarslev, Ralf Möller, +7 authors Nematollah Shiri
- 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 re-use 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… (More)