Abstract
This paper focuses on the problem of reasoning with information provided by a group of databases which share a common set of rules (deductive rules, integrity constraints). Each database is assumed to be consistent with the rules, but federating them may lead to contradictions. This paper describes a logic of beliefs, based on KD logic, for reasoning with contradictory information provided by several databases. It also presents a theorem prover, associated with this logic. This prover, described as a meta-interpreter of PROLOG allows us to derive formulas of the form: given the databases and the rules, assuming an order of relative reliability between the databases, is a given formula deducible? or, what are the individuals which satisfy a given formula? When the set of rules is not recursive, we prove the correctness of this theorem-prover.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
