Efficient Encodings of First-Order Horn Formulas in Equational Logic
Paper in proceeding, 2018
We present several translations from first-order Horn formulas to equational logic. The goal of these translations is to allow equational theorem provers to efficiently reason about non-equational problems. Using these translations we were able to solve 37 problems of rating 1.0 (i.e. which had not previously been automatically solved) from the TPTP.
Author
Koen Lindström Claessen
Chalmers, Computer Science and Engineering (Chalmers), Functional Programming
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. 10900 LNAI 388-404978-3-319-94204-9 (ISBN)
9th International Joint Conference on Automated Reasoning, IJCAR 2018 Held as Part of the Federated Logic Conference, FloC 2018
Oxford, United Kingdom,
Oxford, United Kingdom,
Systematic testing of cyber-physical systems (SyTeC)
Swedish Research Council (VR) (2016-06204), 2017-01-01 -- 2022-12-31.
Subject Categories
Language Technology (Computational Linguistics)
Computational Mathematics
Mathematical Analysis
DOI
10.1007/978-3-319-94205-6_26