SCL(FOL) Revisited

02/12/2023
by   Martin Bromberger, et al.
0

This paper presents an up-to-date and refined version of the SCL calculus for first-order logic without equality. The refinement mainly consists of the following two parts: First, we incorporate a stronger notion of regularity into SCL(FOL). Our regularity definition is adapted from the SCL(T) calculus. This adapted definition guarantees non-redundant clause learning during a run of SCL. However, in contrast to the original presentation, it does not require exhaustive propagation. Second, we introduce trail and model bounding to achieve termination guarantees. In previous versions, no termination guarantees about SCL were achieved. Last, we give rigorous proofs for soundness, completeness and clause learning guarantees of SCL(FOL) and put SCL(FOL) into context of existing first-order calculi.

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
05/06/2019

Revisiting Counter-model Generation for Minimal Implicational Logic

The LMT^→ sequent calculus was introduced in Santos (2016). This paper p...
research
11/27/2021

A Calculus for Modular Loop Acceleration and Non-Termination Proofs

Loop acceleration can be used to prove safety, reachability, runtime bou...
research
05/22/2023

SCL(FOL) Can Simulate Non-Redundant Superposition Clause Learning

We show that SCL(FOL) can simulate the derivation of non-redundant claus...
research
07/19/2023

Proving Non-Termination by Acceleration Driven Clause Learning (Short WST Version)

We recently proposed Acceleration Driven Clause Learning (ADCL), a novel...
research
04/20/2023

Proving Non-Termination by Acceleration Driven Clause Learning

We recently proposed Acceleration Driven Clause Learning (ADCL), a novel...

Please sign up or login with your details

Forgot password? Click here to reset