English
Related papers

Related papers: Indefeasible Semantics and Defeasible Pragmatics

200 papers

This paper presents and discusses several methods for reasoning from inconsistent knowledge bases. A so-called argumentative-consequence relation taking into account the existence of consistent arguments in favor of a conclusion and the…

Artificial Intelligence · Computer Science 2013-03-08 Salem Benferhat , Didier Dubois , Henri Prade

Given an argumentation framework AF, we introduce a mapping function that constructs a disjunctive logic program P, such that the preferred extensions of AF correspond to the stable models of P, after intersecting each stable model with the…

Artificial Intelligence · Computer Science 2008-12-18 Juan Carlos Nieves , Mauricio Osorio , Ulises Cortés

This paper presents an extension of Defeasible Deontic Logic to deal with the Pragmatic Oddity problem. The logic applies three general principles: (1) the Pragmatic Oddity problem must be solved within a general logical treatment of CTD…

Logic in Computer Science · Computer Science 2022-09-13 Guido Governatori , Silvano Colombo Tosatto , Antonino Rotolo

Verbs occur in different syntactic environments, or frames. We investigate whether artificial neural networks encode grammatical distinctions necessary for inferring the idiosyncratic frame-selectional properties of verbs. We introduce five…

Computation and Language · Computer Science 2018-11-28 Katharina Kann , Alex Warstadt , Adina Williams , Samuel R. Bowman

Learning human preferences in language models remains fundamentally challenging, as reward modeling relies on subtle, subjective comparisons or shades of gray rather than clear-cut labels. This study investigates the limits of current…

Computation and Language · Computer Science 2026-04-03 Simona-Vasilica Oprea , Adela Bâra

Psychological investigations have led to considerable insight into the working of the human language comprehension system. In this article, we look at a set of principles derived from psychological findings to argue for a particular…

cmp-lg · Computer Science 2008-02-03 Kavi Mahesh , Kurt P. Eiselt

We propose a system for the interpretation of anaphoric relationships between unbound pronouns and quantifiers. The main technical contribution of our proposal consists in combining generalized quantifiers with dependent types. Empirically,…

Logic · Mathematics 2016-08-02 Justyna Grudzinska , Marek Zawadowski

Language is not only used to transmit neutral information; we often seek to persuade by arguing in favor of a particular view. Persuasion raises a number of challenges for classical accounts of belief updating, as information cannot be…

Computation and Language · Computer Science 2022-09-15 Samuel A. Barnett , Thomas L. Griffiths , Robert D. Hawkins

Implicit discourse relation classification is one of the most difficult parts in shallow discourse parsing as the relation prediction without explicit connectives requires the language understanding at both the text span level and the…

Computation and Language · Computer Science 2020-04-29 Xin Liu , Jiefu Ou , Yangqiu Song , Xin Jiang

In this paper, we address the problem of change in an abstract argumentation system. We focus on a particular change: the addition of a new argument which interacts with previous arguments. We study the impact of such an addition on the…

Artificial Intelligence · Computer Science 2014-01-17 Claudette Cayrol , Florence Dupin de Saint-Cyr , Marie-Christine Lagasquie-Schiex

A controversial test for Large Language Models concerns the ability to discern possible from impossible language. While some evidence attests to the models' sensitivity to what crosses the limits of grammatically impossible language, this…

Computation and Language · Computer Science 2025-09-19 Evelina Leivada , Raquel Montero , Paolo Morosi , Natalia Moskvina , Tamara Serrano , Marcel Aguilar , Fritz Guenther

Recently, unsupervised parsing of syntactic trees has gained considerable attention. A prototypical approach to such unsupervised parsing employs reinforcement learning and auto-encoders. However, no mechanism ensures that the learnt model…

Computation and Language · Computer Science 2021-05-24 Atul Sahay , Anshul Nasery , Ayush Maheshwari , Ganesh Ramakrishnan , Rishabh Iyer

This paper explores the impact of variable pragmatic competence on communicative success through simulating language learning and conversing between speakers and listeners with different levels of reasoning abilities. Through studying this…

Computation and Language · Computer Science 2024-10-10 Kata Naszadi , Frans A. Oliehoek , Christof Monz

Understanding language requires grasping not only the overtly stated content, but also making inferences about things that were left unsaid. These inferences include presuppositions, a phenomenon by which a listener learns about new…

Computation and Language · Computer Science 2021-09-16 Alicia Parrish , Sebastian Schuster , Alex Warstadt , Omar Agha , Soo-Hwan Lee , Zhuoye Zhao , Samuel R. Bowman , Tal Linzen

RNN language models have achieved state-of-the-art results on various tasks, but what exactly they are representing about syntax is as yet unclear. Here we investigate whether RNN language models learn humanlike word order preferences in…

Computation and Language · Computer Science 2018-11-06 Richard Futrell , Roger P. Levy

In many expert and everyday reasoning contexts it is very useful to reason on the basis of defeasible assumptions. For instance, if the information at hand is incomplete we often use plausible assumptions, or if the information is…

Logic in Computer Science · Computer Science 2018-04-25 AnneMarie Borg

While vector-based language representations from pretrained language models have set a new standard for many NLP tasks, there is not yet a complete accounting of their inner workings. In particular, it is not entirely clear what aspects of…

Computation and Language · Computer Science 2021-04-16 Matteo Alleman , Jonathan Mamou , Miguel A Del Rio , Hanlin Tang , Yoon Kim , SueYeon Chung

Propositional term modal logic is interpreted over Kripke structures with unboundedly many accessibility relations and hence the syntax admits variables indexing modalities and quantification over them. This logic is undecidable, and we…

Logic in Computer Science · Computer Science 2019-01-01 Anantha Padmanabha , R Ramanujam

Recognizing implicit discourse relations is a challenging but important task in the field of Natural Language Processing. For such a complex text processing task, different from previous studies, we argue that it is necessary to repeatedly…

Computation and Language · Computer Science 2016-09-22 Yang Liu , Sujian Li

We hypothesize that optimal system responses emerge from adaptive strategies grounded in causal and counterfactual knowledge. Counterfactual inference allows us to create hypothetical scenarios to examine the effects of alternative system…

Human-Computer Interaction · Computer Science 2025-05-29 Donghuo Zeng , Roberto Legaspi , Yuewen Sun , Xinshuai Dong , Kazushi Ikeda , Peter Spirtes , Kun Zhang
‹ Prev 1 8 9 10 Next ›