Planning with partial observability by SAT

DOI10.1007/978-3-031-43619-2_41MaRDI QIDQ6545568zbMATH OpenFDO

Authors Saurabh Fadnis, Jussi Rintanen

Publication date 29 May 2024

Full work available at URL https://doi.org/10.1007/978-3-031-43619-2_41

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Recommendations

• Strong planning under partial observability
• SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
• Planning and acting in partially observable stochastic domains
• Contingent planning under uncertainty via stochastic satisfiability
• Conformant plans and beyond: principles and complexity

Cites work

• A generic approach to planning in the presence of incomplete information: theory and implementation
• Computational complexity of planning and approximate planning in the presence of incompleteness
• Contingent planning under uncertainty via stochastic satisfiability
• scientific article; zbMATH DE number 1305704 (Why is no real title available?)
• scientific article; zbMATH DE number 1931653 (Why is no real title available?)
• Towards an Optimal CNF Encoding of Boolean Cardinality Constraints

This page was built for publication: Planning with partial observability by SAT

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