SCL(EQ): SCL for First-Order Logic with Equality - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Automated Reasoning Year : 2023

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

Abstract

We propose a new calculus SCL(EQ) for first-order logic with equality that only learns nonredundant clauses. Following the idea of CDCL (Conflict Driven Clause Learning) and SCL (Clause Learning from Simple Models) a ground literal model assumption is used to guide inferences that are then guaranteed to be non-redundant. Redundancy is defined with respect to a dynamically changing ordering derived from the ground literal model assumption. We prove SCL(EQ) sound and complete and provide examples where our calculus improves on superposition.
Fichier principal
Vignette du fichier
s10817-023-09673-3.pdf (583.52 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-04313698 , version 1 (29-11-2023)

Licence

Identifiers

Cite

Hendrik Leidinger, Christoph Weidenbach. SCL(EQ): SCL for First-Order Logic with Equality. Journal of Automated Reasoning, 2023, 67 (3), pp.22. ⟨10.1007/s10817-023-09673-3⟩. ⟨hal-04313698⟩
20 View
6 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More