English
Related papers

Related papers: An Algebraic Semantics for Possibilistic Logic

200 papers

A new computational method that uses polynomial equations and dynamical systems to evaluate logical propositions is introduced and applied to Goedel's incompleteness theorems. The truth value of a logical formula subject to a set of axioms…

General Mathematics · Mathematics 2011-12-23 Joseph W. Norman

The present work presents some results about the categorial relation between logics and its categories of structures. A (propositional, finitary) logic is a pair given by a signature and Tarskian consequence relation on its formula algebra.…

Category Theory · Mathematics 2016-03-04 Darllan Conceição Pinto , Hugo Luiz Mariano

One of the greatest problems in philosophy is that of meaning. The turning point in thinking on meaning was Tarski's definition of truth, and the rapid development of logical semantics and model theory was a consequence of this achievement.…

Logic · Mathematics 2021-05-20 Michael Heller

Modal probabilistic logics provide a framework for reasoning about probability in modal contexts, involving notions such as knowledge, belief, time, and action. In this paper, we study a particular family of these logics, extending the…

Logic in Computer Science · Computer Science 2025-12-01 Daniil Kozhemiachenko , Igor Sedlár

We propose a new definition of the representation theorem for many-valued logics, with modal operators as well, and define the stronger relationship between algebraic models of a given logic and relational structures used to define the…

Logic in Computer Science · Computer Science 2011-03-02 Zoran Majkic

By considering probability distributions over the set of assignments the expected truth values assignment to propositional variables are extended through linear operators, and the expected truth values of the clauses at any given…

Logic in Computer Science · Computer Science 2010-07-07 Guillermo Morales-Luna

We propose a multi-agent epistemic logic capturing reasoning with degrees of plausibility that agents can assign to a given statement, with $1$ interpreted as "entirely plausible for the agent" and $0$ as "completely implausible" (i.e., the…

Logic · Mathematics 2025-12-18 Marta Bílková , Thomas Ferguson , Daniil Kozhemiachenko

This paper is a reflexion on the computability of natural language semantics. It does not contain a new model or new results in the formal semantics of natural language: it is rather a computational analysis of the logical models and…

Computation and Language · Computer Science 2016-05-16 Richard Moot , Christian Retoré

This paper introduces context algebras and demonstrates their application to combining logical and vector-based representations of meaning. Other approaches to this problem attempt to reproduce aspects of logical semantics within new…

Computation and Language · Computer Science 2011-11-08 Daoud Clarke

Expectation is a central notion in probability theory. The notion of expectation also makes sense for other notions of uncertainty. We introduce a propositional logic for reasoning about expectation, where the semantics depends on the…

Artificial Intelligence · Computer Science 2007-05-23 Joseph Y. Halpern , Riccardo Pucella

Contemporary semantic description of logic is based on the ontology of all possible interpretations, an insufficiently clear metaphysical concept. In this article, logic is described as the internal organization of language. Logical…

Logic · Mathematics 2024-08-23 Boris Čulina

Real-valued logics underlie an increasing number of neuro-symbolic approaches, though typically their logical inference capabilities are characterized only qualitatively. We provide foundations for establishing the correctness and power of…

Logic in Computer Science · Computer Science 2022-09-01 Ronald Fagin , Ryan Riegel , Alexander Gray

Call a semantics for a language with variables absolute when variables map to fixed entities in the denotation. That is, a semantics is absolute when the denotation of a variable a is a copy of itself in the denotation. We give a trio of…

Logic in Computer Science · Computer Science 2026-04-20 Murdoch J. Gabbay

Description logics (DLs) are well-known knowledge representation formalisms focused on the representation of terminological knowledge. Due to their first-order semantics, these languages (in their classical form) are not suitable for…

Logic in Computer Science · Computer Science 2020-09-29 Leonard Botha , Thomas Meyer , Rafael Peñaloza

The standard approach to logic in the literature in philosophy and mathematics, which has also been adopted in computer science, is to define a language (the syntax), an appropriate class of models together with an interpretation of…

Artificial Intelligence · Computer Science 2009-09-25 Joseph Y. Halpern

In this paper an approach to automated deduction under uncertainty,based on possibilistic logic, is proposed ; for that purpose we deal with clauses weighted by a degree which is a lower bound of a necessity or a possibility measure,…

Artificial Intelligence · Computer Science 2013-04-08 Didier Dubois , Jerome Lang , Henri Prade

In traditional semantics for classical logic and its extensions, such as modal logic, propositions are interpreted as subsets of a set, as in discrete duality, or as clopen sets of a Stone space, as in topological duality. A point in such a…

Logic · Mathematics 2024-05-14 Wesley H. Holliday

We present a probabilistic extension of the description logic $\mathcal{ALC}$ for reasoning about statistical knowledge. We consider conditional statements over proportions of the domain and are interested in the probabilistic-logical…

Artificial Intelligence · Computer Science 2017-06-13 Rafael Peñaloza , Nico Potyka

On the basis of elementary thinking about language functioning, a solution of truth paradoxes is given and a corresponding semantics of a truth predicate is founded. It is shown that it is precisely the two-valued description of the maximal…

Logic · Mathematics 2021-06-01 Boris Čulina

Probabilistic argumentation allows reasoning about argumentation problems in a way that is well-founded by probability theory. However, in practice, this approach can be severely limited by the fact that probabilities are defined by adding…

Artificial Intelligence · Computer Science 2019-03-07 Nico Potyka
‹ Prev 1 3 4 5 6 7 10 Next ›