Consistent query answering over a database that violates primary key constraints is a classical hard problem in database research that has been traditionally dealt with logic programming. However, the applicability of existing logic-based solutions is restricted to data sets of moderate size. This paper presents a novel decomposition and pruning strategy that reduces, in polynomial time, the problem of computing the consistent answer to a conjunctive query over a database subject to primary key constraints to a collection of smaller problems of the same sort that can be solved independently. The new strategy is naturally modeled and implemented using Answer Set Programming (ASP). An experiment run on benchmarks from the database world prove the effectiveness and efficiency of our ASP-based approach also on large data sets. To appear in Theory and Practice of Logic Programming (TPLP), Proceedings of ICLP 2015.
Cost-Based Semantics for Querying Inconsistent Weighted Knowledge Bases
Université de Bordeaux（波尔多大学）；CNRS（法国国家科学研究中心）；Bordeaux INP（波尔多国立综合理工学院）；LaBRI（波尔多计算机科学研究实验室）；Japanese-French Laboratory for Informatics（日法信息学实验室）；NII（日本国立信息学研究所）；DI ENS（巴黎高等师范学院信息学系）；ENS（巴黎高等师范学院）；PSL University（巴黎文理大学）；Inria（法国国家信息与自动化研究所）
A Rule-Based Approach to Specifying Preferences over Conflicting Facts and Querying Inconsistent Knowledge Bases
Univ. Bordeaux（波尔多大学）；CNRS（法国国家科学研究中心）；Bordeaux INP（波尔多国立理工学院）；LaBRI（波尔多计算机科学实验室）；ENS（巴黎高等师范学院）；PSL University（巴黎文理研究大学）；Inria（法国国家信息与自动化研究所）；National Institute of Informatics（国立信息学研究所）
Neuro-Symbolic Recommendation Model based on Logic Query
Huzhou University（湖州师范学院）；Zhejiang Province Key Laboratory of Smart Management and Application of Modern Agricultural Resources（浙江省现代农业资源智慧管理与应用重点实验室）；Guizhou University（贵州大学）；Guizhou Academy of Sciences（贵州科学院）
Computational Complexity of Preferred Subset Repairs on Data-Graphs
University of Sheffield（谢菲尔德大学）；Instituto de Ciencias de la Computación（计算机科学研究所）；Universidad de Buenos Aires（布宜诺斯艾利斯大学）；Artificial Intelligence Research Institute（人工智能研究所）
