Skip to main content
SpringerLink
Log in

Checking Termination of Logic Programs with Function Symbols through Linear Constraints

  • Conference paper
Rules on the Web. From Theory to Applications (RuleML 2014)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 8620))

Abstract

Enriching answer set programming with function symbols makes modeling easier, increases the expressive power, and allows us to deal with infinite domains. However, this comes at a cost: common inference tasks become undecidable. To cope with this issue, recent research has focused on finding trade-offs between expressivity and decidability by identifying classes of logic programs that impose limitations on the use of function symbols but guarantee decidability of common inference tasks. Despite the significant body of work in this area, current approaches do not include many simple practical programs whose evaluation terminates. In this paper, we present the novel class of rule-bounded programs. While current techniques perform a limited analysis of how terms are propagated from an individual argument to another, our technique is able to perform a more global analysis, thereby overcoming several limitations of current approaches. We also present a further class of cycle-bounded programs where groups of rules are analyzed together. We show different results on the correctness and the expressivity of the proposed 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 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. Alviano, M., Faber, W., Leone, N.: Disjunctive ASP with functions: Decidable queries and effective computation. TPLP 10(4-6), 497–512 (2010)

    MATH  MathSciNet  Google Scholar 

  2. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science 236(1-2), 133–178 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  3. Baselice, S., Bonatti, P.A., Criscuolo, G.: On finitely recursive programs. TPLP 9(2), 213–238 (2009)

    MATH  MathSciNet  Google Scholar 

  4. Bonatti, P.A.: Reasoning with infinite stable models. Artificial Intelligence 156(1), 75–111 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  5. Bruynooghe, M., Codish, M., Gallagher, J.P., Genaim, S., Vanhoof, W.: Termination analysis of logic programs through combination of type-based norms. ACM Trans. Program. Lang. Syst. 29(2) (2007)

    Google Scholar 

  6. Calautti, M., Greco, S., Trubitsyna, I.: Detecting decidable classes of finitely ground logic programs with function symbols. In: PPDP, pp. 239–250 (2013)

    Google Scholar 

  7. Calimeri, F., Cozza, S., Ianni, G., Leone, N.: Computable functions in ASP: Theory and implementation. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol. 5366, pp. 407–424. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  8. Codish, M., Lagoon, V., Stuckey, P.J.: Testing for termination with monotonicity constraints. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol. 3668, pp. 326–340. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  9. De Schreye, D., Decorte, S.: Termination of logic programs: The never-ending story. Journal of Logic Programming 19/20, 199–260 (1994)

    Google Scholar 

  10. Eiter, T., Fink, M., Krennwallner, T., Redl, C.: Liberal safety for answer set programs with external sources. In: AAAI (2013)

    Google Scholar 

  11. Endrullis, J., Waldmann, J., Zantema, H.: Matrix interpretations for proving termination of term rewriting. J. Autom. Reas. 40(2-3), 195–220 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  12. Ferreira, M.C.F., Zantema, H.: andH. Zantema. Total termination of term rewriting. Appl. Algebra Eng. Commun. Comput. 7(2), 133–162 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  13. Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Answer Set Solving in Practice. In: Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan & Claypool Publishers (2012)

    Google Scholar 

  14. Gebser, M., Schaub, T., Thiele, S.: Gringo: A new grounder for answer set programming. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol. 4483, pp. 266–271. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  15. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: ICLP/SLP, pp. 1070–1080 (1988)

    Google Scholar 

  16. Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9(3/4), 365–386 (1991)

    Article  Google Scholar 

  17. Greco, S., Molinaro, C., Trubitsyna, I.: Bounded programs: A new decidable class of logic programs with function symbols. In: IJCAI, pp. 926–932 (2013)

    Google Scholar 

  18. Greco, S., Molinaro, C., Trubitsyna, I.: Logic programming with function symbols: Checking Termination of bottom-up Evaluation Through Program Adornments. TPLP 13(4-5), 737–752 (2013)

    MATH  MathSciNet  Google Scholar 

  19. Greco, S., Spezzano, F., Trubitsyna, I.: On the termination of logic programs with function symbols. In: ICLP (Technical Communications), pp. 323–333 (2012)

    Google Scholar 

  20. Leuschel, M., Vidal, G.: Fast offline partial evaluation of logic programs. Information and Computation 235(0), 70–97 (2014)

    Article  MATH  MathSciNet  Google Scholar 

  21. Lierler, Y., Lifschitz, V.: One more decidable class of finitely ground programs. In: Hill, P.M., Warren, D.S. (eds.) ICLP 2009. LNCS, vol. 5649, pp. 489–493. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  22. Marchiori, M.: Proving existential termination of normal logic programs. In: Nivat, M., Wirsing, M. (eds.) AMAST 1996. LNCS, vol. 1101, pp. 375–390. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  23. Nguyen, M.T., Giesl, J., Schneider-Kamp, P., De Schreye, D.: Termination analysis of logic programs based on dependency graphs. In: King, A. (ed.) LOPSTR 2007. LNCS, vol. 4915, pp. 8–22. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  24. Nishida, N., Vidal, G.: Termination of narrowing via termination of rewriting. Appl. Algebra Eng. Commun. Comput 21(3), 177–225 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  25. Ohlebusch, E.: Termination of logic programs: Transformational methods revisited. Appl. Algebra Eng. Commun. Comput. 12(1/2), 73–116 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  26. Riguzzi, F., Swift, T.: Well-definedness and efficient inference for probabilistic logic programming under the distribution semantics. TPLP 13(2), 279–302 (2013)

    MATH  MathSciNet  Google Scholar 

  27. Riguzzi, F., Swift, T.: Terminating evaluation of logic programs with finite three-valued models. ACM Transactions on Computational Logic (2014)

    Google Scholar 

  28. Schneider-Kamp, P., Giesl, J., Serebrenik, A., Thiemann, R.: Automated termination proofs for logic programs by term rewriting. ACM Trans. Comput. Log. 11(1) (2009)

    Google Scholar 

  29. Schneider-Kamp, P., Giesl, J., Ströder, T., Serebrenik, A., Thiemann, R.: Automated termination analysis for logic programs with cut. TPLP 10(4-6), 365–381 (2010)

    MATH  Google Scholar 

  30. Serebrenik, A., De Schreye, D.: On termination of meta-programs. TPLP 5(3), 355–390 (2005)

    MATH  Google Scholar 

  31. Sohn, K., Van Gelder, A.: Termination detection in logic programs using argument sizes. In: PODS, pp. 216–226 (1991)

    Google Scholar 

  32. Sternagel, C., Middeldorp, A.: Root-labeling. In: Voronkov, A. (ed.) RTA 2008. LNCS, vol. 5117, pp. 336–350. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  33. Syrjänen, T.: Omega-restricted logic programs. In: Eiter, T., Faber, W., Truszczyński, M. (eds.) LPNMR 2001. LNCS (LNAI), vol. 2173, pp. 267–280. Springer, Heidelberg (2001)

    Google Scholar 

  34. Verbaeten, S., De Schreye, D., Sagonas, K.F.: Termination proofs for logic programs with tabling. ACM Trans. Comput. Log. 2(1), 57–92 (2001)

    Article  MathSciNet  Google Scholar 

  35. Vidal, G.: Quasi-terminating logic programs for ensuring the termination of partial evaluation. In: PEPM, pp. 51–60 (2007)

    Google Scholar 

  36. Voets, D., De Schreye, D.: Non-termination analysis of logic programs with integer arithmetics. TPLP 11(4-5), 521–536 (2011)

    MATH  Google Scholar 

  37. Zantema, H.: Termination of term rewriting by semantic labelling. Fundamenta Informaticae 24(1/2), 89–105 (1995)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DIMES, Università della Calabria, 87036, Rende (CS), Italy

    Marco Calautti, Sergio Greco, Cristian Molinaro & Irina Trubitsyna

Authors
  1. Marco Calautti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sergio Greco
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Cristian Molinaro
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Irina Trubitsyna
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Information Studies, University College London, Gower Street, WC1E 6BT, London, UK

    Antonis Bikakis

  2. Department of Computer Science, Stony Brook University, 11794, Stony Brook, NY, USA

    Paul Fodor

  3. SINTEF, University of Oslo, Forskningsveien 1, 0314, Oslo, Norway

    Dumitru Roman

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Calautti, M., Greco, S., Molinaro, C., Trubitsyna, I. (2014). Checking Termination of Logic Programs with Function Symbols through Linear Constraints. In: Bikakis, A., Fodor, P., Roman, D. (eds) Rules on the Web. From Theory to Applications. RuleML 2014. Lecture Notes in Computer Science, vol 8620. Springer, Cham. https://doi.org/10.1007/978-3-319-09870-8_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-09870-8_7

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-09869-2

  • Online ISBN: 978-3-319-09870-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation