Reasoning with Concrete Domains
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence. Automated Reasoning. Pages 90-94.
Abstract
Description logics are formalisms for the representation of and reasoning about conceptual knowledge on an abstract level. Concrete domains allow the integration of description logic reasoning with reasoning about concrete objects such as numbers, time intervals, or spatial regions. The importance of this combined approach, especially for building real-world applications, is widely accepted. However, the complexity of reasoning with concrete domains has never been formally analyzed and efficient algorithms have not been developed. This paper closes the gap by providing a tight bound for the complexity of reasoning with concrete domains and presenting optimal algorithms.
@inproceedings{ijcai1999p14,
title = {Reasoning with Concrete Domains},
author = {Lutz, Carsten},
booktitle = {Proceedings of the Sixteenth International Joint Conference on
Artificial Intelligence, {IJCAI-99}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Thomas Dean},
pages = {90--94},
year = {1999},
note = {Automated Reasoning},
url = {https://ijcai.org/proceedings/1999/14},
}
TY - CPAPER TI - Reasoning with Concrete Domains AU - Lutz, Carsten T2 - Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI-99 PB - International Joint Conferences on Artificial Intelligence PY - 1999 SP - 90 EP - 94 UR - https://ijcai.org/proceedings/1999/14 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
