| | |
Summary: Partition-Based Logical Reasoning for
First-Order and Propositional Theories
Eyal Amir a,1
Sheila McIlraith b,2
aStanford University, Computer Science Department, Gates Building 2A,
Stanford, CA 94305-9020, USA
bStanford University, Computer Science Department, Knowledge Systems
Laboratory (KSL), Gates Building 2A, Stanford, CA 94305-9020, USA
Abstract
In this paper we provide algorithms for reasoning with partitions of related logical
axioms in propositional and first-order logic (FOL). We also provide a greedy al-
gorithm that automatically decomposes a set of logical axioms into partitions. Our
motivation is two-fold. First, we are concerned with how to reason effectively with
multiple knowledge bases that have overlap in content. Second, we are concerned
with improving the efficiency of reasoning over a set of logical axioms by partition-
ing the set with respect to some detectable structure, and reasoning over individual
partitions.
Many of the reasoning procedures we present are based on the idea of passing
messages between partitions. We present algorithms for reasoning using forward
(data driven) message-passing and using backward (query driven) message-passing
|
