English
Related papers

Related papers: Propositional Measure Logic

200 papers

The field of proof-theoretic semantics (P-tS) offers an alternative approach to meaning in logic that is based on inference and argument (rather than truth in a model). It has been successfully developed for various logics; in particular,…

Logic · Mathematics 2025-03-10 Alexander V. Gheorghiu , Yll Buzoku

This paper discusses the semantics and proof theory of Nilsson's probabilistic logic, outlining both the benefits of its well-defined model theory and the drawbacks of its proof theory. Within Nilsson's semantic framework, we derive a set…

Artificial Intelligence · Computer Science 2013-04-11 Peter Haddawy , Alan M. Frisch

We examine the complexity of inference in Bayesian networks specified by logical languages. We consider representations that range from fragments of propositional logic to function-free first-order logic with equality; in doing so we cover…

Artificial Intelligence · Computer Science 2017-01-09 Fabio Gagliardi Cozman , Denis Deratani Mauá

Logical formalisms provide a natural and concise means for specifying and reasoning about preferences. In this paper, we propose lexicographic logic, an extension of classical propositional logic that can express a variety of preferences,…

Artificial Intelligence · Computer Science 2020-12-22 Angelos Charalambidis , Giorgos Papadimitriou , Panos Rondogiannis , Antonis Troumpoukis

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

With help of a compact Prolog-based theorem prover for Intuitionistic Propositional Logic, we synthesize minimal assumptions under which a given formula formula becomes a theorem. After applying our synthesis algorithm to cover basic…

Logic in Computer Science · Computer Science 2022-05-13 Paul Tarau

It is an open question whether compositional truth with the principle of propositional soundness ,,all arithmetical sentences which are propositional tautologies are true'' is conservative over its arithmetical base theory. In this article,…

Logic · Mathematics 2024-05-24 Bartosz Wcisło

Argumentation problems are concerned with determining the acceptability of a set of arguments from their relational structure. When the available information is uncertain, probabilistic argumentation frameworks provide modelling tools to…

Artificial Intelligence · Computer Science 2023-04-18 Pietro Totis , Angelika Kimmig , Luc De Raedt

This paper presents State Algebra, a novel framework designed to represent and manipulate propositional logic using algebraic methods. The framework is structured as a hierarchy of three representations: Set, Coordinate, and Row…

Artificial Intelligence · Computer Science 2025-09-15 Dmitry Lesnik , Tobias Schäfer

The language of probability is used to define several different types of conditional statements. There are four principal types: subjunctive, material, existential, and feasibility. Two further types of conditionals are defined using the…

Logic · Mathematics 2014-09-29 Joseph W. Norman

Every countable language which conforms to classical logic is shown to have an extension which conforms to classical logic, and has a definitional theory of truth. That extension has a semantical theory of truth, if every sentence of the…

Logic · Mathematics 2020-02-04 Seppo Heikkilä

We introduce proper display calculi for intuitionistic, bi-intuitionistic and classical linear logics with exponentials, which are sound, complete, conservative, and enjoy cut-elimination and subformula property. Based on the same design,…

Logic · Mathematics 2016-11-15 Giuseppe Greco , Alessandra Palmigiano

Fuzziness and randomicity widespread exist in natural science, engineering, technology and social science. The purpose of this paper is to present a new logic - uncertain propositional logic which can deal with both fuzziness by taking…

Logic · Mathematics 2015-06-11 Maokang Luo , Wei He

We study the logic obtained by endowing the language of first-order arithmetic with second-order measure quantifiers. This new kind of quantification allows us to express that the argument formula is true in a certain portion of all…

Logic in Computer Science · Computer Science 2021-04-27 Melissa Antonelli , Ugo Dal Lago , Paolo Pistone

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

The computational method of parametric probability analysis is introduced. It is demonstrated how to embed logical formulas from the propositional calculus into parametric probability networks, thereby enabling sound reasoning about the…

Logic · Mathematics 2012-05-24 Joseph W. Norman

This paper explores the space of (propositional) probabilistic logical languages, ranging from a purely `qualitative' comparative language to a highly `quantitative' language involving arbitrary polynomials over probability terms. While…

Logic · Mathematics 2023-08-17 Duligur Ibeling , Thomas Icard , Krzysztof Mierzewski , Milan Mossé

A general notion of algebraic conditional plausibility measures is defined. Probability measures, ranking functions, possibility measures, and (under the appropriate definitions) sets of probability measures can all be viewed as defining…

Artificial Intelligence · Computer Science 2011-06-16 Joseph Y. Halpern

We study which standard operators of probabilistic process calculi allow for compositional reasoning with respect to bisimulation metric semantics. We argue that uniform continuity (generalizing the earlier proposed property of…

Logic in Computer Science · Computer Science 2019-03-14 Daniel Gebler , Kim G. Larsen , Simone Tini

The first contribution of this paper is the presentation of a Pavelka - like formulation of possibilistic logic in which the language is naturally enriched by two connectives which represent negation (eg) and a new type of conjunction…

Artificial Intelligence · Computer Science 2013-02-21 Luca Boldrin , Claudio Sossai