English
Related papers

Related papers: Suszko's Problem: Mixed Consequence and Compositio…

200 papers

A semantics is given to possibilistic logic, a logic that handles weighted classical logic formulae, and where weights are interpreted as lower bounds on degrees of certainty or possibility, in the sense of Zadeh's possibility theory. The…

Artificial Intelligence · Computer Science 2013-03-26 Jerome Lang , Didier Dubois , Henri Prade

Ranking individuals based on their performance in different coalitions is a problem emerging in various domains (teams sports, scientific evaluation, argumentation, etc.). Often, for practical reasons, the number of comparable coalitions is…

Theoretical Economics · Economics 2026-03-19 Takahiro Suzuki , Michele Aleandri , Stefano Moretti

In this work, we consider the satisfiability problem in a logic that combines word equations over string variables denoting words of unbounded lengths, regular languages to which words belong and Presburger constraints on the length of…

Logic in Computer Science · Computer Science 2018-05-24 Quang Loc Le

This paper is a contribution to graded model theory, in the context of mathematical fuzzy logic. We study characterizations of classes of graded structures in terms of the syntactic form of their first-order axiomatization. We focus on…

Logic · Mathematics 2019-01-08 Guillermo Badia , Vicent Costa , Pilar Dellunde , Carles Noguera

Tarski's relevance logic is defined and shown to contain many formulas and derived rules of inference. The definition arises from Tarski's work on first-order logic restricted to finitely many variables. It is a relevance logic because it…

Logic · Mathematics 2019-03-05 Roger D. Maddux

In the present paper, we investigate consequence relations that are both paraconsistent and plausible (but still monotonic). More precisely, we put the focus on pivotal consequence relations, i.e. those relations that can be defined by a…

Logic in Computer Science · Computer Science 2007-05-23 Jonathan Ben-Naim

Suszko's Sentential Calculus with Identity SCI results from classical propositional calculus CPC by adding a new connective $\equiv$ and axioms for identity $\varphi\equiv\psi$ (which we interpret here as `propositional identity'). We…

Logic in Computer Science · Computer Science 2023-04-04 Steffen Lewitzka

Compositionality in language refers to how much the meaning of some phrase can be decomposed into the meaning of its constituents and the way these constituents are combined. Based on the premise that substitution by synonyms is…

Computation and Language · Computer Science 2017-03-13 Christina Lioma , Niels Dalum Hansen

A list of all possible causal relations in the $2$-dimensional Minkowski space $M$ is exhausted, based on the duality between timelike and spacelike in this particular case, and thirty topologies are introduced, all of them encapsulating…

Mathematical Physics · Physics 2019-03-06 Kyriakos Papadopoulos , Nazli Kurt , Basil K. Papadopoulos

We introduce an approach to counterfactual inference based on merging information from multiple datasets. We consider a causal reformulation of the statistical marginal problem: given a collection of marginal structural causal models (SCMs)…

Artificial Intelligence · Computer Science 2022-07-18 Luigi Gresele , Julius von Kügelgen , Jonas M. Kübler , Elke Kirschbaum , Bernhard Schölkopf , Dominik Janzing

We study properties related to relevance in non-monotonic consequence relations obtained by systems of structured argumentation. Relevance desiderata concern the robustness of a consequence relation under the addition of irrelevant…

Artificial Intelligence · Computer Science 2020-05-15 AnneMarie Borg , Christian Straßer

In [12], Nilsson proposed the probabilistic logic in which the truth values of logical propositions are probability values between 0 and 1. It is applicable to any logical system for which the consistency of a finite set of propositions can…

Artificial Intelligence · Computer Science 2013-04-12 Su-shing Chen

Automated reasoning about uncertain knowledge has many applications. One difficulty when developing such systems is the lack of a completely satisfactory integration of logic and probability. We address this problem directly. Expressive…

Logic in Computer Science · Computer Science 2012-09-13 Marcus Hutter , John W. Lloyd , Kee Siong Ng , William T. B. Uther

Syntactic discontinuity is a grammatical phenomenon in which a constituent is split into more than one part because of the insertion of an element which is not part of the constituent. This is observed in many languages across the world…

Computation and Language · Computer Science 2025-06-06 Ratna Kandala , Prakash Mondal

NLP tasks differ in the semantic information they require, and at this time no single se- mantic representation fulfills all requirements. Logic-based representations characterize sentence structure, but do not capture the graded aspect of…

Computation and Language · Computer Science 2016-06-09 I. Beltagy , Stephen Roller , Pengxiang Cheng , Katrin Erk , Raymond J. Mooney

This paper studies axioms for nonmonotonic consequences from a semantics-based point of view, focusing on a class of mathematical structures for reasoning about partial information without a predefined syntax/logic. This structure is called…

Logic in Computer Science · Computer Science 2007-05-23 Guo-Qiang Zhang

The topic of this paper is the Finiteness Conjecture for minimally unsatisfiable clause-sets (MUs), stating that for each fixed deficiency (number of clauses minus number of variables) there are only finitely many patterns, given a certain…

Discrete Mathematics · Computer Science 2016-04-06 Oliver Kullmann , Xishun Zhao

Marginal Structural Models (MSM) are the most popular models for causal inference from time-series observational data. However, they have two main drawbacks: (a) they do not capture subject heterogeneity, and (b) they only consider fixed…

Machine Learning · Computer Science 2020-10-19 Debmalya Mandal , David Parkes

We consider equivalence and containment problems for word transductions. These problems are known to be undecidable when the transductions are relations between words realized by non-deterministic transducers, and become decidable when…

Formal Languages and Automata Theory · Computer Science 2018-10-08 Sougata Bose , Anca Muscholl , Vincent Penelle , Gabriele Puppis

The classical condition "$\phi$ is a semantic consequence of $\Theta$" in infinite-valued propositional \L ukasiewicz logic \L$_\infty$ is refined using enriched valuations that take into account the effect on $\phi$ of the stability of the…

Logic · Mathematics 2012-07-25 Daniele Mundici