English
Related papers

Related papers: A Deductive Account of Quantification in LFG

200 papers

Representations are essential to mathematically model phenomena, but there are many options available. While each of those options provides useful properties with which to solve problems related to the phenomena in study, comparing results…

Logic in Computer Science · Computer Science 2025-10-01 Luke Bayzid , Alexandre Madeira , Manuel A. Martins

We introduce a weighted linear dynamic logic (weighted LDL for short) and show the expressive equivalence of its formulas to weighted rational expressions. This adds a new characterization for recognizable series to the fundamental…

Logic in Computer Science · Computer Science 2016-09-15 Manfred Droste , George Rahonis

Deductive reasoning plays a pivotal role in the formulation of sound and cohesive arguments. It allows individuals to draw conclusions that logically follow, given the truth value of the information provided. Recent progress in the domain…

Computation and Language · Computer Science 2024-06-04 Philipp Mondorf , Barbara Plank

This paper presents a substructural logic of sequents with very restricted exchange and weakening rules. It is sound with respect to sequences of measurements of a quantic system. A sound and complete semantics is provided. The semantic…

Quantum Physics · Physics 2023-07-19 Daniel Lehmann

A prototypical example of categorial grammars are those based on Lambek calculus, i.e. noncommutative intuitionistic linear logic. However, it has been noted that purely noncommutative operations are often not sufficient for modeling even…

Logic · Mathematics 2025-07-16 Sergey Slavnov

As deep neural models in NLP become more complex, and as a consequence opaque, the necessity to interpret them becomes greater. A burgeoning interest has emerged in rationalizing explanations to provide short and coherent justifications for…

Computation and Language · Computer Science 2024-05-21 Neema Kotonya , Francesca Toni

In this survey, we present in a unified way the categorical and syntactical settings of coherent differentiation introduced recently, which shows that the basic ideas of differential linear logic and of the differential lambda-calculus are…

Logic in Computer Science · Computer Science 2024-01-29 Thomas Ehrhard

Logic has proved essential for formally modeling software based systems. Such formal descriptions, frequently called specifications, have served not only as requirements documentation and formalisation, but also for providing the…

Logic in Computer Science · Computer Science 2021-07-20 Carlos G. Lopez Pombo , Thomas S. E. Maibaum

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

A natural next step in the evolution of constraint-based grammar formalisms from rewriting formalisms is to abstract fully away from the details of the grammar mechanism---to express syntactic theories purely in terms of the properties of…

cmp-lg · Computer Science 2008-02-03 James Rogers

We describe several views of the semantics of a simple programming language as formal documents in the calculus of inductive constructions that can be verified by the Coq proof system. Covered aspects are natural semantics, denotational…

Logic in Computer Science · Computer Science 2007-07-10 Yves Bertot

We analyse the expressiveness of the two-valued semantics of abstract argumentation frameworks, normal logic programs and abstract dialectical frameworks. By expressiveness we mean the ability to encode a desired set of two-valued…

Artificial Intelligence · Computer Science 2014-05-06 Hannes Strass

Regular cost functions have been introduced recently as an extension to the notion of regular languages with counting capabilities, which retains strong closure, equivalence, and decidability properties. The specificity of cost functions is…

Logic in Computer Science · Computer Science 2017-02-09 Denis Kuperberg

We firstly show that the standard interpretation of natural quantification in mathematical logic does not provide a satisfying account of its original richness. In particular, it ignores the difference between generic and distributive…

Logic · Mathematics 2011-07-12 Michele Abrusci , Christian Retoré

Sets with atoms serve as an alternative to ZFC foundations for mathematics, where some infinite, though highly symmetric sets, behave in a finitistic way. Therefore, one can try to carry over analysis of the classical algorithms from finite…

Logic in Computer Science · Computer Science 2021-01-26 Michał R. Przybyłek

Dependence logic provides an elegant approach for introducing dependencies between variables into the object language of first-order logic. In [1] generalized quantifiers were introduced in this context. However, a satisfactory account was…

Logic · Mathematics 2024-04-29 Fredrik Engström

This work presents a novel systematic methodology to analyse the capabilities and limitations of Large Language Models (LLMs) with feedback from a formal inference engine, on logic theory induction. The analysis is complexity-graded w.r.t.…

Computation and Language · Computer Science 2025-01-15 João Pedro Gandarela , Danilo S. Carvalho , André Freitas

The framework of quantitative equational logic has been successfully applied to reason about algebras whose carriers are metric spaces and operations are nonexpansive. We extend this framework in two orthogonal directions: algebras endowed…

Logic in Computer Science · Computer Science 2022-01-25 Matteo Mio , Ralph Sarkis , Valeria Vignudelli

The main purpose of this paper is to give characterization theorems on derivations as well as on linear functions. Among others the following problem will be investigated: Let $n\in\mathbb{Z}$, $f, g\colon\mathbb{R}\to\mathbb{R}$ be…

Classical Analysis and ODEs · Mathematics 2013-07-03 Eszter Gselmann

This paper introduces an abstract notion of fragments of monadic second-order logic. This concept is based on purely syntactic closure properties. We show that over finite words, every logical fragment defines a lattice of languages with…

Formal Languages and Automata Theory · Computer Science 2015-03-20 Manfred Kufleitner , Alexander Lauser
‹ Prev 1 8 9 10 Next ›