Abstract
This paper revisits the semantics for Prolog with cut from the perspective of formulating a semantic base that is amenable to abstract interpretation. It argues that such a semantics should separate the question of divergence from questions pertaining to the number of answers and determinacy. It also shows how to replace prefix ordering, that is classically used in these semantics, with a domain that is set up for abstraction, whilst simultaneously retaining a fixpoint construction, albeit one in a stratified form.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Apt, K.R., Blair, H.A., Walker, A.: Towards a Theory of Declarative Knowledge. In: Foundations of Deductive Databases and Logic Programming, pp. 89–148. Morgan Kaufmann (1988)
Billaud, M.: Simple Operational and Denotational Semantics for Prolog with Cut. Theoretical Computer Science 71(2), 193–208 (1990)
Cousot, P., Cousot, R.: Abstract interpretation and application to logic programs. Journal of Logic Programming 13(2&3), 103–179 (1992)
Dawson, S., Ramakrishnan, C.R., Ramakrishnan, I.V., Sekar, R.C.: Extracting Determinacy in Logic Programs. In: International Conference on Logic Programming, pp. 424–438. MIT Press (1993)
De Schreye, D., Decorte, S.: Termination of logic programs: The never-ending story. Joural of Logic Programming 19(20), 199–260 (1994)
de Vink, E.P.: Comparative Semantics for Prolog with Cut. Science of Computer Programming 13(1), 237–264 (1989)
Debray, S.K., Mishra, P.: Denotational and Operational Semantics for Prolog. Journal of Logic Programming 5(1), 81–91 (1988)
Kriener, J.: Towards A Verified Determinacy Analysis for Prolog with cut. PhD thesis, School of Computing, University of Kent (December 2013)
Kriener, J., King, A.: Appendix for RedAlert: Determinacy Inference for Prolog. Technical Report 1-11, School of Computing, University of Kent, CT2 7NF, UK (2011), http://arxiv.org/corr/home
Kriener, J., King, A.: RedAlert: Determinacy inference for Prolog. TPLP 11(4-5), 537–553 (2011)
Le Charlier, B., Rossi, S., Van Hentenryck, P.: An Abstract Interpretation Framework which Accurately Handles Prolog Search-Rule and the Cut. In: Symposium on Logic Programming, pp. 157–171. MIT Press (1994)
López-García, P., Bueno, F., Hermenegildo, M.V.: Automatic Inference of Determinacy and Mutual Exclusion for Logic Programs Using Mode and Type Analyses. New Generation Computing 28(2), 177–206 (2010)
Mogensen, T.Æ.: A Semantics-Based Determinacy Analysis for Prolog with Cut. In: Bjorner, D., Broy, M., Pottosin, I.V. (eds.) PSI 1996. LNCS, vol. 1181, pp. 374–385. Springer, Heidelberg (1996)
O’Keefe, R.A.: The Craft of Prolog. MIT Press, Cambridge (1990)
Pfenning, F., Elliott, C.: Higher-Order Abstract Syntax. In: Wexelblat, R.L. (ed.) PLDI, pp. 199–208. ACM (1988)
Sahlin, D.: Determinacy Analysis for Full Prolog. In: Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pp. 23–30. ACM (1991)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Kriener, J., King, A. (2014). Semantics for Prolog with Cut – Revisited. In: Codish, M., Sumii, E. (eds) Functional and Logic Programming. FLOPS 2014. Lecture Notes in Computer Science, vol 8475. Springer, Cham. https://doi.org/10.1007/978-3-319-07151-0_17
Download citation
DOI: https://doi.org/10.1007/978-3-319-07151-0_17
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07150-3
Online ISBN: 978-3-319-07151-0
eBook Packages: Computer ScienceComputer Science (R0)