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

DOI10.1016/J.TCS.2007.01.022MaRDI QIDQ2373707zbMATH OpenOpenAlexFDO

Authors Max 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

AI planning under uncertaintydeterministic and non-deterministic planning domainsHorn linear logiclinear logicproofs as programs

Mathematics Subject Classification ID

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

Recommendations

• Strong planning under partial observability
• Robust planning with incomplete domain models
• Contingent planning under uncertainty via stochastic satisfiability
• Compiling uncertainty away in non-deterministic conformant planning
• Towards efficient universal planning: A randomized approach
• Plan aggregation for strong cyclic planning in nondeterministic domains
• A generic approach to planning in the presence of incomplete information: theory and implementation
• Fast strong planning for fully observable nondeterministic planning problems
• Planning and acting in partially observable stochastic domains

Cites work

• A deductive solution for plan generation
• Artificial intelligence. A new synthesis
• Complexity, decidability and undecidability results for domain-independent planning
• Computer Science Logic
• Decidability of linear affine logic
• Encoding domain and control knowledge for propositional planning
• Functional strips: A more flexible language for planning and problem solving
• Generating plans in linear logic. I: Actions as proofs
• Generating plans in linear logic. II: A geometry of conjunctive actions
• scientific article; zbMATH DE number 1216123 (Why is no real title available?)
• scientific article; zbMATH DE number 1315585 (Why is no real title available?)
• scientific article; zbMATH DE number 786485 (Why is no real title available?)
• scientific article; zbMATH DE number 786490 (Why is no real title available?)
• Linear logic
• Linear logic as a logic of computations
• The classical AI planning problems in the mirror of Horn linear logic: semantics, expressibility, complexity
• The computational complexity of propositional STRIPS planning
• The finite model property for various fragments of linear logic
• Weak, strong, and strong cyclic planning via symbolic model checking

Cited in

(12)

• On linear logic planning and concurrency
• Linearity and plan generation
• Using many-sorted logic in the object-oriented data model for fast robot task planning
• Permissive planning: Extending classical planning to uncertain task domains.
• Generating plans in linear logic. I: Actions as proofs
• The classical AI planning problems in the mirror of Horn linear logic: semantics, expressibility, complexity
• scientific article; zbMATH DE number 1912050 (Why is no real title available?)
• Fast strong planning for fully observable nondeterministic planning problems
• Computer Science Logic
• Linear logic as a tool for planning under temporal uncertainty
• A new representation and associated algorithms for generalized planning
• Theoretical computer science: computability, decidability and logic

This page was built for publication: Strong planning under uncertainty in domains with numerous but identical elements (a generic approach)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2373707)