The expressive power of unique total stable model semantics (Q4572012): Difference between revisions

@@ Property / cites work @@
+Q4692876
@@ Property / cites work: Q4692876 / rank @@
+Normal rank
@@ Property / cites work @@
+On the unique satisfiability problem
@@ Property / cites work: On the unique satisfiability problem / 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 @@
+Q4058132
@@ Property / cites work: Q4058132 / rank @@
+Normal rank
@@ Property / cites work @@
+``Possible is certain'' is desirable and can be expressive
+Normal rank
@@ Property / cites work @@
+On non-determinism in machines and languages
@@ Property / cites work: On non-determinism in machines and languages / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385525
@@ Property / cites work: Q4385525 / 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 @@
+Autoepistemic logic
@@ Property / cites work: Autoepistemic logic / rank @@
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ Property / cites work @@
+Multiple total stable models are definitely needed to solve unique solution problems
+Normal rank
@@ Property / cites work @@
+Relative complexity of checking and evaluating
@@ Property / cites work: Relative complexity of checking and evaluating / rank @@
+Normal rank
@@ Property / cites work @@
+The well-founded semantics for general logic programs
+Normal rank