English
Related papers

Related papers: Equational and Inductive Reasoning for Maude in At…

200 papers

The paper presents algebraic and logical developments. From the algebraic viewpoint, we introduce Monadic Equational Systems as an abstract enriched notion of equational presentation. From the logical viewpoint, we provide Equational…

Category Theory · Mathematics 2013-09-20 Marcelo Fiore

At its core, abstraction is the process of generalizing from specific instances to broader concepts or models, with the primary objective of reducing complexity while preserving properties essential to the intended purpose. It is…

Logic in Computer Science · Computer Science 2026-01-06 Andrzej Szalas

The logic of hereditary Harrop formulas (HH) has proven useful for specifying a wide range of formal systems. This logic includes a form of hypothetical judgment that leads to dynamically changing sets of assumptions and that is key to…

Logic in Computer Science · Computer Science 2013-08-06 Yuting Wang , Kaustuv Chaudhuri , Andrew Gacek , Gopalan Nadathur

We propose abstract compilation for precise static type analysis of object-oriented languages based on coinductive logic programming. Source code is translated to a logic program, then type-checking and inference problems amount to queries…

Programming Languages · Computer Science 2017-09-15 Luca Franceschini , Davide Ancona , Ekaterina Komendantskaya

Answering compositional questions that require multiple steps of reasoning against text is challenging, especially when they involve discrete, symbolic operations. Neural module networks (NMNs) learn to parse such questions as executable…

Computation and Language · Computer Science 2020-02-18 Nitish Gupta , Kevin Lin , Dan Roth , Sameer Singh , Matt Gardner

Abstract argumentation has emerged as a method for non-monotonic reasoning that has gained popularity in the symbolic artificial intelligence community. In the literature, the different approaches to abstract argumentation that were refined…

Artificial Intelligence · Computer Science 2021-01-11 Timotheus Kampik , Juan Carlos Nieves

Transformers have been shown to be able to perform deductive reasoning on a logical rulebase containing rules and statements written in natural language. Recent works show that such models can also produce the reasoning steps (i.e., the…

Computation and Language · Computer Science 2022-03-22 Soumya Sanyal , Harman Singh , Xiang Ren

Our understanding about things is conceptual. By stating that we reason about objects, it is in fact not the objects but concepts referring to them that we manipulate. Now, so long just as we acknowledge infinitely extending notions such as…

Artificial Intelligence · Computer Science 2015-04-21 Ryuta Arisaka

Orthomodular logic is a weakening of quantum logic in the sense of Birkhoff and von Neumann. Orthomodular logic is shown to be a nonlinear noncommutative logic. Sequents are given a physically motivated semantics that is consistent with…

Logic · Mathematics 2024-11-20 Andre Kornell

A semantic tableau method, called an argumentation tableau, that enables the derivation of arguments, is proposed. First, the derivation of arguments for standard propositional and predicate logic is addressed. Next, an extension that…

Artificial Intelligence · Computer Science 2022-09-13 Nico Roos

In complex inferential tasks like question answering, machine learning models must confront two challenges: the need to implement a compositional reasoning process, and, in many applications, the need for this reasoning process to be…

Computer Vision and Pattern Recognition · Computer Science 2019-03-08 Ronghang Hu , Jacob Andreas , Trevor Darrell , Kate Saenko

This article describes an evaluation of Automated Theorem Proving (ATP) systems on problems taken from the QMLTP library of first-order modal logic problems. Principally, the problems are translated to both typed first-order and…

Logic in Computer Science · Computer Science 2026-04-08 Alexander Steen , Geoff Sutcliffe , Christoph Benzmüller

Inductive proofs can be represented as proof schemata, i.e. as parameterized sequences of proofs defined in a primitive recursive way. Applications of proof schemata can be found in the area of automated proof analysis where the schemata…

Logic in Computer Science · Computer Science 2025-06-09 Alexander Leitsch , Anela Lolić , Stella Mahler

Despite the success of neural models in solving reasoning tasks, their compositional generalization capabilities remain unclear. In this work, we propose a new setting of the structured explanation generation task to facilitate…

Computation and Language · Computer Science 2023-09-15 Xiyan Fu , Anette Frank

Dependently typed lambda calculi such as the Edinburgh Logical Framework (LF) are a popular means for encoding rule-based specifications concerning formal syntactic objects. In these frameworks, relations over terms representing formal…

Logic in Computer Science · Computer Science 2013-11-01 Mary Southern , Gopalan Nadathur

In this note we suggest that difficulties encountered in natural language semantics are, for the most part, due to the use of mere symbol manipulation systems that are devoid of any content. In such systems, where there is hardly any link…

Artificial Intelligence · Computer Science 2007-12-13 Walid S. Saba

This paper presents Non-Axiomatic Term Logic (NATL) as a theoretical computational framework of humanlike symbolic reasoning in artificial intelligence. NATL unites a discrete syntactic system inspired from Aristotle's term logic and a…

Artificial Intelligence · Computer Science 2022-11-23 Kotaro Funakoshi

Recent ideas about epistemic modals and indicative conditionals in formal semantics have significant overlap with ideas in modal logic and dynamic epistemic logic. The purpose of this paper is to show how greater interaction between formal…

Logic in Computer Science · Computer Science 2017-08-07 Wesley H. Holliday , Thomas F. Icard

Nonmonotonic logics are usually characterized by the presence of some notion of 'conditional' that fails monotonicity. Research on nonmonotonic logics is therefore largely concerned with the defeasibility of argument forms and the…

Logic in Computer Science · Computer Science 2013-10-29 Katarina Britz , Ivan Varzinczak

Combining higher-order abstract syntax and (co)induction in a logical framework is well known to be problematic. Previous work described the implementation of a tool called Hybrid, within Isabelle HOL, which aims to address many of these…

Logic in Computer Science · Computer Science 2010-05-27 Amy Felty , Alberto Momigliano
‹ Prev 1 8 9 10 Next ›