Counting complexity of propositional abduction (Q988576): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jcss.2009.12.001
+Normal rank
@@ Property / OpenAlex ID @@
+W2032312337
@@ Property / OpenAlex ID: W2032312337 / rank @@
+Normal rank
@@ Property / cites work @@
+The computational complexity of abduction
@@ Property / cites work: The computational complexity of abduction / rank @@
+Normal rank
@@ Property / cites work @@
+A Complete Classification of the Complexity of Propositional Abduction
+Normal rank
@@ Property / cites work @@
+On some tractable classes in deduction and abduction
+Normal rank
@@ Property / cites work @@
+Subtractive reductions and complete problems for counting complexity classes
+Normal rank
@@ Property / cites work @@
+The complexity of logic-based abduction
@@ Property / cites work: The complexity of logic-based abduction / rank @@
+Normal rank
@@ Property / cites work @@
+Computer Science Logic
@@ Property / cites work: Computer Science Logic / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4852904
@@ Property / cites work: Q4852904 / rank @@
+Normal rank
@@ Property / cites work @@
+Counting Complexity of Minimal Cardinality and Minimal Weight Abduction
+Normal rank
@@ Property / cites work @@
+Complexity of counting the optimal solutions
@@ Property / cites work: Complexity of counting the optimal solutions / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of optimization problems
@@ Property / cites work: The complexity of optimization problems / rank @@
+Normal rank
@@ Property / cites work @@
+Generalizations of Opt P to the polynomial hierarchy
+Normal rank
@@ Property / cites work @@
+What makes propositional abduction tractable
@@ Property / cites work: What makes propositional abduction tractable / rank @@
+Normal rank
@@ Property / cites work @@
+Logic Programming and Nonmonotonic Reasoning
@@ Property / cites work: Logic Programming and Nonmonotonic Reasoning / rank @@
+Normal rank
@@ Property / cites work @@
+Q3998470
@@ Property / cites work: Q3998470 / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic Horn abduction and Bayesian networks
+Normal rank
@@ Property / cites work @@
+The complexity of satisfiability problems
@@ Property / cites work: The complexity of satisfiability problems / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of computing the permanent
@@ Property / cites work: The complexity of computing the permanent / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Enumeration and Reliability Problems
+Normal rank
@@ Property / cites work @@
+Q4434165
@@ Property / cites work: Q4434165 / rank @@
+Normal rank