A Continuous-Discontinuous Second-Order Transition in the Satisfiability of Random Horn-SAT Formulas
Probability
2007-05-23 v1 Disordered Systems and Neural Networks
Combinatorics
Abstract
We compute the probability of satisfiability of a class of random Horn-SAT formulae, motivated by a connection with the nonemptiness problem of finite tree automata. In particular, when the maximum clause length is 3, this model displays a curve in its parameter space along which the probability of satisfiability is discontinuous, ending in a second-order phase transition where it becomes continuous. This is the first case in which a phase transition of this type has been rigorously established for a random constraint satisfaction problem.
Keywords
Cite
@article{arxiv.math/0505032,
title = {A Continuous-Discontinuous Second-Order Transition in the Satisfiability of Random Horn-SAT Formulas},
author = {Cristopher Moore and Gabriel Istrate and Demetrios Demopoulos and Moshe Y. Vardi},
journal= {arXiv preprint arXiv:math/0505032},
year = {2007}
}