Horn Renamability and Hypergraphs

Satisfiability testing in the context of directed hypergraphs is discussed. A characterization of Horn-renamable formulae is given and a subclass of SAT that belongs to $QTR{cal}{P}$ is described. An algorithm for Horn renaming with linear time complexity is presented

Author Index

Author Index: CIT Vol. 17 (2009), No 1–