SAT-Inspired Eliminations for Superposition - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue ACM Transactions on Computational Logic Année : 2023

SAT-Inspired Eliminations for Superposition

Résumé

Optimized SAT solvers not only preprocess the clause set, they also transform it during solving as inprocessing. Some preprocessing techniques have been generalized to first-order logic with equality. In this article, we port inprocessing techniques to work with superposition, a leading first-order proof calculus, and we strengthen known preprocessing techniques. Specifically, we look into elimination of hidden literals, variables (predicates), and blocked clauses. Our evaluation using the Zipperposition prover confirms that the new techniques usefully supplement the existing superposition machinery.
Fichier principal
Vignette du fichier
jour.pdf (656.29 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04298574 , version 1 (21-11-2023)

Licence

Paternité

Identifiants

Citer

Petar Vukmirović, Jasmin Blanchette, Marijn J H Heule. SAT-Inspired Eliminations for Superposition. ACM Transactions on Computational Logic, 2023, 24 (1), pp.1-25. ⟨10.1145/3565366⟩. ⟨hal-04298574⟩
12 Consultations
6 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More