Model elimination
4073971
136150632
2007-06-05T21:11:05Z
PaulBrinkley
4563407
linkified SLD resolution
'''Model Elimination''' is the name attached to a pair of [[proof procedure]]s 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]].
Model Elimination is closely related to [[Resolution (logic)|resolution]]
while also bearing characteristics of a [[Method of analytic tableaux|Tableaux]] method. It is a progenitor of the [[SLD resolution]] procedure used in the [[Prolog]] logic programming language.
While somewhat eclipsed by attention to and progress in Resolution
theorem provers, Model Elimination has continued to attract the
attention of researchers and software developers. Today there are several theorem provers under active development that are based on the Model Elimination procedure.
== References ==
* Loveland, D. W. (1968) Mechanical theorem-proving by model elimination. Journal of the ACM, 15, 236--251.
[[Category: Automated theorem proving]]
[[Category: Logical calculi]]
[[Category: Logic in computer science]]