Download:
|
by Steffen Holldobler, Hans--peter Storr
Proc. of NMR’98 – Action and Causality
http://www.inf.tu-dresden.de/~hs3/pub/./hoelld:stoerr:98esslli.ps.gz
Add To MetaCart
Abstract:
Many problems addressed within the field of Cognitive Robotics and related areas can only be solved by complex plans including conditional and recursive actions as well as non--deterministic choice operators. In this paper we present a planning language which allows for the specification of complex plans. We define its semantics and give a provably complete and correct completed equational logic program with an unification complete equational theory. The approach is independent of the representation of states; they may be sets of propositional fluents as in the situation calculus or multisets of resources as in the fluent calculus. Finally, we give an instantiation within the fluent calculus. 1
Citations
|
1654
|
Foundations of Logic Programming
– Lloyd
- 1984
|
|
1224
|
Some philosophical problems from the standpoint of arti cial intelligence
– McCarthy, Hayes
- 1969
|
|
523
|
The frame problem in the situation calculus: A simple solution (sometimes) and a completeness result for goal regression
– Reiter
- 1991
|
|
401
|
Golog: A logic programming language for dynamic domains
– Levesque, Reiter, et al.
- 1997
|
|
166
|
Situations, actions and causal laws
– McCarthy
|
|
156
|
What is planning in the presence of sensing
– Levesque
- 1996
|
|
91
|
A new deductive approach to planning
– Holldobler, Schneeberger
- 1990
|
|
76
|
Execution monitoring of high-level robot programs
– Giacomo, Reiter, et al.
- 1998
|
|
37
|
Computing change and specificity with equational logic programs
– Holldobler, Thielscher
- 1995
|
|
27
|
How to clear a block: a theory of plans
– Manna, Waldinger
- 1987
|
|
26
|
Linear deductive planning
– Groe, Holldobler, et al.
- 1996
|
|
26
|
A New Logical Framework for Deductive Planning
– Stephan, Biundo
- 1993
|
|
21
|
A new deductive approach to planning. New Generation Computing
– Holldobler, Schneeberger
- 1990
|
|
10
|
Deduction-Based Refinement Planning
– Stephan, Biundo
- 1996
|
|
4
|
Bedingte und Rekursive Aktionen im Fluent{Kalkul
– Storr
- 1997
|
|
4
|
Golog and linear logic programming
– White
- 1998
|
|
3
|
A conceptual foundation for autonomous learning in unforeseen situations
– Kennedy
- 1998
|
|
1
|
ac1match([sb],S,). A.3 Query To check that the plan egg2saucer solves the problem for the case of three bad eggs and one good egg the Prolog interpreter has to prove :- nat(N), "+ planfails([eb,eb,eg,eb], [egg2saucer],N). This yields the answer N = 1
– fail, ac1match
|
