English
Related papers

Related papers: Possibility and Necessity Functions over Non-class…

200 papers

This paper addresses fundamental issues on the nature of the concepts and structures of fuzzy logic, focusing, in particular, on the conceptual and functional differences that exist between probabilistic and possibilistic approaches. A…

Artificial Intelligence · Computer Science 2013-04-05 Enrique H. Ruspini

To operate intelligently in the world, an agent must reason about its actions. The consequences of an action are a function of both the state of the world and the action itself. Many aspects of the world are inherently stochastic, so a…

Artificial Intelligence · Computer Science 2013-04-05 Peter Haddawy

This article aims to achieve two goals: to show that probability is not the only way of dealing with uncertainty (and even more, that there are kinds of uncertainty which are for principled reasons not addressable with probabilistic means);…

Artificial Intelligence · Computer Science 2017-03-02 Tarek R. Besold , Artur d'Avila Garcez , Keith Stenning , Leendert van der Torre , Michiel van Lambalgen

This paper relates comparative belief structures and a general view of belief management in the setting of deductively closed logical representations of accepted beliefs. We show that the range of compatibility between the classical…

Artificial Intelligence · Computer Science 2013-02-01 Didier Dubois , Helene Fargier , Henri Prade

I review the classical theory of likelihood based inference and consider how it is being extended and developed for use in complex models and sampling schemes.

Statistics Theory · Mathematics 2013-10-01 Nancy Reid

Defeasible reasoning is a simple but efficient approach to nonmonotonic reasoning that has recently attracted considerable interest and that has found various applications. Defeasible logic and its variants are an important family of…

Logic in Computer Science · Computer Science 2012-06-26 Grigoris Antoniou , David Billington , Guido Governatori , Michael J. Maher

The primary theme of this investigation is a decision theoretic account of conditional ought statements (e.g., "You ought to do A, if C") that rectifies glaring deficiencies in classical deontic logic. The resulting account forms a sound…

Artificial Intelligence · Computer Science 2013-03-08 Judea Pearl

A new syntactic characterization of problems complete via Turing reductions is presented. General canonical forms are developed in order to define such problems. One of these forms allows us to define complete problems on ordered…

Computational Complexity · Computer Science 2014-11-25 Vladimir Naidenko

Algorithms of inference in a computer system oriented to input and semantic processing of text information are presented. Such inference is necessary for logical questions when the direct comparison of objects from a question and database…

Computation and Language · Computer Science 2012-02-02 Yuriy Ostapov

Classical Decision Theory provides a normative framework for representing and reasoning about complex preferences. Straightforward application of this theory to automate decision making is difficult due to high elicitation cost. In response…

Artificial Intelligence · Computer Science 2013-01-30 Vu A. Ha , Peter Haddawy

In this paper, we do three kinds of work. First, we recognize four notions of necessity and two notions of possibility related to time flow, namely strong/weak historical/temporal necessities, as well as historical/temporal possibilities,…

Computation and Language · Computer Science 2025-11-18 Fengkui Ju , Woxuan Zhou

The classical propositional logic is known to be sound and complete with respect to the set semantics that interprets connectives as set operations. The paper extends propositional language by a new binary modality that corresponds to…

Logic in Computer Science · Computer Science 2007-05-23 Pavel Naumov

The object of this lecture is to propose a series of conjectures and problems in different fields of analysis. They have been formulated with the aim of introducing some innovative methods in the study of classical topics, as open mappings,…

Functional Analysis · Mathematics 2007-05-23 Biagio Ricceri

In this paper a conditional logic is defined and studied. This conditional logic, Deterministic Bayesian Logic, is constructed as a deterministic counterpart to the (probabilistic) Bayesian conditional. The logic is unrestricted, so that…

Logic in Computer Science · Computer Science 2011-11-09 Frederic Dambreville

We introduce a two-sort weighted modal logic for possibilistic reasoning with fuzzy formal contexts. The syntax of the logic includes two types of weighted modal operators corresponding to classical necessity ($\Box$) and sufficiency…

Logic in Computer Science · Computer Science 2026-01-01 Prosenjit Howlader , Churn-Jung Liau

We introduce a logic for reasoning about evidence, that essentially views evidence as a function from prior beliefs (before making an observation) to posterior beliefs (after making the observation). We provide a sound and complete…

Artificial Intelligence · Computer Science 2014-07-29 Joseph Y. Halpern , Riccardo Pucella

Logic programming is a flexible programming paradigm due to the use of predicates without a fixed data flow. To extend logic languages with the compact notation of functional programming, there are various proposals to map evaluable…

Programming Languages · Computer Science 2022-05-17 Michael Hanus

The introduction of explicit notions of rejection, or disbelief, into logics for knowledge representation can be justified in a number of ways. Motivations range from the need for versions of negation weaker than classical negation, to the…

Artificial Intelligence · Computer Science 2007-05-23 Samir Chopra , Johannes Heidema , Thomas Meyer

Contextuality and nonlocality are non-classical properties exhibited by quantum statistics whose implications profoundly impact both foundations and applications of quantum theory. In this paper we provide some insights into logical…

Quantum Physics · Physics 2021-08-11 Leonardo Santos , Barbara Amaral

We present a propositional logic to reason about the uncertainty of events, where the uncertainty is modeled by a set of probability measures assigning an interval of probability to each event. We give a sound and complete axiomatization…

Artificial Intelligence · Computer Science 2014-08-08 Joseph Y. Halpern , Riccardo Pucella
‹ Prev 1 4 5 6 7 8 10 Next ›