AC Simplifications and Closure Redundancies in the Superposition Calculus

07/18/2021
by   André Duarte, et al.
0

Reasoning in the presence of associativity and commutativity (AC) is well known to be challenging due to prolific nature of these axioms. Specialised treatment of AC axioms is mainly supported by provers for unit equality which are based on Knuth-Bendix completion. The main ingredient for dealing with AC in these provers are ground joinability criteria adapted for AC. In this paper we extend AC joinability from the context of unit equalities and Knuth-Bendix completion to the superposition calculus and full first-order logic. Our approach is based on an extension of the Bachmair-Ganzinger model construction and a new redundancy criterion which covers ground joinability. A by-product of our approach is a new criterion for applicability of demodulation which we call encompassment demodulation. This criterion is useful in any superposition theorem prover, independently of AC theories, and we demonstrate that it enables demodulation in many more cases, compared to the standard criterion.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/17/2022

SCL(EQ): SCL for First-Order Logic with Equality

We propose a new calculus SCL(EQ) for first-order logic with equality th...
research
11/17/2017

Eliminating the unit constant in the Lambek calculus with brackets

We present a translation of the Lambek calculus with brackets and the un...
research
03/10/2020

SCL with Theory Constraints

We lift the SCL calculus for first-order logic without equality to the S...
research
06/02/2014

A Superposition Calculus for Abductive Reasoning

We present a modification of the superposition calculus that is meant to...
research
04/25/2019

The Epsilon Calculus with Equality and Herbrand Complexity

Hilbert's epsilon calculus is an extension of elementary or predicate ca...
research
01/26/2021

A program logic for fresh name generation

We present a program logic for Pitts and Stark's ν-calculus, an extensio...
research
03/18/2019

Solving x^2^k+1+x+a=0 in F_2^n with (n,k)=1

Let N_a be the number of solutions to the equation x^2^k+1+x+a=0 in n wh...

Please sign up or login with your details

Forgot password? Click here to reset