Hostname: page-component-6766d58669-h8lrw Total loading time: 0 Render date: 2026-05-16T01:07:51.439Z Has data issue: false hasContentIssue false
  • English
  • Français

Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation*

Published online by Cambridge University Press:  21 July 2014

ANGELOS CHARALAMBIDIS ,
ZOLTÁN ÉSIK  and
PANOS RONDOGIANNIS
ANGELOS CHARALAMBIDIS
Affiliation:
Department of Informatics & Telecommunications, University of Athens, Greece (e-mail: a.charalambidis@di.uoa.gr)
ZOLTÁN ÉSIK
Affiliation:
Department of Computer Science, University of Szeged, Hungary (e-mail: ze@inf.u-szeged.hu)
PANOS RONDOGIANNIS
Affiliation:
Department of Informatics & Telecommunications, University of Athens, Greece (e-mail: prondo@di.uoa.gr)
Get access Rights & Permissions [Opens in a new window]

Abstract

Extensional higher-order logic programming has been introduced as a generalization of classical logic programming. An important characteristic of this paradigm is that it preserves all the well-known properties of traditional logic programming. In this paper we consider the semantics of negation in the context of the new paradigm. Using some recent results from non-monotonic fixed-point theory, we demonstrate that every higher-order logic program with negation has a unique minimum infinite-valued model. In this way we obtain the first purely model-theoretic semantics for negation in extensional higher-order logic programming. Using our approach, we resolve an old paradox that was introduced by W. W. Wadge in order to demonstrate the semantic difficulties of higher-order logic programming.

Information

Type
Regular Papers
Information
Theory and Practice of Logic Programming , Volume 14 , Special Issue 4-5: 30th International Conference on Logic Programming , July 2014 , pp. 725 - 737
Copyright
Copyright © Cambridge University Press 2014 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

Footnotes

*

This research is being supported by the Greek General Secretariat for Research and Technology, the National Development Agency of Hungary, and the European Commission (European Regional Development Fund) under a Greek-Hungarian intergovernmental programme of Scientific and Technological collaboration. Project title: “Extensions and Applications of Fixed Point Theory for Non-Monotonic Formalisms”. It is also supported by grant no. ANN 110883 from the National Foundation of Hungary for Scientific Research.

References

Bezem, M. 2001. An improved extensionality criterion for higher-order logic programs. In Proceedings of the 15th International Workshop on Computer Science Logic (CSL). Springer-Verlag, London, UK, 203–216.Google Scholar
Charalambidis, A., Handjopoulos, K., Rondogiannis, P., and Wadge, W. W. 2010. Extensional higher-order logic programming. In JELIA, Janhunen, T. and Niemelä, I., Eds. Lecture Notes in Computer Science, vol. 6341. Springer, 91–103.Google Scholar
Charalambidis, A., Handjopoulos, K., Rondogiannis, P., and Wadge, W. W. 2013. Extensional higher-order logic programming. ACM Transactions on Computational Logic 14, 3, 21:1–21:40.Google Scholar
Ésik, Z. and Rondogiannis, P. 2013. A fixed point theorem for non-monotonic functions. In Proceedings of 13th Panhellenic Logic Symposium, Athens, Greece.Google Scholar
Ésik, Z. and Rondogiannis, P. 2014. A fixed point theorem for non-monotonic functions. CoRR abs/1402.0299. Google Scholar
Lloyd, J. W. 1987. Foundations of Logic Programming. Springer Verlag.Google Scholar
Pearce, D. 1996. A new logical characterisation of stable models and answer sets. In NMELP, Dix, J., Pereira, L. M., and Przymusinski, T. C., Eds. Lecture Notes in Computer Science, vol. 1216. Springer, 57–70.Google Scholar
Przymusinski, T. C. 1989. Every logic program has a natural stratification and an iterated least fixed point model. In PODS, Silberschatz, A., Ed. ACM Press, 11–21.Google Scholar
Rondogiannis, P. and Wadge, W. W. 2005. Minimum model semantics for logic programs with negation-as-failure. ACM Transactions on Computational Logic 6, 2, 441–467.Google Scholar
van Gelder, A., Ross, K. A., and Schlipf, J. S. 1991. The well-founded semantics for general logic programs. J. ACM 38, 3, 620–650.CrossRefGoogle Scholar
Wadge, W. W. 1991. Higher-order Horn logic programming. In ISLP. 289–303.Google Scholar
Supplementary material: PDF

CHARALAMBIDIS et al.

Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation

Download CHARALAMBIDIS et al.(PDF)
PDF 192.6 KB