Knowledge-based programs as succinct policies for partially observable domains
From MaRDI portal
Publication:2046009
Recommendations
- Knowledge-based programs as plans. The complexity of plan verification
- From knowledge-based programs to graded belief-based programs. I: On-line reasoning
- Verified synthesis of knowledge-based programs in finite synchronous environments
- On knowledge-based programming with sensing in the situation calculus
- Knowledge-based programs
Cites work
- scientific article; zbMATH DE number 1946853 (Why is no real title available?)
- scientific article; zbMATH DE number 1467489 (Why is no real title available?)
- scientific article; zbMATH DE number 1820675 (Why is no real title available?)
- scientific article; zbMATH DE number 795590 (Why is no real title available?)
- scientific article; zbMATH DE number 2201583 (Why is no real title available?)
- A Concise Introduction to Models and Methods for Automated Planning
- A generic approach to planning in the presence of incomplete information: theory and implementation
- Algorithms and limits for compact plan representations
- Anytime point-based approximations for large POMDPS
- Automaton plans
- Belief tracking for planning with sensing: width, complexity and approximations
- Bounded Query Classes
- Bounded situation calculus action theories
- Compiling uncertainty away in non-deterministic conformant planning
- Conditional epistemic planning
- DEL planning and some tractable cases
- DEL-sequents for regression and epistemic planning
- Epistemic planning for single- and multi-agent systems
- Formalizing sensing actions -- a transition function based approach
- From knowledge-based programs to graded belief-based programs. I: On-line reasoning
- Knowledge-based programs as plans. The complexity of plan verification
- Knowledge-based programs with defaults in a modal situation calculus
- Minesweeper may not be NP-complete but is hard nonetheless
- More for free: a dynamic epistemic framework for conformant planning over transition systems
- On the knowledge requirements of tasks
- On truth-table reducibility to SAT
- Online belief tracking using regression for contingent planning
- Optimal control of Markov processes with incomplete state information
- Planning and acting in partially observable stochastic domains
- Progression and verification of situation calculus agents with bounded beliefs
- Reducibility among combinatorial problems
- Relationships between nondeterministic and deterministic tape complexities
- Replanning in domains with partial information and sensing actions
- Robot location estimation in the situation calculus
- State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
- Strong planning under partial observability
- The Optimal Control of Partially Observable Markov Processes over a Finite Horizon
- The dynamic logic of policies and contingent planning
- The strong exponential hierarchy collapses
- Weak, strong, and strong cyclic planning via symbolic model checking
Cited in
(6)- Knowledge-based strategies for multi-agent teams playing against nature
- Knowing how to plan
- From knowledge-based programs to graded belief-based programs. I: On-line reasoning
- Epistemic planning: perspectives on the special issue
- Knowing how to plan about planning: higher-order and meta-level epistemic planning
- Knowledge-based programs as plans. The complexity of plan verification
This page was built for publication: Knowledge-based programs as succinct policies for partially observable domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2046009)
