Propositional default logics made easier: computational complexity of model checking. (Q1853549): Difference between revisions

@@ Property / cites work @@
+A survey of complexity results for non-monotonic logics
+Normal rank
@@ Property / cites work @@
+On the computational cost of disjunctive logic programming: Propositional case
+Normal rank
@@ Property / cites work @@
+Complexity Results for Nonmonotonic Logics
@@ Property / cites work: Complexity Results for Nonmonotonic Logics / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of default reasoning under the stationary fixed point semantics
+Normal rank
@@ Property / cites work @@
+Translating default logic into standard autoepistemic logic
+Normal rank
@@ Property / cites work @@
+Q4028804
@@ Property / cites work: Q4028804 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4246971
@@ Property / cites work: Q4246971 / rank @@
+Normal rank
@@ Property / cites work @@
+Hard problems for simple default logics
@@ Property / cites work: Hard problems for simple default logics / rank @@
+Normal rank
@@ Property / cites work @@
+Autoepistemic logic
@@ Property / cites work: Autoepistemic logic / rank @@
+Normal rank
@@ Property / cites work @@
+Q4273952
@@ Property / cites work: Q4273952 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4287511
@@ Property / cites work: Q4287511 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3221403
@@ Property / cites work: Q3221403 / rank @@
+Normal rank
@@ Property / cites work @@
+A logic for default reasoning
@@ Property / cites work: A logic for default reasoning / rank @@
+Normal rank
@@ Property / cites work @@
+Bounded Query Classes
@@ Property / cites work: Bounded Query Classes / rank @@
+Normal rank