A Framework for Combining Entity Resolution and Query Answering in Knowledge Bases
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.
Code (0)
등록된 구현이 없습니다.
Tasks
AttributeEntity ResolutionSimilar Papers 제목 키워드 기반
Multi-Module System for Open Domain Chinese Question Answering over Knowledge Base
For the task of open domain Knowledge Based Question Answering in CCKS2019, we propose a method combining information retrieval and semantic parsing. This multi-module system extracts the topic entity and the most relate…
Information RetrievalQuestion AnsweringRelationRetrieval+1The Pipeline Model for Resolution of Anaphoric Reference and Resolution of Entity Reference
The objective of anaphora resolution in dialogue shared-task is to go above and beyond the simple cases of coreference resolution in written text on which NLP has mostly focused so far, which arguably overestimate the pe…
coreference-resolutionCoreference ResolutionReferring ExpressionSimplifying Data Integration: SLM-Driven Systems for Unified Semantic Queries Across Heterogeneous Databases
The integration of heterogeneous databases into a unified querying framework remains a critical challenge, particularly in resource-constrained environments. This paper presents a novel Small Language Model(SLM)-driven s…
Data IntegrationLanguage ModelingLanguage ModellingQuestion Answering+4Leveraging Frequent Query Substructures to Generate Formal Queries for Complex Question Answering
Formal query generation aims to generate correct executable queries for question answering over knowledge bases (KBs), given entity and relation linking results. Current approaches build universal paraphrasing or ranking…
Question AnsweringRelationRelation LinkingGoal-Driven Query Answering for Existential Rules with Equality
Inspired by the magic sets for Datalog, we present a novel goal-driven approach for answering queries over terminating existential rules with equality (aka TGDs and EGDs). Our technique improves the performance of query …