Efficient Encodings of First-Order Horn Formulas in Equational Logic
Paper i 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.

Författare

Koen Lindström Claessen

Chalmers, Data- och informationsteknik, Funktionell programmering

Nicholas Smallbone

Chalmers, Data- och informationsteknik, Funktionell programmering

Lecture Notes in Computer Science

0302-9743 (ISSN)

Vol. 10900 388-404

9th International Joint Conference on Automated Reasoning, IJCAR 2018 Held as Part of the Federated Logic Conference, FloC 2018
Oxford, United Kingdom,

Systematisk testning av cyberfysiska system (SyTeC)

Vetenskapsrådet (VR), 2017-01-01 -- 2022-12-31.

Ämneskategorier

Språkteknologi (språkvetenskaplig databehandling)

Beräkningsmatematik

Matematisk analys

DOI

10.1007/978-3-319-94205-6_26

Mer information

Senast uppdaterat

2018-09-05