Knowledge-based programs as succinct policies for partially observable domains
DOI10.1016/J.ARTINT.2020.103365zbMATH Open1504.68214OpenAlexW3049453035WikidataQ113442973 ScholiaQ113442973MaRDI QIDQ2046009FDOQ2046009
Authors: Bruno Zanuttini, Jérôme Lang, Abdallah Saffidine, François Schwarzentruber 
Publication date: 16 August 2021
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2020.103365
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
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Knowledge representation (68T30) Logic in artificial intelligence (68T27)
Cites Work
- Strong planning under partial observability
- Optimal control of Markov processes with incomplete state information
- The Optimal Control of Partially Observable Markov Processes over a Finite Horizon
- Replanning in domains with partial information and sensing actions
- Planning and acting in partially observable stochastic domains
- Epistemic planning for single- and multi-agent systems
- Reducibility among combinatorial problems
- On truth-table reducibility to SAT
- Title not available (Why is that?)
- Relationships between nondeterministic and deterministic tape complexities
- Title not available (Why is that?)
- Bounded situation calculus action theories
- Progression and verification of situation calculus agents with bounded beliefs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Weak, strong, and strong cyclic planning via symbolic model checking
- Bounded Query Classes
- Robot location estimation in the situation calculus
- The strong exponential hierarchy collapses
- A Concise Introduction to Models and Methods for Automated Planning
- Belief tracking for planning with sensing: width, complexity and approximations
- Online belief tracking using regression for contingent planning
- Anytime point-based approximations for large POMDPS
- DEL-sequents for regression and epistemic planning
- Algorithms and limits for compact plan representations
- State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
- Formalizing sensing actions -- a transition function based approach
- From knowledge-based programs to graded belief-based programs. I: On-line reasoning
- Minesweeper may not be NP-complete but is hard nonetheless
- Compiling uncertainty away in non-deterministic conformant planning
- A generic approach to planning in the presence of incomplete information: theory and implementation
- Title not available (Why is that?)
- On the knowledge requirements of tasks
- DEL planning and some tractable cases
- Conditional epistemic planning
- Knowledge-based programs as plans. The complexity of plan verification
- The dynamic logic of policies and contingent planning
- Automaton plans
- More for free: a dynamic epistemic framework for conformant planning over transition systems
- Knowledge-based programs with defaults in a modal situation calculus
Cited In (6)
- Knowledge-based strategies for multi-agent teams playing against nature
- Knowing how to plan
- Epistemic planning: perspectives on the special issue
- From knowledge-based programs to graded belief-based programs. I: On-line reasoning
- Knowing how to plan about planning: higher-order and meta-level epistemic planning
- Knowledge-based programs as plans. The complexity of plan verification
Uses Software
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)
