A description logic with expressive concrete domains Gerd Kamp and Holger Wache May 1996 Deutsches Forschungszentrum für Künstliche Intelligenz


f ¨ ur K ¨ unstliche Intelligenz, DFKI) with sites in Kaiserslautern and Saarbrücken is a non-profit organization which was founded in 1988. The DFKI conducts application-oriented basic research in the field of artificial intelligence and other related subfields of computer science. The overall goal is to construct systems with technical knowledge and common sense which-by using AI methods-implement a problem solution for a selected application area. Currently, there are the following research areas at the DFKI: The DFKI strives at making its research results available to the scientific community. There exist many contacts to domestic and foreign research institutions, both in academy and industry. The DFKI hosts technology transfer workshops for shareholders and other interested groups in order to inform about the current state of research. From its beginning, the DFKI has provided an attractive working environment for AI researchers from Germany and from all over the world. The goal is to have a staff of about 100 researchers at the end of the building-up phase. c Deutsches Forschungszentrum für K ¨ unstliche Intelligenz 1996 This work may not be copied or reproduced in whole of part for any commercial purpose. Permission to copy in whole or part without payment of fee is granted for nonprofit educational and research purposes provided that all such whole or partial copies include the following: a notice that such copying is by permission of the Deutsche Forschungszentrum für K ¨ unstliche Intelligenz, Kaiserslautern, Federal Republic of Germany; an acknowledgement of the authors and individual contributors to the work; all applicable portions of this copyright notice. Copying, reproducing, or republishing for any other purpose shall require a licence with payment of fee to Deutsches Forschungszentrum für K ¨ unstliche Intelligenz. Abstract Compared with frame-based systems, description logics have the advantage of well-deened semantics and powerful inferences. In order to exploit these advantages in technical domains, the ability to use concrete domains is needed, e.g. systems of (in)equalities over (non)linear polynomials to handle physical laws. Existing systems can only cope with comparisons between attributes. We present an approach that considerably improves the expressive-ness of the concrete domains. Ctl 1 is based on the ideas presented in 1] and 5]. Concrete domains are realised through a well-deened interface to external algorithms. Constraint Logic Programming (CLP) systems allow us to easily realise a whole range of concrete domains, e.g. over sets of symbols and numbers. In particular, …

Cite this paper

@inproceedings{Wache1996ADL, title={A description logic with expressive concrete domains Gerd Kamp and Holger Wache May 1996 Deutsches Forschungszentrum f{\"{u}r K{\"{u}nstliche Intelligenz}, author={Holger Wache and Gerd Kamp}, year={1996} }