Generating plans in linear logic. I: Actions as proofs
From MaRDI portal
Publication:1802077
DOI10.1016/0304-3975(93)90007-GzbMath0787.03006OpenAlexW4323966281MaRDI QIDQ1802077
M. Masseron, Christophe Tollu, Jacqueline Vauzeilles
Publication date: 23 May 1994
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(93)90007-g
Subsystems of classical logic (including intuitionistic logic) (03B20) Other applications of logic (03B80)
Related Items
Cut elimination for the unified logic, On proof normalization in linear logic, Strong planning under uncertainty in domains with numerous but identical elements (a generic approach), Semantic data modelling using linear logic, Ramification and causality, Linear logic as a tool for planning under temporal uncertainty, Collaborative planning with confidentiality, Linear temporal logic as an executable semantics for planning languages, Generating plans in linear logic. II: A geometry of conjunctive actions, Structural Analysis of Narratives with the Coq Proof Assistant, Proof-search in type-theoretic languages: An introduction
Cites Work