R.B. Stillman. The concept of weak substitution in theorem-proving. Journal of ACM, 20(4):648--667, October 1973.  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Thue Trees - Marcinkowski, Pacholski (Correct)
....as a criterion for deletion. A clause C subsumes the clause D if there exists a substitution oe such that each literal of oe(C) appears as a literal of D. The problem whether the clause C subsumes the clause D is NP complete. Some efficient subsumption algorithms were given and analyzed in [12, 55, 24, 26, 25]. Also several papers [24, 27, 35, 36] considered very strong sufficient criteria for decidability of clause implication. For example, it is decidable whether a Horn clause H 1 implies a Horn clause H 2 provided H 1 is linear recursive i.e. at most one of the premises of H 1 can be unified with ....
R. Stillman. The concept of weak substitution in theorem-proving. JACM, 20(4):648--667, October 1973.
Subsumption and Resolution: A New - Algorithm Ferilli Di (Correct)
No context found.
R.B. Stillman. The concept of weak substitution in theorem-proving. Journal of ACM, 20(4):648--667, October 1973.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC