LiU Electronic Press
Full-text not available in DiVA
Author:
Magnusson, Martin (Linköping University, The Institute of Technology) (Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab)
Doherty, Patrick (Linköping University, The Institute of Technology) (Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab)
Title:
Deductive Planning with Temporal Constraints using TAL
Department:
Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab
Linköping University, The Institute of Technology
Publication type:
Conference paper (Refereed)
Language:
English
In:
Proceedings of the International Symposium on Practical Cognitive Agents and Robots (PCAR)
Place of publ.: Claremont, Australia Publisher: UWA Press
Pages:
141-
Year of publ.:
2006
URI:
urn:nbn:se:liu:diva-39650
Permanent link:
http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-39650
ISBN:
1-74052-130-7
Local ID:
50547
Subject category:
Computer Science
SVEP category:
Computer science
Abstract(en) :

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.

Available from:
2009-10-10
Created:
2009-10-10
Last updated:
2011-04-14
Statistics:
8 hits