English
Related papers

Related papers: Natural Deduction for Assertibility and Deniabilit…

200 papers

We present several philosophical ideas emerging from the studies of complex systems. We make a brief introduction to the basic concepts of complex systems, for then defining "abstraction levels". These are useful for representing…

Adaptation and Self-Organizing Systems · Physics 2007-05-23 Carlos Gershenson

We investigate the possibility of distinguishing among different causal relations starting from a limited set of marginals. Our main tool is the notion of adhesivity, that is, the extension of probability or entropies defined only on…

Quantum Physics · Physics 2016-10-28 Costantino Budroni , Nikolai Miklin , Rafael Chaves

We present a propositional logic with fundamental probabilistic semantics, in which each formula is given a real measure in the interval $[0,1]$ that represents its degree of truth. This semantics replaces the binarity of classical logic,…

Logic in Computer Science · Computer Science 2025-05-22 Francisco Aragão

We extend the $ASPIC^+$ framework for structured argumentation so as to allow applications of the reasoning by cases inference scheme for defeasible arguments. Given an argument with conclusion `$A$ or $B$', an argument based on $A$ with…

Artificial Intelligence · Computer Science 2017-03-27 Mathieu Beirlaen , Jesse Heyninck , Christian Straßer

The article proposes a new technique for proving the undefinability of logical connectives through each other and illustrates the technique with several examples. Some of the obtained results are new proofs of the existing theorems, others…

Artificial Intelligence · Computer Science 2023-07-04 Sophia Knight , Pavel Naumov , Qi Shi , Vigasan Suntharraj

We give a proof-theoretic as well as a semantic characterization of a logic in the signature with conjunction, disjunction, negation, and the universal and existential quantifiers that we suggest has a certain fundamental status. We present…

Logic · Mathematics 2023-04-06 Wesley H. Holliday

Based on an analysis of the inference rules used, we provide a characterization of the situations in which classical provability entails intuitionistic provability. We then examine the relationship of these derivability notions to uniform…

Logic in Computer Science · Computer Science 2016-08-31 Gopalan Nadathur

When agents devise plans for execution in the real world, they face two important forms of uncertainty: they can never have complete knowledge about the state of the world, and they do not have complete control, as the effects of their…

Artificial Intelligence · Computer Science 2013-02-28 Ron Davidson , Michael R. Fehling

We present probabilistic approaches to check the validity of selected connexive principles within the setting of coherence. Connexive logics emerged from the intuition that conditionals of the form "If $\sim A$, then $A$", should not hold,…

Logic · Mathematics 2021-09-13 Niki Pfeifer , Giuseppe Sanfilippo

This paper presents Abduction and Argumentation as two principled forms for reasoning, and fleshes out the fundamental role that they can play within Machine Learning. It reviews the state-of-the-art work over the past few decades on the…

Artificial Intelligence · Computer Science 2020-10-27 Antonis Kakas , Loizos Michael

We introduce a new notion of a relational word as a finite totally ordered set of positions endowed with three binary relations that describe which positions are labeled by equal data, by unequal data and those having an undefined relation…

Formal Languages and Automata Theory · Computer Science 2015-10-13 Igor Potapov , Olena Prianychnykova , Sergey Verlan

This paper presents a method to explain the knowledge encoded in a convolutional neural network (CNN) quantitatively and semantically. The analysis of the specific rationale of each prediction made by the CNN presents a key issue of…

Computer Vision and Pattern Recognition · Computer Science 2018-12-19 Runjin Chen , Hao Chen , Ge Huang , Jie Ren , Quanshi Zhang

Contingency and accident are two important notions in philosophy and philosophical logic. Their meanings are so close that they are mixed sometimes, in both everyday discourse and academic research. This indicates that it is necessary to…

Logic · Mathematics 2018-02-13 Jie Fan

We give a new proof of the decidability of reachability in alternating pushdown systems, showing that it is a simple consequence of a cut-elimination theorem for some natural-deduction style inference systems. Then, we show how this result…

Logic in Computer Science · Computer Science 2014-10-31 Gilles Dowek , Ying Jiang

In this paper we show that two seemingly unrelated problems in economics, the hypothesis of integrability and the hypothesis of additive separability are linked by the absence of curvature of connections on webs naturally associated with…

Differential Geometry · Mathematics 2009-01-05 Thomas Russell

Existing tools for explaining complex models and systems are associational rather than causal and do not provide mechanistic understanding. We propose a new notion called counterfactual explainability for causal attribution that is…

Machine Learning · Statistics 2025-10-07 Zijun Gao , Qingyuan Zhao

We formulate argumentative relation classification (support vs. attack) as a text-plausibility ranking task. To this aim, we propose a simple reconstruction trick which enables us to build minimal pairs of plausible and implausible texts by…

Computation and Language · Computer Science 2019-09-20 Juri Opitz

Conditionals are useful for modelling, but are not always sufficiently expressive for capturing information accurately. In this paper we make the case for a form of conditional that is situation-based. These conditionals are more expressive…

Artificial Intelligence · Computer Science 2023-04-18 Giovanni Casini , Thomas Meyer , Ivan Varzinczak

We argue for a compositional semantics grounded in a strongly typed ontology that reflects our commonsense view of the world and the way we talk about it. Assuming such a structure we show that the semantics of various natural language…

Artificial Intelligence · Computer Science 2007-05-23 Walid S. Saba

While most approaches to automatically recognizing entailment relations have used classifiers employing hand engineered features derived from complex natural language processing pipelines, in practice their performance has been only…

Computation and Language · Computer Science 2016-03-02 Tim Rocktäschel , Edward Grefenstette , Karl Moritz Hermann , Tomáš Kočiský , Phil Blunsom