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.
Model Elimination is closely related to resolution while also bearing characteristics of a 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.
Famous quotes containing the words model and/or elimination:
“The playing adult steps sideward into another reality; the playing child advances forward to new stages of mastery....Child’s play is the infantile form of the human ability to deal with experience by creating model situations and to master reality by experiment and planning.”
—Erik H. Erikson (20th century)
“To reduce the imagination to a state of slavery—even though it would mean the elimination of what is commonly called happiness—is to betray all sense of absolute justice within oneself. Imagination alone offers me some intimation of what can be.”
—André Breton (1896–1966)