Unique satisfiability of Horn sets can be solved in nearly linear time (Q1894352): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4065051
@@ Property / cites work: Q4065051 / rank @@
+Normal rank
@@ Property / cites work @@
+On the unique satisfiability problem
@@ Property / cites work: On the unique satisfiability problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4138187
@@ Property / cites work: Q4138187 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear-time algorithms for testing the satisfiability of propositional horn formulae
+Normal rank
@@ Property / cites work @@
+Unification as a complexity measure for logic programming
+Normal rank
@@ Property / cites work @@
+The unique Horn-satisfiability problem and quadratic Boolean equations.
+Normal rank
@@ Property / cites work @@
+A note on Dowling and Gallier's top-down algorithm for propositional Horn satisfiability
+Normal rank
@@ Property / cites work @@
+Depth-First Search and Linear Graph Algorithms
@@ Property / cites work: Depth-First Search and Linear Graph Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Efficiency of a Good But Not Linear Set Union Algorithm
+Normal rank
@@ Property / cites work @@
+The Semantics of Predicate Logic as a Programming Language
+Normal rank