Checking Quasi-First-Order-Logic Rule -Based Systems for Inconsistency and Redundancy
This paper shows how the knowledge-base reductions (KBR) algorithm for testing knowledge bases for inconsistency and redundancy, introduced in [2] can be extended to deal with knowledge bases which are "quasi" first -order-logic (FOL) knowledge bases in the sense that their rules can be adequately represented by corresponding statements in FOL.