English
Related papers

Related papers: From Coalgebraic Determinization to Belief Constru…

200 papers

We consider a partially observable Markov decision problem (POMDP) that models a class of sequencing problems. Although POMDPs are typically intractable, our formulation admits tractable solution. Instead of maintaining a value function…

Artificial Intelligence · Computer Science 2013-01-14 Paat Rusmevichientong , Benjamin van Roy

In the setting of constructive mathematics, we suggest and study a framework for decidability of properties, which allows for finer distinctions than just "decidable, semidecidable, or undecidable". We work in homotopy type theory and use…

Logic in Computer Science · Computer Science 2026-05-14 Tom de Jong , Nicolai Kraus , Aref Mohammadzadeh , Fredrik Nordvall Forsberg

We propose parametric constructive Kripke-semantics for multi-agent KD45-belief and S5-knowledge in terms of elementary set-theoretic constructions of two basic functional building blocks, namely bias (or viewpoint) and visibility,…

Logic in Computer Science · Computer Science 2012-09-11 Simon Kramer , Joshua Sack

We present a coalgebraic framework for studying generalisations of dynamic modal logics such as PDL and game logic in which both the propositions and the semantic structures can take values in an algebra $\mathbf{A}$ of truth-degrees. More…

Logic in Computer Science · Computer Science 2025-12-30 Helle Hvid Hansen , Wolfgang Poiger

This paper deals with control of partially observable discrete-time stochastic systems. It introduces and studies Markov Decision Processes with Incomplete Information and with semi-uniform Feller transition probabilities. The important…

Optimization and Control · Mathematics 2022-08-30 Eugene A. Feinberg , Pavlo O. Kasyanov , Michael Z. Zgurovsky

Partially observable Markov decision processes (POMDP) are a useful model for decision-making under partial observability and stochastic actions. Partially Observable Monte-Carlo Planning is an online algorithm for deciding on the next…

Artificial Intelligence · Computer Science 2023-10-05 Oded Blumenthal , Guy Shani

We introduce partially observable concurrent Kleene algebra (POCKA), an algebraic framework to reason about concurrent programs with control structures, such as conditionals and loops. POCKA enables reasoning about programs that can access…

Logic in Computer Science · Computer Science 2023-02-06 Jana Wagemaker , Paul Brunet , Simon Docherty , Tobias Kappé , Jurriaan Rot , Alexandra Silva

The words of a language reflect the structure of the human mind, allowing us to transmit thoughts between individuals. However, language can represent only a subset of our rich and detailed cognitive architecture. Here, we ask what kinds of…

Computation and Language · Computer Science 2018-03-07 Gabriel Grand , Idan Asher Blank , Francisco Pereira , Evelina Fedorenko

There currently exists a gap between the theories proposed by the probability and uncertainty and the needs of Artificial Intelligence research. These theories primarily address the needs of expert systems, using knowledge structures which…

Artificial Intelligence · Computer Science 2013-04-12 Brian Falkenhainer

Partially Observable Markov Decision Processes (POMDPs) offer a promising world representation for autonomous agents, as they can model both transitional and perceptual uncertainties. Calculating the optimal solution to POMDP problems can…

Artificial Intelligence · Computer Science 2022-10-25 Sigurdur Orn Adalgeirsson , Cynthia Breazeal

The AGM theory of belief revision has become an important paradigm for investigating rational belief changes. Unfortunately, researchers working in this paradigm have restricted much of their attention to rather simple representations of…

Artificial Intelligence · Computer Science 2013-01-30 Frans Voorbraak

We construct the belief function that quantifies the agent, beliefs about which event of Q will occurred when he knows that the event is selected by a chance set-up and that the probability function associated to the chance set up is only…

Artificial Intelligence · Computer Science 2013-02-28 Philippe Smets

While belief functions may be seen formally as a generalization of probabilistic distributions, the question of the interactions between belief functions and probability is still an issue in practice. This question is difficult, since the…

Logic in Computer Science · Computer Science 2011-10-03 Frederic Dambreville

Confidence is a fundamental concept in statistics, but there is a tendency to misinterpret it as probability. In this paper, I argue that an intuitively and mathematically more appropriate interpretation of confidence is through…

Statistics Theory · Mathematics 2017-07-04 Ryan Martin

Argumentation is the process of constructing arguments about propositions, and the assignment of statements of confidence to those propositions based on the nature and relative strength of their supporting arguments. The process is modelled…

Artificial Intelligence · Computer Science 2013-03-08 John Fox , Paul J. Krause , Morten Elvang-Gøransson

The synthesis problem for partially observable Markov decision processes (POMDPs) is to compute a policy that satisfies a given specification. Such policies have to take the full execution history of a POMDP into account, rendering the…

Artificial Intelligence · Computer Science 2020-07-20 Leonore Winterer , Ralf Wimmer , Nils Jansen , Bernd Becker

We present quantum observable Markov decision processes (QOMDPs), the quantum analogues of partially observable Markov decision processes (POMDPs). In a QOMDP, an agent's state is represented as a quantum state and the agent can choose a…

Artificial Intelligence · Computer Science 2015-06-19 Jennifer Barry , Daniel T. Barry , Scott Aaronson

We consider partially observable Markov decision processes (POMDPs) with {\omega}-regular conditions specified as parity objectives. The class of {\omega}-regular languages extends regular languages to infinite strings and provides a robust…

Logic in Computer Science · Computer Science 2013-09-12 Krishnendu Chatterjee , Martin Chmelik , Mathieu Tracol

Concept Bottleneck Models (CBMs) predict through human-interpretable concepts, but they typically output point concept probabilities that conflate epistemic uncertainty (reducible model underspecification) with aleatoric uncertainty…

Artificial Intelligence · Computer Science 2026-04-28 Tanmoy Mukherjee , Thomas Bailleux , Pierre Marquis , Zied Bouraoui

We investigate estimating a human's world belief state using a robot's observations in a dynamic, 3D, and partially observable environment. The methods are grounded in mental model theory, which posits that human decision making, contextual…

Robotics · Computer Science 2026-04-14 Jack Kolb , Aditya Garg , Nikolai Warner , Karen M. Feigh
‹ Prev 1 8 9 10 Next ›