English
Related papers

Related papers: Turning the Liar paradox into a metatheorem of Bas…

200 papers

Detecting semantic arguments of a predicate word has been conventionally modeled as a sentence-level task. The typical reader, however, perfectly interprets predicate-argument relations in a much wider context than just the sentence where…

Computation and Language · Computer Science 2024-08-09 Paul Roit , Aviv Slobodkin , Eran Hirsch , Arie Cattan , Ayal Klein , Valentina Pyatkin , Ido Dagan

Pronoun disambiguation in understanding text and discourse often requires the application of both general pragmatic knowledge and context-specific information. In AI and linguistics research, this has mostly been studied in cases where the…

Computation and Language · Computer Science 2022-04-06 Ernest Davis

This paper develops a proof-theoretic framework for abstract interpretation by systematically associating logical systems with finite abstractions. Building on earlier work on the internal logics of abstractions, we propose a general…

Logic in Computer Science · Computer Science 2026-05-27 Vijay D'Silva , Alessandra Palmigiano , Apostolos Tzimoulis , Caterina Urban

To counter a general belief that all the paradoxes stem from a kind of circularity (or involve some self--reference, or use a diagonal argument) Stephen Yablo designed a paradox in 1993 that seemingly avoided self--reference. We turn…

Logic · Mathematics 2024-04-17 Ahmad Karimi , Saeed Salehi

Paradoxes are interesting puzzles in philosophy and mathematics, and they could be even more fascinating, when turned into proofs and theorems. For example, Liar's paradox can be translated into a propositional tautology, and Barber's…

Logic · Mathematics 2022-05-10 Saeed Salehi

Linear logic (LL) is a resource-aware, abstract logic programming language that refines both classical and intuitionistic logic. Linear logic semantics is typically presented in one of two ways: by associating each formula with the set of…

Logic in Computer Science · Computer Science 2026-03-03 Victor Barroso-Nascimento , Ekaterina Piotrovskaya , Elaine Pimentel

Real-world arguments in text and dialogues are normally enthymemes (i.e. some of their premises and/or claims are implicit). Natural language processing (NLP) methods for handling enthymemes can potentially identify enthymemes in text but…

Computation and Language · Computer Science 2026-03-09 Xuyao Feng , Anthony Hunter

LF is a dependent type theory in which many other formal systems can be conveniently embedded. However, correct use of LF relies on nontrivial metatheoretic developments such as proofs of correctness of decision procedures for LF's…

Logic in Computer Science · Computer Science 2010-05-04 Christian Urban , James Cheney , Stefan Berghofer

I outline a new theory of truth that resolves the classical and constructive versions of the liar paradox. The theory features a provably consistent axiomatization of a global self-applicative truth predicate. Truth is defined using…

Logic · Mathematics 2025-07-14 Nik Weaver

Logical reasoning is central to human cognition and intelligence. It includes deductive, inductive, and abductive reasoning. Past research of logical reasoning within AI uses formal language as knowledge representation and symbolic…

Computation and Language · Computer Science 2024-02-19 Zonglin Yang , Xinya Du , Rui Mao , Jinjie Ni , Erik Cambria

Recent work has shown that integrating large language models (LLMs) with theorem provers (TPs) in neuro-symbolic pipelines helps with entailment verification and proof-guided refinement of explanations for natural language inference (NLI).…

Computation and Language · Computer Science 2026-01-28 Xin Quan , Marco Valentino , Louise A. Dennis , André Freitas

Attractor-repeller decompositions of isolated invariant sets give rise to so-called connecting homomorphisms. These homomorphisms reveal information on the existence and structure of connecting trajectories of the underlying dynamical…

Dynamical Systems · Mathematics 2018-01-11 Axel Jänig

We introduce the Delta-framework, LF-Delta, a dependent type theory based on the Edinburgh Logical Framework LF, extended with the strong proof-functional connectives, i.e. strong intersection, minimal relevant implication and strong union.…

Logic in Computer Science · Computer Science 2018-08-22 Furio Honsell , Luigi Liquori , Claude Stolze , Ivan Scagnetto

The development of logic has largely been through the 'deductive' paradigm: conclusions are inferred from established premisses. However, the use of logic in the context of both human and machine reasoning is typically through the dual…

Logic in Computer Science · Computer Science 2025-04-29 Alexander V. Gheorghiu , David J. Pym

The concurrent logical framework CLF is an extension of the logical framework LF designed to specify concurrent and distributed languages. While it can be used to define a variety of formalisms, reasoning about such languages within CLF has…

Logic in Computer Science · Computer Science 2013-07-30 Iliano Cervesato , Jorge Luis Sacchini

Non-classical generalizations of classical modal logic have been developed in the contexts of constructive mathematics and natural language semantics. In this paper, we discuss a general approach to the semantics of non-classical modal…

Logic · Mathematics 2024-06-25 Wesley H. Holliday

Biomedical ontologies contain numerous concept or role names involving negative knowledge such as lacks_part, absence_of. Such a representation with labels rather than logical constructors would not allow a reasoner to interpret lacks_part…

Logic in Computer Science · Computer Science 2026-03-20 Chan Le Duc , Ludovic Brieulle

Most current approaches to metaphor identification use restricted linguistic contexts, e.g. by considering only a verb's arguments or the sentence containing a phrase. Inspired by pragmatic accounts of metaphor, we argue that broader…

Computation and Language · Computer Science 2019-04-11 Jesse Mu , Helen Yannakoudakis , Ekaterina Shutova

Treating syntactic equality as a logical connective -- governed by left- and right-introduction rules within the sequent calculus -- offers an elegant and powerful approach to term identity. This treatment of equality allows for the…

Logic in Computer Science · Computer Science 2026-05-20 Kaustuv Chaudhuri , Arunava Gantait , Dale Miller

We extend the meet-implication fragment of propositional intuitionistic logic with a meet-preserving modality. We give semantics based on semilattices and a duality result with a suitable notion of descriptive frame. As a consequence we…

Logic · Mathematics 2023-06-22 Jim de Groot , Dirk Pattinson
‹ Prev 1 4 5 6 7 8 10 Next ›