@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ Name: GETFOL Keywords: Description: Semantics: sorted first-order logic Deductive machinery: natural deduction inference rules (with extensions to deal with sorts), equality rules, conditional rules deciders for propositional and predicate logic, semantic and syntactic simplification, meta-reasoning. Dynamics: theory and axiom declaration commands, multiple proofs, multiple contexts, Persistence: proof scripts can be save in files GETFOL is an interactive reasoning system running on top of a complete reimplementation of the FOL system (FOL was itself developed by Richard W. Weyhrauch). GETFOL can be used in many ways, for instance as a programming language for building intelligent systems, as an interactive theorem prover for first order logic or as an environment for the study of the mathematical theory of computation. Contact persons: Fausto Giunchiglia getfol@frege.mrg.dist.unige.it User group: Mechanize Reasoning Group at IRST Pragmatics: Documentation: The GETFOL Manual - GETFOL version 1 F. Giunchiglia Technical Report 92-0010, DIST - University of Genova, Genoa, Italy, 1992 Applications: Extensions/enhancements: Resource requirements: GETFOL is implemented in HGKM, a language built on top of Common Lisp. GETFOL has been successfully compiled with KCL (Kyoto Common Lisp), AKCL (Austin Kyoto Common Lisp) Version(1.623) and Lucid (version 3.0.0) on Unix. Where-to-get-it: GETFOL 2.001 can be obtained via ftp from the following address: Network address: frege.mrg.dist.unige.it (130.251.7.2) Login: ftp (anonymous) Passwd: Directory: pub/GETFOL File: GETFOL2.001.tar.Z GETFOL2.001.tar.Z is a compressed, tar file containing the source code and the documentation needed to run the system. GetFol announcement Oct 94 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%