O'Reilly logo

Handbook of Automated Reasoning by Andrei Voronkov, Alan J.A. Robinson

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

7 Architectures of Model Elimination Implementations

All competitive implementations of model elimination are iterative-deepening search procedures using backtracking. When envisaging the implementation of such a procedure, one has the choice between fundamentally different architectures, for reasons we will now explain. As indicated at the end of Section 2.7.1, it is straightforward to recognize that SLD-resolution (the inference system underlying Prolog) can be considered as a refinement of model elimination obtained by simply omitting the reduction inference rule. Since highly efficient implementation techniques for Prolog have been developed, one can profit from these efforts and design a Prolog Technology Theorem Prover (PTTP). The crucial ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required