On the duality of abduction and model generation in a framework for model generation with equality
FGCS'921 Selected papers of the conference on Fifth generation computer systems
Term Indexing
The Procedures of the CADE-13 ATP System Competition
Journal of Automated Reasoning
Proceedings of the 12th International Conference on Automated Deduction
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Minimal Model Generation with Positive Unit Hyper-Resolution Tableaux
TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
SATCHMO: A Theorem Prover Implemented in Prolog
Proceedings of the 9th International Conference on Automated Deduction
FINDER: Finite Domain Enumerator - System Description
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Efficient Model Generation through Compilation
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
SETHEO V3.2: Recent Developments - System Abstract
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
SEM: a system for enumerating models
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Positive Unit Hyperresolution Tableaux and Their Application to Minimal Model Generation
Journal of Automated Reasoning
An Improvement of Herbrand's theorem and its application to model generation theorem proving
Journal of Computer Science and Technology
Blocking and other enhancements for bottom-up model generation methods
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Hi-index | 0.01 |
Compiling Satchmo and Functional Satchmo are two variants of the model generator Satchmo, incorporating enhancements in different directions. Compiling Satchmo is based on the observation that Satchmo (like any model generator or theorem prover) can be seen as an interpreter for a program given as a logical theory, and that this interpretation layer can be avoided by compilation of the theory into a directly executable program. Functional Satchmo is an implementation of Satchmo’s calculus in a purely functional language supporting lazy evaluation.