Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Theory of finite and infinite graphs
Theory of finite and infinite graphs
Warren's abstract machine: a tutorial reconstruction
Warren's abstract machine: a tutorial reconstruction
SATCHMO: A Theorem Prover Implemented in Prolog
Proceedings of the 9th International Conference on Automated Deduction
Query completeness of Skolem machine computations
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Skolem machines and geometric logic
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Geometric resolution: a proof procedure based on finite model search
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
On the undecidability of coherent logic
Processes, Terms and Cycles
| Hi-index | 0.00 |
The Skolem machine is a Turing-complete machine model where the instructions are first-order formulas of a specific form. We introduce Skolem machines and prove their logical correctness and completeness. Skolem machines compute queries for the Geolog language, a rich fragment of first-order logic. The concepts of Geolog trees and complete Geolog trees are defined, and these tree concepts are used to show logical correctness and completeness of Skolem machine computations. The universality of Skolem machine computations is demonstrated. Lastly, the paper outlines implementation design issues using an abstract machine model approach.