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

Leidinger, Hendrik; Weidenbach, Christoph

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Paper

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

MPS-Authors

/persons/resource/persons282489

Leidinger, Hendrik
Automation of Logic, MPI for Informatics, Max Planck Society;

/persons/resource/persons45719

Weidenbach, Christoph
Automation of Logic, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

arXiv:2205.08297.pdf
(Preprint), 437KB

Supplementary Material (public)

There is no public supplementary material available

Citation

Leidinger, H., & Weidenbach, C. (2022). SCL(EQ): SCL for First-Order Logic with Equality. Retrieved from https://arxiv.org/abs/2205.08297.

Cite as: https://hdl.handle.net/21.11116/0000-000B-652E-1

Abstract

We propose a new calculus SCL(EQ) for first-order logic with equality that
only learns non-redundant 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.