Consistent query answering using relational databases through argumentation

3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper introduces a framework that integrates a reasoner based on defeasible argumentation with a large information repository backed by one or several relational databases. In our scenario, we assume that the databases involved are updated by external independent applications, possibly introducing inconsistencies in a particular database, or leading to inconsistency among the subset of databases that refer to the same data. Argumentation reasoning will contribute with the possibility of obtaining consistent answers from the information repository with the properties described. We present the Database Integration for Defeasible Logic Programming (DBI-DeLP) framework, which enables commonsense reasoning based on Defeasible Logic Programming (DeLP) by extending the system capabilities to handle large amounts of data and providing consistent answers for queries posed to it. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Deagustini, C. A. D., Fulladoza Dalibón, S. E., Gottifredi, S., Falappa, M. A., & Simari, G. R. (2012). Consistent query answering using relational databases through argumentation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7447 LNCS, pp. 1–15). https://doi.org/10.1007/978-3-642-32597-7_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free