On the Boolean connectivity problem for Horn relations Original Research Article

Gopalan et al. studied in [P. Gopalan, P.G. Kolaitis, E.N. Maneva, C.H. Papadimitriou, The connectivity of Boolean satisfiability: computational and structural dichotomies, in: Proceedings of the 33rd International Colloquium on Automata, Languages and Programming, ICALP 2006, 2006, pp. 346–357] and [P. Gopalan, P.G. Kolaitis, E.N. Maneva, C.H. Papadimitrio