Abstract
metafor is a general purpose Automated Theorem Proving (ATP) system for First Order Predicate Logic (FOPL) with equality. It is in daily use as a tool aiding researchers working in the field of theory building in the social sciences. It is based on model generation with a ground term rewrite system incorporated for the handling of equality. It effects partial deduction on Horn clauses as a preprocessing step which provides information which allows heuristics to be applied to the selection of moves in the proof search. Also, metaf or allows the user to provide certain meta-information by giving type constraints on predicate slots or certain properties of binary relations. The CCSOM implementation of metaf or consists of approximately 4500 lines of PROLOG and currently runs on Prolog by BIM on a Sun Sparcstation network.
Similar content being viewed by others
References
Reiner Manthey and François Bry. satchmo: a theorem prover in PROLOG. In Jörg H. Siekman, editor, CADE 8. Springer-Verlag, 1986.
Allan Ramsay. Generating relevant models. Journal of Automated Reasoning, 7:359–368, 1991.
M. Partsch and R. Steinbruggen. Program transformation systems. Computing Surveys, 15:199–236, 1983.
J. Komorowski. Partial evaluation as a means for inferencing data structures in an applicative language: a theory and implementation in the case of PROLOG. In Proceedings of the ACM Symposium on Principles of Programming Languages, pages 255–267, 1982.
Breanndán Ó Nualláin. Model generation with partial deduction of Horn clauses. TR 93-81, CCSOM, Universiteit van Amsterdam, The Netherlands, March 1993.
W. Bledsoe. Non-resolution theorem proving. Artificial Intelligence, 9:1–35, 1977.
Breanndán Ó Nualláin. Equality and model generation. TR 92-78, CCSOM, Universiteit van Amsterdam, The Netherlands, December 1992.
Breanndán Ó Nualláin. Safe goal reduction in model generation with equality. TR 93-80, CCSOM, Universiteit van Amsterdam, The Netherlands, January 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nualláin, B.Ó. (1993). Mixing metafor. In: Voronkov, A. (eds) Logic Programming and Automated Reasoning. LPAR 1993. Lecture Notes in Computer Science, vol 698. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56944-8_70
Download citation
DOI: https://doi.org/10.1007/3-540-56944-8_70
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56944-2
Online ISBN: 978-3-540-47830-0
eBook Packages: Springer Book Archive