Skip to main content
SpringerLink
Log in
Book cover

International Conference on Artificial General Intelligence

AGI 2015: Artificial General Intelligence pp 156–165Cite as

Two Attempts to Formalize Counterpossible Reasoning in Deterministic Settings

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9205))

Abstract

This paper motivates the study of counterpossibles (logically impossible counterfactuals) as necessary for developing a decision theory suitable for generally intelligent agents embedded within their environments. We discuss two attempts to formalize a decision theory using counterpossibles, one based on graphical models and another based on proof search.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bar-Hillel, M., Margalit, A.: Newcomb’s paradox revisited. British Journal for the Philosophy of Science 23(4), 295–304 (1972). http://www.jstor.org/stable/686730

    Article  Google Scholar 

  2. Benson-Tilsen, T.: UDT with known search order. Tech. Rep. 2014–4, Machine Intelligence Research Institute (2014). http://intelligence.org/files/UDTSearchOrder.pdf

  3. Cohen, D.: On what cannot be. In: Dunn, J., Gupta, A. (eds.) Truth or Consequences, pp. 123–132. Kluwer (1990)

    Google Scholar 

  4. Dai, W.: Towards a new decision theory. Less Wrong (2009). http://lesswrong.com/lw/15m/towards_a_new_decision_theory/

  5. Gibbard, A., Harper, W.L.: Counterfactuals and two kinds of expected utility. In: Hooker, C.A., Leach, J.J., McClennen, E.F. (eds.) Foundations and Applications of Decision Theory, The Western Ontario Series in Philosophy of Science, vol. 13a. D. Reidel (1978)

    Google Scholar 

  6. Jeffrey, R.C.: The Logic of Decision, 2 edn. Chicago University Press (1983)

    Google Scholar 

  7. Lehmann, E.L.: Some principles of the theory of testing hypotheses. Annals of Mathematical Statistics 21(1), 1–26 (1950)

    Article  MathSciNet  Google Scholar 

  8. Lewis, D.: Prisoners’ dilemma is a Newcomb problem. Philosophy & Public Affairs 8(3), 235–240 (1979). http://www.jstor.org/stable/2265034

    Google Scholar 

  9. Lewis, D.: Causal decision theory. Australasian Journal of Philosophy 59(1), 5–30 (1981)

    Article  Google Scholar 

  10. Lewis, D.: Why ain’cha rich? Noûs 15(3), 377–380 (1981). http://www.jstor.org/stable/2215439

    Article  Google Scholar 

  11. Nozick, R.: Newcomb’s problem and two principles of choice. In: Rescher, N. (ed.) Essays in Honor of Carl G. Hempel, pp. 114–146. No. 24 in Synthese Library, D. Reidel (1969)

    Google Scholar 

  12. Pearl, J.: Causality, 1 edn. Cambridge University Press (2000)

    Google Scholar 

  13. Von Neumann, J., Morgenstern, O.: Theory of Games and Economic Behavior, 1 edn. Princeton University Press (1944)

    Google Scholar 

  14. Yudkowsky, E.: Timeless decision theory. Tech. rep., The Singularity Institute, San Francisco, CA (2010). http://intelligence.org/files/TDT.pdf

Download references

Author information

Authors and Affiliations

  1. Machine Intelligence Research Institute, Berkeley, USA

    Nate Soares & Benja Fallenstein

Authors
  1. Nate Soares
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Benja Fallenstein
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nate Soares .

Editor information

Editors and Affiliations

  1. Reykjavik University, Reykjavik, Iceland

    Jordi Bieger

  2. Hong Kong Polytechnic University, Hong Kong, Hong Kong SAR

    Ben Goertzel

  3. Mechanics and Optics, Saint Petersburg State University of Information Technologies, St. Petersburg, Russia

    Alexey Potapov

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Soares, N., Fallenstein, B. (2015). Two Attempts to Formalize Counterpossible Reasoning in Deterministic Settings. In: Bieger, J., Goertzel, B., Potapov, A. (eds) Artificial General Intelligence. AGI 2015. Lecture Notes in Computer Science(), vol 9205. Springer, Cham. https://doi.org/10.1007/978-3-319-21365-1_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-21365-1_17

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-21364-4

  • Online ISBN: 978-3-319-21365-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation