liu.seSearch for publications in DiVA
ReferencesLink to record
Permanent link

Direct link
Deductive Planning with Temporal Constraints using TAL
2006 (English)In: Proceedings of the International Symposium on Practical Cognitive Agents and Robots (PCAR), Claremont, Australia: UWA Press, 2006, 141-Konferensbidrag (Refereed)
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.

National Category
Computer Science
Identifiers
urn:nbn:se:liu:diva-39650 (URN)10.1145/1232425.1232444 (DOI)50547 (Local ID)1-74052-130-7 (ISBN)oai:DiVA.org:liu-39650 (OAI)
Available from2009-10-10 Created:2009-10-10 Last updated:2011-04-14

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Magnusson, MartinDoherty, Patrick
By organisation
The Institute of TechnologyKPLAB - Knowledge Processing Lab
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Citations

Web of Science®:

Altmetric score

Total: 8 hits
ReferencesLink to record
Permanent link

Direct link