Reasoning about distances

  • Authors:
  • Frank Wolter;Michael Zakharyaschev

  • Affiliations:
  • Department of Computer Science, University of Liverpool, Liverpool, U.K. and Department of Computer Science, King's College, London, U.K.;Department of Computer Science, University of Liverpool, Liverpool, U.K. and Department of Computer Science, King's College, London, U.K.

  • Venue:
  • IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

The paper presents a novel expressive logic-based formalism intended for reasoning about numerical distances. We investigate its computational properties (in particular, show that it is EXPTIME-complete) and devise a tableau-based satisfiability-checking algorithm. To be able to express knowledge about implicit or unknown distances, we then extend the language with variables ranging over distances and prove that the resulting logic is decidable as well.