On Linear Logic Planning and Concurrency
نویسنده
چکیده
We present an approach to linear logic planning where an explicit correspondence between partial order plans and multiplicative exponential linear logic proofs is established. This is performed by extracting partial order plans from sound and complete encodings of planning problems in multiplicative exponential linear logic in a way that exhibits a non-interleaving behavioral concurrency semantics. Relying on this fact, we argue that this work is a crucial step for establishing a common language for concurrency and planning that will allow to carry techniques and methods between these two fields.
منابع مشابه
On Linear Logic Planning and Concurrency
We present an approach to linear logic planning where an explicit correspondence between partial order plans and multiplicative exponential linear logic proofs is established. This is performed by extracting partial order plans from sound and complete encodings of planning problems in multiplicative exponential linear logic in a way that exhibits a non-interleaving behavioral concurrency semant...
متن کاملExpressiveness of the Abstract Logic Programming Language Forum in Planning and Concurrency
We talk about the expressive power of Forum, an abstract logic programming language recently proposed by Dale Miller. Forum is rich enough to directly express the whole linear logic, and it is a generalization of many existing logic programming languages. In the meantime it retains a pure proof-theoretic view of logic programming. We try to understand and use the set of connectives Forum provid...
متن کاملTowards Planning as Concurrency
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, no...
متن کاملLabelled Event Structure Semantics of Linear Logic Planning
Labelled event structures is a model of concurrency, where causality between actions is expressed by a partial order and the nondeterminism is expressed by a conflict relation on actions. We present a new approach to linear logic planning where computation is performed as cutfree proof search. We provide a labelled event structure semantics for the planning problems, and establish an explicit c...
متن کاملA Tableau for Temporal Logic over the Reals
We provide a simple, sound, complete and terminating tableau decision procedure for the temporal logic of until and since over the real numbers model of time. This logic is an important basis for reasoning about concurrency, metric constraints and planning. Despite its usefulness and long history, there are no existing implementable reasoning techniques for it. The tableau uses a mosaic-based t...
متن کامل