- On the computational complexity of ethics: moral tractability for minds and machines.Jakob Stenseke - 2024 - Artificial Intelligence Review 57 (105):90.details
|
|
An algorithm for rinding MAPs for belief networks through cost-based abduction.Ashraf M. Abdelbar - 1998 - Artificial Intelligence 104 (1-2):331-338.details
|
|
Rational analysis, intractability, and the prospects of ‘as if’-explanations.Iris van Rooij, Johan Kwisthout, Todd Wareham & Cory Wright - 2018 - Synthese 195 (2):491-510.details
|
|
Coherence measures and inference to the best explanation.David H. Glass - 2007 - Synthese 157 (3):275-296.details
|
|
Bayesian Intractability Is Not an Ailment That Approximation Can Cure.Johan Kwisthout, Todd Wareham & Iris van Rooij - 2011 - Cognitive Science 35 (5):779-784.details
|
|
The complexity of approximating MAPs for belief networks with bounded probabilities.Ashraf M. Abdelbar, Stephen T. Hedetniemi & Sandra M. Hedetniemi - 2000 - Artificial Intelligence 124 (2):283-288.details
|
|
Approximating MAPs for belief networks is NP-hard and other theorems.Ashraf M. Abdelbar & Sandra M. Hedetniemi - 1998 - Artificial Intelligence 102 (1):21-38.details
|
|
A probabilistic plan recognition algorithm based on plan tree grammars.Christopher W. Geib & Robert P. Goldman - 2009 - Artificial Intelligence 173 (11):1101-1132.details
|
|
Complexity results for structure-based causality.Thomas Eiter & Thomas Lukasiewicz - 2002 - Artificial Intelligence 142 (1):53-89.details
|
|
Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering.Ole J. Mengshoel, David C. Wilkins & Dan Roth - 2006 - Artificial Intelligence 170 (16-17):1137-1174.details
|
|
Monitoring of perception systems: Deterministic, probabilistic, and learning-based fault detection and identification.Pasquale Antonante, Heath G. Nilsen & Luca Carlone - 2023 - Artificial Intelligence 325 (C):103998.details
|
|
Most frugal explanations in Bayesian networks.Johan Kwisthout - 2015 - Artificial Intelligence 218 (C):56-73.details
|
|
Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks.Solomon E. Shimony & Carmel Domshlak - 2003 - Artificial Intelligence 151 (1-2):213-225.details
|
|
Approximate belief updating in max-2-connected Bayes networks is NP-hard.Erez Karpas, Solomon Eyal Shimony & Amos Beimel - 2009 - Artificial Intelligence 173 (12-13):1150-1153.details
|
|
Complexity results for explanations in the structural-model approach.Thomas Eiter & Thomas Lukasiewicz - 2004 - Artificial Intelligence 154 (1-2):145-198.details
|
|
Relational preference rules for control.Ronen I. Brafman - 2011 - Artificial Intelligence 175 (7-8):1180-1193.details
|
|
When Can Predictive Brains be Truly Bayesian?Mark Blokpoel, Johan Kwisthout & Iris van Rooij - 2012 - Frontiers in Psychology 3.details
|
|