English
Related papers

Related papers: Deontic Paradoxes in Library Lending Regulations: …

200 papers

Language models (LMs) are said to be exhibiting reasoning, but what does this entail? We assess definitions of reasoning and how key papers in the field of natural language processing (NLP) use the notion and argue that the definitions…

Computation and Language · Computer Science 2025-11-18 Bertram Højer

Background and Context. The increasing integration of large language models (LLMs) in computing education presents an emerging challenge in understanding how students use LLMs and craft prompts to solve computational tasks. Prior research…

The prevailing approach to distilling reasoning from Large Language Models (LLMs)-behavioral cloning from textual rationales-is fundamentally limited. It teaches Small Language Models (SLMs) to mimic surface-level patterns rather than the…

Artificial Intelligence · Computer Science 2025-10-02 Xiangyu Wen , Junhua Huang , Zeju Li , Min Li , Jianyuan Zhong , Zhijian Xu , Mingxuan Yuan , Yongxiang Huang , Qiang Xu

One major deficiency of most semantic representation techniques is that they usually model a word type as a single point in the semantic space, hence conflating all the meanings that the word can have. Addressing this issue by learning…

Computation and Language · Computer Science 2016-08-08 Mohammad Taher Pilehvar , Nigel Collier

Normative texts are documents based on the deontic notions of obligation, permission, and prohibition. Our goal is to model such texts using the C-O Diagram formalism, making them amenable to formal analysis, in particular verifying that a…

Computation and Language · Computer Science 2016-07-07 John J. Camilleri , Normunds Gruzitis , Gerardo Schneider

Permissive-Nominal Logic (PNL) extends first-order predicate logic with term-formers that can bind names in their arguments. It takes a semantics in (permissive-)nominal sets. In PNL, the forall-quantifier or lambda-binder are just…

Logic in Computer Science · Computer Science 2023-12-29 Gilles Dowek , Murdoch J. Gabbay

The ability of Large Language Models (LLMs) to perform reasoning tasks such as deduction has been widely investigated in recent years. Yet, their capacity to generate proofs-faithful, human-readable explanations of why conclusions…

Artificial Intelligence · Computer Science 2026-01-21 Hui Yang , Jiaoyan Chen , Uli Sattler

Language evolves over time in many ways relevant to natural language processing tasks. For example, recent occurrences of tokens 'BERT' and 'ELMO' in publications refer to neural network architectures rather than persons. This type of…

Computation and Language · Computer Science 2019-11-25 Johannes Bjerva , Wouter Kouw , Isabelle Augenstein

Many writers have observed that default logics appear to contain the "lottery paradox" of probability theory. This arises when a default "proof by contradiction" lets us conclude that a typical X is not a Y where Y is an unusual subclass of…

Artificial Intelligence · Computer Science 2013-04-08 Eric Neufeld , J. D. Horton

Legal judgment prediction is essential for enhancing judicial efficiency. In this work, we identify that existing large language models (LLMs) underperform in this domain due to challenges in understanding case complexities and…

Computation and Language · Computer Science 2024-08-07 Chenlong Deng , Kelong Mao , Yuyao Zhang , Zhicheng Dou

Large Language Models (LLMs) have demonstrated significant promise in formal theorem proving. In this study, we investigate the ability of LLMs to discover novel theorems and produce verified proofs. We propose a pipeline called…

Machine Learning · Computer Science 2026-05-07 Kazumi Kasaura , Naoto Onda , Yuta Oriike , Masaya Taniguchi , Akiyoshi Sannai , Sho Sonoda

The dissertation addresses the design of parsing grammars for automatic surface-syntactic analysis of unconstrained English text. It consists of a summary and three articles. {\it Morphological disambiguation} documents a grammar for…

cmp-lg · Computer Science 2008-02-03 Atro Voutilainen

Formal reasoning with non-denoting terms, esp. non-referring descriptions such as "the King of France", is still an under-investigated area. The recent exception being a series of papers e.g. by Indrzejczak, Zawidzki and K\"rbis. The…

Logic in Computer Science · Computer Science 2025-01-03 Jiří Raclavský

This paper discusses the semantics and proof theory of Nilsson's probabilistic logic, outlining both the benefits of its well-defined model theory and the drawbacks of its proof theory. Within Nilsson's semantic framework, we derive a set…

Artificial Intelligence · Computer Science 2013-04-11 Peter Haddawy , Alan M. Frisch

The theory of limits of discrete combinatorial objects has been thriving for the last decade or so. The syntactic, algebraic approach to the subject is popularly known as "flag algebras", while the semantic, geometric one is often…

Combinatorics · Mathematics 2020-12-02 Leonardo N. Coregliano , Alexander A. Razborov

The success of neural networks on a diverse set of NLP tasks has led researchers to question how much these networks actually ``know'' about natural language. Probes are a natural way of assessing this. When probing, a researcher chooses a…

Computation and Language · Computer Science 2020-05-26 Tiago Pimentel , Josef Valvoda , Rowan Hall Maudslay , Ran Zmigrod , Adina Williams , Ryan Cotterell

An interpretable system for open-domain reasoning needs to express its reasoning process in a transparent form. Natural language is an attractive representation for this purpose -- it is both highly expressive and easy for humans to…

Computation and Language · Computer Science 2021-09-10 Kaj Bostrom , Xinyu Zhao , Swarat Chaudhuri , Greg Durrett

This article presents a formalism inspired by Dennett's notion of the intentional stance. Whereas Dennett's treatment of these concepts is informal, we aim to provide a more formal analogue. We introduce a framework based on stochastic…

Optimization and Control · Mathematics 2025-01-10 Simon McGregor , timorl , Nathaniel Virgo

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

Web resources in linked open data (LOD) are comprehensible to humans through literal textual values attached to them, such as labels, notes, or comments. Word choices in literals may not always be neutral. When outdated and culturally…

Computation and Language · Computer Science 2023-11-21 Andrei Nesterov , Laura Hollink , Jacco van Ossenbruggen
‹ Prev 1 8 9 10 Next ›