e/Model elimination

Information
has gloss	eng: Model Elimination is the name attached to a pair of proof procedures invented by Donald W. Loveland, the first of which was published in 1968 in the Journal of the ACM. Their primary purpose is to carry out automated theorem proving, though they can readily be extended to logic programming, including the more general disjunctive logic programming.
lexicalization	eng: Model elimination
instance of	c/Logical calculi