Reasoning About Data Provided By Federated Deductive Databases

  • Authors:
  • Laurence Cholvy

  • Affiliations:
  • ONERA-CERT, 2 avenue Ed Belin, 31055 Toulouse, France. E-mail: cholvy@cert.fr

  • Venue:
  • Journal of Intelligent Information Systems
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper focuses on the problem of reasoning withinformation provided by a group of databases which share a common setof rules (deductive rules, integrity constraints). Each database isassumed to be consistent with the rules, but federating them may leadto contradictions.This paper describes a logic of beliefs, based on KD logic, forreasoning with contradictory information provided by severaldatabases. It also presents a theorem prover, associated with thislogic. This prover, described as a meta-interpreter of PROLOG allowsus to derive formulas of the form: given the databases and the rules,assuming an order of relative reliability between the databases, is agiven formula deducible? or, what are the individuals which satisfy agiven formula? When the set of rules is not recursive, we prove thecorrectness of this theorem-prover.