Equational reasoning and term rewriting systems
Handbook of logic in artificial intelligence and logic programming (vol. 1)
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Polarity guided tractable reasoning
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
An Efficient Proof Method for Non-clausal Reasoning
ISMIS '00 Proceedings of the 12th International Symposium on Foundations of Intelligent Systems
Extending Polynomiality to a Class of Non-clausal Many-Valued Horn-Like Formulas
ECSQARU '01 Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Finding Tractable Formulas in NNF
CL '00 Proceedings of the First International Conference on Computational Logic
Non-Clausal Reasoning with Definite Theories
Fundamenta Informaticae
Non-Clausal Reasoning with Definite Theories
Fundamenta Informaticae
| Hi-index | 0.00 |
CNF-BCP is a well-known propositional reasoner that extends clausal Boolean Constraint Propagation (BCP) to non-clausal theories. Although BCP has efficient linear-time implementations, CNF-BCP requires clausal form transformation that sometimes leads to an exponential increase in the size of a theory. We present a new quadratic-time reasoner, RFP, that infers exactly the same literals as CNF-BCP. Although CNF-BCP has been specified only syntactically, we present a simple model-theoretic semantics for RFP. We also present a convergent term-rewriting system for RFP that is suitable for reasoning with knowledge bases that are built incrementally. Potential applications of RFP include logical truth-maintenance systems and general-purpose knowledge representation systems.