Skip to main content Accessibility help
×
Home

Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs

  • ANGELOS CHARALAMBIDIS (a1), PANOS RONDOGIANNIS (a1) and IOANNA SYMEONIDOU (a1)

Abstract

We define a novel, extensional, three-valued semantics for higher-order logic programs with negation. The new semantics is based on interpreting the types of the source language as three-valued Fitting-monotonic functions at all levels of the type hierarchy. We prove that there exists a bijection between such Fitting-monotonic functions and pairs of two-valued-result functions where the first member of the pair is monotone-antimonotone and the second member is antimonotone-monotone. By deriving an extension of consistent approximation fixpoint theory (Denecker et al. 2004) and utilizing the above bijection, we define an iterative procedure that produces for any given higher-order logic program a distinguished extensional model. We demonstrate that this model is actually a minimal one. Moreover, we prove that our construction generalizes the familiar well-founded semantics for classical logic programs, making in this way our proposal an appealing formulation for capturing the well-founded semantics for higher-order logic programs.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs
      Available formats
      ×

      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs
      Available formats
      ×

      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs
      Available formats
      ×

Copyright

References

Hide All
Bezem, M. 1999. Extensionality of simply typed logic programs. In Logic Programming: The 1999 International Conference, Las Cruces, New Mexico, USA, November 29 - December 4, 1999, Schreye, D. D., Ed. MIT Press, 395–410.
Bloom, S. L. and Ésik, Z. 1993. Iteration Theories - The Equational Logic of Iterative Processes. EATCS Monographs on Theoretical Computer Science. Springer.
Carayol, A. and Ésik, Z. 2016. An analysis of the equational properties of the well-founded fixed point. In Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, KR 2016, Cape Town, South Africa, April 25-29, 2016., Baral, C., Delgrande, J. P., and Wolter, F., Eds. AAAI Press, 533–536.
Charalambidis, A., Ésik, Z., and Rondogiannis, P. 2014. Minimum model semantics for extensional higher-order logic programming with negation. TPLP 14, 4–5, 725737.
Charalambidis, A., Handjopoulos, K., Rondogiannis, P., and Wadge, W. W. 2013. Extensional higher-order logic programming. ACM Trans. Comput. Log. 14, 3, 21.
Charalambidis, A., Rondogiannis, P., and Symeonidou, I. 2017. Equivalence of two fixed-point semantics for definitional higher-order logic programs. Theor. Comput. Sci. 668, 2742.
Davey, B. A. and Priestley, H. A. 2002. Introduction to Lattices and Order. Cambridge University Press.
Denecker, M., Bruynooghe, M., and Vennekens, J. 2012. Approximation fixpoint theory and the semantics of logic and answers set programs. In Correct Reasoning - Essays on Logic-Based AI in Honour of Vladimir Lifschitz, Erdem, E., Lee, J., Lierler, Y., and Pearce, D., Eds. Lecture Notes in Computer Science, vol. 7265. Springer, 178194.
Denecker, M., Marek, V. and Truszczyński, M. 2000. Approximations, Stable Operators, Well-Founded Fixpoints and Applications in Nonmonotonic Reasoning. In: Logic-Based Artificial Intelligence. The Kluwer International Series in Engineering and Computer Science. Kluwer Academic Publishers, Boston, MA, 127144.
Denecker, M., Marek, V. W., and Truszczynski, M. 2004. Ultimate approximation and its application in nonmonotonic knowledge representation systems. Inf. Comput. 192, 1, 84121.
Ésik, Z. 2015. Equational properties of stratified least fixed points (extended abstract). In Logic, Language, Information, and Computation - 22nd International Workshop, WoLLIC 2015, Bloomington, IN, USA, July 20-23, 2015, Proceedings, de Paiva, V., de Queiroz, R. J. G. B., Moss, L. S., Leivant, D., and de Oliveira, A. G., Eds. Lecture Notes in Computer Science, vol. 9160. Springer, 174188.
Ésik, Z. and Rondogiannis, P. 2015. A fixed point theorem for non-monotonic functions. Theoretical Computer Science 574, 1838.
Fitting, M. 2002. Fixpoint semantics for logic programming: a survey. Theor. Comput. Sci. 278, 1–2, 2551.
Gelder, A. V., Ross, K. A., and Schlipf, J. S. 1991. The well-founded semantics for general logic programs. J. ACM 38, 3, 620650.
Przymusinski, T. C. 1989. Every logic program has a natural stratification and an iterated least fixed point model. In Proceedings of the Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, March 29-31, 1989, Philadelphia, Pennsylvania, USA. 11–21.
Rondogiannis, P. and Symeonidou, I. 2016. Extensional semantics for higher-order logic programs with negation. In Logics in Artificial Intelligence - 15th European Conference, JELIA 2016, Larnaca, Cyprus, November 9-11, 2016, Proceedings, Michael, L. and Kakas, A. C., Eds. Lecture Notes in Computer Science, vol. 10021. 447–462.
Rondogiannis, P. and Symeonidou, I. 2017. The intricacies of three-valued extensional semantics for higher-order logic programs. TPLP 17, 5–6, 974991.
Tennent, R. D. 1991. Semantics of programming languages. Prentice Hall International Series in Computer Science. Prentice Hall.
van Emden, M. H. and Kowalski, R. A. 1976. The semantics of predicate logic as a programming language. J. ACM 23, 4, 733742.
Wadge, W. W. 1991. Higher-order horn logic programming. In Logic Programming, Proceedings of the 1991 International Symposium, San Diego, California, USA, Oct. 28 - Nov 1, 1991, Saraswat, V. A. and Ueda, K., Eds. MIT Press, 289303.

Keywords

Type Description Title
PDF
Supplementary materials

Charalambidis et al. supplementary material
Charalambidis et al. supplementary material 1

 PDF (254 KB)
254 KB

Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs

  • ANGELOS CHARALAMBIDIS (a1), PANOS RONDOGIANNIS (a1) and IOANNA SYMEONIDOU (a1)

Metrics

Altmetric attention score

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.