English
Related papers

Related papers: Provenance Analysis and Semiring Semantics for Fir…

200 papers

We study the status of preservation theorems such as the {\L}o\'s-Tarski theorem and the homomorphism preservation theorem in the context of semiring semantics. Semiring semantics has its origins in the provenance analysis of database…

Logic in Computer Science · Computer Science 2026-05-12 Sophie Brinke , Anuj Dawar , Erich Grädel , Benedikt Pago

In some contexts, well-formed natural language cannot be expected as input to information or communication systems. In these contexts, the use of grammar-independent input (sequences of uninflected semantic units like e.g.…

Computation and Language · Computer Science 2007-05-23 Pascal Vaillant

Data analytics often involves hypothetical reasoning: repeatedly modifying the data and observing the induced effect on the computation result of a data-centric application. Recent work has proposed to leverage ideas from data provenance…

Databases · Computer Science 2020-07-13 Daniel Deutch , Yuval Moskovitch , Noam Rinetzky

In Apt and Bezem [AB99] (see cs.LO/9811017) we provided a computational interpretation of first-order formulas over arbitrary interpretations. Here we complement this work by introducing a denotational semantics for first-order logic.…

Programming Languages · Computer Science 2007-05-23 Krzysztof R. Apt

Large language models are increasingly customized through fine-tuning and other adaptations, creating challenges in enforcing licensing terms and managing downstream impacts. Tracking model origins is crucial both for protecting…

Cryptography and Security · Computer Science 2025-10-31 Ivica Nikolic , Teodora Baluta , Prateek Saxena

We will investigate proof-theoretic and linguistic aspects of first-order linear logic. We will show that adding partial order constraints in such a way that each sequent defines a unique linear order on the antecedent formulas of a sequent…

Logic in Computer Science · Computer Science 2020-08-17 Richard Moot

Properties expressed as the provability of a first-order sentence can be disproved by just finding a model of the negation of the sentence. This fact, however, is meaningful in restricted cases only, depending on the shape of the sentence…

Programming Languages · Computer Science 2017-09-18 Salvador Lucas

Semi-algebraic proof systems such as sum-of-squares (SoS) have attracted a lot of attention recently due to their relation to approximation algorithms: constant degree semi-algebraic proofs lead to conjecturally optimal polynomial-time…

Logic in Computer Science · Computer Science 2021-05-20 Fedor Part , Neil Thapen , Iddo Tzameret

For data-centric systems, provenance tracking is particularly important when the system is open and decentralised, such as the Web of Linked Data. In this paper, a concise but expressive calculus which models data updates is presented. The…

Distributed, Parallel, and Cluster Computing · Computer Science 2012-08-24 Gabriel Ciobanu , Ross Horne

To answer database queries over incomplete data the gold standard is finding certain answers: those that are true regardless of how incomplete data is interpreted. Such answers can be found efficiently for conjunctive queries and their…

Databases · Computer Science 2023-10-20 Amélie Gheerbrant , Leonid Libkin , Alexandra Rogova , Cristina Sirangelo

Call a semantics for a language with variables absolute when variables map to fixed entities in the denotation. That is, a semantics is absolute when the denotation of a variable a is a copy of itself in the denotation. We give a trio of…

Logic in Computer Science · Computer Science 2026-04-20 Murdoch J. Gabbay

Many theorems of mathematics have the form that for a certain problem, e.g. a differential equation or polynomial (in)equality, there exists a solution. The sequential version then states that for a sequence of problems, there is a sequence…

Logic · Mathematics 2024-03-21 Dag Normann , Sam Sanders

A first-order conditional logic is considered, with semantics given by a variant of epsilon-semantics, where p -> q means that Pr(q | p) approaches 1 super-polynomially --faster than any inverse polynomial. This type of convergence is…

Cryptography and Security · Computer Science 2008-12-18 Joseph Y. Halpern

Classical algorithms for query optimization presuppose the absence of inconsistencies or uncertainties in the database and exploit only valid semantic knowledge provided, e.g., by integrity constraints. Data inconsistency or uncertainty,…

Databases · Computer Science 2014-05-05 Federica Panella

We investigate neg(ation)-raising inferences, wherein negation on a predicate can be interpreted as though in that predicate's subordinate clause. To do this, we collect a large-scale dataset of neg-raising judgments for effectively all…

Computation and Language · Computer Science 2019-10-18 Hannah Youngeun An , Aaron Steven White

Analytic provenance can be visually encoded to help users track their ongoing analysis trajectories, recall past interactions, and inform new analytic directions. Despite its significance, provenance is often hardwired into analytics…

Human-Computer Interaction · Computer Science 2025-05-20 Arpit Narechania , Shunan Guo , Eunyee Koh , Alex Endert , Jane Hoffswell

Modern AI systems are complex workflows containing multiple components and data sources. Data provenance provides the ability to interrogate and potentially explain the outputs of these systems. However, provenance is often too detailed and…

Human-Computer Interaction · Computer Science 2025-07-25 Jan-Christoph Kalo , Fina Polat , Shubha Guha , Paul Groth

Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus involving induction and co-induction. These proof principles…

Logic in Computer Science · Computer Science 2010-10-01 Alwen Tiu , Alberto Momigliano

Provenance encodes information that connects datasets, their generation workflows, and associated metadata (e.g., who or when executed a query). As such, it is instrumental for a wide range of critical governance applications (e.g.,…

Reasoning semantically in first-order logic is notoriously a challenge. This paper surveys a selection of semantically-guided or model-based methods that aim at meeting aspects of this challenge. For first-order logic we touch upon…

Artificial Intelligence · Computer Science 2019-11-22 Maria Paola Bonacina , Ulrich Furbach , Viorica Sofronie-Stokkermans