Harrison, M.C. and N. Rubin. Another generalization of resolution. Journal of the ACM 25, 3 (July 1978), 341--351. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Automated Deduction by Theory Resolution - Stickel (1985) (101 citations) (Correct)
....: x x) or (x y) y z) oe (x z) but does permit efficient computation of T resolvents (even allowing the possibility of compiling T to Lisp code and thence to machine code) Z factoring and Z subsumption operations are also defined. 19 Harrison and Rubin s U generalized resolution [16] is essentially binary partial narrow theory resolution applied to sets of clauses that have a unit or input refutation. They apply it to building in the equality relation, developing a procedure similar to Morris s Eresolution [21] The restriction to sets of clauses having unit or input ....
Harrison, M.C. and N. Rubin. Another generalization of resolution. Journal of the ACM 25, 3 (July 1978), 341--351.
A Generalization of Band Joins and The Merge/Purge Problem - Hernandez (1996) (4 citations) (Correct)
....kind of inference with very large databases as input where quadratic time comparison operations are infeasible. The use of equational theories or knowledge intensive matching procedures is not a new idea. The first reference to this idea comes from the context of theorem proving by resolution in [Harrison and Rubin, 1978]. In that paper, Harrison and Rubin generalize the usual unification procedure allowing the specification of equality predicates . In a more recent example, Tsur, 1991] introduced this idea in the context of deductive databases. In particular, he points out that in Scientific Databases the data ....
M. C. Harrison and N. Rubin. Another generalization of resolution. Journal of the ACM, 25(3), July 1978.
Deduction Systems Based on Resolution - Norbert Eisinger, Hans Jürgen.. (1991) (15 citations) (Correct)
....Even more special refutation graphs are such that the major branches do not fan out at all, representing derivations without factoring or merging. In this case, the refutation graph has a treelike structure and is also called a refutation tree. A theorem by Malcolm C. Harrison and Norman Rubin [Harrison and Rubin, 1978] states that there exists a refutation tree for a given clause set if and only if this clause set is unit refutable (for instance, if it is an unsatisfiable Horn clause set) The clause set ffP; Qg; f:P; Qg; f:Q;Pg;f:Q; Pgg is unsatisfiable and has only refutation graphs that are no refutation ....
Harrison, M. C. and Rubin, N. (1978). Another generalization of resolution. Journal of the ACM, 25(3):341--351.
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