English
Related papers

Related papers: Conditioning on Disjunctive Knowledge: Defaults an…

200 papers

Considerable attention has been given to the problem of non-monotonic reasoning in a belief function framework. Earlier work (M. Ginsberg) proposed solutions introducing meta-rules which recognized conditional independencies in a…

Artificial Intelligence · Computer Science 2013-04-05 Mary McLeish

We introduce a new approach to modeling uncertainty based on plausibility measures. This approach is easily seen to generalize other approaches to modeling uncertainty, such as probability measures, belief functions, and possibility…

Artificial Intelligence · Computer Science 2016-08-31 Nir Friedman , Joseph Y. Halpern

Default logic was introduced by Reiter in 1980. In 1992, Gottlob classified the complexity of the extension existence problem for propositional default logic as $\SigmaPtwo$-complete, and the complexity of the credulous and skeptical…

Computational Complexity · Computer Science 2010-08-24 Olaf Beyersdorff , Arne Meier , Michael Thomas , Heribert Vollmer

Over the past few decades, non-monotonic reasoning has developed to be one of the most important topics in computational logic and artificial intelligence. Different ways to introduce non-monotonic aspects to classical logic have been…

Computational Complexity · Computer Science 2010-09-13 Michael Thomas , Heribert Vollmer

Simpson's paradox is an obstacle to establishing a probabilistic association between two events $a_1$ and $a_2$, given the third (lurking) random variable $B$. We focus on scenarios when the random variables $A$ (which combines $a_1$,…

Methodology · Statistics 2024-07-23 A. Hovhannisyan , A. E. Allahverdyan

Different notions of the consistency of obligations collapse in standard deontic logic. In justification logics, which feature explicit reasons for obligations, the situation is different. Their strength depends on a constant specification…

Logic in Computer Science · Computer Science 2023-10-09 Federico L. G. Faroldi , Meghdad Ghari , Eveline Lehmann , Thomas Studer

In many real-life settings, agents must navigate dynamic environments while reasoning under incomplete information and acting on a corpus of unstable, context-dependent, and often conflicting norms. We introduce a general, non-modal,…

Logic in Computer Science · Computer Science 2025-12-23 Mario Piazza , Andrea Sabatini

(l) I have enough evidence to render the sentence S probable. (la) So, relative to what I know, it is rational of me to believe S. (2) Now that I have more evidence, S may no longer be probable. (2a) So now, relative to what I know, it is…

Artificial Intelligence · Computer Science 2016-11-26 Henry E. Kyburg

We start by defining an approach to non-monotonic probabilistic reasoning in terms of non-monotonic categorical (true-false) reasoning. We identify a type of non-monotonic probabilistic reasoning, akin to default inheritance, that is…

Artificial Intelligence · Computer Science 2013-04-12 Benjamin N. Grosof

We propose an abductive diagnosis theory that integrates probabilistic, causal and taxonomic knowledge. Probabilistic knowledge allows us to select the most likely explanation; causal knowledge allows us to make reasonable independence…

Artificial Intelligence · Computer Science 2013-04-05 Dekang Lin , Randy Goebel

We argue that the notion of epistemic \emph{possible worlds} in constructivism (intuitionism) is not as the same as it is in classic view, and there are possibilities, called non-predetermined worlds, which are ignored in (classic)…

Logic in Computer Science · Computer Science 2013-02-06 Rasoul Ramezanian

It is well-known that Choice and Regularity are independent of each other but have important common consequences of logical character (reflection principles, representations of classes by sets, etc.). We explain this phenomenon by isolating…

Logic · Mathematics 2007-09-20 Denis I. Saveliev

Conceiving of premises as collected into sets or multisets, instead of sequences, may lead to triviality for classical and intuitionistic logic in general proof theory, where we investigate identity of deductions. Any two deductions with…

Logic · Mathematics 2016-06-10 Kosta Dosen

Parrondo's paradox arises in sequences of games in which a winning expectation may be obtained by playing the games in a random order, even though each game in the sequence may be lost when played individually. We present a suitable version…

Probability · Mathematics 2007-06-19 Antonio Di Crescenzo

Possibilistic logic, an extension of first-order logic, deals with uncertainty that can be estimated in terms of possibility and necessity measures. Syntactically, this means that a first-order formula is equipped with a possibility degree…

Artificial Intelligence · Computer Science 2013-02-28 Bernhard Hollunder

In this work we describe preferential Description Logics of typicality, a nonmonotonic extension of standard Description Logics by means of a typicality operator T allowing to extend a knowledge base with inclusions of the form T(C) v D,…

Artificial Intelligence · Computer Science 2020-04-24 Laura Giordano , Valentina Gliozzi , Antonio Lieto , Nicola Olivetti , Gian Luca Pozzato

This paper continues an established line of research about the relations between argumentation theory, particularly assumption-based argumentation, and different kinds of logic programs. In particular, we extend known result of Caminada,…

Artificial Intelligence · Computer Science 2025-07-09 Jesse Heyninck , Ofer Arieli

We extend the $ASPIC^+$ framework for structured argumentation so as to allow applications of the reasoning by cases inference scheme for defeasible arguments. Given an argument with conclusion `$A$ or $B$', an argument based on $A$ with…

Artificial Intelligence · Computer Science 2017-03-27 Mathieu Beirlaen , Jesse Heyninck , Christian Straßer

We seek to find normative criteria of adequacy for nonmonotonic logic similar to the criterion of validity for deductive logic. Rather than stipulating that the conclusion of an inference be true in all models in which the premises are…

Artificial Intelligence · Computer Science 2007-05-23 Henry E. Kyburg , Choh Man Teng

A fact apparently not observed earlier in the literature of nonmonotonic reasoning is that Reiter, in his default logic paper, did not directly formalize informal defaults. Instead, he translated a default into a certain natural language…

Artificial Intelligence · Computer Science 2011-08-17 Marc Denecker , Victor W. Marek , Miroslaw Truszczynski