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. These partial order plans exhibit a non-interleaving behavioural concurrency semantics, i.e., labelled event structures. 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.
Scheda prodotto non validato
I dati visualizzati non sono stati ancora sottoposti a validazione formale da parte dello Staff di IRIS, ma sono stati ugualmente trasmessi al Sito Docente Cineca (Loginmiur).
Titolo: | On Linear Logic Planning and Concurrency | |
Autori: | Kahramanogullari, Ozan | |
Autori Unitn: | ||
Titolo del periodico: | INFORMATION AND COMPUTATION | |
Anno di pubblicazione: | 2009 | |
Numero e parte del fascicolo: | 11 | |
Codice identificativo Scopus: | 2-s2.0-70349734504 | |
Codice identificativo WOS: | WOS:000271169800010 | |
Digital Object Identifier (DOI): | http://dx.doi.org/10.1016/j.ic.2009.02.008 | |
Handle: | http://hdl.handle.net/11572/99750 | |
Appare nelle tipologie: | 03.1 Articolo su rivista (Journal article) |