Download:
|
by Ying Zhang, Ying Zhang, Howard Barringer, Howard Barringer
ftp://ftp.cs.man.ac.uk/pub/TR/./UMCS-94-7-1.ps.Z
Add To MetaCart
Abstract:
Deductive planning treats planning as a reasoning process within a formal logic. Several formal logics have been applied in various deductive planning systems, but none is completely satisfactory and widely accepted by planning researchers. Almost all the formal logics applied in deductive planning are proposed for more general purpose than planning. Usually, the more general and the more expressive a language is, the less efficient that language is for dealing with problems in a specific domain. In this report, we propose a temporal logic specifically for representing and reasoning about nonlinear planning. Our temporal logic naturally captures the persistence assumption and, when applied in deductive planning, can deal with the frame problem efficiently. Also, in this temporal logic, planning problem can be concisely and clearly specified. Directly upon this temporal logic, we build a deductive nonlinear planning framework, constraint logic planning, which is proved to be sound, complete and is showed to be efficient. In this report, we briefly describe how the temporal logic provides the basis for constraint logic planning. Copyright c fl1994. All rights reserved. Reproduction of all or part of this work is permitted for educational or research purposes on condition that (1) this copyright notice is included, (2) proper attribution to the author or authors is made and (3) no commercial gain is involved.
Citations
|
1397
|
STRIPS: A new approach in the application of theorem proving to problem solving
– Fikes, Nilsson
- 1971
|
|
682
|
Towards a general theory of action and time
– Allen
- 1984
|
|
579
|
Planning for conjunctive goals
– Chapman
- 1987
|
|
320
|
Constraint propagation algorithms for temporal reasoning: a revised report
– Vilain, Kautz, et al.
- 1989
|
|
307
|
O-Plan: the Open Planning Architecture
– Currie
- 1991
|
|
249
|
A temporal logic for reasoning about processes and plans
– McDermott
- 1982
|
|
167
|
The nonlinear nature of plans
– Sacerdoti
- 1975
|
|
126
|
Planning in Time: Windows and Durations for Activities and Goals
– Vere
- 1981
|
|
123
|
Executing Temporal Logic Programs
– Moszkowski
- 1986
|
|
105
|
A deductive approach to program synthesis
– Manna, Waldinger
- 1980
|
|
104
|
Planning using a temporal world model
– Allen, Koomen
- 1983
|
|
94
|
Temporal logics in AI: Semantical and ontological considerations
– Shoham
- 1987
|
|
93
|
A propositional modal logic of time intervals
– Halpern, Shoham
- 1986
|
|
54
|
Temporal Reasoning and Planning
– Allen
- 1991
|
|
47
|
Plan synthesis: A logical perspective
– Rosenschein
- 1981
|
|
37
|
Generalizing nonlinear planning to handle complex goals and actions with context-dependent effects
– Pednault
- 1991
|
|
25
|
Deductive Planning and Plan Reuse in a Command Language Environment
– Biundo, Dengler, et al.
- 1992
|
|
22
|
Matrix proof methods for modal logics
– Wallen
- 1987
|
|
12
|
A hierarchical planner that generates its own hierarchies
– Christensen
- 1990
|
|
8
|
Goal Structure, Holding Periods and "Clouds
– Tate
- 1986
|
|
6
|
Two theories of time
– Lin
- 1991
|
|
4
|
Temporal Reasoning Involving Counterfactuals and Disjunctions
– Dean
- 1985
|
|
4
|
Planning within First-Order Dynamic Logic
– Kautz
- 1982
|
|
3
|
Deterministic modal logic for automated deduction
– Cerro, Herzig
- 1990
|
|
3
|
A Constraint Logic Approach to Modal Deduction
– Frisch, Scherl
- 1990
|
|
2
|
Formal Models of Planning. Pages 50--54 of
– Allen
- 1990
|
|
2
|
Planning as Temporal Reasoning. Pages 3--14 of
– Allen
- 1991
|
|
2
|
Automated quantified modal logic
– Cerro, L, et al.
- 1989
|
|
2
|
A high-level semantics based on interval logic
– Halpern, Manna, et al.
- 1983
|
|
1
|
A Common-Sense Theory of Time. Pages 528--531 of
– Allen
- 1985
|
|
1
|
1004--1009 of
– Pages
|
|
1
|
A formal Model for Classical Planning. Pages 246--251 of
– Christensen
- 1991
|
|
1
|
Planning for Behaviour-Based Robotic Assembly: A Logical Framework
– Cranefield
- 1990
|
|
1
|
A simple Deduction Method for Modal Logic
– Cerro, Luis
- 1982
|
|
1
|
Quantified Modal Logic and Unification Theory. Tech. rept. Rapport LSI n o 293. IRIT, Universit'e Paul Sabatier
– Cerro, Luis
- 1988
|
|
1
|
Application of Theorem Proving to Problem Solving. Pages 741-- 747 of
– Green
- 1969
|
|
1
|
Logic for Problem Solving. New-York
– Kowalski
- 1979
|
|
1
|
A Theory of Plans. Pages 11--45 of
– Manna
- 1986
|
|
1
|
Deadlines, Travel Time and Robot
– Miller, Firby
- 1985
|
|
1
|
A Resolution Calculus for Modal Logics. Pages 500--516 of
– Ohlbach
- 1988
|
|
1
|
Semantics for Reified Temporal Logic. Pages 49--61 of
– Reichgelt
- 1987
|
|
1
|
Splicing Plans to Achieve Misordered Goals. Pages 1016--1021 of
– Vere
|
|
1
|
Temporal Scope of Assertions and Window Cutoff. Pages 1055--1059 of
– Vere
- 1985
|
|
1
|
Achieve Several Goals Simultaneously. Pages 94 --137 of
– Waldinger
- 1977
|
