Izvorni znanstveni članak
https://doi.org/10.2498/cit.1001287
Horn Renamability and Hypergraphs
Dušan Hvalica
Sažetak
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.
Ključne riječi
Hrčak ID:
51554
URI
Datum izdavanja:
30.12.2009.
Posjeta: 1.355 *