A theoretical framework for knowledge-based entity resolution
DOI10.1016/j.tcs.2014.06.030zbMath1360.68822OpenAlexW2061162567MaRDI QIDQ402127
Klaus-Dieter Schewe, Qing Wang
Publication date: 27 August 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.06.030
knowledge representationquery evaluationentity resolutionquery containmentdata matchingknowledge optimizationrecord linkage
Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Knowledge representation (68T30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decidable containment of recursive queries
- Information integration using logical views
- On conjunctive queries containing inequalities
- Equivalences Among Relational Expressions with the Union and Difference Operators
- Equivalence of Datalog queries is undecidable
- Equivalences among Relational Expressions
- Learning object identification rules for information integration
- Data mining. Concepts and techniques
This page was built for publication: A theoretical framework for knowledge-based entity resolution