中文
相关论文

相关论文: The "Fodor"-FODOR fallacy bites back

200 篇论文

Definition Modeling, the task of generating definitions, was first proposed as a means to evaluate the semantic quality of word embeddings-a coherent lexical semantic representations of a word in context should contain all the information…

计算与语言 · 计算机科学 2023-06-16 Vincent Segonne , Timothee Mickus

This paper aims to provide an analysis of what it means when we say that a pair of theories, very generously construed, are equivalent in the sense that they are interdefinable. With regard to theories articulated in first order logic, we…

逻辑 · 数学 2025-11-05 Toby Meadows

This paper discusses the representation of ontologies in the first-order logical environment {\ttfamily FOLE}. An ontology defines the primitives with which to model the knowledge resources for a community of discourse. These primitives…

数据库 · 计算机科学 2023-04-25 Robert E. Kent

As machine learning and algorithmic decision making systems are increasingly being leveraged in high-stakes human-in-the-loop settings, there is a pressing need to understand the rationale of their predictions. Researchers have responded to…

机器学习 · 计算机科学 2020-12-07 Jonathan Dinu , Jeffrey Bigham , J. Zico Kolter

It is well known that the resolution method (for propositional logic) is complete. However, completeness proofs found in the literature use an argument by contradiction showing that if a set of clauses is unsatisfiable, then it must have a…

计算机科学中的逻辑 · 计算机科学 2017-01-11 Jean Gallier

This paper develops a new approach to computational argumentation that is informed by philosophical and linguistic views. Namely, it takes into account two ideas that have received little attention in the literature on computational…

人工智能 · 计算机科学 2026-02-04 Michael A. Müller , Srdjan Vesic , Bruno Yun

This paper combines two studies: a topological semantics for epistemic notions and abstract argumentation theory. In our combined setting, we use a topological semantics to represent the structure of an agent's collection of evidence, and…

人工智能 · 计算机科学 2017-07-28 Chenwei Shi , Sonja Smets , Fernando R. Velázquez-Quesada

Compact closed categories have found applications in modeling quantum information protocols by Abramsky-Coecke. They also provide semantics for Lambek's pregroup algebras, applied to formalizing the grammatical structure of natural…

计算与语言 · 计算机科学 2014-05-13 Dimitri Kartsaklis , Mehrnoosh Sadrzadeh , Stephen Pulman , Bob Coecke

We extend description logics (DLs) with non-monotonic reasoning features. We start by investigating a notion of defeasible subsumption in the spirit of defeasible conditionals as studied by Kraus, Lehmann and Magidor in the propositional…

人工智能 · 计算机科学 2019-04-17 Katarina Britz , Giovanni Casini , Thomas Meyer , Kody Moodley , Uli Sattler , Ivan Varzinczak

Using Pustejovsky's "The Syntax of Event Structure" and Fong's "On Mending a Torn Dress" we give a glimpse of a Pustejovsky-like analysis to some example sentences in Fong. We attempt to give a framework for semantics to the noun phrases…

计算与语言 · 计算机科学 2010-02-05 Serguei A. Mokhov

Wittgenstein's paradoxical theses that unproved propositions are meaningless, proofs form new concepts and rules, and contradictions are of limited concern, led to a variety of interpretations, most of them centered on the rule-following…

历史与综述 · 数学 2022-06-24 Sergiy Koshkin

AI Scientists have shown promising progress across multiple stages of the research pipeline, among which automatic scientific paper writing remains a formidable challenge. The Introduction writing is especially challenging, which demands…

人工智能 · 计算机科学 2026-05-26 Jiabei Xiao , Yizhou Wang , Chen Tang , Pengze Li , Wanli Ouyang , Shixiang Tang

Algorithms of inference in a computer system oriented to input and semantic processing of text information are presented. Such inference is necessary for logical questions when the direct comparison of objects from a question and database…

计算与语言 · 计算机科学 2012-02-02 Yuriy Ostapov

The Bodirsky-Pinsker conjecture asserts a P vs. NP-complete dichotomy for the computational complexity of Constraint Satisfaction Problems (CSPs) of first-order reducts of finitely bounded homogeneous structures. Prominently, two structures…

逻辑 · 数学 2026-02-03 Roman Feller , Michael Pinsker

The word "complexity" is most often used as a meta--linguistic expression referring to certain intuitive characteristics of a natural system and/or its scientific description. These characteristics may include: sheer amount of data that…

历史与综述 · 数学 2013-01-03 Yuri I. Manin

(l) I have enough evidence to render the sentence S probable. (la) So, relative to what I know, it is rational of me to believe S. (2) Now that I have more evidence, S may no longer be probable. (2a) So now, relative to what I know, it is…

人工智能 · 计算机科学 2016-11-26 Henry E. Kyburg

This paper focusses on mental state adjectives and offers a unified analysis in the theory of Generative Lexicon (Pustejovsky, 1991, 1995). We show that, instead of enumerating the various syntactic constructions they enter into, with the…

cmp-lg · 计算机科学 2008-02-03 Pierrette Bouillon

The notion of concept has been studied for centuries, by philosophers, linguists, cognitive scientists, and researchers in artificial intelligence (Margolis & Laurence, 1999). There is a large literature on formal, mathematical models of…

Can a machine understand the meanings of natural language? Recent developments in the generative large language models (LLMs) of artificial intelligence have led to the belief that traditional philosophical assumptions about machine…

计算与语言 · 计算机科学 2023-10-27 Vladimír Havlík

Large language models (LLMs) are widely described as artificial intelligence, yet their epistemic profile diverges sharply from human cognition. Here we show that the apparent alignment between human and machine outputs conceals a deeper…

计算机与社会 · 计算机科学 2025-12-23 Walter Quattrociocchi , Valerio Capraro , Matjaž Perc