Skip to main content
SpringerLink
Log in

Preference Revision Via Declarative Debugging

  • Conference paper
Progress in Artificial Intelligence (EPIA 2005)

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

Included in the following conference series:

Abstract

Preference criteria are rarely static. Often they are subject to modification and aggregation. The resulting preference criteria may not satisfy the properties of the original ones and must therefore be revised. This paper investigates the problem of revising such preference criteria by means of declarative debugging techniques.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alferes, J.J., Pereira, L.M., Swift, T.: Abduction in Well-Founded Semantics and Generalized Stable Models via Tabled Dual Programs. Theory and Practice of Logic Programming 4(4), 383–428 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  2. Arrow, K.: Social Choice and Individual Values. John Wiley and Sons, Chichester (1951)

    MATH  Google Scholar 

  3. Chomicki, J.: Preference Formulas in Relational Queries. ACM Transactions on Database Systems 28(4), 427–466 (2003)

    Article  Google Scholar 

  4. Chomicki, J., Song, J.: On Preference Refinement. Paper in Progress (2004)

    Google Scholar 

  5. Dell’Acqua, P., Pereira, L.M.: Preferring and updating in logic-based agents. In: Bartenstein, O., Geske, U., Hannebauer, M., Yoshie, O. (eds.) INAP 2001. LNCS (LNAI), vol. 2543, pp. 70–85. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  6. Gärdenfors, P., Rott, H.: Belief Revision. In: Gabbay, D.M., Hogger, C.J., Robinson, J.A. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 4, pp. 35–132. Oxford University Press, Oxford (1995)

    Google Scholar 

  7. Gelder, A.V., Ross, K.A., Schlipf, J.S.: The Well-Founded Semantics for General Logic Programs. J. ACM 38(3), 620–650 (1991)

    MATH  Google Scholar 

  8. Grosof, B.N.: New Prioritization Methods for Conflict Management. In: Klein, M. (ed.) Proc. IJCAI 1993 W. on Computational Models of Conflict Management in Cooperative Problem-Solving. Int. Joint Conf. on Artificial Intelligence (1993)

    Google Scholar 

  9. Andréka, H., Ryan, M., Schobbens, P.Y.: Operators and Laws for Combining Preference Relations. J. of Logic and Computation 12(1), 13–53 (2002)

    Article  MATH  Google Scholar 

  10. Pereira, L.M., Damásio, C., Alferes, J.J.: Debugging by Diagnosing Assumptions. In: Fritzson, P.A. (ed.) AADEBUG 1993. LNCS, vol. 749, pp. 58–74. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  11. Rossi, F., Venable, K.B., Walsh, T.: Aggregating Preference Cannot be Fair. Preprint n. 12-2004, Dept. of Pure and Applied Mathematics, Univ. of Padova, Italy (2004)

    Google Scholar 

  12. Rossi, F., Venable, K.B., Walsh, T.: mCP nets: Representing and Reasoning with Preferences of Multiple Agents. In: McGuinness, D.L., Ferguson, G. (eds.) AADEBUG 1993. LNCS, vol. 749, pp. 729–734. AAAI Press, Menlo Park (2004)

    Google Scholar 

  13. Yager, R.R.: Fusion of Multi-Agent Preference Ordering. Fuzzy Sets and Systems 117, 1–12 (2001)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Science and Technology – ITN, Linköping University, 601 74, Norrköping, Sweden

    Pierangelo Dell’Acqua

  2. Centro de Inteligência Artificial – CENTRIA, Departamento de Informática, Faculdade de Ciências e Tecnologia, Universidade Nova de Lisboa, 2829-516, Caparica, Portugal

    Pierangelo Dell’Acqua & Luís Moniz Pereira

Authors
  1. Pierangelo Dell’Acqua
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luís Moniz Pereira
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Portugal Telecom Inovação (PTI), Centro de Informatica e Sistemas da Universidade de Coimbra (CISUC),  

    Carlos Bento

  2. Department of Informatics Engineering, Coimbra University, Portugal

    Amílcar Cardoso

  3. Centre of Human Language Technology and Bioinformatics, University of Beira Interior, 6201-001, Covilhã, Portugal

    Gaël Dias

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dell’Acqua, P., Pereira, L.M. (2005). Preference Revision Via Declarative Debugging. In: Bento, C., Cardoso, A., Dias, G. (eds) Progress in Artificial Intelligence. EPIA 2005. Lecture Notes in Computer Science(), vol 3808. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11595014_3

Download citation

  • DOI: https://doi.org/10.1007/11595014_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30737-2

  • Online ISBN: 978-3-540-31646-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation