English
Related papers

Related papers: An argumentation system for reasoning with conflic…

200 papers

Large Language Models (LLMs) encode vast world knowledge across multiple languages, yet their internal beliefs are often unevenly distributed across linguistic spaces. When external evidence contradicts these language-dependent memories,…

Computation and Language · Computer Science 2026-01-13 Jiaqi Zhao , Qiang Huang , Haodong Chen , Xiaoxing You , Jun Yu

With the rise of knowledge management and knowledge economy, the knowledge elements that directly link and embody the knowledge system have become the research focus and hotspot in certain areas. The existing knowledge element…

Logic in Computer Science · Computer Science 2019-04-17 Bin Wen , Jianhou Gan , Juan L. G. Guirao , Wei Gao

We obtain, for the first time, a modular many-valued semantics for combined logics, which is built directly from many-valued semantics for the logics being combined, by means of suitable universal operations over partial non-deterministic…

Logic · Mathematics 2024-05-22 Carlos Caleiro , Sérgio Marcelino

We explore the problem of explaining observations starting from a classically inconsistent theory by adopting a paraconsistent framework. We consider two expansions of the well-known Belnap--Dunn paraconsistent four-valued logic…

Logic in Computer Science · Computer Science 2025-07-21 Meghyn Bienvenu , Katsumi Inoue , Daniil Kozhemiachenko

Semantic communication has emerged as a promising paradigm to address the challenges of next-generation communication networks. While some progress has been made in its conceptualization, fundamental questions remain unresolved. In this…

Information Theory · Computer Science 2025-05-05 Javad Gholipour , Rafael F. Schaefer , Gerhard P. Fettweis

Signed systems were introduced as a general, syntax-independent framework for paraconsistent reasoning, that is, non-trivialised reasoning from inconsistent information. In this paper, we show how the family of corresponding paraconsistent…

Logic in Computer Science · Computer Science 2007-05-23 Philippe Besnard , Torsten Schaub , Hans Tompits , Stefan Woltran

Automated grading systems can efficiently score short-answer responses, yet they often fail to indicate when a grading decision is uncertain or potentially contentious. We introduce semantic entropy, a measure of variability across multiple…

Artificial Intelligence · Computer Science 2025-08-07 Karrtik Iyer , Manikandan Ravikiran , Prasanna Pendse , Shayan Mohanty

Abstract Dialectical Frameworks (ADFs) are argumentation frameworks where each node is associated with an acceptance condition. This allows us to model different types of dependencies as supports and attacks. Previous studies provided a…

Artificial Intelligence · Computer Science 2019-07-24 João Alcântara , Samy Sá , Juan Acosta-Guadarrama

Uncertainty in Logic Programming has been investigated during the last decades, dealing with various extensions of the classical LP paradigm and different applications. Existing proposals rely on different approaches, such as clause…

Logic in Computer Science · Computer Science 2010-07-22 Mario Rodríguez-Artalejo , Carlos A. Romero-Díaz

A non-distributive two-sorted hypersequent calculus \textbf{PDBL} and its modal extension \textbf{MPDBL} are proposed for the classes of pure double Boolean algebras and pure double Boolean algebras with operators respectively. A relational…

Logic · Mathematics 2022-07-25 Prosenjit Howlader , Mohua Banerjee

Humans currently use arguments for explaining choices which are already made, or for evaluating potential choices. Each potential choice has usually pros and cons of various strengths. In spite of the usefulness of arguments in a decision…

Artificial Intelligence · Computer Science 2012-07-19 Leila Amgoud , Henri Prade

Convincing someone of the truth value of a premise requires understanding and articulating the core logical structure of the argument which proves or disproves the premise. Understanding the logical structure of an argument refers to…

Computation and Language · Computer Science 2025-08-21 Krunal Shah , Dan Roth

I review evidence for the claim that syntactic ambiguities are resolved on the basis of the meaning of the competing analyses, not their structure. I identify a collection of ambiguities that do not yet have a meaning-based account and…

cmp-lg · Computer Science 2008-02-03 Michael Niv

We present a family of paraconsistent counterparts of the constructive modal logic CK. These logics aim to formalise reasoning about contradictory but non-trivial propositional attitudes like beliefs or obligations. We define their…

Logic in Computer Science · Computer Science 2025-08-26 Han Gao , Daniil Kozhemiachenko , Nicola Olivetti

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

In recent work, Stalnaker proposes a logical framework in which belief is realized as a weakened form of knowledge. Building on Stalnaker's core insights, and using frameworks developed by Bjorndahl and Baltag et al., we employ topological…

Logic in Computer Science · Computer Science 2017-08-01 Adam Bjorndahl , Aybüke Özgün

Recent large language models (LLMs) have achieved impressive reasoning milestones but continue to struggle with high computational costs, logical inconsistencies, and sharp performance degradation on high-complexity problems. While…

Artificial Intelligence · Computer Science 2026-05-01 Adam Ishay , Joohyung Lee

Abstract argumentation frameworks are formal systems that facilitate obtaining conclusions from non-monotonic knowledge systems. Within such a system, an argumentation semantics is defined as a set of arguments with some desired qualities,…

Artificial Intelligence · Computer Science 2018-08-14 Renata Wong

Cascade systems route computational requests to smaller models when possible and defer to larger models only when necessary, offering a promising approach to balance cost and quality in LLM deployment. However, they face a fundamental…

Computation and Language · Computer Science 2025-10-29 Duncan Soiffer , Steven Kolawole , Virginia Smith

Most non-classical logics are subclassical, that is, every inference/theorem they validate is also valid classically. A notable exception is the three-valued propositional Logic of Ordinary Discourse (OL) proposed and extensively motivated…

Logic · Mathematics 2024-05-07 Vitor Greati , Sérgio Marcelino , Umberto Rivieccio
‹ Prev 1 3 4 5 6 7 10 Next ›