Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

LACE: A Logical Approach to Collective Entity resolution

Bienvenu, Meghyn, Cima, Gianluca and Gutierrez Basulto, Victor ORCID: https://orcid.org/0000-0002-6117-5459 2022. LACE: A Logical Approach to Collective Entity resolution. Presented at: 41st ACM SIGMOD/PODS International Conference on Management of Data 2022, Philadelphia, PA, United States, 12-17 June 2022. Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. New York, NY, US: Association for Computing Machinery, pp. 379-391. 10.1145/3517804.3526233

[thumbnail of main.pdf]
Preview
PDF - Accepted Post-Print Version
Download (647kB) | Preview

Abstract

In this paper, we revisit the problem of entity resolution and propose a novel, logical framework, LACE, which mixes declarative and procedural elements to achieve a number of desirable properties. Our approach is fundamentally declarative in nature: it utilizes hard and soft rules to specify conditions under which pairs of entity references must or may be merged, together with denial constraints that enforce consistency of the resulting instance. Importantly, however, rule bodies are evaluated on the instance resulting from applying the already 'derived' merges. It is the dynamic nature of our semantics that enables us to capture collective entity resolution scenarios, where merges can trigger further merges, while at the same time ensuring that every merge can be justified. As the denial constraints restrict which merges can be performed together, we obtain a space of (maximal) solutions, from which we can naturally define notions of certain and possible merges and query answers. We explore the computational properties of our framework and determine the precise computational complexity of the relevant decision problems. Furthermore, as a first step towards implementing our approach, we demonstrate how we can encode the various reasoning tasks using answer set programming.

Item Type: Conference or Workshop Item (Paper)
Date Type: Publication
Status: Published
Schools: Schools > Computer Science & Informatics
Publisher: Association for Computing Machinery
ISBN: 9781450392600
Funders: Royal Society (IES\R3\193236)
Date of First Compliant Deposit: 8 April 2022
Date of Acceptance: 12 March 2022
Last Modified: 21 May 2025 14:56
URI: https://orca.cardiff.ac.uk/id/eprint/149114

Citation Data

Cited 5 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item Edit Item

Downloads

Downloads per month over past year

View more statistics