TY  - CONF
AU  - Baader, Franz
AU  - Ganter, Bernhard
AU  - Sertkaya, Baris
AU  - Sattler, Ulrike
A2  - 
T1  - Completing description logic knowledge bases using formal concept analysis
T2  - Proceedings of the 20th international joint conference on Artifical intelligence
PB  - Morgan Kaufmann Publishers Inc.
C1  - San Francisco, CA, USA
PY  - 2007/
CY  -  
VL  - 
IS  - 
SP  - 230
EP  - 235
UR  - http://dl.acm.org/citation.cfm?id=1625275.1625311
DO  - 
KW  - analysis
KW  - base
KW  - complete
KW  - concept
KW  - description
KW  - dl
KW  - fca
KW  - formal
KW  - knowledge
KW  - logic
KW  - ontology
L1  - 
SN  - 
N1  - 
N1  - 
AB  - We propose an approach for extending both the terminological and the assertional part of a Description Logic knowledge base by using information provided by the knowledge base and by a domain expert. The use of techniques from Formal Concept Analysis ensures that, on the one hand, the interaction with the expert is kept to a minimum, and, on the other hand, we can show that the extended knowledge base is complete in a certain, well-defined sense.
ER  -

TY  - CONF
AU  - Baader, Franz
AU  - Sertkaya, Baris
A2  - Eklund, Peter W.
T1  - Applying Formal Concept Analysis to Description Logics.
T2  - Concept Lattices
PB  - Springer
C1  - Berlin/Heidelberg
PY  - 2004/
CY  -  
VL  - 2961
IS  - 
SP  - 261
EP  - 286
UR  - http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2961&spage=261
DO  - 10.1007/978-3-540-24651-0_24
KW  - analysis
KW  - concept
KW  - description
KW  - dl
KW  - fca
KW  - formal
KW  - logic
KW  - logics
L1  - 
SN  - 3-540-21043-1
N1  - 
N1  - 
AB  - Given a finite set $C := C_1,  C_n$ of description logic concepts, we are interested in computing the subsumption hierarchy of all least common subsumers of subsets of $C$ as well as the hierarchy of all conjunctions of subsets of $C$. These hierarchies can be used to support the bottom-up construction of description logic knowledge bases. The point is to compute the first hierarchy without having to compute the least common subsumer for all subsets of $C$, and the second hierarchy without having to check all possible pairs of such conjunctions explicitly for subsumption. We will show that methods from formal concept analysis developed for computing concept lattices can be employed for this purpose.
ER  -

TY  - BOOK
AU  - 
A2  - Baader, Franz
A2  - Calvanese, Diego
A2  - McGuinness, Deborah L.
A2  - Nardi, Daniele
A2  - Patel-Schneider, Peter F.
T1  - The description logic handbook: theory, implementation, and applications
PB  - Cambridge University Press
C1  - New York, NY, USA
PY  - 2003/
VL  - 
IS  - 
SP  - 
EP  - 
UR  - 
DO  - 
KW  - description
KW  - dl
KW  - logics
L1  - 
SN  - 0-521-78176-0
N1  - 
N1  - 
AB  - 
ER  -

TY  - JOUR
AU  - Horrocks, Ian
AU  - Patel-Schneider, Peter F.
AU  - van Harmelen, Frank
T1  - From SHIQ and RDF to OWL: the making of a Web Ontology Language
JO  - Web Semantics: Science, Services and Agents on the World Wide Web
PY  - 2003/
VL  - 1
IS  - 1
SP  - 7
EP  - 26
UR  - http://www.sciencedirect.com/science/article/pii/S1570826803000027
DO  - 10.1016/j.websem.2003.07.001
KW  - dl
KW  - owl
KW  - rdf
KW  - semantic
KW  - web
L1  - 
SN  - 
N1  - 
N1  - 
AB  - The OWL Web Ontology Language is a new formal language for representing ontologies in the Semantic Web. OWL has features from several families of representation languages, including primarily Description Logics and frames. OWL also shares many characteristics with RDF, the W3C base of the Semantic Web. In this paper, we discuss how the philosophy and features of OWL can be traced back to these older formalisms, with modifications driven by several other constraints on OWL. Several interesting problems have arisen where these influences on OWL have clashed.
ER  -