Logic systems that limit, for example, the power of classical inference relations to retrieve non trivial information of inconsistent sets of formulas.
Published in Chapter:
Inconsistency, Logic Databases, and Ontologies
José A. Alonso-Jiménez (Artificial Universidad de Sevilla, Spain), Joaquín Borrego-Díaz (Artificial Universidad de Sevilla, Spain), and Antonia M. Chávez-González (Artificial Universidad de Sevilla, Spain)
Copyright: © 2009
|Pages: 8
DOI: 10.4018/978-1-60566-242-8.ch049
Abstract
Nowadays, data management on the World Wide Web needs to consider very large knowledge databases (KDB). The larger is a KDB, the smaller the possibility of being consistent. Consistency in checking algorithms and systems fails to analyse very large KDBs, and so many have to work every day with inconsistent information. Database revision—transformation of the KDB into another, consistent database—is a solution to this inconsistency, but the task is computationally untractable. Paraconsistent logics are also a useful option to work with inconsistent databases. These logics work on inconsistent KDBs but prohibit non desired inferences. From a philosophical (logical) point of view, the paraconsistent reasoning is a need that the self human discourse practices. From a computational, logical point of view, we need to design logical formalisms that allow us to extract useful information from an inconsistent database, taking into account diverse aspects of the semantics that are “attached” to deductive databases reasoning (see Table 1). The arrival of the semantic web (SW) will force the database users to work with a KDB that is expressed by logic formulas with higher syntactic complexity than are classic logic databases.