Strong planning under uncertainty in domains with numerous but identical elements (a generic approach)

DOI10.1016/j.tcs.2007.01.022zbMath1118.68157OpenAlexW2014364240MaRDI QIDQ2373707

Max I. Kanovich, Jacqueline Vauzeilles

Publication date: 16 July 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.01.022

zbMATH Keywords

linear logicproofs as programsAI planning under uncertaintydeterministic and non-deterministic planning domainsHorn linear logic

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Reasoning under uncertainty in the context of artificial intelligence (68T37) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Linear logic as a tool for planning under temporal uncertainty ⋮ On linear logic planning and concurrency

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A deductive solution for plan generation
• Linear logic
• Weak, strong, and strong cyclic planning via symbolic model checking
• Linear logic as a logic of computations
• The computational complexity of propositional STRIPS planning
• Generating plans in linear logic. I: Actions as proofs
• Generating plans in linear logic. II: A geometry of conjunctive actions
• Decidability of linear affine logic
• Complexity, decidability and undecidability results for domain-independent planning
• The finite model property for various fragments of linear logic
• The classical AI planning problems in the mirror of Horn linear logic: semantics, expressibility, complexity
• Computer Science Logic