DocumentCode :
188597
Title :
Extensions and Variants of Dalal´s Quad Polynomial Fragments of SAT
Author :
Al-Saedi, Balasim ; Gregoire, Eric ; Mazure, Bertrand ; Sais, Lakhdar
Author_Institution :
Univ. of Mustansiriyah, Baghdad, Iraq
fYear :
2014
fDate :
10-12 Nov. 2014
Firstpage :
446
Lastpage :
452
Abstract :
An extension and several variants of Dalal´s Quad polynomial fragments of SAT are presented. Firstly, the stability of Quad fragments is investigated. Then, the extension is as follows. Quad fixed total orderings of clauses is accompanied with specific additional separate orderings of maximal sub-clauses. Interestingly, the resulting fragments extend Quad without degrading its worst-case complexity. Several other variants of Quad that give rise to additional different polynomial fragments are then investigated.
Keywords :
Boolean functions; computability; computational complexity; SAT; maximal subclause orderings; quad extension; quad fixed total clause orderings; quad fragment stability; quad polynomial fragments; worst-case complexity; Artificial intelligence; Complexity theory; Conferences; Educational institutions; Polynomials; Sensitivity; Stability analysis; Polynomial Classes; Quad; SAT;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Tools with Artificial Intelligence (ICTAI), 2014 IEEE 26th International Conference on
Conference_Location :
Limassol
ISSN :
1082-3409
Type :
conf
DOI :
10.1109/ICTAI.2014.74
Filename :
6984510
Link To Document :
بازگشت