The expressive powers of stable models for bound and unbound DATALOG queries (Q1362337): Difference between revisions

@@ Property / DOI @@
-.1006/jcss.1997.1446
@@ Property / DOI: 10.1006/jcss.1997.1446 / rank @@
-Normal rank
@@ Property / describes a project that uses @@
+LOGIDATA+
@@ Property / describes a project that uses: LOGIDATA+ / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Datalog
@@ Property / describes a project that uses: Datalog / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1006/jcss.1997.1446
+Normal rank
@@ Property / OpenAlex ID @@
+W2030648384
@@ Property / OpenAlex ID: W2030648384 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3477931
@@ Property / cites work: Q3477931 / rank @@
+Normal rank
@@ Property / cites work @@
+Procedural languages for database queries and updates
+Normal rank
@@ Property / cites work @@
+Stable and extension class theory for logic programs and default logics
+Normal rank
@@ Property / cites work @@
+Negation in rule-based database languages: A survey
+Normal rank
@@ Property / cites work @@
+A survey of complexity results for non-monotonic logics
+Normal rank
@@ Property / cites work @@
+Structure and complexity of relational queries
@@ Property / cites work: Structure and complexity of relational queries / rank @@
+Normal rank
@@ Property / cites work @@
+Horn clause queries and generalizations
@@ Property / cites work: Horn clause queries and generalizations / rank @@
+Normal rank
@@ Property / cites work @@
+Q4937194
@@ Property / cites work: Q4937194 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4058132
@@ Property / cites work: Q4058132 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Languages that Capture Complexity Classes
@@ Property / cites work: Languages that Capture Complexity Classes / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385525
@@ Property / cites work: Q4385525 / rank @@
+Normal rank
@@ Property / cites work @@
+Short note preferred extensions are partial stable models
+Normal rank
@@ Property / cites work @@
+The expressive power of stratified logic programs
@@ Property / cites work: The expressive power of stratified logic programs / rank @@
+Normal rank
@@ Property / cites work @@
+Why not negation by fixpoint?
@@ Property / cites work: Why not negation by fixpoint? / rank @@
+Normal rank
@@ Property / cites work @@
+Q3339245
@@ Property / cites work: Q3339245 / rank @@
+Normal rank
@@ Property / cites work @@
+Autoepistemic logic
@@ Property / cites work: Autoepistemic logic / rank @@
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of facets (and some facets of complexity)
+Normal rank
@@ Property / cites work @@
+Q3486858
@@ Property / cites work: Q3486858 / rank @@
+Normal rank
@@ Property / cites work @@
+Multiple total stable models are definitely needed to solve unique solution problems
+Normal rank
@@ Property / cites work @@
+The expressive powers of the logic programming semantics
+Normal rank
@@ Property / cites work @@
+Negation as failure using tight derivations for general logic programs
+Normal rank
@@ Property / cites work @@
+The well-founded semantics for general logic programs
+Normal rank
@@ Property / cites work @@
+On the equivalence of semantics for normal logic programs
+Normal rank
@@ Property / DOI @@
+.1006/JCSS.1997.1446
@@ Property / DOI: 10.1006/JCSS.1997.1446 / rank @@
+Normal rank