Skip to main content
SpringerLink
Log in

Partial Stable Models for Logic Programs with Aggregates

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

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

Abstract

We introduce a family of partial stable model semantics for logic programs with arbitrary aggregate relations. The semantics are parametrized by the interpretation of aggregate relations in three-valued logic. Any semantics in this family satisfies two important properties: (i) it extends the partial stable semantics for normal logic programs and (ii) total stable models are always minimal. We also give a specific instance of the semantics and show that it has several attractive features.

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. Dell’Armi, T., Faber, W., Ielpa, G., Leone, N., Pfeifer, G.: Aggregate functions in disjunctive logic programming: Semantics, complexity, and implementation in DLV. In: Proc. of the 18th Int. Joint Conference on Artificial Intelligence (2003)

    Google Scholar 

  2. Dell’Armi, T., Faber, W., Ielpa, G., Leone, N., Pfeifer, G.: Aggregate functions in DLV. Answer Set Programming: Advances in Theory and Implementation, 274–288 (2003), online CEUR-WS.org/Vol-78/

  3. Denecker, M., Marek, V., Truszczyński, M.: Approximating operators, stable operators, well-founded fixpoints and applications in non-monotonic reasoning. In: Minker, J. (ed.) Logic-based Artificial Intelligence, pp. 127–144 (2000)

    Google Scholar 

  4. Denecker, M., Marek, V., Truszczyńsky, M.: Ultimate approximations in nonmonotonic knowledge representation systems. In: Principles of Knowledge Representation and Reasoning, pp. 177–188. Morgan Kaufmann, San Francisco (2002)

    Google Scholar 

  5. Denecker, M., Pelov, N., Bruynooghe, M.: Ultimate well-founded and stable model semantics for logic programs with aggregates. In: Codognet, P. (ed.) ICLP 2001. LNCS, vol. 2237, pp. 212–226. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  6. Fitting, M.: A Kripke-Kleene semantics for logic programs. Journal of Logic Programming 2(4), 295–312 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  7. Fitting, M.: Fixpoint semantics for logic programming a survey. Theoretical Computer Science 278(1-2), 25–51 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  8. Gelfond, M.: Representing knowledge in A-Prolog. In: Kakas, A.C., Sadri, F. (eds.) Computational Logic: Logic Programming and Beyond. LNCS (LNAI), vol. 2408, pp. 413–451. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  9. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R.A., Bowen, K.A. (eds.) Logic Programming, Proc. of the 5th International Conference and Symposium, pp. 1070–1080. MIT Press, Cambridge (1988)

    Google Scholar 

  10. Kemp, D.B., Srivastava, D., Stuckey, P.J.: Bottom-up evaluation and query optimization of well-founded models. Theoretical Computer Science 146(1-2), 145–184 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  11. Kemp, D.B., Stuckey, P.J.: Semantics of logic programs with aggregates. In: Proc. of the Int. Logic Programming Symposium, pp. 387–401. MIT Press, Cambridge (1991)

    Google Scholar 

  12. Marek, V., Remmel, J.: On logic programs with cardinality constraints. In: 9th International Workshop on Non-Monotonic Reasoning, pp. 219–228 (2002)

    Google Scholar 

  13. Mumick, S., Pirahesh, H., Ramakrishnan, R.: The magic of duplicates and aggregates. In: 16th Int. Conf. on Very Large Data Bases, pp. 264–277 (1990)

    Google Scholar 

  14. Przymusinksi, T.: The well-founded semantics coincides with the three-valued stable semantics. Fundamenta Informaticae 13(4), 445–464 (1990)

    MathSciNet  Google Scholar 

  15. Ross, K.A., Sagiv, Y.: Monotonic aggregation in deductive databases. Journal of Computer and System Sciences 54(1), 79–97 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  16. Simons, P., Niemelä, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence 138(1-2), 181–234 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  17. Van Gelder, A.: The well-founded semantics of aggregation. In: 11th ACM Symposium on Principles of Database Systems, pp. 127–138. ACM Press, New York (1992)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, K.U.Leuven, Celestijnenlaan 200A, B-3001, Heverlee, Belgium

    Nikolay Pelov, Marc Denecker & Maurice Bruynooghe

Authors
  1. Nikolay Pelov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marc Denecker
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Maurice Bruynooghe
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Sciences, University of Texas at Austin, USA

    Vladimir Lifschitz

  2. Department of Information and Computer Science, Helsinki University of Technology TKK,  

    Ilkka Niemelä

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pelov, N., Denecker, M., Bruynooghe, M. (2003). Partial Stable Models for Logic Programs with Aggregates. In: Lifschitz, V., Niemelä, I. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2004. Lecture Notes in Computer Science(), vol 2923. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24609-1_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24609-1_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20721-4

  • Online ISBN: 978-3-540-24609-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation