Skip to main content
SpringerLink
Log in

Strong Equivalence of Logic Programs with Abstract Constraint Atoms

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

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

Abstract

Logic programs with abstract constraint atoms provide a unifying framework for studying logic programs with various kinds of constraints. Establishing strong equivalence between logic programs is a key property for program maintenance and optimization, and for guaranteeing the same behavior for a revised original program in any context. In this paper, we study strong equivalence of logic programs with abstract constraint atoms. We first give a general characterization of strong equivalence based on a new definition of program reduct for logic programs with abstract constraints. Then we consider a particular kind of program revision—constraint replacements addressing the question: under what conditions can a constraint in a program be replaced by other constraints, so that the resulting program is strongly equivalent to the original one.

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. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proc. ICLP, pp. 1070–1080 (1988)

    Google Scholar 

  2. Niemelä, I.: Logic programs with stable model semantics as a constraint programming paradigm. Annals of Math. and Artificial Intelligence 25(3-4), 241–273 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  3. Marek, V., Niemelä, I., Truszczyński, M.: Logic programs with monotone abstract constraint atoms. TPLP 8(2), 167–199 (2008)

    MathSciNet  MATH  Google Scholar 

  4. Marek, V.W., Remmel, J.B.: Set constraints in logic programming. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS (LNAI), vol. 2923, pp. 167–179. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  5. Son, T.C., Pontelli, E., Tu, P.H.: Answer sets for logic programs with arbitrary abstract constraint atoms. JAIR 29, 353–389 (2007)

    MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Chapter  Google Scholar 

  8. Son, T.C., Pontelli, E.: A constructive semantic characterization of aggregates in answer set programming. TPLP 7, 355–375 (2006)

    MathSciNet  MATH  Google Scholar 

  9. van Hoeve, W.J., Katriel, I.: Global constraints. In: Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming. Elsevier, Amsterdam (2006)

    Google Scholar 

  10. Lifschitz, V., Pearce, D., Valverde, A.: Strongly equivalent logic programs. ACM Transactions on Computational Logic 2(4), 526–541 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  11. Liu, L., Truszczyński, M.: Properties and applications of programs with monotone and convex constraints. JAIR 7, 299–334 (2006)

    MathSciNet  MATH  Google Scholar 

  12. Lin, F.: Reducing strong equivalence of logic programs to entailment in classical propositional logic. In: Proc. KR 2002, pp. 170–176 (2002)

    Google Scholar 

  13. Turner, H.: Strong equivalence made easy: nested expressions and weight constraints. Theory and Practice of Logic Programming 3, 609–622 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  14. Gebser, M., Kaminski, R., Ostrowski, M., Schaub, T., Thiele, S.: On the input language of ASP grounder gringo. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol. 5753, pp. 502–508. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  15. Pelov, N., Denecker, M., Bruynooghe, M.: Well-founded and stable semantics of logic programs with aggregates. TPLP 7(3), 301–353 (2007)

    MathSciNet  MATH  Google Scholar 

  16. Janhunen, T.: Sampler programs: The stable model semantics of abstract constraint programs revisited. In: Proc. ICLP, pp. 94–103 (2010)

    Google Scholar 

  17. Eiter, T., Fink, M., Woltran, S.: Semantical characterizations and complexity of equivalences in answer set programming. ACM Transactions on Computational Logic 8(3) (2007)

    Google Scholar 

  18. Janhunen, T., Oikarinen, E., Tompits, H., Woltran, S.: Modularity aspects of disjunctive stable models. J. Artif. Intell. Res. (JAIR) 35, 813–857 (2009)

    MathSciNet  MATH  Google Scholar 

  19. Pelov, N.: Semantics of Logic Programs with Aggregates. PhD thesis, Ketholieke Universiteit Leuven (2004)

    Google Scholar 

  20. Pelov, N., Denecker, M., Bruynooghe, M.: Translation of aggregate programs to normal logic programs. In: Proc. ASP 2003, pp. 29–42 (2003)

    Google Scholar 

  21. Shen, Y., You, J., Yuan, L.: Characterizations of stable model semantics for logic programs with arbitrary constraint atoms. TPLP 9(4), 529–564 (2009)

    MathSciNet  MATH  Google Scholar 

  22. You, J., Liu, G.: Loop formulas for logic programs with arbitrary constraint atoms. In: Proc. AAAI 2008, pp. 584–589 (2008)

    Google Scholar 

  23. You, J., Yuan, L.Y., Liu, G., Shen, Y.: Logic programs with abstract constraints: Representation, disjunction and complexities. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol. 4483, pp. 228–240. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  24. Eiter, T., Fink, M., Tompits, H., Woltran, S.: Simplifying logic programs under uniform and strong equivalence. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS (LNAI), vol. 2923, pp. 87–99. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  25. Ferraris, P.: Answer sets for propositional theories. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS (LNAI), vol. 3662, pp. 119–131. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  26. Baselice, S., Bonatti, P.A., Gelfond, M.: Towards an integration of answer set and constraint solving. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol. 3668, pp. 52–66. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  27. Gebser, M., Ostrowski, M., Schaub, T.: Constraint answer set solving. In: Hill, P.M., Warren, D.S. (eds.) ICLP 2009. LNCS, vol. 5649, pp. 235–249. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  28. Mellarkod, V.S., Gelfond, M., Zhang, Y.: Integrating answer set programming and constraint logic programming. Annals of Math. and AI 53(1-4), 251–287 (2008)

    MathSciNet  MATH  Google Scholar 

  29. Eiter, T., Ianni, G., Lukasiewicz, T., Schindlauer, R., Tompits, H.: Combining answer set programming with description logics for the semantic web. Artificial. Intelligence. 172(12-13), 1495–1539 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  30. Niemelä, I.: Integrating answer set programming and satisfiability modulo theories. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol. 5753, pp. 3–3. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information and Computer Science, Aalto University, Finland

    Guohua Liu, Tomi Janhunen & Ilkka Niemelä

  2. Department of Computing Science, University of Alberta, Canada

    Randy Goebel & Jia-Huai You

Authors
  1. Guohua Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Randy Goebel
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tomi Janhunen
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ilkka Niemelä
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Jia-Huai You
    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

Liu, G., Goebel, R., Janhunen, T., Niemelä, I., You, JH. (2011). Strong Equivalence of Logic Programs with Abstract Constraint Atoms. 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_15

Download citation

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

  • 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