Declarative semantics for contradictory modular logic programs

Abstract

Abstract.A complex reasoning system can be designed as an interaction between reasoning modules. A module consists of a declaration of exported/imported predicates and a set of rules containing both negation by default and classical negation. A prioritized modular logic program (PMP) consists of a set of modules and a partial order < def on the predicate definitions (M, p), where M is a module and p is a predicate exported by M. Because of the classical negation, conflicts may arise within and among modules. The partial order < def denotes the relative reliability of the predicate definitions contributing to the conflict. We present the reliable semantics for PMPs . The goal of the reliable semantics is to draw reliable conclusions from possibly contradictory PMPs.