相关论文: Corrigendum to "Counting Database Repairs that Sat…
We study the problem of consistent query answering under primary key violations. In this setting, the relations in a database violate the key constraints and we are interested in maximal subsets of the database that satisfy the constraints,…
In this paper we consider two points of views to the problem of coherent integration of distributed data. First we give a pure model-theoretic analysis of the possible ways to `repair' a database. We do so by characterizing the…
Unfortunately, some proofs in the first version of this paper were incorrect. In this revised version, some minor gaps are fixed, one serious mistake found. The main theorem is now claimed only under a restrictive technical assumption. This…
Large-scale Text-to-SQL benchmarks such as BIRD typically assume complete and accurate database annotations as well as readily available external knowledge, which fails to reflect common industrial settings where annotations are missing,…
We make a few comments on some misleading statements in the above paper.
In this note, we demonstrate that an incorrect statement has been propagated in multiple papers, stemming from the substitution of ``lim'' with ``limsup'' for a sequence in Lemma 1.3 of the paper [J. Schu: Weak and strong convergence to…
In the paper [Hong-Shi Zong, Wei-Min Sun, Phys. Lett. B 640 (2006) 196], the authors claim that our proof of the inconsistency of the ladder approximation to QCD [Phys. Lett. B 611 (2005) 129] was incorrect. However, their claim is based on…
For each $n\in\mathbb{N}$, let $[n]\phi$ mean "the sentence $\phi$ is true in all $\Sigma_{n+1}$-correct transitive sets." Assuming G\"odel's axiom $V = L$, we prove the following graded variant of Solovay's completeness theorem: the set of…
Instruction-tuned large language models produce helpful, structured responses, but how robust is this helpfulness under trivial constraints? We show that simple lexical constraints (banning a single punctuation character or common word)…
Since 2005, significant progress has been made in the problem of Consistent Query Answering (CQA) with respect to primary keys. In this problem, the input is a database instance that may violate one or more primary key constraints. A repair…
This comment is devoted to the paper "Exact solutions of nonlinear diffusion-convection-reaction equation: A Lie symmetry approach" (CNSNS, vol. 67 (2019), 253-263) in which several results are not new because were derived much earlier.…
In this note we rectify the proof of Theorem 3.11 in [arXiv:2403.02876]. We also present a set of examples at the end discussing various cases.
Conjunctive queries are basic and heavily studied database queries; in relational algebra, they are the select-project-join queries. In this article, we study the fundamental problem of counting, given a conjunctive query and a relational…
The mechanisms underlying scientific confabulation in Large Language Models (LLMs) remain poorly understood. We introduce ReFACT (Reddit False And Correct Texts), a benchmark of 1,001 expert-annotated question-answer pairs with span-level…
Retrieval-augmented large language models (LLMs) have demonstrated efficacy in knowledge-intensive tasks such as open-domain QA, addressing inherent challenges in knowledge update and factual inadequacy. However, inconsistencies between…
The material presented in this paper contributes to establishing a basis deemed essential for substantial progress in Automated Deduction. It identifies and studies global features in selected problems and their proofs which offer the…
We present two proofs each, all shorter than the original proofs, of two elegant combinatorial identities that came up in the beautiful article arXiv:2010.00077 .
Consistent query answering is the problem of computing the answers from a database that are consistent with respect to certain integrity constraints that the database as a whole may fail to satisfy. Those answers are characterized as those…
Although empirical studies have confirmed the effectiveness of spectrum-based fault localization (SBFL) techniques, their performance may be degraded due to presence of some undesired circumstances such as the existence of coincidental…
The Lovasz Local Lemma [EL75] is a powerful tool to non-constructively prove the existence of combinatorial objects meeting a prescribed collection of criteria. In his breakthrough paper [Bec91], Beck demonstrated that a constructive…