Propositional information systems
Juerg Kohlas · Journal of Logic and Computation · 1999
Resolution is an often used method for deduction in propositional logic. Here a proper organization of deduction is proposed which avoids redundant computations. It is based on a generic framework of decompositions and local computations as introduced by Shenoy and Shafer. The system contains the two basic operations with information, namely marginalization (or projection) and combination; the latter being an idempotent operation in the present case. The theory permits the conception of an architecture of distributed computing. As an important application assumption-based reasoning is discussed.