A computational logic for incomplete and distributed knowledge based systems

Abstract

By viewing the problems of formal aspects in incomplete and distributed knowledge-based systems as the development of a logic of epistemic notions, the author obtains a computational logic of belief that formalizes beliefs in an extended clausal form of logic. It is shown that this logic can capture many intentional subtleties of quantified beliefs that might result from the communications between subsystems in a distributed environment. In particular, it is shown that the logic can offer an efficient resolution-like proof mechanism with controlled granularity for each subsystem.<>