English
Related papers

Related papers: Neutrality and Many-Valued Logics

200 papers

In this paper we propose a general approach to define a many-valued preferential interpretation of gradual argumentation semantics. The approach allows for conditional reasoning over arguments and boolean combination of arguments, with…

Artificial Intelligence · Computer Science 2025-06-10 Mario Alviano , Laura Giordano , Daniele Theseider Dupré

This paper proves normalisation theorems for intuitionist and classical negative free logic, without and with the $\invertediota$ operator for definite descriptions. Rules specific to free logic give rise to new kinds of maximal formulas…

Logic in Computer Science · Computer Science 2024-10-16 Nils Kürbis

We introduce a new semantics for a logic of explicit and implicit beliefs based on the concept of multi-agent belief base. Differently from existing Kripke-style semantics for epistemic logic in which the notions of possible world and…

Artificial Intelligence · Computer Science 2018-12-19 Emiliano Lorini

Weighted knowledge bases for description logics with typicality under a "concept-wise" multi-preferential semantics provide a logical interpretation of MultiLayer Perceptrons. In this context, Answer Set Programming (ASP) has been shown to…

Artificial Intelligence · Computer Science 2023-03-28 Mario Alviano , Laura Giordano , Daniele Theseider Dupré

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 this paper, we present an abstract framework of many-valued modal logic with the interpretation of atomic propositions and modal operators as predicate lifting over coalgebras for an endofunctor on the category of sets. It generalizes…

Logic in Computer Science · Computer Science 2022-10-25 Chun-Yu Lin , Churn-Jung Liau

We extend classical work by Janusz Czelakowski on the closure properties of the class of matrix models of entailment relations - nowadays more commonly called multiple-conclusion logics - to the setting of non-deterministic matrices…

Logic · Mathematics 2023-10-05 Carlos Caleiro , Sérgio Marcelino , Umberto Rivieccio

Equilibrium logic is an approach to nonmonotonic reasoning that extends the stable-model and answer-set semantics for logic programs. In particular, it includes the general case of nested logic programs, where arbitrary Boolean combinations…

Logic in Computer Science · Computer Science 2009-12-30 David Pearce , Hans Tompits , Stefan Woltran

We consider the call-by-value lambda-calculus extended with a may-convergent non-deterministic choice and a must-convergent parallel composition. Inspired by recent works on the relational semantics of linear logic and non-idempotent…

Logic in Computer Science · Computer Science 2014-01-08 Alejandro Díaz-Caro , Giulio Manzonetto , Michele Pagani

We examine Paul Halmos' comments on category theory, Dedekind cuts, devil worship, logic, and Robinson's infinitesimals. Halmos' scepticism about category theory derives from his philosophical position of naive set-theoretic realism. In the…

In this paper, we define a multi-type calculus for inquisitive logic, which is sound, complete and enjoys Belnap-style cut-elimination and subformula property. Inquisitive logic is the logic of inquisitive semantics, a semantic framework…

Logic in Computer Science · Computer Science 2016-04-05 Sabine Frittella , Giuseppe Greco , Alessandra Palmigiano , Fan Yang

The paper proposes a new type of negation in multi-valued logics, providing a different way to answer the following question: what does it mean that some object language formula does not have a given truth-value. Along the way, the paper…

Logic in Computer Science · Computer Science 2022-04-01 Nissim Francez

We propose four axiomatic systems for intuitionistic linear temporal logic and show that each of these systems is sound for a class of structures based either on Kripke frames or on dynamic topological systems. Our topological semantics…

The multi-valued logic of {\L}ukasiewicz is a substructural logic that has been widely studied and has many interesting properties. It is classical, in the sense that it admits the axiom schema of double negation, [DNE]. However, our…

Logic in Computer Science · Computer Science 2014-08-18 Rob Arthan , Paulo Oliva

A grammar logic refers to an extension to the multi-modal logic K in which the modal axioms are generated from a formal grammar. We consider a proof theory, in nested sequent calculus, of grammar logics with converse, i.e., every modal…

Logic in Computer Science · Computer Science 2012-04-12 Alwen Tiu , Egor Ianovski , Rajeev Gore

Aristotelian assertoric syllogistic, which is currently of growing interest, has attracted the attention of the founders of modern logic, who approached it in several (semantical and syntactical) ways. Further approaches were introduced…

Logic · Mathematics 2019-04-03 Mohamed A. Amer

We introduce the concept of weighted rules under the stable model semantics following the log-linear models of Markov Logic. This provides versatile methods to overcome the deterministic nature of the stable model semantics, such as…

Artificial Intelligence · Computer Science 2026-05-12 Joohyung Lee , Yi Wang

The supervaluationist approach to fixed-point semantics is, arguably, the most celebrated and studied competitor to the Strong Kleene approach within Kripkean truth. In this paper, we show how to obtain supervaluationist fixed-point…

Logic · Mathematics 2025-11-21 Pablo Dopico

Logic-based argumentation is a well-established formalism modelling nonmonotonic reasoning. It has been playing a major role in AI for decades, now. Informally, a set of formulas is the support for a given claim if it is consistent,…

Artificial Intelligence · Computer Science 2021-02-24 Yasir Mahmood , Arne Meier , Johannes Schmidt

We prove that there are continuum-many axiomatic extensions of the full Lambek calculus with exchange that have the deductive interpolation property. Further, we extend this result to both classical and intuitionistic linear logic as well…

Logic · Mathematics 2023-08-04 Wesley Fussner , Simon Santschi