Skip to main content
SpringerLink
Log in

Aggregates in Answer Set Optimization

  • Conference paper
Logic Programming and Nonmonotonic Reasoning (LPNMR 2011)

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

Abstract

Answer set optimization (ASO) is a flexible framework for qualitative optimization in answer set programming (ASP). The approach uses a generating program to construct the space of problem solutions, and a preference program to assess the quality of solutions. In this short paper we generalize the approach by introducing aggregates in preference programs. This allows the user to express preferences which are based on minimization or maximization of some numerical criteria. We introduce the new language of preference programs, define its semantics and give an example illustrating its use.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brewka, G., Niemelä, I., Truszczynski, M.: Answer set optimization. In: Proc. IJCAI, pp. 867–872 (2003)

    Google Scholar 

  2. Brewka, G.: Logic programming with ordered disjunction. In: Proc. AAAI, pp. 100-105 (2002)

    Google Scholar 

  3. Faber, W., Leone, N., Pfeifer, G.: Semantics and complexity of recursive aggregates in answer set programming. Artificial Intelligence 175(1), 278–298 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  4. Faber, W., Leone, N., Pfeifer, G.: Recursive aggregates in disjunctive logic programs: Semantics and complexity. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 200–212. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  5. Foo, N., Meyer, T., Brewka, G.: LPOD answer sets and nash equilibria. In: Maher, M.J. (ed.) ASIAN 2004. LNCS, vol. 3321, pp. 343–351. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  6. Pelov, N., Denecker, M., Bruynooghe, M.: Well-founded and stable semantics of logic programs with aggregates. TPLP 7, 355–375 (2007)

    MathSciNet  MATH  Google Scholar 

  7. Sakama, C., Inoue, K.: Prioritized logic programming and its application to common-sense reasoning. Artificial Intelligence 123(1-2), 185–222 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  8. Schaub, T., Wang, K.: A comparative study of logic programming with preference. In: Proc. IJCAI, pp. 597-602 (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Gulf University for Science and Technology, Mishref, Kuwait

    Emad Saad

  2. University of Leipzig, Augustusplatz 10-11, D-04109, Leipzig, Germany

    Gerhard Brewka

Authors
  1. Emad Saad
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gerhard Brewka
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computing Science, Simon Fraser University, V5A 1S6, Burnaby, B.C., Canada

    James P. Delgrande

  2. Department of Mathematics, University of Calabria, 87036, Rende (CS), Italy

    Wolfgang Faber

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Saad, E., Brewka, G. (2011). Aggregates in Answer Set Optimization. In: Delgrande, J.P., Faber, W. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2011. Lecture Notes in Computer Science(), vol 6645. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20895-9_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20895-9_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20894-2

  • Online ISBN: 978-3-642-20895-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation