A Framework for Combining Entity Resolution and Query Answering in Knowledge Bases

• URL: http://arxiv.org/abs/2303.07469v1
• Date: Mon, 13 Mar 2023 21:10:57 GMT
• Title: A Framework for Combining Entity Resolution and Query Answering in Knowledge Bases
• Authors: Ronald Fagin, Phokion G. Kolaitis, Domenico Lembo, Lucian Popa, Federico Scafoglieri
• Abstract summary: We propose a new framework for entity resolution and query answering in knowledge bases. We define the semantics of the KB in terms of special instances that involve equivalence classes of entities and sets of values. We then design a chase procedure that is tailored to this new framework and has the feature that it never fails.
• Score: 13.700646439200423
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We propose a new framework for combining entity resolution and query answering in knowledge bases (KBs) with tuple-generating dependencies (tgds) and equality-generating dependencies (egds) as rules. We define the semantics of the KB in terms of special instances that involve equivalence classes of entities and sets of values. Intuitively, the former collect all entities denoting the same real-world object, while the latter collect all alternative values for an attribute. This approach allows us to both resolve entities and bypass possible inconsistencies in the data. We then design a chase procedure that is tailored to this new framework and has the feature that it never fails; moreover, when the chase procedure terminates, it produces a universal solution, which in turn can be used to obtain the certain answers to conjunctive queries. We finally discuss challenges arising when the chase does not terminate.

Related papers

• Graph-based RAG Enhancement via Global Query Disambiguation and Dependency-Aware Reranking [9.280502741892676]
  PankRAG is a globally aware, hierarchical query-resolution strategy with a novel dependency-aware reranking mechanism.<n>It applies its dependency-aware reranker to exploit the dependency structure among resolved sub-questions.<n>PankRAG consistently outperforms state-of-the-art approaches across multiple benchmarks.
  arXiv  Detail & Related papers  (2025-06-07T07:17:14Z)
• UniversalRAG: Retrieval-Augmented Generation over Multiple Corpora with Diverse Modalities and Granularities [53.76854299076118]
  UniversalRAG is a novel RAG framework designed to retrieve and integrate knowledge from heterogeneous sources with diverse modalities and granularities. We propose a modality-aware routing mechanism that dynamically identifies the most appropriate modality-specific corpus and performs targeted retrieval within it. We validate UniversalRAG on 8 benchmarks spanning multiple modalities, showing its superiority over modality-specific and unified baselines.
  arXiv  Detail & Related papers  (2025-04-29T13:18:58Z)
• CORG: Generating Answers from Complex, Interrelated Contexts [57.213304718157985]
  In a real-world corpus, knowledge frequently recurs across documents but often contains inconsistencies due to ambiguous naming, outdated information, or errors. Previous research has shown that language models struggle with these complexities, typically focusing on single factors in isolation. We introduce Context Organizer (CORG), a framework that organizes multiple contexts into independently processed groups.
  arXiv  Detail & Related papers  (2025-04-25T02:40:48Z)
• Goal-Driven Query Answering over First- and Second-Order Dependencies with Equality [9.880191856609581]
  We present what we believe to be the first technique for goal-driven query answering over first- and second-order dependencies with equality reasoning. Our technique transforms the input dependencies so that applying the chase to the output avoids many inferences that are irrelevant to the query. We also present the results of an extensive empirical evaluation, which show that goal-driven query answering can be orders of magnitude faster than computing the full universal model.
  arXiv  Detail & Related papers  (2024-12-12T10:02:16Z)
• OneNet: A Fine-Tuning Free Framework for Few-Shot Entity Linking via Large Language Model Prompting [49.655711022673046]
  OneNet is an innovative framework that utilizes the few-shot learning capabilities of Large Language Models (LLMs) without the need for fine-tuning. OneNet is structured around three key components prompted by LLMs: (1) an entity reduction processor that simplifies inputs by summarizing and filtering out irrelevant entities, (2) a dual-perspective entity linker that combines contextual cues and prior knowledge for precise entity linking, and (3) an entity consensus judger that employs a unique consistency algorithm to alleviate the hallucination in the entity linking reasoning.
  arXiv  Detail & Related papers  (2024-10-10T02:45:23Z)
• Entity Disambiguation via Fusion Entity Decoding [68.77265315142296]
  We propose an encoder-decoder model to disambiguate entities with more detailed entity descriptions. We observe +1.5% improvements in end-to-end entity linking in the GERBIL benchmark compared with EntQA.
  arXiv  Detail & Related papers  (2024-04-02T04:27:54Z)
• From Instructions to Constraints: Language Model Alignment with Automatic Constraint Verification [70.08146540745877]
  We investigate common constraints in NLP tasks, categorize them into three classes based on the types of their arguments. We propose a unified framework, ACT (Aligning to ConsTraints), to automatically produce supervision signals for user alignment with constraints.
  arXiv  Detail & Related papers  (2024-03-10T22:14:54Z)
• Neural Constraint Satisfaction: Hierarchical Abstraction for Combinatorial Generalization in Object Rearrangement [75.9289887536165]
  We present a hierarchical abstraction approach to uncover underlying entities. We show how to learn a correspondence between intervening on states of entities in the agent's model and acting on objects in the environment. We use this correspondence to develop a method for control that generalizes to different numbers and configurations of objects.
  arXiv  Detail & Related papers  (2023-03-20T18:19:36Z)
• DecAF: Joint Decoding of Answers and Logical Forms for Question Answering over Knowledge Bases [81.19499764899359]
  We propose a novel framework DecAF that jointly generates both logical forms and direct answers. DecAF achieves new state-of-the-art accuracy on WebQSP, FreebaseQA, and GrailQA benchmarks.
  arXiv  Detail & Related papers  (2022-09-30T19:51:52Z)
• Autoregressive Entity Generation for End-to-End Task-Oriented Dialog [24.75603780275969]
  Most current end-to-end TOD systems either retrieve the KB information explicitly or embed it into model parameters for implicit access. In either approach, the systems may generate a response with conflicting entity information. We propose to generate the entity autoregressively first and leverage it to guide the response generation in an end-to-end system.
  arXiv  Detail & Related papers  (2022-09-19T01:49:29Z)
• Parallel Instance Query Network for Named Entity Recognition [73.30174490672647]
  Named entity recognition (NER) is a fundamental task in natural language processing. Recent works treat named entity recognition as a reading comprehension task, constructing type-specific queries manually to extract entities. We propose Parallel Instance Query Network (PIQN), which sets up global and learnable instance queries to extract entities in a parallel manner.
  arXiv  Detail & Related papers  (2022-03-20T13:01:25Z)
• Towards Dynamic Consistency Checking in Goal-directed Predicate Answer Set Programming [2.3204178451683264]
  We present a variation of the top-down evaluation strategy, termed Dynamic Consistency checking. This makes it possible to determine when a literal is not compatible with the denials associated to the global constraints in the program. We have experimentally observed speedups of up to 90x w.r.t. the standard versions of s(CASP)
  arXiv  Detail & Related papers  (2021-10-22T20:38:48Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.