Twee: An Equational Theorem Prover
Paper in proceeding, 2021
Twee is an automated theorem prover for equational logic. It implements unfailing Knuth-Bendix completion with ground joinability testing and a connectedness-based redundancy criterion. It came second in the UEQ division of CASC-J10, solving some problems that no other system solved. This paper describes Twee’s design and implementation.
unit equality
Automated theorem proving
completion
Author
Nicholas Smallbone
Chalmers, Computer Science and Engineering (Chalmers), Functional Programming
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
03029743 (ISSN) 16113349 (eISSN)
Vol. 12699 LNAI 602-6139783030798758 (ISBN)
28th International Conference on Automated Deduction, CADE 28 2021
Virtual, Online, ,
Virtual, Online, ,
Systematic testing of cyber-physical systems (SyTeC)
Swedish Research Council (VR) (2016-06204), 2017-01-01 -- 2022-12-31.
Subject Categories
Computational Mathematics
Embedded Systems
Control Engineering
DOI
10.1007/978-3-030-79876-5_35