Hypothetical datalog: Complexity and expressibility (Q915436): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0304-3975(90)90011-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2126897484
@@ Property / OpenAlex ID: W2126897484 / rank @@
+Normal rank
@@ Property / cites work @@
+Contributions to the Theory of Logic Programming
@@ Property / cites work: Contributions to the Theory of Logic Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Computable queries for relational data bases
@@ Property / cites work: Computable queries for relational data bases / rank @@
+Normal rank
@@ Property / cites work @@
+Alternation
@@ Property / cites work: Alternation / rank @@
+Normal rank
@@ Property / cites work @@
+N-Prolog: An extension of prolog with hypothetical implication. II. Logical foundations, and negation as failure
+Normal rank
@@ Property / cites work @@
+N-Prolog: An extension of Prolog with hypothetical implications. I.
+Normal rank
@@ Property / cites work @@
+Q5592246
@@ Property / cites work: Q5592246 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3862380
@@ Property / cites work: Q3862380 / rank @@
+Normal rank
@@ Property / cites work @@
+The Computational Complexity of Provability in Systems of Modal Propositional Logic
+Normal rank
@@ Property / cites work @@
+Clausal intuitionistic logic I. fixed-point semantics
+Normal rank
@@ Property / cites work @@
+Clausal intuitionistic logic II. tableau proof procedures
+Normal rank
@@ Property / cites work @@
+Intuitionistic propositional logic is polynomial-space complete
+Normal rank
@@ Property / cites work @@
+The Semantics of Predicate Logic as a Programming Language
+Normal rank