About some UP-based polynomial fragments of SAT - Université d'Artois Access content directly
Journal Articles Annals of Mathematics and Artificial Intelligence Year : 2017

About some UP-based polynomial fragments of SAT

Abstract

This paper explores several polynomial fragments of SAT that are based on the unit propagation (UP) mechanism. As a first case study, one Tovey's polynomial fragment of SAT is extended through the use of UP. Then, we answer an open question about connections between the so-called UP-Horn class (and other UP-based polynomial variants) and Dalal's polynomial Quad class. Finally, we introduce an extended UP-based pre-processing procedure that allows us to prove that some series of benchmarks from the SAT competitions are polynomial ones. Moreover, our experimentations show that this pre-processing can speed-up the satisfiability check of other instances.
No file

Dates and versions

hal-03300429 , version 1 (27-07-2021)

Identifiers

  • HAL Id : hal-03300429 , version 1

Cite

Balasim Al-Saedi, Olivier Fourdrinoy, Éric Grégoire, Bertrand Mazure, Lakhdar Saïs. About some UP-based polynomial fragments of SAT. Annals of Mathematics and Artificial Intelligence, 2017, 79 (1), pp.25-44. ⟨hal-03300429⟩
13 View
0 Download

Share

Gmail Facebook X LinkedIn More