The computational complexity of ideal semantics (Q1045987): Difference between revisions

@@ Property / cites work @@
+Argumentation in artificial intelligence
@@ Property / cites work: Argumentation in artificial intelligence / 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 @@
+An abstract, argumentation-theoretic approach to default reasoning
+Normal rank
@@ Property / cites work @@
+Functions computable with nonadaptive queries to NP
+Normal rank
@@ Property / cites work @@
+On computing Boolean connectives of characteristic functions
+Normal rank
@@ Property / cites work @@
+On unique satisfiability and the threshold behavior of randomized reductions
+Normal rank
@@ Property / cites work @@
+On the computational complexity of assumption-based argumentation for default reasoning.
+Normal rank
@@ Property / cites work @@
+Graph theoretical structures in logic programs and default theories
+Normal rank
@@ Property / cites work @@
+On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
+Normal rank
@@ Property / cites work @@
+Dialectic proof procedures for assumption-based, admissible argumentation
+Normal rank
@@ Property / cites work @@
+Computing ideal sceptical argumentation
@@ Property / cites work: Computing ideal sceptical argumentation / rank @@
+Normal rank
@@ Property / cites work @@
+Computational properties of argument systems satisfying graph-theoretic constraints
+Normal rank
@@ Property / cites work @@
+Coherence in finite argument systems.
@@ Property / cites work: Coherence in finite argument systems. / rank @@
+Normal rank
@@ Property / cites work @@
+Two party immediate response disputes: Properties and efficiency
+Normal rank
@@ Property / cites work @@
+Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
+Normal rank
@@ Property / cites work @@
+Complexity Results for Nonmonotonic Logics
@@ Property / cites work: Complexity Results for Nonmonotonic Logics / rank @@
+Normal rank
@@ Property / cites work @@
+Computing functions with parallel queries to NP
@@ Property / cites work: Computing functions with parallel queries to NP / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385525
@@ Property / cites work: Q4385525 / rank @@
+Normal rank
@@ Property / cites work @@
+On the relation between default and autoepistemic logic
+Normal rank
@@ Property / cites work @@
+A comparison of polynomial time reducibilities
@@ Property / cites work: A comparison of polynomial time reducibilities / rank @@
+Normal rank
@@ Property / cites work @@
+Semantical considerations on nonmonotonic logic
@@ Property / cites work: Semantical considerations on nonmonotonic logic / 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 @@
+NP is as easy as detecting unique solutions
@@ Property / cites work: NP is as easy as detecting unique solutions / rank @@
+Normal rank
@@ Property / cites work @@
+Q4536329
@@ Property / cites work: Q4536329 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounded Query Classes
@@ Property / cites work: Bounded Query Classes / rank @@
+Normal rank