Skip to main content
SpringerLink
Log in

Algorithmic Decision Theory Meets Logic

— Invited Talk —

  • Conference paper
  • First Online:
Logic Programming and Nonmonotonic Reasoning (LPNMR 2015)

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

  • 812 Accesses

Abstract

Algorithmic decision theory can be roughly defined as the design and study of languages and methods for expressing and solving various classes of decision problems, including: decision under uncertainty, sequential decision making, multicriteria decision making, collective decision making, and strategic interactions in distributed decision making.

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

Access this chapter

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 EPUB and 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

Institutional subscriptions

Notes

  1. 1.

    See [1] for an survey of voting in combinatorial domains.

  2. 2.

    See [15] for a review of existing work along this line.

  3. 3.

    See [21] for a survey.

References

  1. Lang, J., Xia, L.: Voting in combinatorial domains. In: Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.D. (eds.) Handbook of Computational Social Choice. Cambridge University Press (2015, in Press)

    Google Scholar 

  2. Lang, J.: Logical representation of preferences. In: Bouyssou, D., Dubois, D., Prade, H., Pirlot, M. (eds.) Decision Making Process: Concepts and Methods, pp. 321–364. Wiley-ISTE, London (2009)

    Chapter  Google Scholar 

  3. Delgrande, J.P., Schaub, T., Tompits, H., Wang, K.: A classification and survey of preference handling approaches in nonmonotonic reasoning. Comput. Intell. 20, 308–334 (2004)

    Article  MathSciNet  Google Scholar 

  4. Brewka, G.: Preferences in answer set programming. In: Marín, R., Onaindía, E., Bugarín, A., Santos, J. (eds.) CAEPIA 2005. LNCS (LNAI), vol. 4177, pp. 1–10. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  5. Brewka, G., Niemelä, I., Truszczynski, M.: Preferences and nonmonotonic reasoning. AI Mag. 29, 69–78 (2008)

    Google Scholar 

  6. Brewka, G., Delgrande, J.P., Romero, J., Schaub, T.: asprin: customizing answer set preferences without a headache. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, Austin, Texas, USA, 25–30 January 2015, pp. 1467–1474 (2015)

    Google Scholar 

  7. von Wright, G.: The Logic of Preference. Edinburgh University Press, Edinburgh (1963)

    Google Scholar 

  8. Hansson, S.O.: The Structure of Values and Norms. Cambridge University Press, Cambridge (2001)

    Book  MATH  Google Scholar 

  9. van Benthem, J., Girard, P., Roy, O.: Everything else being equal: a modal logic for Ceteris Paribus preferences. J. Philos. Logic 38, 83–125 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  10. Bienvenu, M., Lang, J., Wilson, N.: From preference logics to preference languages, and back. In: Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Conference, KR 2010, Toronto, Ontario, Canada, 9–13 May 2010

    Google Scholar 

  11. Boutilier, C.: Toward a logic for qualitative decision theory. In: Proceedings of the 4th International Conference on Principles of Knowledge Representation and Reasoning (KR 1994), Bonn, Germany, 24–27 May 1994, pp. 75–86 (1994)

    Google Scholar 

  12. Lang, J.: Conditional desires and utilities: an alternative logical approach to qualitative decision theory. In: Proceedings of the 12th European Conference on Artificial Intelligence, Budapest, Hungary, 11–16 August 1996, pp. 318–322 (1996)

    Google Scholar 

  13. Lang, J., van der Torre, L.W.N., Weydert, E.: Hidden uncertainty in the logical representation of desires. In: IJCAI 2003, Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, Acapulco, Mexico, 9–15 August 2003, pp. 685–690 (2003)

    Google Scholar 

  14. Konczak, K., Lang, J.: Voting procedures with incomplete preferences. In: Multidisciplinary Workshop on Advances in Preference Handling, pp. 124–129 (2005)

    Google Scholar 

  15. Boutilier, C., Rosenschein, J.: Incomplete information and communication in voting. In: Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.D. (eds.) Handbook of Computational Social Choice. Cambridge University Press (2015, in Press)

    Google Scholar 

  16. Chopra, S., Pacuit, E., Parikh, R.: Knowledge-theoretic properties of strategic voting. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 18–30. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  17. van Ditmarsch, H., Lang, J., Saffidine, A.: Strategic voting and the logic of knowledge. In: Proceedings of 14th TARK, ACM (2013)

    Google Scholar 

  18. Meir, R., Lev, O., Rosenschein, J.: A local-dominance theory of voting equilibria. In: ACM Conference on Economics and Computation, EC 2014, Stanford, CA, USA, 8–12 June 2014, pp. 313–330 (2014)

    Google Scholar 

  19. Conitzer, V., Walsh, T., Xia, L.: Dominating manipulations in voting with partial information. In: Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2011, San Francisco, California, USA, 7–11 August 2011

    Google Scholar 

  20. Kautz, H., Selman, B.: Planning as satisfiability. In: ECAI, pp. 359–363 (1992)

    Google Scholar 

  21. Rintanen, J.: Planning and sat. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability, pp. 483–504. IOS Press, Amsterdam (2009)

    Google Scholar 

  22. Lifschitz, V.: Answer set programming and plan generation. Artif. Intell. 138, 39–54 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  23. Eiter, T., Faber, W., Leone, N., Pfeifer, G., Polleres, A.: A logic programming approach to knowledge-state planning, II: the DLV\({}^{\text{ k }}\) system. Artif. Intell. 144, 157–211 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  24. Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Multi-criteria optimization in answer set programming. In: Technical Communications of the 27th International Conference on Logic Programming, p. 1 (2011)

    Google Scholar 

  25. Nipkow, T.: Social choice theory in HOL: Arrow and Gibbard-Satterthwaite. J. Autom. Reasoning 43, 289–304 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  26. Tang, P., Lin, F.: Computer-aided proofs of Arrow’s and other impossibility theorems. Artif. Intell. 173, 1041–1053 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  27. Tang, P., Lin, F.: Discovering theorems in game theory: two-person games with unique pure nash equilibrium payoffs. Artif. Intell. 175, 2010–2020 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  28. Geist, C., Endriss, U.: Automated search for impossibility theorems in social choice theory: ranking sets of objects. J. Artif. Intell. Res. 40, 143–174 (2011)

    MATH  MathSciNet  Google Scholar 

  29. Brandt, F., Geist, C.: Finding strategyproof social choice functions via SAT solving. In: AAMAS 2014, pp. 1193–1200. IFAAMAS (2014)

    Google Scholar 

  30. Brandl, F., Brandt, F., Geist, C., Hofbauer, J.: Strategic abstention based on preference extensions: positive results and computer-generated impossibilities. In: IJCAI 2015 (2015)

    Google Scholar 

  31. Ågotnes, T., van der Hoek, W., Wooldridge, M.: On the logic of preference and judgment aggregation. Auton. Agents Multi-Agent Syst. 22, 4–30 (2011)

    Article  Google Scholar 

  32. Troquard, N., van der Hoek, W., Wooldridge, M.: Reasoning about social choice functions. J. Philos. Logic 40, 473–498 (2011)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LAMSADE, CNRS and Université Paris Dauphine, Paris, France

    Jérôme Lang

Authors
  1. Jérôme Lang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jérôme Lang .

Editor information

Editors and Affiliations

  1. University of Calabria, Rende, Italy

    Francesco Calimeri

  2. University of Calabria, Rende, Italy

    Giovambattista Ianni

  3. University of Kentucky Dept. Computer Science, Lexington, Kentucky, USA

    Miroslaw Truszczynski

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Lang, J. (2015). Algorithmic Decision Theory Meets Logic. In: Calimeri, F., Ianni, G., Truszczynski, M. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2015. Lecture Notes in Computer Science(), vol 9345. Springer, Cham. https://doi.org/10.1007/978-3-319-23264-5_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23264-5_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-23263-8

  • Online ISBN: 978-3-319-23264-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation