Magnusson, Martin 2007 (English)Licentiatavhandling, sammanläggning (Other academic)
Temporal Action Logic is a well established logical formalism for reasoning about action and change that has long been used as a formal specification language. Its first-order characterization and explicit time representation makes it a suitable target for automated theorem proving and the application of temporal constraint solvers. We introduce a translation from a subset of Temporal Action Logic to constraint logic programs that takes advantage of these characteristics to make the logic applicable, not just as a formal specification language, but in solving practical reasoning problems. Extensions are introduced that enable the generation of action sequences, thus paving the road for interesting applications in deductive planning. The use of qualitative temporal constraints makes it possible to follow a least commitment strategy and construct partially ordered plans. Furthermore, the logical language and logic program translation is extended with the notion of composite actions that can be used to formulate and execute scripted plans with conditional actions, non-deterministic choices, and loops. The resulting planner and reasoner is integrated with a graphical user interface in our autonomous helicopter research system and applied to logistics problems. Solution plans are synthesized together with monitoring constraints that trigger the generation of recovery actions in cases of execution failures.
Place, publisher, year, pages
Institutionen för datavetenskap, 2007. 85 p.
Linköping Studies in Science and Technology. Thesis, ISSN 0280-7971 ; 1329
Temporal Action Logic, deductive planning, composite actions, interval algebra, constraint logic programming, execution monitoring
National CategoryComputer Science
Identifiersurn:nbn:se:liu:diva-9726 (URN)978-91-85895-93-9 (ISBN)oai:DiVA.org:liu-9726 (OAI)
2007-09-28, Alan Turing, Hus E, Campus Valla, Linköpings universitet, Linköping, 10:15 (English)