Circumscribing DATALOG: expressive power and complexity (Q1127538): Difference between revisions

@@ Property / cites work @@
+Q4864249
@@ Property / cites work: Q4864249 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4035348
@@ Property / cites work: Q4035348 / rank @@
+Normal rank
@@ Property / cites work @@
+Querying disjunctive databases through nonmonotonic logics
+Normal rank
@@ Property / cites work @@
+The complexity of model checking for circumscriptive formulae
+Normal rank
@@ Property / cites work @@
+The complexity of propositional closed world reasoning and circumscription
+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 @@
+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 @@
+Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
+Normal rank
@@ Property / cites work @@
+Q4375822
@@ Property / cites work: Q4375822 / 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 @@
+Negation as failure: careful closure procedure
@@ Property / cites work: Negation as failure: careful closure procedure / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm to compute circumscription
@@ Property / cites work: An algorithm to compute circumscription / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-point extensions of first-order logic
@@ Property / cites work: Fixed-point extensions of first-order logic / rank @@
+Normal rank
@@ Property / cites work @@
+Relational queries computable in polynomial time
@@ Property / cites work: Relational queries computable in polynomial time / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385543
@@ Property / cites work: Q4385543 / 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 @@
+Q5750390
@@ Property / cites work: Q5750390 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity classes and theories of finite models
@@ Property / cites work: Complexity classes and theories of finite models / rank @@
+Normal rank
@@ Property / cites work @@
+Circumscription - a form of non-monotonic reasoning
+Normal rank
@@ Property / cites work @@
+Q3221403
@@ Property / cites work: Q3221403 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3348437
@@ Property / cites work: Q3348437 / rank @@
+Normal rank
@@ Property / cites work @@
+Multiple total stable models are definitely needed to solve unique solution problems
+Normal rank
@@ Property / cites work @@
+Q3477931
@@ Property / cites work: Q3477931 / rank @@
+Normal rank
@@ Property / cites work @@
+Embedding circumscriptive theories in general disjunctive programs
+Normal rank
@@ Property / cites work @@
+Decidability and definability with circumscription
+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 @@
+Comparing the Expressibility of Languages Formed Using NP-Complete Operators
+Normal rank
@@ Property / cites work @@
+The Semantics of Predicate Logic as a Programming Language
+Normal rank