Related papers: Corrigendum to "Counting Database Repairs that Sat…
Recent work in database query optimization has used complex machine learning strategies, such as customized reinforcement learning schemes. Surprisingly, we show that LLM embeddings of query text contain useful semantic information for…
The property 4 in Proposition 2.3 from the paper "Some remarks on Davie's uniqueness theorem" is replaced with a weaker assertion which is sufficient for the proof of the main results. Technical details and improvements are given.
Some errors in section 4 are corrected. No change in the results.
We consider the following fundamental problem: given a database D, Boolean conjunctive query (CQ) q, and fact f in D, decide whether f is relevant to q wrt. D, i.e., does f belong to a minimal subset S of D such that S |= q. Despite being…
We prove that the Arithmetic Fundamental Lemma conjecture of Wei Zhang is equivalent to a similar conjecture, but for Lie algebras, in the case of non-degenerate intersection. We use this result to give a simplified proof of the AFL for…
The aim of this paper is to give a corrected bijective proof of Vershik's relations for the Kostka numbers. Our proof uses insertion and reverse insertion algorithms, as in the combinatorial proof of the Pieri rule.
The main objective of this work is to show, through counterexamples, that some of the theorems presented in the papers of Sharma \textit{et al.} (2018) and Chauhan \textit{et al.} ( 2021) are incorrect. Although they used these theorems to…
We consider the dichotomy conjecture for consistent query answering under primary key constraints. It states that, for every fixed Boolean conjunctive query q, testing whether q is certain (i.e. whether it evaluates to true over all repairs…
The increasing prevalence of online misinformation has heightened the demand for automated fact-checking solutions. Large Language Models (LLMs) have emerged as potential tools for assisting in this task, but their effectiveness remains…
This is a corrected version of our paper published in Osaka Journal of Mathematics 51(2014), 673-693. We correct Theorem~1.1, Proposition~3.3 and their proofs.
This paper is withdrawn. We found a mistake in Lemma 4.1
In this note, we correct an oversight from the paper mentioned in the title.
Fact-checking the truthfulness of claims usually requires reasoning over multiple evidence sentences. Oftentimes, evidence sentences may not be always self-contained, and may require additional contexts and references from elsewhere to…
Automated fact-checking, using machine learning to verify claims, has grown vital as misinformation spreads beyond human fact-checking capacity. Large Language Models (LLMs) like GPT-4 are increasingly trusted to write academic papers,…
While Wikipedia has been utilized for fact-checking and claim verification to debunk misinformation and disinformation, it is essential to either improve article quality and rule out noisy articles. Self-contradiction is one of the…
In this note we correct two errors in our paper "On the Homology of Completion and Torsion", arXiv:1010.4386, that appeared in Algebras and Representation Theory (2014).
Removing an agent from a cooperative team to measure its contribution seems natural, yet in multi-agent LLM systems this evaluation distorts the result it claims to measure. This failure is not isolated: learned critics, trajectory-level…
Currently, there is a significant amount of research being conducted in the field of artificial intelligence to improve the explainability and interpretability of deep learning models. It is found that if end-users understand the reason for…
It is shown that the arguments in the reply of Z.-D. Zhang (arXiv:0812.0194) to the comment arXiv:0811.1802 defending his conjectures in arXiv:0705.1045 are invalid. His conjectures have been thoroughly disproved.
This paper investigates the reliability of explanations generated by large language models (LLMs) when prompted to explain their previous output. We evaluate two kinds of such self-explanations - extractive and counterfactual - using three…