Reasoning About Distances
Abstract
The paper presents a novel expressive logic-based \nformalism intended for reasoning about numerical \ndistances. We investigate its computational properties (in particular, show that it is EXPTIMEcomplete) and devise a tableau-based satisfiabilitychecking algorithm. To be able to express knowledge about implicit or unknown distances, we then \nextend the language with variables ranging over \ndistances and prove that the resulting logic is decidable as well.
Cite
Text
Wolter and Zakharyaschev. "Reasoning About Distances." International Joint Conference on Artificial Intelligence, 2003.Markdown
[Wolter and Zakharyaschev. "Reasoning About Distances." International Joint Conference on Artificial Intelligence, 2003.](https://mlanthology.org/ijcai/2003/wolter2003ijcai-reasoning/)BibTeX
@inproceedings{wolter2003ijcai-reasoning,
title = {{Reasoning About Distances}},
author = {Wolter, Frank and Zakharyaschev, Michael},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2003},
pages = {1275-1282},
url = {https://mlanthology.org/ijcai/2003/wolter2003ijcai-reasoning/}
}