Knowledge-based programs as succinct policies for partially observable domains
type: Item
instance of: scholarly article
title: Knowledge-based programs as succinct policies for partially observable domains
zbMATH Open document ID: 1504.68214
author: Bruno Zanuttini
author: Jérôme Lang
author: Abdallah Saffidine
author: François Schwarzentruber
published in: Artificial Intelligence
publication date: 2021-08-16T00:00:00Z
Mathematics Subject Classification ID: 68T27
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68T30
zbMATH DE Number: 7382216
zbMATH Keywords: planning under uncertainty
zbMATH Keywords: contingent planning
zbMATH Keywords: epistemic logic
zbMATH Keywords: knowledge-based programs
zbMATH Keywords: belief tracking
describes a project that uses: Hintikka's world
MaRDI profile type: Publication
full work available at URL: j.artint.2020.103365
OpenAlex ID: W3049453035
Wikidata QID: Q113442973
cites work: Q2999178
cites work: Conditional Epistemic Planning
cites work: Optimal control of Markov processes with incomplete state information
cites work: DEL-sequents for regression and epistemic planning
cites work: Algorithms and limits for compact plan representations
cites work: Automaton plans
cites work: Robot location estimation in the situation calculus
cites work: Strong planning under partial observability
cites work: Epistemic planning for single- and multi-agent systems
cites work: The dynamic logic of policies and contingent planning
cites work: Belief tracking for planning with sensing: width, complexity and approximations
cites work: Replanning in Domains with Partial Information and Sensing Actions
cites work: Online belief tracking using regression for contingent planning
cites work: On the knowledge requirements of tasks
cites work: State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
cites work: On truth-table reducibility to SAT
cites work: Weak, strong, and strong cyclic planning via symbolic model checking
cites work: Knowledge-based programs with defaults in a modal situation calculus
cites work: Q4411139
cites work: Bounded situation calculus action theories
cites work: Progression and verification of situation calculus agents with bounded beliefs
cites work: Q4845472
cites work: A Concise Introduction to Models and Methods for Automated Planning
cites work: Q5313998
cites work: The strong exponential hierarchy collapses
cites work: Planning and acting in partially observable stochastic domains
cites work: Reducibility among Combinatorial Problems
cites work: Q3455569
cites work: From knowledge-based programs to graded belief-based programs. I: On-line reasoning
cites work: More for free: a dynamic epistemic framework for conformant planning over transition systems*
cites work: DEL Planning and Some Tractable Cases
cites work: Q4488091
cites work: Q3624036
cites work: Q4779807
cites work: Relationships between nondeterministic and deterministic tape complexities
cites work: Minesweeper may not be NP-complete but is hard nonetheless
cites work: The Optimal Control of Partially Observable Markov Processes over a Finite Horizon
cites work: Formalizing sensing actions -- a transition function based approach
cites work: A generic approach to planning in the presence of incomplete information: theory and implementation
cites work: Bounded Query Classes
DOI: 10.1016/J.ARTINT.2020.103365
description: scientific article; zbMATH DE number 7382216