Affiliation:
1. University of Trento
2. University of Calabria
Abstract
Query answering over inconsistent knowledge bases is a problem that has attracted a great deal of interest over the years.
Different inconsistency-tolerant semantics have been proposed, and most of them are based on the notion of repair, that is, a "maximal" consistent subset of the database.
In general, there can be several repairs, so it is often natural and desirable to express preferences among them.
In this paper, we propose a framework for querying inconsistent knowledge bases under user preferences for existential rule languages.
We provide generalizations of popular inconsistency-tolerant semantics taking preferences into account and study the data and combined complexity of different relevant problems.
Publisher
International Joint Conferences on Artificial Intelligence Organization
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The MICS Project: A Data Science Pipeline for Industry 4.0 Applications;2023 IEEE International Conference on Metrology for eXtended Reality, Artificial Intelligence and Neural Engineering (MetroXRAINE);2023-10-25
2. Consistent query answering with prioritized active integrity constraints;Proceedings of the 24th Symposium on International Database Engineering & Applications;2020-08-12