Switch to: References

Add citations

You must login to add citations.
  1. An optimal approximation algorithm for Bayesian inference.Paul Dagum & Michael Luby - 1997 - Artificial Intelligence 93 (1-2):1-27.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • 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.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Learning tractable Bayesian networks in the space of elimination orders.Marco Benjumeda, Concha Bielza & Pedro Larrañaga - 2019 - Artificial Intelligence 274 (C):66-90.
    Download  
     
    Export citation  
     
    Bookmark  
  • 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.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Approximating MAPs for belief networks is NP-hard and other theorems.Ashraf M. Abdelbar & Sandra M. Hedetniemi - 1998 - Artificial Intelligence 102 (1):21-38.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • On the computational complexity of ethics: moral tractability for minds and machines.Jakob Stenseke - 2024 - Artificial Intelligence Review 57 (105):90.
    Why should moral philosophers, moral psychologists, and machine ethicists care about computational complexity? Debates on whether artificial intelligence (AI) can or should be used to solve problems in ethical domains have mainly been driven by what AI can or cannot do in terms of human capacities. In this paper, we tackle the problem from the other end by exploring what kind of moral machines are possible based on what computational systems can or cannot do. To do so, we analyze normative (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • 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.
    Despite their success in describing and predicting cognitive behavior, the plausibility of so-called ‘rational explanations’ is often contested on the grounds of computational intractability. Several cognitive scientists have argued that such intractability is an orthogonal pseudoproblem, however, since rational explanations account for the ‘why’ of cognition but are agnostic about the ‘how’. Their central premise is that humans do not actually perform the rational calculations posited by their models, but only act as if they do. Whether or not the problem (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Iterative state-space reduction for flexible computation.Weixiong Zhang - 2001 - Artificial Intelligence 126 (1-2):109-138.
    Download  
     
    Export citation  
     
    Bookmark  
  • Two paradoxes of bounded rationality.David Thorstad - 2022 - Philosophers' Imprint 22.
    My aim in this paper is to develop a unified solution to two paradoxes of bounded rationality. The first is the regress problem that incorporating cognitive bounds into models of rational decisionmaking generates a regress of higher-order decision problems. The second is the problem of rational irrationality: it sometimes seems rational for bounded agents to act irrationally on the basis of rational deliberation. I review two strategies which have been brought to bear on these problems: the way of weakening which (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Finding MAPs for belief networks is NP-hard.Solomon Eyal Shimony - 1994 - Artificial Intelligence 68 (2):399-410.
    Download  
     
    Export citation  
     
    Bookmark   21 citations  
  • Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks.Solomon E. Shimony & Carmel Domshlak - 2003 - Artificial Intelligence 151 (1-2):213-225.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • On the hardness of approximate reasoning.Dan Roth - 1996 - Artificial Intelligence 82 (1-2):273-302.
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  • Probabilistic conflicts in a search algorithm for estimating posterior probabilities in Bayesian networks.David Poole - 1996 - Artificial Intelligence 88 (1-2):69-100.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Demons of Ecological Rationality.Maria Otworowska, Mark Blokpoel, Marieke Sweers, Todd Wareham & Iris van Rooij - 2018 - Cognitive Science 42 (3):1057-1066.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Demons of Ecological Rationality.Maria Otworowska, Mark Blokpoel, Marieke Sweers, Todd Wareham & Iris Rooij - 2018 - Cognitive Science 42 (3):1057-1066.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • A rational analysis of the selection task as optimal data selection.Mike Oaksford & Nick Chater - 1994 - Psychological Review 101 (4):608-631.
    Download  
     
    Export citation  
     
    Bookmark   238 citations  
  • Bayesian Intractability Is Not an Ailment That Approximation Can Cure.Johan Kwisthout, Todd Wareham & Iris van Rooij - 2011 - Cognitive Science 35 (5):779-784.
    Bayesian models are often criticized for postulating computations that are computationally intractable (e.g., NP-hard) and therefore implausibly performed by our resource-bounded minds/brains. Our letter is motivated by the observation that Bayesian modelers have been claiming that they can counter this charge of “intractability” by proposing that Bayesian computations can be tractably approximated. We would like to make the cognitive science community aware of the problematic nature of such claims. We cite mathematical proofs from the computer science literature that show intractable (...)
    Download  
     
    Export citation  
     
    Bookmark   25 citations  
  • Naive Probability: Model‐Based Estimates of Unique Events.Sangeet S. Khemlani, Max Lotstein & Philip N. Johnson-Laird - 2015 - Cognitive Science 39 (6):1216-1258.
    We describe a dual-process theory of how individuals estimate the probabilities of unique events, such as Hillary Clinton becoming U.S. President. It postulates that uncertainty is a guide to improbability. In its computer implementation, an intuitive system 1 simulates evidence in mental models and forms analog non-numerical representations of the magnitude of degrees of belief. This system has minimal computational power and combines evidence using a small repertoire of primitive operations. It resolves the uncertainty of divergent evidence for single events, (...)
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • 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.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • 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.
    Download  
     
    Export citation  
     
    Bookmark  
  • On the complexity of inference about probabilistic relational models.Manfred Jaeger - 2000 - Artificial Intelligence 117 (2):297-308.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Principles and applications of continual computation.Eric Horvitz - 2001 - Artificial Intelligence 126 (1-2):159-196.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • How (far) can rationality be naturalized?Gerd Gigerenzer & Thomas Sturm - 2012 - Synthese 187 (1):243-268.
    The paper shows why and how an empirical study of fast-and-frugal heuristics can provide norms of good reasoning, and thus how (and how far) rationality can be naturalized. We explain the heuristics that humans often rely on in solving problems, for example, choosing investment strategies or apartments, placing bets in sports, or making library searches. We then show that heuristics can lead to judgments that are as accurate as or even more accurate than strategies that use more information and computation, (...)
    Download  
     
    Export citation  
     
    Bookmark   41 citations  
  • 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.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Axiomatic rationality and ecological rationality.Gerd Gigerenzer - 2019 - Synthese 198 (4):3547-3564.
    Axiomatic rationality is defined in terms of conformity to abstract axioms. Savage limited axiomatic rationality to small worlds, that is, situations in which the exhaustive and mutually exclusive set of future states S and their consequences C are known. Others have interpreted axiomatic rationality as a categorical norm for how human beings should reason, arguing in addition that violations would lead to real costs such as money pumps. Yet a review of the literature shows little evidence that violations are actually (...)
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Semantics and complexity of abduction from default theories.Thomas Eiter, Georg Gottlob & Nicola Leone - 1997 - Artificial Intelligence 90 (1-2):177-223.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Good Guesses.Kevin Dorst & Matthew Mandelkern - 2023 - Philosophy and Phenomenological Research 105 (3):581-618.
    This paper is about guessing: how people respond to a question when they aren’t certain of the answer. Guesses show surprising and systematic patterns that the most obvious theories don’t explain. We argue that these patterns reveal that people aim to optimize a tradeoff between accuracy and informativity when forming their guess. After spelling out our theory, we use it to argue that guessing plays a central role in our cognitive lives. In particular, our account of guessing yields new theories (...)
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • Local conditioning in Bayesian networks.F. J. Díez - 1996 - Artificial Intelligence 87 (1-2):1-20.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • The Oxford Handbook of Causal Reasoning.Michael Waldmann (ed.) - 2017 - Oxford, England: Oxford University Press.
    Causal reasoning is one of our most central cognitive competencies, enabling us to adapt to our world. Causal knowledge allows us to predict future events, or diagnose the causes of observed facts. We plan actions and solve problems using knowledge about cause-effect relations. Without our ability to discover and empirically test causal theories, we would not have made progress in various empirical sciences. In the past decades, the important role of causal knowledge has been discovered in many areas of cognitive (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations