中文
相关论文

相关论文: Nonmonotonic Probabilistic Logics between Model-Th…

200 篇论文

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…

人工智能 · 计算机科学 2013-04-12 Benjamin N. Grosof

The decoherent (consistent) histories formalism has been proposed as a means of eliminating measurements as a fundamental concept in quantum mechanics. In this formalism, probabilities can be assigned to any description which satisfies a…

量子物理 · 物理学 2007-05-23 Todd A. Brun

Do LMs infer the semantics of text from co-occurrence patterns in their training data? Merrill et al. (2022) argue that, in theory, sentence co-occurrence probabilities predicted by an optimal LM should reflect the entailment relationship…

计算与语言 · 计算机科学 2024-07-18 William Merrill , Zhaofeng Wu , Norihito Naka , Yoon Kim , Tal Linzen

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…

人工智能 · 计算机科学 2016-08-31 Nir Friedman , Joseph Y. Halpern

This note is concerned with a formal analysis of the problem of non-monotonic reasoning in intelligent systems, especially when the uncertainty is taken into account in a quantitative way. A firm connection between logic and probability is…

人工智能 · 计算机科学 2013-04-05 Hung-Trung Nguyen

In this talk - based on the results of a forthcoming paper (Coletti, Scozzafava and Vantaggi 2002), presented also by one of us at the Conference on "Non Classical Logic, Approximate Reasoning and Soft-Computing" (Anacapri, Italy, 2001) -…

概率论 · 数学 2007-05-23 Giulianella Coletti , Romano Scozzafava , Barbara Vantaggi

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…

计算复杂性 · 计算机科学 2010-09-13 Michael Thomas , Heribert Vollmer

Tarski gave a general semantics for deductive reasoning: a formula a may be deduced from a set A of formulas iff a holds in all models in which each of the elements of A holds. A more liberal semantics has been considered: a formula a may…

人工智能 · 计算机科学 2007-05-23 Daniel Lehmann

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…

人工智能 · 计算机科学 2013-03-08 Craig Boutilier

The apparent failure of individual probabilistic expressions to distinguish uncertainty about truths from uncertainty about probabilistic assessments have prompted researchers to seek formalisms where the two types of uncertainties are…

人工智能 · 计算机科学 2013-04-11 Judea Pearl

Generalised Probabilistic Theories (GPTs) provide a unifying framework encompassing classical theories, quantum theories, as well as hypothetical alternatives. We investigate the problem of extending a system with a finite set of…

量子物理 · 物理学 2026-03-17 Serge Massar

In this article we demonstrate how algorithmic probability theory is applied to situations that involve uncertainty. When people are unsure of their model of reality, then the outcome they observe will cause them to update their beliefs. We…

人工智能 · 计算机科学 2014-05-26 Phil Maguire , Philippe Moser , Rebecca Maguire , Mark Keane

For the classical mind, quantum mechanics is boggling enough; nevertheless more bizarre behavior could be imagined, thereby concentrating on propositional structures (empirical logics) that transcend the quantum domain. One can also…

量子物理 · 物理学 2017-01-09 Karl Svozil

Many writers have observed that default logics appear to contain the "lottery paradox" of probability theory. This arises when a default "proof by contradiction" lets us conclude that a typical X is not a Y where Y is an unusual subclass of…

人工智能 · 计算机科学 2013-04-08 Eric Neufeld , J. D. Horton

In this paper we put forward a new solution of the well-known problem of relevant logics, i.e. we construct an atomic entailment. Hence, we construct a system of predicate calculus based on the atomic entailment. Next, we establish the…

逻辑 · 数学 2016-03-23 T. J. Stepien , L. T. Stepien

Based on an analysis of the inference rules used, we provide a characterization of the situations in which classical provability entails intuitionistic provability. We then examine the relationship of these derivability notions to uniform…

计算机科学中的逻辑 · 计算机科学 2016-08-31 Gopalan Nadathur

One advantage of paraconsistent logic is that it can deal with inconsistencies without making the system trivial. However, unlike classical propositional calculus, its deductive system is limited, and the meaning of paraconsistent negation…

逻辑 · 数学 2025-10-14 Oscar Ramírez

Classical probability theory supports probability measures, assigning a fixed positive real value to each event, these measures are far from satisfactory in formulating real-life occurrences. The main innovation of this paper is the…

概率论 · 数学 2009-02-09 Yehuda Izhakian , Zur Izhakian

Non-classical probability (along with its underlying logic) is a defining feature of quantum mechanics. A formulation that incorporates them, inherently and directly, would promise a unified description of seemingly different prescriptions…

量子物理 · 物理学 2019-05-21 Soumik Adhikary , Sooryansh Asthana , V. Ravishankar

A number of writers(Joseph Halpern and Fahiem Bacchus among them) have offered semantics for formal languages in which inferences concerning probabilities can be made. Our concern is different. This paper provides a formalization of…

人工智能 · 计算机科学 2013-03-25 Henry E. Kyburg