Journal of Computing and Information Technology
Horn Renamability and Hypergraphs
Abstract
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.
Full Text:
PDFDOI: https://doi.org/10.2498/cit.1001287
This work is licensed under a Creative Commons Attribution-NoDerivatives 4.0 International License.
|  |  |
|  |  |
