Expressive power and complexity of partial models for disjunctive deductive databases (Q1274974): Difference between revisions

@@ Property / author @@
-Domenico Saccà
@@ Property / author: Domenico Saccà / rank @@
-Normal rank
@@ Property / author @@
+Domenico Saccà
@@ Property / author: Domenico Saccà / 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 / cites work @@
+Q4864249
@@ Property / cites work: Q4864249 / rank @@
+Normal rank
@@ Property / cites work @@
+Logic programming and negation: A survey
@@ Property / cites work: Logic programming and negation: A survey / rank @@
+Normal rank
@@ Property / cites work @@
+Stable and extension class theory for logic programs and default logics
+Normal rank
@@ Property / cites work @@
+Propositional semantics for disjunctive logic programs
+Normal rank
@@ Property / cites work @@
+Negation in rule-based database languages: A survey
+Normal rank
@@ Property / cites work @@
+General logical databases and programs: Default logic semantics and stratification
+Normal rank
@@ Property / cites work @@
+Circumscribing DATALOG: expressive power and complexity
+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 @@
+Generalized closed world assumption is \(\Pi ^ 0_ 2\)-complete
+Normal rank
@@ Property / cites work @@
+A restricted second order logic for finite structures
+Normal rank
@@ Property / cites work @@
+Q4225120
@@ Property / cites work: Q4225120 / rank @@
+Normal rank
@@ Property / cites work @@
+On the computational cost of disjunctive logic programming: Propositional case
+Normal rank
@@ Property / cites work @@
+On the partial semantics for disjunctive deductive databases
+Normal rank
@@ Property / cites work @@
+Short note preferred extensions are partial stable models
+Normal rank
@@ Property / cites work @@
+Q4058132
@@ Property / cites work: Q4058132 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3983043
@@ Property / cites work: Q3983043 / rank @@
+Normal rank
@@ Property / cites work @@
+Second order logic and the weak exponential hierarchies
+Normal rank
@@ Property / cites work @@
+Q4385543
@@ Property / cites work: Q4385543 / rank @@
+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 @@
+On the expressive power of Datalog: tools and a case study.
+Normal rank
@@ Property / cites work @@
+Q3339245
@@ Property / cites work: Q3339245 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4391449
@@ Property / cites work: Q4391449 / rank @@
+Normal rank
@@ Property / cites work @@
+Autoepistemic logic
@@ Property / cites work: Autoepistemic logic / rank @@
+Normal rank
@@ Property / cites work @@
+Q3939270
@@ Property / cites work: Q3939270 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3221403
@@ Property / cites work: Q3221403 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3983045
@@ Property / cites work: Q3983045 / rank @@
+Normal rank
@@ Property / cites work @@
+The expressive powers of stable models for bound and unbound DATALOG queries
+Normal rank
@@ Property / cites work @@
+Deterministic and non-deterministic stable models
@@ Property / cites work: Deterministic and non-deterministic stable models / rank @@
+Normal rank
@@ Property / cites work @@
+The expressive powers of the logic programming semantics
+Normal rank
@@ Property / cites work @@
+Complexity and undecidability results for logic programming
+Normal rank
@@ Property / cites work @@
+The polynomial-time hierarchy
@@ Property / cites work: The polynomial-time hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+The well-founded semantics for general logic programs
+Normal rank
@@ Property / cites work @@
+A three-valued semantics for deductive databases and logic programs
+Normal rank
@@ Property / cites work @@
+On the equivalence of semantics for normal logic programs
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0304-3975(97)00129-1
+Normal rank
@@ Property / OpenAlex ID @@
+W1974247722
@@ Property / OpenAlex ID: W1974247722 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1274974