A declarative semantics for the prolog cut operator

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1050, Issue , 1996, Pages 255-271

  Stroetmann, Karl ^a   Glaß, Thomas ^a  

^a SIEMENS AG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; LOGIC PROGRAMMING; SEMANTICS;

CUT OPERATORS; DECLARATIVE SEMANTICS; EFFICIENT IMPLEMENTATION; LARGE PARTS; LOGICAL CONTROL; PROLOG PROGRAMS; SEARCH FACILITIES;

PROLOG (PROGRAMMING LANGUAGE);

EID: 84955565629     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60983-0_18     Document Type: Conference Paper

References (26)

1. [AE93] Krzysztof R. Apt and Sandro Etalle. On the unification free Prolog programs. In S. Sokolowslá, editor, Proceedings of the Conference on Mathematical Foundations of Computer Science (MFCS '93), Lecture Notes in Computer Science. Springer Verlag, 1993. Available at: http://www.cwi.nl/cwi/publicat ions/index.html.
2. [And95] James Andrews. The logical semantics of the PROLOG cut. In John W. Lloyd, editor, International Logic Programming Symposium '95. MIT, 1995.
3. [Apt90] Krzysztof R. Apt. Logic programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume B, chapter 10, pages 495-574. Elsevier, 1990.
4. [Apt92] Krzysztof R. Apt, editor. Logic Programming. The MIT Press, 1992.
5. [Apt93] Krzysztof R. Apt. Declarative programming in Prolog. In D. Miller, editor, Proceedings of International Logic Programming Symposium (ILPS '93), Cambridge, Mass./London, 1993. The MIT Press. Available at: http://WWW.cwi.nl/cwi/publications/index.html.
6. [BG94] L. Bachmair and H. Ganzinger. Rewrite-based equational theorem proving with selection and simplification. Journal of Logic and Computation, 4(3):217-247, 1994.
7. [BLR92] François Bronsard, T. K. Lakshman, and Uday S. Reddy. A framework of directionality for proving termination of logic programs. In Apt [Apt92], pages 321-335.
8. [Bör89] E. Börger. A logical operational semantics of full Prolog, part I: Selection core and control. In E. Börger, H. Kleine Büning, and M. M. Richter, editors, Computer Science Logic CSL '89, pages 36-64. Springer-Verlag, Lecture Notes in Computer Science 440, 1989.
9. [Bou94] Adel Bouhoula. SPIKE: a system for sufficient completeness and parameterized inductive proofs. In Alan Bundy, editor, Twelfth International Conference on Automated Deduction, LNAI 814, pages 836-840, Nancy, France, 1994. Springer-Verlag.
10. [BR95] Adel Bouhoula and Michael Rusinowitch. Implicit induction in conditional theories. Journal of Automated Reasoning, 1995.
11. [Cla78] K. L. Clark. Negation as failure. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pages 293-322. Plenum Press, New York, 1978.
12. [dBdV89] A. de Bruin and E.P. de Vink. Continuation semantics for Prolog with cut. In Theory and practice of software engineering, volume 351 of Lecture Notes in Computer Science, pages 178-192. Springer-Verlag, 1989.
13. [DM85] P. Dembinski and J. Maluszynski. And-parallelism with intelligent backtracking for annotated logic programs. In Proceedings of the International Symposium on Logic Programming, 1985.
14. [HSC96] Fergus Henderson, Zoltan Somogyi, and Thomas Conway. Determinism analysis in the MERCURY compiler. In Proceedings of the Australian Computer Science Conference, 1996. Available at: http://www.cs.mu.oz.au/~zs/mercury/papers.html.
15. [JM84] N. D. Jones and A. Mycroft. Stepwise development of operational and de-notational semantics for prolog. In 1984 International Symposium on Logic Programming, pages 281-288. IEEE, 1984.
16. [Llo87] J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, Berlin, second edition, 1987.
17. [LM87] J.-L. Lassez and M. J. Maher. Unification revisited. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 587-625. Morgan Kaufmann, Los Altos, 1987.
18. [M084] Alan Mycroft and Richard A. O'Keefe. A polymorphic type system for Prolog. Artificial Intelligence, 23:295-307, 1984.
19. [MÜ195] Martin Müller. Automatisierbare Terminierungsnachweise von Prolog-Programmen. Master's thesis, Universität Marburg, 1995. Available at: ht tp: //www.mathematik.uni-marburg.de/'mueller/termnach.ps.
20. [PS95] Andreas Podelski and Gert Smolka. Operational semantics of constraint logic programs with coroutining. In Leon Sterling, editor, Proceedings of the 1995 International Conference on Logic Programming, pages 449-463, Kanagawa, Japan, 13-18 June 1995. The MIT Press.
21. [SG95] Karl Stroetmann and Thomas Glaß. Augmented PROLOG-An evolutionary approach. In Donald A. Smith, Olivier Ridoux, and Peter Van Roy, editors, Proceedings of the Workshop Wsioras for the Future of Logic Programming: Laying the Foundations for a Modern Successor to Prolog, pages 59-100, 1995. The Proceedings of this workshop are available at: ftp://ps-ftp.dfki.uni-sb.de/pub/ILPS95-FutureLP/.
22. [SHC95] Zoltan Somogyi, Fergus Henderson, and Thomas Conway. Logic programming for the real world. In Donald A. Smith, Olivier Ridoux, and Peter Van Roy, editors, Proceedings of the Workshop Visions for the Future of Logic Programming: Laying the Foundations for a Modern Successor to Prolog, pages 83-94, 1995. The Proceedings of this workshop are available at: ftp://ps-ftp.dfki.uni-sb.de/pub/ILPS95-FutureLP/.
23. [Stä95] Robert F. Stark. Formal methods for logic programming systems. Technical report, Department of Mathematics, Stanford University, 1995. Available at: http://www-leland.stanford.edu/~staerk/list.html.
24. [Stä96] Robert F. Stärk. Total correctness of pure Prolog programs: A formal approach. In Roy DyckhoíF, Heinrich Herre, and Peter Schroeder-Heister, editors, Fifth International Workshop on Extensions of Logic Programming (ELP '96), Lecture Notes in Computer Science. Springer-Verlag, 1996.
25. [Str95] Karl Stroetmann. Seduct-a proof compiler for first order logic. In Manfred Broy and Stefan Jänichen, editors, KORSO: Methods, Languages, and Tools for the Construction of Correct Software, volume 1009 of Lecture Notes in Computer Science. Springer Verlag, 1995.
26. [Vod88] Paul J. Voda. The logical reconstruction of cuts as one solution operators. In John W. Lloyd, editor, Proceedings of the Workshop on Meta-programming in Logic Programming, pages 379-384. 1988.