Reasoning with Concrete Domains

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche

„Juli 31 -- August 6,“ befindet sich nicht in der Liste (Januar, Februar, März, April, Mai, Juni, Juli, August, September, Oktober, ...) zulässiger Werte für das Attribut „Month“.

Toggle side column

Reasoning with Concrete Domains

Carsten LutzCarsten Lutz
Carsten Lutz
Reasoning with Concrete Domains
In Thomas Dean, eds., Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence IJCAI-99, 90-95,  1999. Morgan-Kaufmann Publishers
  • KurzfassungAbstract
    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.
  • Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@inproceedings{ Lutz-IJCAI-99,
  address = {Stockholm, Sweden},
  author = {C. {Lutz}},
  booktitle = {Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence IJCAI-99},
  editor = {Thomas {Dean}},
  month = {July 31 -- August 6,},
  pages = {90--95},
  publisher = {Morgan-Kaufmann Publishers},
  title = {Reasoning with Concrete Domains},
  year = {1999},
}