On linear logic planning and concurrency
From MaRDI portal
Publication:1041042
DOI10.1016/j.ic.2009.02.008zbMath1192.68644OpenAlexW4213277074MaRDI QIDQ1041042
Publication date: 27 November 2009
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2009.02.008
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Uses Software
Cites Work
- Forum: A multiple-conclusion specification logic
- Models for concurrency: Towards a classification
- What is the inverse method?
- A new deductive approach to planning
- Petri nets, event structures and domains. I
- Completeness results for linear logic on Petri nets
- Fast planning through planning graph analysis
- A brief history of process algebra
- Focussing and proof construction
- MELL in the calculus of structures
- Strong planning under uncertainty in domains with numerous but identical elements (a generic approach)
- The completeness of linear logic for Petri net models
- A system of interaction and structure IV
- Logic Programming with Focusing Proofs in Linear Logic
- Representing action and change by logic programs
- The classical AI planning problems in the mirror of Horn linear logic: semantics, expressibility, complexity
- From Petri nets to linear logic
- Linear deductive planning
- Logic Programming
- A system of interaction and structure
- Computer Science Logic
- A System of Interaction and Structure II: The Need for Deep Inference
- Reducing Nondeterminism in the Calculus of Structures
- Artificial Intelligence and Symbolic Computation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
