Knowledge-based programs as plans. The complexity of plan verification
From MaRDI portal
Recommendations
- Knowledge-based programs as succinct policies for partially observable domains
- From knowledge-based programs to graded belief-based programs. I: On-line reasoning
- Verified synthesis of knowledge-based programs in finite synchronous environments
- A logic programming approach to knowledge-state planning, semantics and complexity
- Planning using dynamic epistemic logic: correspondence and complexity
Cited in
(12)- Knowledge-based proof planning
- Knowledge-based programs as succinct policies for partially observable domains
- Planning-based knowing how: a unified approach
- Knowledge-based programs as building blocks for planning
- Reactive policies with planning for action languages
- Verified synthesis of knowledge-based programs in finite synchronous environments
- A dynamic epistemic framework for conformant planning
- A note on knowledge-based programs and specifications
- Excursions in first-order logic and probability: infinitely many random variables, continuous distributions, recursive programs and beyond
- Knowing how to plan
- Knowing how to plan about planning: higher-order and meta-level epistemic planning
- From knowledge-based programs to graded belief-based programs. I: On-line reasoning
This page was built for publication: Knowledge-based programs as plans. The complexity of plan verification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3455569)