A Unifying Splitting Framework

G. Ebner, J. Blanchette, S. Tourret

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review


© 2021, The Author(s).AVATAR is an elegant and effective way to split clauses in a saturation prover using a SAT solver. But is it refutationally complete? And how does it relate to other splitting architectures? To answer these questions, we present a unifying framework that extends a saturation calculus (e.g., superposition) with splitting and embeds the result in a prover guided by a SAT solver. The framework also allows us to study locking, a subsumption-like mechanism based on the current propositional model. Various architectures are instances of the framework, including AVATAR, labeled splitting, and SMT with quantifiers.
Original languageEnglish
Title of host publicationAutomated Deduction – CADE 28 - 28th International Conference on Automated Deduction, 2021, Proceedings
EditorsA. Platzer, G. Sutcliffe
PublisherSpringer Science and Business Media Deutschland GmbH
ISBN (Print)9783030798758
Publication statusPublished - 2021
Event28th International Conference on Automated Deduction, CADE 28 2021 - Virtual, Online
Duration: 12 Jul 202115 Jul 2021

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference28th International Conference on Automated Deduction, CADE 28 2021
CityVirtual, Online


Dive into the research topics of 'A Unifying Splitting Framework'. Together they form a unique fingerprint.

Cite this