Twee: An Equational Theorem Prover
Paper i 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
Författare
Nicholas Smallbone
Chalmers, Data- och informationsteknik, Funktionell programmering
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, ,
Systematisk testning av cyberfysiska system (SyTeC)
Vetenskapsrådet (VR) (2016-06204), 2017-01-01 -- 2022-12-31.
Ämneskategorier
Beräkningsmatematik
Inbäddad systemteknik
Reglerteknik
DOI
10.1007/978-3-030-79876-5_35