Title :
More evidence that SRHD-SGI produces hard SAT instances
Author :
Anton, Constantin ; EstevezdesFreitas, Ruben
Author_Institution :
Comput. Sci. Dept., Grant MacEwan Univ., Edmonton, AB, Canada
Abstract :
In this paper we test whether the properties of the SAT encoded SRHD-SGI instances are independent of the encoding scheme. We selected for our experiments several SAT solvers that won medals at the last SAT competition and a solver that performed very well on the direct encoded SRHD-SGI instances used in the competition. We tested four encoding of SGI to SAT based on converting the original SGI instance into a PBC instance and then from PBC to SAT. We found that the most important properties of SAT encoded SRHD-SGI are preserved under all encodings and, therefore, we concluded that these properties are independent of the encoding scheme1.
Keywords :
computability; computational complexity; encoding; graph theory; PBC instance; SAT competition; SAT encoded SRHD-SGI instances; SAT solvers; encoding scheme; satisfiability; subgraph isomorphism; Boolean functions; Computer hacking; Cryptography; Data structures; Encoding; Medals; Polynomials;
Conference_Titel :
Electronics, Computers and Artificial Intelligence (ECAI), 2013 International Conference on
Conference_Location :
Pitesti
Print_ISBN :
978-1-4673-4935-2
DOI :
10.1109/ECAI.2013.6636212