English
Related papers

Related papers: Dependence in Propositional Logic: Formula-Formula…

200 papers

In this paper we explore a class of belief update operators, in which the definition of the operator is compositional with respect to the sentence to be added. The goal is to provide an update operator that is intuitive, in that its…

Artificial Intelligence · Computer Science 2014-01-16 James Delgrande , Yi Jin , Francis Jeffry Pelletier

This paper presents a novel approach based on variable forgetting, which is a useful tool in resolving contradictory by filtering some given variables, to merging multiple knowledge bases. This paper first builds a relationship between…

Artificial Intelligence · Computer Science 2013-01-11 Dai Xu , Xiaowang Zhang , Zuoquan Lin

The notion of argumentation and the one of belief stand in a problematic relation to one another. On the one hand, argumentation is crucial for belief formation: as the outcome of a process of arguing, an agent might come to (justifiably)…

Logic in Computer Science · Computer Science 2021-06-23 Alfredo Burrieza , Antonio Yuste-Ginel

In this paper, we study logics of dependence on the propositional level. We prove that several interesting propositional logics of dependence, including propositional dependence logic, propositional intuitionistic dependence logic as well…

Logic · Mathematics 2018-12-19 Fan Yang , Jouko Väänänen

This paper deals with belief base revision that is a form of belief change consisting of the incorporation of new facts into an agent's beliefs represented by a finite set of propositional formulas. In the aim to guarantee more reliability…

Artificial Intelligence · Computer Science 2020-09-25 Raïda Ktari , Mohamed Ayman Boujelben

Mechanistic interpretability is the program of explaining what AI systems are doing in terms of their internal mechanisms. I analyze some aspects of the program, along with setting out some concrete challenges and assessing progress to…

Artificial Intelligence · Computer Science 2025-01-28 David J. Chalmers

In this paper we present a transformation of finite propositional default theories into so-called propositional argumentation systems. This transformation allows to characterize all notions of Reiter's default logic in the framework of…

Artificial Intelligence · Computer Science 2007-05-23 Dritan Berzati , Bernhard Anrig , Juerg Kohlas

We modify a canonical experimental design to identify the effectiveness of retractions. Comparing beliefs after retractions to beliefs (a) without the retracted information and (b) after equivalent new information, we find that retractions…

General Economics · Economics 2025-03-03 Duarte Gonçalves , Jonathan Libgober , Jack Willis

Within classical propositional logic, assigning probabilities to formulas is shown to be equivalent to assigning probabilities to valuations. A novel notion of probabilistic entailment enjoying desirable properties of logical consequence is…

Logic · Mathematics 2016-01-13 Joao Rasga , Cristina Sernadas , Amilcar Sernadas

An ordinal view of independence is studied in the framework of possibility theory. We investigate three possible definitions of dependence, of increasing strength. One of them is the counterpart to the multiplication law in probability…

Artificial Intelligence · Computer Science 2013-02-28 Didier Dubois , Luis Farinas del Cerro , Andreas Herzig , Henri Prade

Functional dependencies restrict the potential interactions among variables connected in a probabilistic network. This restriction can be exploited in qualitative probabilistic reasoning by introducing deterministic variables and modifying…

Artificial Intelligence · Computer Science 2013-04-05 Michael P. Wellman

This paper uses possible-world semantics to model the changes that may occur in an agent's knowledge as she loses information. This builds on previous work in which the agent may forget the truth-value of an atomic proposition, to a more…

While a large body of work has scrutinized the meaning of conditional sentences, considerably less attention has been paid to formal models of their pragmatic use and interpretation. Here, we take a probabilistic approach to pragmatic…

Computation and Language · Computer Science 2022-10-14 Britta Grusdt , Daniel Lassiter , Michael Franke

People supported by AI-powered decision support tools frequently overrely on the AI: they accept an AI's suggestion even when that suggestion is wrong. Adding explanations to the AI decisions does not appear to reduce the overreliance and…

Human-Computer Interaction · Computer Science 2021-02-22 Zana Buçinca , Maja Barbara Malaya , Krzysztof Z. Gajos

Axiomatization has been widely used for testing logical implications. This paper suggests a non-axiomatic method, the chase, to test if a new dependency follows from a given set of probabilistic dependencies. Although the chase computation…

Artificial Intelligence · Computer Science 2013-02-18 Michael S. K. M. Wong

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

In this paper, we investigate knowledge reasoning within a simple framework called knowledge structure. We use variable forgetting as a basic operation for one agent to reason about its own or other agents\ knowledge. In our framework, two…

Logic in Computer Science · Computer Science 2014-01-16 Kaile Su , Abdul Sattar , Guanfeng Lv , Yan Zhang

Forgetting as a knowledge management operation deliberately ignores parts of the knowledge and beliefs of an agent, for various reasons. Forgetting has many facets, one may want to forget parts of the syntax, a proposition, or a…

Artificial Intelligence · Computer Science 2025-09-01 Christoph Beierle , Alexander Hahn , Diana Howey , Gabriele Kern-Isberner , Kai Sauerwald

When submitting queries to information retrieval (IR) systems, users often have the option of specifying which, if any, of the query terms are heavily dependent on each other and should be treated as a fixed phrase, for instance by placing…

Information Retrieval · Computer Science 2018-03-07 Christina Lioma , Birger Larsen , Peter Ingwersen

Most approaches for repairing description logic (DL) ontologies aim at changing the axioms as little as possible while solving inconsistencies, incoherences and other types of undesired behaviours. As in Belief Change, these issues are…

Logic in Computer Science · Computer Science 2022-02-22 Jandson S. Ribeiro , Ricardo Guimarães , Ana Ozaki