Phase Transitions of Bounded Satisfiability Problems
Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence. Pages 1187-1192.
Abstract
We investigate phase transitions for the family of bounded satisfiability problems 3SAT(b), recently introduced by Zhang, that ask: given a 3CNFformula, is there a truth assignment that violates no more than b of its clauses. Zhang's results were experimental and for a fixed number of variables (n = 25), and suggested that the locations of the phase transitions for 3SAT(b) are separated and move significantly as b increases. Analysis of these locations was posed as an open question . We analytically show that the phase transitions of all 3SAT(b) problems must occur within a narrow region, regardless of how large the value of b is. Moreover, our experiments reveal that the phase transitions for these problems occur in a remarkable way. Specifically, unlike 3SAT, the probability curves for 3SAT(b) do not have a quasi-common intersection point about which they rotate as they become steeper with increasing n. Instead, they move rapidly to the left toward the narrow region that the analysis predicts.
@inproceedings{ijcai2003p169,
title = {Phase Transitions of Bounded Satisfiability Problems},
author = {Bailey, Delbert D. and Kolaitis, Phokion G.},
booktitle = {Proceedings of the Eighteenth International Joint Conference on
Artificial Intelligence, {IJCAI-03}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Georg Gottlob},
pages = {1187--1192},
year = {2003},
url = {https://ijcai.org/proceedings/2003/169},
}
TY - CPAPER TI - Phase Transitions of Bounded Satisfiability Problems AU - Bailey, Delbert D. AU - Kolaitis, Phokion G. T2 - Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, IJCAI-03 PB - International Joint Conferences on Artificial Intelligence PY - 2003 SP - 1187 EP - 1192 UR - https://ijcai.org/proceedings/2003/169 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: