On linear logic planning and concurrency

Authors:
Ozan Kahramanoğulları
Affiliations:
Imperial College London, Department of Computing, 180 Queen's Gate, London SW7 2AZ, UK
Venue:
Information and Computation
Year:
2009

Citing 23
Cited 0

A new deductive approach to planning

New Generation Computing
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
Concurrency and plan generation in a logic programming language with a sequential operator

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

Handbook of logic in computer science (vol. 4)
Models for concurrency: towards a classification

Theoretical Computer Science
Forum: a multiple-conclusion specification logic

ALP Proceedings of the fourth international conference on Algebraic and logic programming
Fast planning through planning graph analysis

Artificial Intelligence
A linear logic view of gamma style computations as proof searches

Coordination programming
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
Deductive Synthesis of Recursive Plans in Linear Logic

ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
Linear Logic on Petri Nets

A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
MELL in the calculus of structures

Theoretical Computer Science
A brief history of process algebra

Theoretical Computer Science - Process algebra
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
Petri nets for systems and synthetic biology

SFM'08 Proceedings of the Formal methods for the design of computer, communication, and software systems 8th international conference on Formal methods for computational systems biology
Complexity results for serial decomposability

AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Reducing nondeterminism in the calculus of structures

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Petri net reachability checking is polynomial with optimal abstraction hierarchies

SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation

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. 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.