Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Anni-Yasmin Turhan
2010 – today
- 2013
[c34]Anni-Yasmin Turhan, Benjamin Zarrieß: Computing the lcs w.r.t. General EL+-TBoxes. Description Logics 2013: 477-488
[c33]Andreas Ecke, Rafael Peñaloza, Anni-Yasmin Turhan: Role-depth Bounded Least Common Subsumer in Prob-EL with Nominals. Description Logics 2013: 670-688
[c32]Benjamin Zarrieß, Anni-Yasmin Turhan: Most Specific Generalizations w.r.t. General EL-TBoxes. IJCAI 2013
[c31]Andreas Ecke, Rafael Peñaloza, Anni-Yasmin Turhan: Computing Role-Depth Bounded Generalizations in the Description Logic. KI 2013: 49-60
[c30]Waltenegus Dargie, Eldora, Julian Mendez, Christoph Mobius, Kateryna Rybina, Veronika Thost, Anni-Yasmin Turhan: Situation recognition for service management systems using OWL 2 reasoners. PerCom Workshops 2013: 31-36
[c29]Anni-Yasmin Turhan: Introductions to Description Logics - A Guided Tour. Reasoning Web 2013: 150-161
[c28]Rafael Peñaloza, Anni-Yasmin Turhan: Instance-Based Non-standard Inferences in $\mathcal{EL}$ with Subjective Probabilities. URSW (LNCS Vol.) 2013: 80-98- 2012
[c27]Andreas Ecke, Anni-Yasmin Turhan: Role-depth Bounded Least Common Subsumers for EL+ and ELI. Description Logics 2012
[c26]Karsten Lehmann, Anni-Yasmin Turhan: A Framework for Semantic-Based Similarity Measures for $\mathcal{ELH}$ -Concepts. JELIA 2012: 307-319
[c25]Andreas Ecke, Anni-Yasmin Turhan: Optimizations for the Role-Depth Bounded Least Common Subsumer in EL+. OWLED 2012- 2011
[c24]Julian Mendez, Andreas Ecke, Anni-Yasmin Turhan: Implementing Completion-Based Inferences for the EL-family. Description Logics 2011
[c23]Rafael Peñaloza, Anni-Yasmin Turhan: A Practical Approach for Computing Generalization Inferences in EL\mathcal{EL}. ESWC (1) 2011: 410-423
[c22]- 2010
[j3]Franz Baader, Carsten Lutz, Anni-Yasmin Turhan: Small is Again Beautiful in Description Logics. KI 24(1): 25-33 (2010)
[c21]Rafael Peñaloza, Anni-Yasmin Turhan: Towards Approximative Most Specific Concepts by Completion for EL with Subjective Probabilities. UniDL 2010
[c20]Anni-Yasmin Turhan, Rafael Peñaloza: Role-depth Bounded Least Common Subsumers by Completion for EL- and prob-EL-TBoxes. Description Logics 2010
[c19]Anni-Yasmin Turhan: Reasoning and Explanation in EL and in Expressive Description Logics. Reasoning Web 2010: 1-27
[e2]Thomas Lukasiewicz, Rafael Peñaloza, Anni-Yasmin Turhan (Eds.): Proceedings of the First International Workshop on Uncertainty in Description Logics, Edinburgh, UK, July 20, 2010. CEUR Workshop Proceedings 613, CEUR-WS.org 2010
2000 – 2009
- 2009
[j2]Thomas Springer, Anni-Yasmin Turhan: Employing description logics in Ambient Intelligence for modeling and reasoning about complex situations. JAISE 1(3): 235-259 (2009)- 2007
[b1]Anni-Yasmin Turhan: On the computation of common subsumers in description logics. Dresden University of Technology 2007, pp. 1-156
[j1]Franz Baader, Baris Sertkaya, Anni-Yasmin Turhan: Computing the least common subsumer w.r.t. a background terminology. J. Applied Logic 5(3): 392-420 (2007)
[c18]Anni-Yasmin Turhan, Yusri Bong: Speeding up Approximation with Nicer Concepts. Description Logics 2007
[e1]Diego Calvanese, Enrico Franconi, Volker Haarslev, Domenico Lembo, Boris Motik, Anni-Yasmin Turhan, Sergio Tessaris (Eds.): Proceedings of the 2007 International Workshop on Description Logics (DL2007), Brixen-Bressanone, near Bozen-Bolzano, Italy, 8-10 June, 2007. CEUR Workshop Proceedings 250, CEUR-WS.org 2007- 2006
[c17]Sean Bechhofer, Thorsten Liebig, Marko Luther, Olaf Noppens, Peter F. Patel-Schneider, Boontawee Suntisrivaraporn, Anni-Yasmin Turhan, Timo Weithöner: DIG 2.0 -- Towards a Flexible Interface for Description Logic Reasoners. OWLED 2006
[c16]Anni-Yasmin Turhan, Thomas Springer, Michael Berger: Pushing Doors for Modeling Contexts with OWL DL a Case Study. PerCom Workshops 2006: 13-17- 2004
[c15]
[c14]Franz Baader, Baris Sertkaya, Anni-Yasmin Turhan: Computing the Least Common Subsumer w.r.t. a Background Terminology. Description Logics 2004
[c13]
[c12]Franz Baader, Baris Sertkaya, Anni-Yasmin Turhan: Computing the Least Common Subsumer w.r.t. a Background Terminology. JELIA 2004: 400-412- 2003
[c11]Sebastian Brandt, Anni-Yasmin Turhan: Computing Least Common Subsumers for FLE+. Description Logics 2003
[c10]Sebastian Brandt, Anni-Yasmin Turhan, Ralf Küsters: Extensions of Non-standard Inferences to Descriptions Logics with Transitive Roles. LPAR 2003: 122-136- 2002
[c9]Franz Baader, Anni-Yasmin Turhan: On the Problem of Computing Small Representations of Least Common Subsumers. KI 2002: 99-113
[c8]Sebastian Brandt, Ralf Küsters, Anni-Yasmin Turhan: Approximation and Difference in Description Logics. KR 2002: 203-214- 2001
[c7]Volker Haarslev, Ralf Möller, Anni-Yasmin Turhan: Exploiting Pseudo Models for TBox and ABox Reasoning in Expressive Description Logics. IJCAR 2001: 61-75
[c6]Franz Baader, Anni-Yasmin Turhan: TBoxes do not Yield a Compact Representation of Least Common Subsumers. Description Logics 2001
[c5]Anni-Yasmin Turhan, Ralf Molitor: Using Lazy Unfolding for the Computation of Least Common Subsumers. Description Logics 2001- 2000
[c4]Anni-Yasmin Turhan, Volker Haarslev: Adapting Optimization Techniques to Description Logics with Concrete Domains. Description Logics 2000: 247-256
1990 – 1999
- 1999
[c3]Volker Haarslev, Ralf Möller, Anni-Yasmin Turhan, Michael Wessel: On Terminological Default Reasoning about Spatial Information: Extended Abstract. Description Logics 1999- 1998
[c2]
[c1]Volker Haarslev, Ralf Möller, Anni-Yasmin Turhan: Implementing an ALCRP(D) ABox Reasoner - Progress Report. Description Logics 1998
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:09 CEST by the dblp team



