English
Related papers

Related papers: Focus on ``only" and ``Not"

200 papers

An earlier paper gives an account of a quest for a satisfactory formalization of the classical informal notion of an algorithm. That notion only covers algorithms that are deterministic and non-interactive. In this paper, an attempt is made…

Computational Complexity · Computer Science 2025-11-11 C. A. Middelburg

Framing involves the positive or negative presentation of an argument or issue depending on the audience and goal of the speaker (Entman 1983). Differences in lexical framing, the focus of our work, can have large effects on peoples'…

Computation and Language · Computer Science 2021-04-13 Tuhin Chakrabarty , Christopher Hidey , Smaranda Muresan

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…

Computation and Language · Computer Science 2023-06-16 Vincent Segonne , Timothee Mickus

Approaching limitations of digital computing technologies have spurred research in neuromorphic and other unconventional approaches to computing. Here we argue that if we want to systematically engineer computing systems that are based on…

Emerging Technologies · Computer Science 2023-08-21 Herbert Jaeger , Beatriz Noheda , Wilfred G. van der Wiel

New models for natural language understanding have recently made an unparalleled amount of progress, which has led some researchers to suggest that the models induce universal text representations. However, current benchmarks are…

Computation and Language · Computer Science 2022-04-05 Damien Sileo , Tim Van-de-Cruys , Camille Pradel , Philippe Muller

The notion of argumentation and the one of belief stand in a problematic relation to one another. On the one hand, argumentation is crucial for belief formation: as the outcome of a process of arguing, an agent might come to (justifiably)…

Logic in Computer Science · Computer Science 2021-06-23 Alfredo Burrieza , Antonio Yuste-Ginel

Interpretation methods and their restrictions to polynomials have been deeply used to control the termination and complexity of first-order term rewrite systems. This paper extends interpretation methods to a pure higher order functional…

Logic in Computer Science · Computer Science 2023-06-22 Emmanuel Hainry , Romain Péchoux

In the quest to give a formal compositional semantics to natural languages, semanticists have started turning their attention to phenomena that have been also considered as parts of pragmatics (e.g., discourse anaphora and presupposition…

Computation and Language · Computer Science 2015-06-19 Jiri Marsik , Maxime Amblard

We consider modeling the conception of knowledge in terms of temporal logic. The study of knowledge logical operations is originated around 1962 by representation of knowledge and belief using modalities. Nowadays, it is very good…

Logic in Computer Science · Computer Science 2014-05-06 Vladimir Rybakov

We develop librationism, {\pounds}, and clarify some mathematical and philosophical matters which relate to the particular manner in which it deals with the paradoxes and to its usefulness as a foundation for mathematics and type free…

Logic · Mathematics 2015-08-05 Frode Bjørdal

These are lecture notes on the algebraic approach to regular languages. The classical algebraic approach is for finite words; it uses semigroups instead of automata. However, the algebraic approach can be extended to structures beyond…

Formal Languages and Automata Theory · Computer Science 2020-08-27 Mikołaj Bojańczyk

Interpretation is not the only way to explain a theory's success, form and features, and nor is it the only way to solve problems we see with a theory. This can also be done by giving a reductive explanation of the theory, by reference to a…

History and Philosophy of Physics · Physics 2025-12-17 Karen Crowther

Without an agreed-upon definition of intelligence, asking "is this system intelligent?"" is an untestable question. This lack of consensus hinders research, and public perception, on Artificial Intelligence (AI), particularly since the rise…

Artificial Intelligence · Computer Science 2023-12-18 Warisa Sritriratanarak , Paulo Garcia

This article shows a correspondence between abstract interpretation of imperative programs and the refinement calculus: in the refinement calculus, an abstract interpretation of a program is a specification which is a function. This…

Programming Languages · Computer Science 2014-06-16 Arnaud Spiwack

We unify functional and logic programming by treating predicatesas functions equipped with their support: the set of inputs whose output is nonzero. Datalog, for instance, is a language of finitely supported boolean functions. Finite…

Programming Languages · Computer Science 2026-04-30 Michael Arntzenius , Max Willsey

Belief revision has been studied mainly with respect to background logics that are monotonic in character. In this paper we study belief revision when the underlying logic is non-monotonic instead--an inherently interesting problem that is…

Artificial Intelligence · Computer Science 2016-04-05 Zhiqiang Zhuang , James Delgrande , Abhaya Nayak , Abdul Sattar

As a supplement to my talk at the workshop, this extended abstract motivates and summarizes my work with co-authors on problems in two separate areas: first, in the lambda-calculus with letrec, a universal model of computation, and second,…

Logic in Computer Science · Computer Science 2024-10-02 Clemens Grabmayer

The control function approach allows the researcher to identify various causal effects of interest. While powerful, it requires a strong invertibility assumption in the selection process, which limits its applicability. This paper expands…

Econometrics · Economics 2026-04-28 Sukjin Han , Hiroaki Kaido

This article surveys work done in the last six years on the unification of various functional interpretations including G\"odel's dialectica interpretation, its Diller-Nahm variant, Kreisel modified realizability, Stein's family of…

Logic · Mathematics 2014-10-17 Paulo Oliva

This paper argues that an interlingual representation must explicitly represent some parts of the meaning of a situation as possibilities (or preferences), not as necessary or definite components of meaning (or constraints). Possibilities…

Computation and Language · Computer Science 2007-05-23 Philip Edmonds
‹ Prev 1 4 5 6 7 8 10 Next ›