Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/talplanner-a-temporal-logic-based-forward-chaining-planner-MhjSGwKCdt
References (54)
-
Jonas Kvarnström, P. Doherty (1998)
Tackling the qualification problem using fluent dependency constraints: preliminary reportProceedings. Fifth International Workshop on Temporal Representation and Reasoning (Cat. No.98EX157)
-
The result of Progress is simpliied using the rules :false = true, (false ^ ) = ( ^ false) = false, (false _ ) = ( _ false) = , :true = false -
(1998)
Kvarnstr om, `TAL: Temporal Action Logics { language speci cation and tutorial', Link oping Electronic Articles in Computer and Information Science, 3(15) -
T. Henzinger (1996)
The Beneets of Relaxing Punctuality -
Let ? 0 = ? acs ? dep and let ? = Circ SO (? 0 (Occlude); Occlude) ? dom Circ SO (? occ (Occurs); Occurs) ? obs ? ? fnd . ? is the theory that is used for proofs in TAL -
B. Selman, Henry Kautz (1998)
BLACKBOX: A New Approach to the Application of Theorem Proving to Problem Solving -
Jana Koehler, Bernhard Nebel, J. Hoffmann, Yannis Dimopoulos (1997)
Extending Planning Graphs to an ADL Subset -
F. Bacchus, F. Kabanza (2000)
Using temporal logics to express search control knowledge for planningArtif. Intell., 116
-
J. Gustafsson, P. Doherty (1996)
Principles of Knowledge Representation and Reasoning: Proceedings of the Fifth International Conference (KR '96) -
E. Emerson (1991)
Temporal and Modal Logic -
Let ? dom = Trans(dom), ? acs = Trans(acs), ? dep = Trans(dep), ? obs = Trans(obs), ? occ = Trans(occ), and ? per = Trans(per) -
Jonas Kvarnström, P. Doherty, P. Haslum (2000)
Extending TALplanner with Concurrency and Resources -
F. Bacchus (2001)
AIPS 2000 Planning Competition: The Fifth International Conference on Artificial Intelligence Planning and Scheduling SystemsAi Magazine, 22
-
F. Bacchus, F. Kabanza (1996)
Using temporal logic to control search in a forward chaining planner -
P. Doherty (1994)
Reasoning about Action and Change Using Occlusion -
J. Gustafsson, P. Doherty (1996)
Embracing Occlusion in Specifying the Indirect Effects of Actions -
M. Fox, D. Long (1999)
The Detection and Exploitation of Symmetry in Planning Problems -
Muhammad Upal (2001)
Learning Plan Rewriting Rules -
Miconic 10 elevator domain home page -
(1998)
Artiicial Intelligence Planning Systems: 1998 Planning Competition -
D. Kibler, P. Morris (1981)
Don't Be Stupid -
J. McCarthy (1995)
Circumscription: a form of non-monotonic reasoning -
J. Ambite, Craig Knoblock (2001)
Planning by RewritingArXiv, abs/1106.0250
-
(1999)
Available at ftp://newlogos. uwaterloo.ca/pub/bacchus/BApre.ps.gz -
Let dom, acs, dep, obs, occ, and per be the sets of statements with labels dom, acs, dep, obs, occ, and per respectively, completed with universal quantiication for variables occurring freely -
P. Doherty, Jonas Kvarnström (1999)
TALplanner: an empirical investigation of a temporal logic-based forward chaining plannerProceedings. Sixth International Workshop on Temporal Representation and Reasoning. TIME-99
-
only on the right-hand side are assumed to be previously unused variables -
F. Bacchus, F. Kabanza (1996)
Planning for temporally extended goalsAnnals of Mathematics and Artificial Intelligence, 22
-
E. Pednault (1989)
ADL: Exploring the Middle Ground Between STRIPS and the Situation Calculus -
J. McCarthy (1980)
Circumscription - A Form of Non-Monotonic ReasoningArtif. Intell., 13
-
E. Sandewall (1995)
Features and fluents (vol. 1): the representation of knowledge about dynamical systems -
J.L. Ambite, C.A. Knoblock, S. Minton (2000)
Proceedings of the Fifth International Conference -
R. Alur, T. Feder, T. Henzinger (1991)
The benefits of relaxing punctualityJ. ACM, 43
-
Trans(Per(t; f)) = Per(t; f) Trans(Dur(t; f; v)) = Dur -
V. Lifschitz (1985)
Computing Circumscription -
J. Kvarnstrr om and P. Doherty TALplanner -
J. Kvarnström, P. Doherty, P. Haslum (2000)
Proceedings of the Fourteenth European Conference -
P. Doherty, J. Gustafsson, L. Karlsson, Jonas Kvarnström (1998)
TAL: Temporal Action Logics Language Specification and TutorialElectron. Trans. Artif. Intell., 2
-
J. Hoffmann, Bernhard Nebel (2011)
The FF Planning System: Fast Plan Generation Through Heuristic SearchJ. Artif. Intell. Res., 14
-
Precondition control, 1999. Available at ftp -
(1992)
`Back to the future: Towards a theory of timed regular languages -
Fangzhen Lin (2001)
A Planner Called RAI Mag., 22
-
F. Kabanza, M. Barbeau, R. St.-Denis (1997)
Planning Control Rules for Reactive AgentsArtif. Intell., 95
-
J. Kvarnström, P. Doherty (2000)
Tackling the qualification problem using fluent dependency constraintsComputational Intelligence, 16
-
P. Doherty, W. Lukaszewicz (1994)
Circumscribing Features and Fluents: A Fluent Logic for Reasoning about Action and Change -
Fast-Forward home page -
(1981)
Proceedings of the Seventh International Joint Conference on Artiicial Intelligence (IJCAI-81) -
D. Nau, Y. Cau, A. Lotem, H. Muños-Avila (1999)
Proceedings of the International Joint Conference -
L. Karlsson, J. Gustafsson (1999)
Reasoning about Concurrent InteractionJ. Log. Comput., 9
-
To transform a narrative from L(ND) to L(FL) -
Dana Nau, Yue Cao, A. Lotem, Hector Muñoz-Avila (1999)
SHOP: Simple Hierarchical Ordered Planner -
L. Karlsson, J. Gustafsson, P. Doherty (1998)
Delayed Effects of Actions -
(1998)
HSP: Heuristic search planner -
V. Lifschitz (1985)
Proceedings of the Ninth International Joint Conference
- Publisher
- Springer Journals
- Copyright
- Copyright © 2000 by Kluwer Academic Publishers
- Subject
- Computer Science; Computer Science, general; Artificial Intelligence (incl. Robotics); Mathematics, general; Complexity
- ISSN
- 1012-2443
- eISSN
- 1573-7470
- DOI
- 10.1023/A:1016619613658
- Publisher site
- See Article on Publisher Site
Abstract
We present TALplanner, a forward-chaining planner based on the use of domain-dependent search control knowledge represented as formulas in the Temporal Action Logic (TAL). TAL is a narrative based linear metric time logic used for reasoning about action and change in incompletely specified dynamic environments. TAL is used as the formal semantic basis for TALplanner, where a TAL goal narrative with control formulas is input to TALplanner which then generates a TAL narrative that entails the goal and control formulas. The sequential version of TALplanner is presented. The expressivity of plan operators is then extended to deal with an interesting class of resource types. An algorithm for generating concurrent plans, where operators have varying durations and internal state, is also presented. All versions of TALplanner have been implemented. The potential of these techniques is demonstrated by applying TALplanner to a number of standard planning benchmarks in the literature.
Journal
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Sep 30, 2004