Handling common transitive relations in first-order automated reasoning
Paper i proceeding, 2016

We present a number of alternative ways of handling transitive binary relations that commonly occur in first-order problems, in particular equivalence relations, total orders, and reflexive, transitive relations. We show how such relations can be discovered syntactically in an input theory. We experimentally evaluate different treatments on problems from the TPTP, using resolution-based reasoning tools as well as instance-based tools. Our conclusions are that (1) it is beneficial to consider different treatments of binary relations as a user, and that (2) reasoning tools could benefit from using a preprocessor or even built-in support for certain binary relations.

Transitive relation

Based reasonings

Equivalence relations

Transitive binary relations

First order problems

Different treatments

Built-in-support

Författare

Koen Lindström Claessen

Chalmers, Data- och informationsteknik, Programvaruteknik

Ann Lillieström

Chalmers, Data- och informationsteknik, Programvaruteknik

CEUR Workshop Proceedings

1613-0073 (ISSN)

Vol. 1635 11-23

Ämneskategorier

Data- och informationsvetenskap