Deductive planning with temporal constraints using TAL

  • Authors:
  • Martin Magnusson;Patrick Doherty

  • Affiliations:
  • Linköpings universitet, Linköping, Sweden;Linköpings universitet, Linköping, Sweden

  • Venue:
  • PCAR '06 Proceedings of the 2006 international symposium on Practical cognitive agents and robots
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Temporal Action Logic is a well established logical formalism for reasoning about action and change using an explicit time representation that makes it suitable for applications that involve complex temporal reasoning. We take advantage of constraint satisfaction technology to facilitate such reasoning through temporal constraint networks. Extensions are introduced that make generation of action sequences possible, thus paving the road for interesting applications in deductive planning. The extended formalism is encoded as a logic program that is able to realize a least commitment strategy that generates partial order plans in the context of both qualitative and quantitative temporal constraints.