On Linear Logic Planning and Concurrency

Authors:
Ozan Kahramanoğulları
Affiliations:
Department of Computing, Imperial College London,
Venue:
Language and Automata Theory and Applications
Year:
2008

Citing 13
Cited 0

Linear logic

Theoretical Computer Science
ADL: exploring the middle ground between STRIPS and the situation calculus

Proceedings of the first international conference on Principles of knowledge representation and reasoning
Representing actions in equational logic programming

Proceedings of the eleventh international conference on Logic programming
Models for concurrency

Handbook of logic in computer science (vol. 4)
Fast planning through planning graph analysis

Artificial Intelligence
Generating Plans in Linear Logic

Proceedings of the Tenth Conference on Foundations of Software Technology and Theoretical Computer Science
The pi-Calculus as a Theory in Linear Logic: Preliminary Results

ELP '92 Proceedings of the Third International Workshop on Extensions of Logic Programming
MELL in the calculus of structures

Theoretical Computer Science
A system of interaction and structure

ACM Transactions on Computational Logic (TOCL)
Strong planning under uncertainty in domains with numerous but identical elements (a generic approach)

Theoretical Computer Science
The classical AI planning problems in the mirror of Horn linear logic: semantics, expressibility, complexity

Mathematical Structures in Computer Science
Partial-order planning with concurrent interacting actions

Journal of Artificial Intelligence Research
Naming proofs in classical propositional logic

TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.