English
Related papers

Related papers: Natural Deduction systems for some weak Subintuiti…

200 papers

The importance of transformations and normal forms in logic programming, and generally in computer science, is well documented. This paper investigates transformations and normal forms in the context of Defeasible Logic, a simple but…

Logic in Computer Science · Computer Science 2021-02-16 G. Antoniou , D. Billington , G. Governatori , M. J. Maher

A class of subsets designated as very thin subsets of natural numbers has been studied and seen that theory of convergence may be rediscovered if very thin sets are given to play main role instead of thin or finite sets which removes some…

General Topology · Mathematics 2021-12-24 Manoranjan Singha , Ujjal Kumar Hom

We consider the immediate consequence of an arguable addition to the standard Deduction Theorems of first order theories.

General Mathematics · Mathematics 2007-05-23 Bhupinder Singh Anand

We introduce DeepProbLog, a probabilistic logic programming language that incorporates deep learning by means of neural predicates. We show how existing inference and learning techniques can be adapted for the new language. Our experiments…

Artificial Intelligence · Computer Science 2018-12-13 Robin Manhaeve , Sebastijan Dumančić , Angelika Kimmig , Thomas Demeester , Luc De Raedt

Abductive reasoning, reasoning for inferring explanations for observations, is often mentioned in scientific, design-related and artistic contexts, but its understanding varies across these domains. This paper reviews how abductive…

Artificial Intelligence · Computer Science 2025-07-14 Abhinav Sood , Kazjon Grace , Stephen Wan , Cecile Paris

We investigate cut-elimination and cut-simulation in impredicative (higher-order) logics. We illustrate that adding simple axioms such as Leibniz equations to a calculus for an impredicative logic -- in our case a sequent calculus for…

Logic in Computer Science · Computer Science 2019-03-14 Christoph Benzmueller , Chad E. Brown , Michael Kohlhase

In settings from fact-checking to question answering, we frequently want to know whether a collection of evidence (premises) entails a hypothesis. Existing methods primarily focus on the end-to-end discriminative version of this task, but…

Computation and Language · Computer Science 2022-10-31 Kaj Bostrom , Zayne Sprague , Swarat Chaudhuri , Greg Durrett

These notes derive a number of technical results on nonlinear contraction theory, a comparatively recent tool for system stability analysis. In particular, they provide new results on the preservation of contraction through system…

Adaptation and Self-Organizing Systems · Physics 2007-05-23 Nicolas Tabareau , Jean-Jacques Slotine

Decision tree induction systems are being used for knowledge acquisition in noisy domains. This paper develops a subjective Bayesian interpretation of the task tackled by these systems and the heuristic methods they use. It is argued that…

Artificial Intelligence · Computer Science 2013-04-11 Wray L. Buntine

The present paper refers to the theory and the practice of the systems regarding non-linear systems and their applications. We aimed the integration of these systems to elaborate their response as well as to highlight some outstanding…

Discrete Mathematics · Computer Science 2009-03-26 Petre Bucur , Lucian Luca

In natural characteristic, smooth induction from an open subgroup does not always give an exact functor. In this article we initiate a study of the right derived functors, and we give applications to the non-existence of projective…

Number Theory · Mathematics 2024-02-05 Peter Schneider , Claus Sorensen

The purpose of this paper is to introduce justification logics based on conditional logics. We introduce a new family of logics, called conditional justification logics, which incorporates a counterfactual conditional in its language. For…

Logic · Mathematics 2025-01-17 Meghdad Ghari

The aim of this paper is to introduce a logic in which nouns and verbs are handled together as a deductive reasoning, and also to observe the relationship between nouns and verbs as well as between logics and conversations.

Artificial Intelligence · Computer Science 2010-06-01 Jun Tanaka

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

This paper presents a soundness and completeness proof for propositional intuitionistic calculus with respect to the semantics of computability logic. The latter interprets formulas as interactive computational problems, formalized as games…

Logic in Computer Science · Computer Science 2011-04-15 Giorgi Japaridze

Understanding and creating mathematics using natural mathematical language - the mixture of symbolic and natural language used by humans - is a challenging and important problem for driving progress in machine learning. As a step in this…

Information Retrieval · Computer Science 2021-06-09 Sean Welleck , Jiacheng Liu , Ronan Le Bras , Hannaneh Hajishirzi , Yejin Choi , Kyunghyun Cho

Accounting for the epistemic contribution of deduction has been a pervasive problem for logicians interested in deduction, such as, among others, Jakko Hintikka. The problem arises because the conclusion validly deduced from a set of…

We discuss the recently developed method of refined absorption and how it is used to provide a new proof of the Existence Conjecture for combinatorial designs. This method can also be applied to resolve open problems in extremal and…

Combinatorics · Mathematics 2025-10-24 Luke Postle

This note introduces a new notion of random dynamical system with inputs and outputs, and sketches a small-gain theorem for monotone systems which generalizes a similar theorem known for deterministic systems.

Systems and Control · Computer Science 2013-01-01 Michael Marcondes de Freitas , Eduardo D. Sontag

We introduce the notion of weak reduciblity for Dupin submanifolds with arbitrary codimension. We give a complete characterization of all weakly reducible Dupin submanifolds, as a consequence of a general result on a broader class of…

Differential Geometry · Mathematics 2007-05-23 Marcos Dajczer , Luis A. Florit , Ruy Tojeiro