Abstract:
We present a purely logical framework to planning where we bring the sequential and parallel composition in the plans to the same level, as in process algebras. The problem of expressing causality, which is very challenging for common logics and traditional deductive systems, is solved by resorting to a recently developed extension of multiplicative exponential linear logic with a self-dual, noncommutative operator. We present an encoding of the conjunctive planning problems in this logic, and provide a constructive soundness and completeness result. We argue that this work is the first, but crucial, step of a uniform deductive formalism that connects planning and concurrency inside a common language, and allows to transfer methods from concurrency to planning.
Citations
|
769
|
Fast planning through planning graph analysis
– Blum, Furst
- 1997
|
|
450
|
Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search
– Kautz, Selman
- 1996
|
|
119
|
Natural actions, concurrency and continuous time in the situation calculus
– Reiter
- 1996
|
|
102
|
The -calculus as a theory in linear logic: Preliminary results
– Miller
- 1992
|
|
92
|
A new deductive approach to planning
– Holldobler, Schneeberger
- 1990
|
|
91
|
A deductive solution for plan generation
– Bibel
- 1986
|
|
55
|
A system of interaction and structure
– Guglielmi
- 2002
|
|
53
|
Generating plans in linear logic
– Masseron, Tollu, et al.
- 1990
|
|
52
|
The Maude 2.0 system
– Clavel, Durán, et al.
- 2003
|
|
35
|
Flaw Selection Strategies for Partial-Order Planning
– Pollack, Joslin, et al.
- 1997
|
|
29
|
Linear Deductive Planning
– Große, Hölldobler, et al.
- 1996
|
|
27
|
Linear Logic and Noncommutativity in the Calculus of Structures
– Straßburger
- 2003
|
|
22
|
A purely logical account of sequentiality in proof search
– Bruscoli
- 2002
|
|
22
|
A non-commutative extension of MELL
– Guglielmi, Straßburger
- 2002
|
|
14
|
Abstract Logic Programming in Linear Logic—Independence and Causality in a First Order Calculus
– Guglielmi
- 1996
|
|
14
|
Models for concurrency: Towards a classification
– Sassone, Nielsen, et al.
- 1996
|
|
12
|
Implementing system BV of the calculus of structures in maude
– Kahramano˘gulları
- 2004
|
|
11
|
Classical AI planning as theorem proving: The case of a fragment of linear logic
– Jacopin
- 1993
|
|
10
|
Utilizing Problem Structure in Planning: A local Search Approach
– Hoffmann
- 2003
|
|
8
|
Deductive synthesis of recursive plans in linear logic
– Cresswell, Smaill, et al.
- 1999
|
|
8
|
System BV without the equalities for unit
– Kahramano˘gulları
- 2004
|
|
4
|
Reasoning on actions and change in a linear logic programming
– Kobayashi, Yonezawa
- 1993
|
|
3
|
Plans as formulae with a non-commutative operator
– Kahramano˘gulları
- 2004
|
|
3
|
A note on processes for plan-execution and powerdomains for plan-comparison
– Pym, Pryor, et al.
- 1996
|
|
2
|
A new logical notion of partial order planning
– Kahramano˘gulları
- 2004
|
