Detecting embedded Horn structure in propositional logic (Q1198035): Difference between revisions

@@ Property / cites work @@
+Recognizing disguised NR(1) instances of the satisfiability problem
+Normal rank
@@ Property / cites work @@
+Finding a Maximum Clique in an Arbitrary Graph
@@ Property / cites work: Finding a Maximum Clique in an Arbitrary Graph / rank @@
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the maximum clique problem
@@ Property / cites work: An exact algorithm for the maximum clique problem / rank @@
+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 @@
+Linear-time algorithms for testing the satisfiability of propositional horn formulae
+Normal rank
@@ Property / cites work @@
+Q3798257
@@ Property / cites work: Q3798257 / rank @@
+Normal rank
@@ Property / cites work @@
+Computational aspects of a branch and bound algorithm for quadratic zero- one programming
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(92)90098-g
+Normal rank
@@ Property / OpenAlex ID @@
+W1991253226
@@ Property / OpenAlex ID: W1991253226 / rank @@
+Normal rank