- On the computational complexity of ethics: moral tractability for minds and machines.Jakob Stenseke - 2024 - Artificial Intelligence Review 57 (105):90.details
|
|
Two paradoxes of bounded rationality.David Thorstad - 2022 - Philosophers' Imprint 22.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
|
|
Iterative state-space reduction for flexible computation.Weixiong Zhang - 2001 - Artificial Intelligence 126 (1-2):109-138.details
|
|
Good Guesses.Kevin Dorst & Matthew Mandelkern - 2021 - Philosophy and Phenomenological Research 105 (3):581-618.details
|
|
Demons of Ecological Rationality.Maria Otworowska, Mark Blokpoel, Marieke Sweers, Todd Wareham & Iris van Rooij - 2018 - Cognitive Science 42 (3):1057-1066.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
|
|
Learning tractable Bayesian networks in the space of elimination orders.Marco Benjumeda, Concha Bielza & Pedro Larrañaga - 2019 - Artificial Intelligence 274 (C):66-90.details
|
|
Estimating the probability of meeting a deadline in schedules and plans.Liat Cohen, Solomon Eyal Shimony & Gera Weiss - 2019 - Artificial Intelligence 275 (C):329-355.details
|
|
A rational analysis of the selection task as optimal data selection.Mike Oaksford & Nick Chater - 1994 - Psychological Review 101 (4):608-631.details
|
|
Naive Probability: Model‐Based Estimates of Unique Events.Sangeet S. Khemlani, Max Lotstein & Philip N. Johnson-Laird - 2015 - Cognitive Science 39 (6):1216-1258.details
|
|
A general scheme for automatic generation of search heuristics from specification dependencies☆☆preliminary versions of this paper were presented in [15,16,18]. This work was supported in part by nsf grant iis-0086529 and by muri onr award n00014-00-1-0617. [REVIEW]Kalev Kask & Rina Dechter - 2001 - Artificial Intelligence 129 (1-2):91-131.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
|
|
Axiomatic rationality and ecological rationality.Gerd Gigerenzer - 2019 - Synthese 198 (4):3547-3564.details
|
|
Demons of Ecological Rationality.Maria Otworowska, Mark Blokpoel, Marieke Sweers, Todd Wareham & Iris Rooij - 2018 - Cognitive Science 42 (3):1057-1066.details
|
|
Fast and frugal heuristics are plausible models of cognition: Reply to Dougherty, Franco-Watkins, and Thomas (2008).Gerd Gigerenzer, Ulrich Hoffrage & Daniel G. Goldstein - 2008 - Psychological Review 115 (1):230-239.details
|
|
The Oxford Handbook of Causal Reasoning.Michael Waldmann (ed.) - 2017 - Oxford, England: Oxford University Press.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
|
|
An optimal approximation algorithm for Bayesian inference.Paul Dagum & Michael Luby - 1997 - Artificial Intelligence 93 (1-2):1-27.details
|
|
Semantics and complexity of abduction from default theories.Thomas Eiter, Georg Gottlob & Nicola Leone - 1997 - Artificial Intelligence 90 (1-2):177-223.details
|
|
How (far) can rationality be naturalized?Gerd Gigerenzer & Thomas Sturm - 2012 - Synthese 187 (1):243-268.details
|
|
Probabilistic conflicts in a search algorithm for estimating posterior probabilities in Bayesian networks.David Poole - 1996 - Artificial Intelligence 88 (1-2):69-100.details
|
|
Local conditioning in Bayesian networks.F. J. Díez - 1996 - Artificial Intelligence 87 (1-2):1-20.details
|
|
Principles and applications of continual computation.Eric Horvitz - 2001 - Artificial Intelligence 126 (1-2):159-196.details
|
|
Finding MAPs for belief networks is NP-hard.Solomon Eyal Shimony - 1994 - Artificial Intelligence 68 (2):399-410.details
|
|
On the hardness of approximate reasoning.Dan Roth - 1996 - Artificial Intelligence 82 (1-2):273-302.details
|
|
On the complexity of inference about probabilistic relational models.Manfred Jaeger - 2000 - Artificial Intelligence 117 (2):297-308.details
|
|