English
Related papers

Related papers: Compositional Belief Update

200 papers

In this paper we introduce a framework for option model composition. Option models are temporal abstractions that, like macro-operators in classical planning, jump directly from a start state to an end state. Prior work has focused on…

Artificial Intelligence · Computer Science 2012-07-03 David Silver , Kamil Ciosek

The standard operational semantics of the sequential composition operator gives rise to unbounded branching and forgetfulness when transparent process expressions are put in sequence. Due to transparency, the correspondence between…

Logic in Computer Science · Computer Science 2017-06-27 Jos Baeten , Bas Luttik , Fei Yang

Mechanistic interpretability aims to reverse engineer neural networks by uncovering which high-level algorithms they implement. Causal abstraction provides a precise notion of when a network implements an algorithm, i.e., a causal model of…

Machine Learning · Computer Science 2025-03-17 Theodora-Mara Pîslar , Sara Magliacane , Atticus Geiger

The standard operational semantics of the sequential composition operator gives rise to unbounded branching and forgetfulness when transparent process expressions are put in sequence. Due to transparency, the correspondence between…

Logic in Computer Science · Computer Science 2017-09-11 Jos Baeten , Bas Luttik , Fei Yang

Humans are remarkably flexible when understanding new sentences that include combinations of concepts they have never encountered before. Recent work has shown that while deep networks can mimic some human language abilities when presented…

Computation and Language · Computer Science 2021-10-20 Yen-Ling Kuo , Boris Katz , Andrei Barbu

Natural revision seems so natural: it changes beliefs as little as possible to incorporate new information. Yet, some counterexamples show it wrong. It is so conservative that it never fully believes. It only believes in the current…

Artificial Intelligence · Computer Science 2025-05-27 Paolo Liberatore

The stability rule for belief, advocated by Leitgeb [Annals of Pure and Applied Logic 164, 2013], is a rule for rational acceptance that captures categorical belief in terms of $\textit{probabilistically stable propositions}$: propositions…

Logic in Computer Science · Computer Science 2025-09-03 Krzysztof Mierzewski

This paper develops an algorithmic-based approach for proving inductive properties of propositional sequent systems such as admissibility, invertibility, cut-elimination, and identity expansion. Although undecidable in general, these…

Logic in Computer Science · Computer Science 2021-01-11 Carlos Olarte , Elaine Pimentel , Camilo Rocha

Theory refinement is the task of updating a domain theory in the light of new cases, to be done automatically or with some expert assistance. The problem of theory refinement under uncertainty is reviewed here in the context of Bayesian…

Artificial Intelligence · Computer Science 2013-03-26 Wray L. Buntine

The study of belief change has been an active area in philosophy and AI. In recent years two special cases of belief change, belief revision and belief update, have been studied in detail. Roughly, revision treats a surprising observation…

Artificial Intelligence · Computer Science 2013-02-18 Nir Friedman , Joseph Y. Halpern

In the context-dependent Text-to-SQL task, the generated SQL statements are refined iteratively based on the user input utterance from each interaction. The input text from each interaction can be viewed as component modifications to the…

Computation and Language · Computer Science 2023-08-15 Aiwei Liu , Wei Liu , Xuming Hu , Shuang Li , Fukun Ma , Yawen Yang , Lijie Wen

Most merging operators are defined by semantics methods which have very high computational complexity. In order to have operators with a lower computational complexity, some merging operators defined in a syntactical way have be proposed.…

Artificial Intelligence · Computer Science 2012-07-23 José Luis Chacón , Ramón Pino Pérez

We present a semantics for adding uncertainty to conditional logics for default reasoning and belief revision. We are able to treat conditional sentences as statements of conditional probability, and express rules for revision such as "If A…

Artificial Intelligence · Computer Science 2013-03-08 Craig Boutilier

Human beliefs change, but so do the concepts that underpin them. The recent Abduction, Belief Revision and Conceptual Change (ABC) repair system combines several methods from automated theory repair to expand, contract, or reform logical…

Computation and Language · Computer Science 2022-01-21 Xue Li , Alan Bundy , Eugene Philalithis

Compositionality is a key aspect of human intelligence, essential for reasoning and generalization. While transformer-based models have become the de facto standard for many language modeling tasks, little is known about how they represent…

Computation and Language · Computer Science 2025-06-03 Aishik Nagar , Ishaan Singh Rawal , Mansi Dhanania , Cheston Tan

Many variability management techniques rely on sophisticated language extension or tools to support it. While this can provide dedicated syntax and operational mechanism but it struggling practical adaptation for the cost of adapting new…

Programming Languages · Computer Science 2021-09-15 Hiun Kim

Over the years, nonmonotonic rules have proven to be a very expressive and useful knowledge representation paradigm. They have recently been used to complement the expressive power of Description Logics (DLs), leading to the study of…

Artificial Intelligence · Computer Science 2011-07-27 Martin Slota , João Leite , Terrance Swift

Recently, belief change within the framework of fragments of propositional logic has gained increasing attention. Previous works focused on belief contraction and belief revision on the Horn fragment. However, the problem of belief merging…

Artificial Intelligence · Computer Science 2014-04-28 Nadia Creignou , Odile Papini , Stefan Rümmele , Stefan Woltran

In this contribution we present arbitrary arrow update model logic (AAUML). This is a dynamic epistemic logic or update logic. In update logics, static/basic modalities are interpreted on a given relational model whereas dynamic/update…

Logic in Computer Science · Computer Science 2021-11-30 Hans van Ditmarsch , Wiebe van der Hoek , Barteld Kooi , Louwe B. Kuijer

Assurance arguments provide a clear and structured way to explain why stakeholders should trust that a system satisfies certain properties, yet widely used notations, e.g.Goal Structuring Notation (GSN), typically lack an operational…

Artificial Intelligence · Computer Science 2026-05-22 Benjamin Herd , Jessica Kelly , Jan Sabsch , Lydia Gauerhof