Skip to main content

Logic-Based Merging in Fragments of Classical Logic with Inputs from Social Choice Theory

  • 744 Accesses

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

Abstract

One does not need to look far to find problems which require harmonization of different, possibly conflicting, preferences.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-319-67504-6_30
  • Chapter length: 5 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   59.99
Price excludes VAT (USA)
  • ISBN: 978-3-319-67504-6
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   79.99
Price excludes VAT (USA)

References

  1. Ahn, D.S., Oliveros, S.: Combinatorial voting. Econometrica 80(1), 89–141 (2012)

    MathSciNet  CrossRef  Google Scholar 

  2. Arrow, K.: Social Choice and Individual Values, 2nd edn. Yale University Press, New Haven (1963)

    MATH  Google Scholar 

  3. Bienvenu, M., Lang, J., Wilson, N.: From preference logics to preference languages, and back. In: Proceedings of KR 2010 (2010)

    Google Scholar 

  4. Boutilier, C., Brafman, R.I., Domshlak, C., Hoos, H.H., Poole, D.: CP-nets: a tool for representing and reasoning with conditional ceteris paribus preference statements. J. Artif. Intell. Res. (JAIR) 21, 135–191 (2004)

    MathSciNet  CrossRef  Google Scholar 

  5. Brewka, G., Mailly, J., Woltran, S.: Translation-based revision and merging for minimal horn reasoning. In: Proceedings of ECAI 2016, pp. 734–742 (2016)

    Google Scholar 

  6. Chevaleyre, Y., Endriss, U., Lang, J., Maudet, N.: Preference handling in combinatorial domains: from AI to social choice. AI Mag. 29(4), 37–46 (2008)

    CrossRef  Google Scholar 

  7. Creignou, N., Papini, O., Rümmele, S., Woltran, S.: Belief merging within fragments of propositional logic. ACM Trans. Comput. Log. 17(3), 20:1–20:28 (2016)

    MathSciNet  CrossRef  Google Scholar 

  8. Delobelle, J., Haret, A., Konieczny, S., Mailly, J., Rossit, J., Woltran, S.: Merging of abstract argumentation frameworks. In: Proceedings of KR 2016, pp. 33–42 (2016)

    Google Scholar 

  9. Díaz, A.M., Pérez, R.P.: Impossibility in Belief Merging. CoRR abs/1606.04589 (2016)

    Google Scholar 

  10. Diller, M., Haret, A., Linsbichler, T., Rümmele, S., Woltran, S.: An extension-based approach to belief revision in abstract argumentation. In: Proceedings of IJCAI 2015, pp. 2926–2932 (2015)

    Google Scholar 

  11. Everaere, P., Konieczny, S., Marquis, P.: The strategy-proofness landscape of merging. J. Artif. Intell. Res. (JAIR) 28, 49–105 (2007)

    CrossRef  Google Scholar 

  12. Konieczny, S., Lang, J., Marquis, P.: DA\(^{2}\) merging operators. Artif. Intell. 157(1–2), 49–79 (2004)

    MathSciNet  CrossRef  Google Scholar 

  13. Konieczny, S., Pérez, R.P.: Logic based merging. J. Philos. Logic 40(2), 239–270 (2011)

    MathSciNet  CrossRef  Google Scholar 

  14. 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, pp. 197–222. Cambridge University Press, New York (2016). Chapter 9

    Google Scholar 

  15. Masthoff, J.: Group modeling: selecting a sequence of television items to suit a group of viewers. User Model. User-Adapt. Interact. 14(1), 37–85 (2004)

    CrossRef  Google Scholar 

  16. Senot, C., Kostadinov, D., Bouzid, M., Picault, J., Aghasaryan, A., Bernier, C.: Analysis of strategies for building group profiles. In: De Bra, P., Kobsa, A., Chin, D. (eds.) UMAP 2010. LNCS, vol. 6075, pp. 40–51. Springer, Heidelberg (2010). doi:10.1007/978-3-642-13470-8_6

    CrossRef  Google Scholar 

  17. Haret, A., Mailly, J., Woltran, S.: Distributing knowledge into simple bases. In: Proceedings of IJCAI 2016, pp. 1109–1115 (2016)

    Google Scholar 

  18. Haret, A., Pfandler, A., Woltran, S.: Beyond IC postulates: classification criteria for merging operators. In: Proceedings ECAI 2016, pp. 372–380 (2016)

    Google Scholar 

  19. Haret, A., Rümmele, S., Woltran, S.: Merging in the horn fragment. In: Proceedings of IJCAI 2015, pp. 3041–3047 (2015)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Adrian Haret .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Haret, A. (2017). Logic-Based Merging in Fragments of Classical Logic with Inputs from Social Choice Theory. In: Rothe, J. (eds) Algorithmic Decision Theory. ADT 2017. Lecture Notes in Computer Science(), vol 10576. Springer, Cham. https://doi.org/10.1007/978-3-319-67504-6_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-67504-6_30

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-67503-9

  • Online ISBN: 978-3-319-67504-6

  • eBook Packages: Computer ScienceComputer Science (R0)