Skolem machines and geometric logic

Authors:
John Fisher;Marc Bezem
Affiliations:
Department of Computer Science, California State Polytechnic University, Pomona, California;Department of Computer Science, University of Bergen, Bergen, Norway
Venue:
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Year:
2007

Citing 7
Cited 5

Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
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
Automating coherent logic

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

Skolem Machines

Fundamenta Informaticae - Machines, Computations and Universality, Part I
Geometry Constructions Language

Journal of Automated Reasoning
A coherent logic based geometry theorem prover capable of producing formal and readable proofs

ADG'10 Proceedings of the 8th international conference on Automated Deduction in Geometry
CDCL-based abstract state transition system for coherent logic

CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
Skolem Machines

Fundamenta Informaticae - Machines, Computations and Universality, Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

Inspired by the wonderful design and implementation of the Prolog language afforded by the Warren Abstract Machine (WAM), this paper describes an extended logical language which can compute larger realms of first-order logic, based upon theories for finitary geometric logic. The paper describes a Geolog language for expressing first-order geometric logic in tidy closed form, a mathematical Skolem Machine that computes the language, and an implementation prototype that intimately mimics the abstract machine, and which also reformulates expensive bottom-up inference into efficient top-down inference. There are promising mathematical theorem proving applications for geometric logic systems, collected on the website [5]. The emphasis of this paper is theory, abstract machine design and direct implementation of the abstract machine.