A linear-programming approach to temporal reasoning

  • Authors:

  • Peter Jonsson;Christer Bäckström

  • Affiliations:

  • Department of Computer and Information Science, Linköping University, Linköping, Sweden;Department of Computer and Information Science, Linköping University, Linköping, Sweden

  • Venue:
  • AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
  • Year:
  • 1996

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a new formalism, Horn Disjunctive Linear Relations (Horn DLRs), for reasoning about temporal constraints. We prove that deciding satisfiability of sets of Horn DLRs is polynomial by exhibiting an algorithm based upon linear programming. Furthermore, we prove that most other approaches to tractable temporal constraint reasoning can be encoded as Horn DLRs, including the ORD-Horn algebra and most methods for purely quantitative reasoning.