publication . Preprint . Report . 2003

OTTER 3.3 reference manual.

W McCune;
Open Access English
  • Published: 27 Oct 2003
Abstract
OTTER is a resolution-style theorem-proving program for first-order logic with equality. OTTER includes the inference rules binary resolution, hyperresolution, UR-resolution, and binary paramodulation. Some of its other abilities and features are conversion from first-order formulas to clauses, forward and back subsumption, factoring, weighting, answer literals, term ordering, forward and back demodulation, evaluable functions and predicates, Knuth-Bendix completion, and the hints strategy. OTTER is coded in ANSI C, is free, and is portable to many different kinds of computer.
Subjects
ACM Computing Classification System: TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES
free text keywords: Computer Science - Symbolic Computation, Computer Science - Mathematical Software, F.4.1
Related Organizations

64 65 65 67 [1] W. Bledsoe and D. Loveland, editors. Automated Theorem Proving: After 25 Years, volume 29 of Contemporary Mathematics. AMS, 1984.

[4] N. Dershowitz. Termination of rewriting. J. Symbolic Computation, 3:69-116, 1987. [OpenAIRE]

[19] W. McCune and O. Shumsky. IVY: A preprocessor and proof checker for first-order logic. In M. Kaufmann, P. Manolios, and J Moore, editors, Computer-Aided Reasoning: ACL2 Case Studies, chapter 16. Kluwer Academic, 2000.

Powered by OpenAIRE Research Graph
Any information missing or wrong?Report an Issue