Computing the well-founded semantics faster (Q5101445): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-59487-6_9
+Normal rank
@@ Property / OpenAlex ID @@
+W1497544880
@@ Property / OpenAlex ID: W1497544880 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4327612
@@ Property / cites work: Q4327612 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear-time algorithms for testing the satisfiability of propositional horn formulae
+Normal rank
@@ Property / cites work @@
+A kripke-kleene semantics for logic programs*
@@ Property / cites work: A kripke-kleene semantics for logic programs* / rank @@
+Normal rank
@@ Property / cites work @@
+Q4955331
@@ Property / cites work: Q4955331 / rank @@
+Normal rank
@@ Property / cites work @@
+Autoepistemic logic
@@ Property / cites work: Autoepistemic logic / rank @@
+Normal rank
@@ Property / cites work @@
+A topological approach to dynamic graph connectivity
+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 @@
+The well-founded semantics for general logic programs
+Normal rank