OTTER
Our current automated deduction system Otter is designed to prove theorems stated in first-order logic with equality. Otter’s inference rules are based on resolution and paramodulation, and it includes facilities for term rewriting, term orderings, Knuth-Bendix completion, weighting, and strategies for directing and restricting searches for proofs. Otter can also be used as a symbolic calculator and has an embedded equational programming system. Otter is a fourth-generation Argonne National Laboratory deduction system whose ancestors (dating from the early 1960s) include the TP series, NIUTP, AURA, and ITP. Currently, the main application of Otter is research in abstract algebra and formal logic. Otter and its predecessors have been used to answer many open questions in the areas of finite semigroups, ternary Boolean algebra, logic calculi, combinatory logic, group theory, lattice theory, and algebraic geometry. Note: Otter/Mace2 are no longer being actively developed, and maintenance and support minimal. We recommend using Otter/Mace2’s successor Prover9/Mace4 instead.
Keywords for this software
References in zbMATH (referenced in 314 articles , 1 standard article )
Showing results 1 to 20 of 314.
Sorted by year (- Kaufmann, Matt; Moore, J. Strother: Limited second-order functionality in a first-order setting (2020)
- Moghaddam, G. I.; Padmanabhan, R.; Zhang, Yang: Automated reasoning with power maps (2020)
- Nalon, Cláudia; Hustadt, Ullrich; Dixon, Clare: (\mathrmK_\mathrmS\mathrmP) a resolution-based theorem prover for (\mathsfK_n): architecture, refinements, strategies and experiments (2020)
- Schlichtkrull, Anders; Blanchette, Jasmin; Traytel, Dmitriy; Waldmann, Uwe: Formalizing Bachmair and Ganzinger’s ordered resolution prover (2020)
- Coghetto, Roland; Grabowski, Adam: Tarski geometry axioms. IV: Right angle (2019)
- Kellison, Ariel; Bickford, Mark; Constable, Robert: Implementing Euclid’s straightedge and compass constructions in type theory (2019)
- Kinyon, Michael: Proof simplification and automated theorem proving (2019)
- Narboux, Julien; Janičić, Predrag; Fleuriot, Jacques: Computer-assisted theorem proving in synthetic geometry (2019)
- Padmanabhan, Ranganathan; Zhang, Yang: Commutativity theorems in groups with power-like maps (2019)
- Rawson, Michael; Reger, Giles: Old or heavy? Decaying gracefully with age/weight shapes (2019)
- Goertzel, Zarathustra; Jakubův, Jan; Schulz, Stephan; Urban, Josef: ProofWatch: watchlist guidance for large theories in E (2018)
- Sestini, Filippo; Crafa, Silvia: Proof search in a context-sensitive logic for molecular biology (2018)
- Beeson, Michael; Wos, Larry: Finding proofs in Tarskian geometry (2017)
- Bonacina, Maria Paola; Plaisted, David A.: Semantically-guided goal-sensitive reasoning: inference system and completeness (2017)
- Coghetto, Roland; Grabowski, Adam: Tarski geometry axioms. III (2017)
- Itegulov, Daniyar; Slaney, John; Woltzenlogel Paleo, Bruno: Scavenger 0.1: a theorem prover based on conflict resolution (2017)
- Larson, C. E.; Van Cleemput, N.: Automated conjecturing. III. Property-relations conjectures (2017)
- Rump, Wolfgang: Quantum B-algebras: their omnipresence in algebraic logic and beyond (2017)
- Song, Dan; Wang, Dongming; Chen, Xiaoyu: Retrieving geometric information from images: the case of hand-drawn diagrams (2017)
- Sutcliffe, Geoff: The TPTP problem library and associated infrastructure. From CNF to TH0, TPTP v6.4.0 (2017)