Recognizing renamable generalized propositional Horn formulas is NP- complete (Q1804878): Difference between revisions

@@ Property / cites work @@
+Recognizing disguised NR(1) instances of the satisfiability problem
+Normal rank
@@ Property / cites work @@
+On renamable Horn and generalized Horn functions
@@ Property / cites work: On renamable Horn and generalized Horn functions / rank @@
+Normal rank
@@ Property / cites work @@
+Extended Horn sets in propositional logic
@@ Property / cites work: Extended Horn sets in propositional logic / rank @@
+Normal rank
@@ Property / cites work @@
+Detecting embedded Horn structure in propositional logic
+Normal rank
@@ Property / cites work @@
+Linear-time algorithms for testing the satisfiability of propositional horn formulae
+Normal rank
@@ Property / cites work @@
+Polynomially solvable satisfiability problems
@@ Property / cites work: Polynomially solvable satisfiability problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+Renaming a Set of Clauses as a Horn Set
@@ Property / cites work: Renaming a Set of Clauses as a Horn Set / rank @@
+Normal rank
@@ Property / cites work @@
+LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation
+Normal rank
@@ Property / cites work @@
+The satisfiabilty problem for a class consisting of horn sentences and some non-horn sentences in proportional logic
+Normal rank