A Paraconsistent Logic Programming Approach for Querying Inconsistent Databases
S. de Amoa, und M. Pais. Proceedings of the 18th International FLAIRS Conference, (2005)
Zusammenfassung
When integrating data coming from multiple different sources we are faced with the possibility of inconsistency in databases. A paraconsistent approach for knowledge base integration allows keeping inconsistent information and reasoning in its presence. In this paper, we use a paraconsistent logic (LFI1) as the underlying logic for the specification of P-Datalog, a deductive query language for databases containing inconsistent information. We present a declarative semantics which captures the desired meaning of a recursive query executed over a database containing inconsistent facts and whose rules allow inferring information from inconsistent premises. We also present a bottom-up evaluation method for P-Datalog programs based on an alternating fixpoint operator.
%0 Journal Article
%1 Amoa2005
%A de Amoa, Sandra
%A Pais, Mˆonica S.
%D 2005
%J Proceedings of the 18th International FLAIRS Conference
%K kiwi
%P 24
%T A Paraconsistent Logic Programming Approach for Querying Inconsistent Databases
%X When integrating data coming from multiple different sources we are faced with the possibility of inconsistency in databases. A paraconsistent approach for knowledge base integration allows keeping inconsistent information and reasoning in its presence. In this paper, we use a paraconsistent logic (LFI1) as the underlying logic for the specification of P-Datalog, a deductive query language for databases containing inconsistent information. We present a declarative semantics which captures the desired meaning of a recursive query executed over a database containing inconsistent facts and whose rules allow inferring information from inconsistent premises. We also present a bottom-up evaluation method for P-Datalog programs based on an alternating fixpoint operator.
@article{Amoa2005,
abstract = {When integrating data coming from multiple different sources we are faced with the possibility of inconsistency in databases. A paraconsistent approach for knowledge base integration allows keeping inconsistent information and reasoning in its presence. In this paper, we use a paraconsistent logic (LFI1) as the underlying logic for the specification of P-Datalog, a deductive query language for databases containing inconsistent information. We present a declarative semantics which captures the desired meaning of a recursive query executed over a database containing inconsistent facts and whose rules allow inferring information from inconsistent premises. We also present a bottom-up evaluation method for P-Datalog programs based on an alternating fixpoint operator.},
added-at = {2008-11-14T13:33:38.000+0100},
author = {de Amoa, Sandra and Pais, Mˆonica S.},
biburl = {https://www.bibsonomy.org/bibtex/2abecd6e563788f48c53e9935fc726482/fraktalek},
citeulike-article-id = {3508713},
interhash = {28cd024c193ee66fcbfcee49f4a457f8},
intrahash = {abecd6e563788f48c53e9935fc726482},
journal = {Proceedings of the 18th International FLAIRS Conference},
keywords = {kiwi},
pages = 24,
posted-at = {2008-11-13 14:13:52},
priority = {2},
timestamp = {2008-11-14T13:33:40.000+0100},
title = {A Paraconsistent Logic Programming Approach for Querying Inconsistent Databases},
year = 2005
}