English
Related papers

Related papers: Nonmonotonic Inferences with Qualitative Condition…

200 papers

CP-nets represent the dominant existing framework for expressing qualitative conditional preferences between alternatives, and are used in a variety of areas including constraint solving. Over the last fifteen years, a significant…

Artificial Intelligence · Computer Science 2015-04-27 Cristina Cornelio , Andrea Loreggia , Vijay Saraswat

A natural way to represent beliefs and the process of updating beliefs is presented by Bayesian probability theory, where belief of an agent a in P can be interpreted as a considering that P is more probable than not P. This paper attempts…

Logic in Computer Science · Computer Science 2017-07-28 Jan van Eijck , Kai Li

The paper introduces a basic logic of knowledge and abduction by extending Levesque logic of only-knowing with an abduction modal operator defined via the combination of basic epistemic concepts. The upshot is an alternative approach to…

Artificial Intelligence · Computer Science 2026-01-09 Sanderson Molick , Vaishak Belle

In this work we generalize standard Decision Theory by assuming that two outcomes can also be incomparable. Two motivating scenarios show how incomparability may be helpful to represent those situations where, due to lack of information,…

Computer Science and Game Theory · Computer Science 2014-04-04 Piero A. Bonatti , Marco Faella , Luigi Sauro

An automated explanation facility for Bayesian conditioning aimed at improving user acceptance of probability-based decision support systems has been developed. The domain-independent facility is based on an information processing…

Artificial Intelligence · Computer Science 2013-04-11 Christopher Elsaesser

Understanding and quantifying causal relationships between variables is essential for reasoning about the physical world. In this work, we develop a resource-theoretic framework to do so. Here, we focus on the simplest nontrivial setting --…

After surveying classical results, we introduce a generalized notion of inference system to support structural recursion on non-well-founded data types. Besides axioms and inference rules with the usual meaning, a generalized inference…

Logic in Computer Science · Computer Science 2018-04-23 Francesco Dagnino

In this paper we discuss the consistency concept of Williams coherence for imprecise conditional previsions, presenting a variant of this notion, which we call W-coherence. It is shown that W-coherence ensures important consistency…

Probability · Mathematics 2015-03-10 Renato Pelessoni , Paolo Vicig

We present a novel approach to constraint-based causal discovery, that takes the form of straightforward logical inference, applied to a list of simple, logical statements about causal relations that are derived directly from observed…

Artificial Intelligence · Computer Science 2012-02-20 Tom Claassen , Tom Heskes

Ranked decision systems -- recommenders, ad auctions, clinical triage queues -- must decide when to intervene in ranked outputs and when to abstain. We study when confidence-based abstention monotonically improves decision quality, and when…

Artificial Intelligence · Computer Science 2026-03-11 Ronald Doku

Reynolds' parametricity originally equips types with proof-irrelevant binary propositional relations over the types. But such relations can also be taken proof-relevant or unary, and described either in an indexed or fibred way.…

Logic in Computer Science · Computer Science 2026-02-16 Hugo Herbelin , Ramkumar Ramachandra

We show that moment inequalities in a wide variety of economic applications have a particular linear conditional structure. We use this structure to construct uniformly valid confidence sets that remain computationally tractable even in…

Econometrics · Economics 2022-12-20 Isaiah Andrews , Jonathan Roth , Ariel Pakes

Many frameworks exist to infer cause and effect relations in complex nonlinear systems but a complete theory is lacking. A new framework is presented that is fully nonlinear, provides a complete information theoretic disentanglement of…

Methodology · Statistics 2022-01-12 Peter Jan van Leeuwen , Michael DeCaria , Nachiketa Chakaborty , Manuel Pulido

Probability theory, epistemically interpreted, provides an excellent, if not the best available account of inductive reasoning. This is so because there are general and definite rules for the change of subjective probabilities through…

Artificial Intelligence · Computer Science 2013-04-10 Wolfgang Spohn

The thermodynamic definition of entropy can be extended to nonequilibrium systems based on its relation to information. To apply this definition in practice requires access to the physical system's microstates, which may be prohibitively…

Statistical Mechanics · Physics 2020-08-21 Gil Ariel , Haim Diamant

We consider concurrent systems consisting of a finite but unknown number of components, that are replicated instances of a given set of finite state automata. The components communicate by executing interactions which are simultaneous…

Formal Languages and Automata Theory · Computer Science 2019-02-08 Marius Bozga , Radu Iosif , Joseph Sifakis

The infrastructure upon which the functioning of society depends is composed of complex ecosystems of systems. Consequently, we must reason about the properties of such ecosystems, which requires that we construct models of them. There are…

Logic in Computer Science · Computer Science 2024-11-15 Didier Galmiche , Timo Lang , David Pym

Recommender systems have become crucial in information filtering nowadays. Existing recommender systems extract user preferences based on the correlation in data, such as behavioral correlation in collaborative filtering, feature-feature,…

Information Retrieval · Computer Science 2023-12-18 Chen Gao , Yu Zheng , Wenjie Wang , Fuli Feng , Xiangnan He , Yong Li

System Z+ [Goldszmidt and Pearl, 1991, Goldszmidt, 1992] is a formalism for reasoning with normality defaults of the form "typically if phi then + (with strength cf)" where 6 is a positive integer. The system has a critical shortcoming in…

Artificial Intelligence · Computer Science 2013-02-28 Sek-Wah Tan

One of the goals of probabilistic inference is to decide whether an empirically observed distribution is compatible with a candidate Bayesian network. However, Bayesian networks with hidden variables give rise to highly non-trivial…

Machine Learning · Statistics 2014-10-14 R. Chaves , L. Luft , T. O. Maciel , D. Gross , D. Janzing , B. Schölkopf