Knowledge-based programs as succinct policies for partially observable domains
From MaRDI portal
Publication:2046009
DOI10.1016/j.artint.2020.103365zbMath1504.68214OpenAlexW3049453035WikidataQ113442973 ScholiaQ113442973MaRDI QIDQ2046009
Abdallah Saffidine, François Schwarzentruber, Bruno Zanuttini, Jérôme Lang
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
Logic in artificial intelligence (68T27) Knowledge representation (68T30) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (2)
Knowledge-based strategies for multi-agent teams playing against nature ⋮ Epistemic planning: perspectives on the special issue
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Planning and acting in partially observable stochastic domains
- Bounded situation calculus action theories
- Progression and verification of situation calculus agents with bounded beliefs
- Online belief tracking using regression for contingent planning
- State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
- The strong exponential hierarchy collapses
- Minesweeper may not be NP-complete but is hard nonetheless
- From knowledge-based programs to graded belief-based programs. I: On-line reasoning
- Weak, strong, and strong cyclic planning via symbolic model checking
- A generic approach to planning in the presence of incomplete information: theory and implementation
- Robot location estimation in the situation calculus
- On the knowledge requirements of tasks
- On truth-table reducibility to SAT
- The dynamic logic of policies and contingent planning
- Strong planning under partial observability
- Optimal control of Markov processes with incomplete state information
- Relationships between nondeterministic and deterministic tape complexities
- A Concise Introduction to Models and Methods for Automated Planning
- Belief Tracking for Planning with Sensing: Width, Complexity and Approximations
- Epistemic planning for single- and multi-agent systems
- Algorithms and Limits for Compact Plan Representations
- Conditional Epistemic Planning
- Automaton Plans
- DEL Planning and Some Tractable Cases
- Bounded Query Classes
- The Optimal Control of Partially Observable Markov Processes over a Finite Horizon
- More for free: a dynamic epistemic framework for conformant planning over transition systems*
- Knowledge-based programs with defaults in a modal situation calculus
- DEL-sequents for regression and epistemic planning
- Replanning in Domains with Partial Information and Sensing Actions
- Reducibility among Combinatorial Problems
- Formalizing sensing actions -- a transition function based approach
This page was built for publication: Knowledge-based programs as succinct policies for partially observable domains
