Skip to main content

A Free Logic for Stable Models with Partial Intensional Functions

  • Conference paper
Logics in Artificial Intelligence (JELIA 2014)

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

Included in the following conference series:

Abstract

In this paper we provide a new logical characterisation of stable models with partial functions that consists in a free-logic extension of Quantified Equilibrium Logic (QEL). In so-called “free” logics, terms may denote objects that are outside the domain of quantification, something that can be immediately used to capture partial functions. We show that this feature can be naturally accommodated in the monotonic basis of QEL (the logic of Quantified Here-and-There, QHT) by allowing variable quantification domains that depend on the world where the formula is being interpreted. The paper provides two main contributions: (i) a correspondence with Cabalar’s semantics for stable models with partial functions; and (ii) a Gentzen system for free QHT, the monotonic basis of free QEL.

This research was partially supported by: European French-Spanish Lab IREP; MEC project TIN2012-39353-C04; Junta de Andalucía project TIC115; Xunta de Galicia, Spain, grant GPC2013/070; and Universidad de Málaga, Campus de Excelencia Internacional Andalucía Tech.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

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., et al.: The fourth answer set programming competition: Preliminary report. In: Cabalar, P., Son, T.C. (eds.) LPNMR 2013. LNCS, vol. 8148, pp. 42–53. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  2. Balduccini, M.: A “Conservative” approach to extending answer set programming with non-herbrand functions. In: Erdem, E., Lee, J., Lierler, Y., Pearce, D. (eds.) Correct Reasoning. LNCS, vol. 7265, pp. 24–39. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  3. Bartholomew, M., Lee, J.: Stable models of formulas with intensional functions. In: Proceedings of International Conference on Principles of Knowledge Representation and Reasoning, KR 2012, pp. 2–12 (2012)

    Google Scholar 

  4. Bartholomew, M., Lee, J.: On the stable model semantics for intensional functions. In: Proceedings of International Conference on Logic Programming, ICLP 2013 (2013)

    Google Scholar 

  5. Brewka, G., Eiter, T., Truszczynski, M.: Answer set programming at a glance. Commun. ACM 54(12), 92–103 (2011)

    Article  Google Scholar 

  6. Burge, T.: Truth and singular terms. Nous 8(4), 309–325 (1974)

    Article  MathSciNet  Google Scholar 

  7. Cabalar, P.: Functional answer set programming. Theory and Practice of Logic Programming 10(2-3), 203–233 (2011)

    Article  MathSciNet  Google Scholar 

  8. Cabalar, P., Lorenzo, D.: Logic programs with functions and default values. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 294–306. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  9. Cabalar, P., Pearce, D., Valverde, A.: A revised concept of safety for general answer set programs. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol. 5753, pp. 58–70. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

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

  11. Calimeri, F., Cozza, S., Ianni, G., Leone, N.: An ASP system with functions, lists, and sets. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol. 5753, pp. 483–489. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  12. Farinãs del Cerro, L., Pearce, D., Valverde, A.: FQHT: The logic of stable models for logic programs with intensional functions. In: Proceedings of International Joint Conference on Artificial Intelligence, IJCAI 2013 (2013)

    Google Scholar 

  13. Ferraris, P., Lee, J., Lifschitz, V.: A new perspective on stable models. In: Proc. of the International Joint Conference on Artificial Intelligence (IJCAI 2007), pp. 372–379 (2007)

    Google Scholar 

  14. Gabbay, D.M., Pearce, D., Valverde, A.: Interpolable formulas in equilibrium logic and answer set programming. Journal of Artificial Intelligence Research (JAIR) 42, 917–943 (2011)

    MathSciNet  MATH  Google Scholar 

  15. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proc. of the 5th Intl. Conf. on Logic Programming, pp. 1070–1080 (1988)

    Google Scholar 

  16. Hanus, M.: The integration of functions into logic programming: from theory to practice. Journal of Logic Programming 19, 20, 583–628 (1994)

    Google Scholar 

  17. Heyting, A.: Die formalen Regeln der intuitionistischen Logik. Sitzungsberichte der Preussischen Akademie der Wissenschaften, Physikalisch-mathematische Klasse, pp. 42–56 (1930)

    Google Scholar 

  18. Lifschitz, V.: Logic programs with intensional functions. In: Proceedings of International Conference on Principles of Knowledge Representation and Reasoning, KR 2012 (2012)

    Google Scholar 

  19. Lifschitz, V., Pearce, D.J., Valverde, A.: A characterization of strong equivalence for logic programs with variables. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol. 4483, pp. 188–200. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  20. Lin, F., Wang, Y.: Answer set programming with functions. In: Proc. of the 11th Intl. Conf. on Principles of Knowledge Representation and Reasoning, KR 2008 (2008)

    Google Scholar 

  21. Marek, V., Truszczyński, M.: Stable models and an alternative logic programming paradigm. In: The Logic Programming Paradigm: a 25-Year Perspective, pp. 169–181. Springer (1999)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  23. Pearce, D.: A new logical characterisation of stable models and answer sets. In: Dix, J., Przymusinski, T.C., Moniz Pereira, L. (eds.) NMELP 1996. LNCS, vol. 1216, Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  24. Pearce, D.J., Valverde, A.: Towards a first order equilibrium logic for nonmonotonic reasoning. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 147–160. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  25. Pearce, D., Valverde, A.: Synonymous theories and knowledge representations in answer set programming. Journal of Computer and System Sciences 78(1), 86–104 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  26. Posy, C.J.: A free IPC is a natural logic: Strong completeness for some intuitionistic free logics. Topoi 1(1-2), 30–43 (1982)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Cabalar, P., del Cerro, L.F., Pearce, D., Valverde, A. (2014). A Free Logic for Stable Models with Partial Intensional Functions. In: Fermé, E., Leite, J. (eds) Logics in Artificial Intelligence. JELIA 2014. Lecture Notes in Computer Science(), vol 8761. Springer, Cham. https://doi.org/10.1007/978-3-319-11558-0_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11558-0_24

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11557-3

  • Online ISBN: 978-3-319-11558-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics