 | 2009 |
|---|
| 15 |       | Rafael Peñaloza,
Baris Sertkaya:
Axiom Pinpointing is Hard.
Description Logics 2009 |
| 14 | | Baris Sertkaya:
OntoComP System Description.
Description Logics 2009 |
| 13 | | Baris Sertkaya:
OntoComP: A Protégé Plugin for Completing OWL Ontologies.
ESWC 2009: 898-902 |
| 12 | | Baris Sertkaya:
Towards the Complexity of Recognizing Pseudo-intents.
ICCS 2009: 284-292 |
| 11 | | Franz Baader,
Baris Sertkaya:
Usability Issues in Description Logic Knowledge Base Completion.
ICFCA 2009: 1-21 |
| 10 | | Baris Sertkaya:
Some Computational Problems Related to Pseudo-intents.
ICFCA 2009: 130-145 |
| 2008 |
|---|
| 9 | | Baris Sertkaya:
Explaining User Errors in Knowledge Base Completion.
Description Logics 2008 |
| 8 | | Miki Hermann,
Baris Sertkaya:
On the Complexity of Computing Generators of Closed Sets.
ICFCA 2008: 158-168 |
| 2007 |
|---|
| 7 | | Franz Baader,
Bernhard Ganter,
Baris Sertkaya,
Ulrike Sattler:
Completing Description Logic Knowledge Bases Using Formal Concept Analysis.
IJCAI 2007: 230-235 |
| 6 | | Franz Baader,
Bernhard Ganter,
Ulrike Sattler,
Baris Sertkaya:
Completing Description Logic Knowledge Bases using Formal Concept Analysis.
OWLED 2007 |
| 5 | | 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) |
| 2004 |
|---|
| 4 | | Franz Baader,
Baris Sertkaya,
Anni-Yasmin Turhan:
Computing the Least Common Subsumer w.r.t. a Background Terminology.
Description Logics 2004 |
| 3 | | Franz Baader,
Baris Sertkaya:
Applying Formal Concept Analysis to Description Logics.
ICFCA 2004: 261-286 |
| 2 | | Baris Sertkaya,
Halit Oguztüzün:
Proof of the Basic Theorem on Concept Lattices in Isabelle/HOL.
ISCIS 2004: 976-985 |
| 1 | | Franz Baader,
Baris Sertkaya,
Anni-Yasmin Turhan:
Computing the Least Common Subsumer w.r.t. a Background Terminology.
JELIA 2004: 400-412 |
