Semantics for Prolog with Cut - Revisited

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.

[1]  Appendix for RedAlert: Determinacy Inference for Prolog , 2011 .

[2]  Andy King,et al.  RedAlert: Determinacy inference for Prolog , 2011, Theory Pract. Log. Program..

[3]  Adrian Walker,et al.  Towards a Theory of Declarative Knowledge , 1988, Foundations of Deductive Databases and Logic Programming..

[4]  Jürgen Giesl,et al.  Automated termination analysis for logic programs with cut , 2010, Theory Pract. Log. Program..

[5]  Richard A. O'Keefe,et al.  The Craft of Prolog , 1990 .

[6]  Patrick Cousot,et al.  Abstract Interpretation and Application to Logic Programs , 1992, J. Log. Program..

[7]  Pascal Van Hentenryck,et al.  An Abstract Interpretation Framework which Accurately Handles Prolog Search-Rule and the Cut , 1994, ILPS.

[8]  Manuel V. Hermenegildo,et al.  Automatic Inference of Determinacy and Mutual Exclusion for Logic Programs Using Mode and Type Analyses , 2008, New Generation Computing.

[9]  Danny De Schreye,et al.  Termination of Logic Programs: The Never-Ending Story , 1994, J. Log. Program..

[10]  Dan Sahlin.  Determinacy analysis for full Prolog , 1991 .

[11]  Erik P. de Vink,et al.  Comparative Semantics for PROLOG with Cut , 1990, Sci. Comput. Program..

[12]  Torben Æ. Mogensen.  A Semantics-Based Determinacy Analysis for Prolog with Cut , 1996, Ershov Memorial Conference.

[13]  C. R. Ramakrishnan,et al.  Extracting Determinacy in Logic Programs , 1993, ICLP.

[14]  Manfred Broy,et al.  Perspectives of System Informatics , 2001, Lecture Notes in Computer Science.

[15]  Frank Pfenning,et al.  Higher-order abstract syntax , 1988, PLDI '88.

[16]  Michel Billaud,et al.  Simple Operational and Denotational Semantics for Prolog with Cut , 1990, Theor. Comput. Sci..

[17]  Saumya K. Debray,et al.  Denotational and Operational Semantics for Prolog , 1988, J. Log. Program..