Semantics of well-moded input-consuming logic programs

Kowalski, 1979, Algorithm = logic + control, Communications of the ACM, 22, 424, 10.1145/359131.359136 Hill, 1994 Naish L. Coroutining and the construction of terminating logic programs. Technical Report 92/5, Department of Computer Science, University of Melbourne, 1992. Naish L. Parallelizing NU-Prolog. In: Bowen KA, Kowalski RA, editors. Proceedings of the Fifth International Conference/Symposium on Logic Programming, Seattle, Washington, August 1988. p. 1546–64. Apt KR, Luitjes I. Verification of logic programs with delay declarations. In: Borzyszkowski A, Sokolowski S, editors. Proceedings of the Fourth International Conference on Algebraic Methodology and Software Technology, (AMAST’95). Lecture Notes in Computer Science, Vol. 936, Berlin: Springer, 1995. p. 66–90. Ueda K. Guarded Horn Clauses, a parallel logic programming language with the concept of a guard. In: Nivat M, Fuchi K, editors. Programming of Future Generation Computers. Amsterdam: North-Holland, 1988. p. 441–56. Ueda, 1994, Moded flat GHC and its message-oriented implementation technique, New Generation Computing, 13, 3, 10.1007/BF03038307 Wallace, 1997, ECLiPSe, ICL Systems Journal, 12, 159 Intelligent Systems Laboratory, Swedish Institute of Computer Science, PO Box 1263, S-164 29 Kista, Sweden. SICStus Prolog User's Manual, 1997. http://www.sics.se/isl/sicstus/sicstus_toc.html. Apt, 1982, Contributions to the theory of logic programming, Journal of the ACM, 29, 841, 10.1145/322326.322339 Apt, 1997 Smaus JG. Proving termination of input-consuming logic programs. In: De Schreye D, editor. Proceedings of the 16th International Conference on Logic Programming, Las Cruces, New Mexico, USA. Cambridge, MA: The MIT Press, 1999. p. 335–49. Bossi A, Etalle S, Rossi S. Properties of input-consuming derivations. Electronic Notes in Theoretical Computer Science 1999;30(1). http://www.elsevier.nl/locate/entcs. Also available on CoRR: http://arXiv.org/abs/cs/0101022. Smaus J-G. Modes and Types in Logic Programming. Ph.D. thesis, University of Kent at Canterbury, October 1999. Draft available from www.cs.ukc.ac.uk/people/staff/jgs5/thesis.ps. Falaschi, 1989, Declarative modeling of the operational behavior of logic languages, Theoretical Computer Science, 69, 289, 10.1016/0304-3975(89)90070-4 Bossi A, Etalle S, Rossi S. Semantics of input-consuming programs. In: Lloyd J et al., editors. First International Conference on Computational Logic (CL2000). Lecture Notes in Artificial Intelligence, Vol. 1861. Berlin: Springer, 2000. p. 194–208. Apt KR. Introduction to Logic Programming. In: van Leeuwen J, editor. Handbook of Theoretical Computer Science, vol. B: formal models and semantics. Amsterdam: Elsevier and Cambridge, MA: The MIT Press, 1990. p. 495–574. Lloyd JW. Foundations of logic programming. Symbolic computation—artificial intelligence, 2nd ed. Berlin: Springer, 1987. Bossi, 1994, The S-semantics approach: theory and applications, The Journal of Logic Programming, 19&20, 149, 10.1016/0743-1066(94)90026-4 Dembinski P, Maluszynski J. AND-parallelism with intelligent backtracking for annotated logic programs. Proceedings of the International Symposium on Logic Programming, IEEE-CS, Boston, 1985. p. 29–38. Chadha R, Plaisted DA. Correctness of unification without occur check in Prolog. Technical report, Department of Computer Science, University of North Carolina, Chapel Hill, NC, 1991. Smaus J-G, Hill PM, King AM. Termination of logic programs with block declarations running in several modes. In: Palamidessi C, editor. Proceedings of the 10th Symposium on Programming Language Implementations and Logic Programming. Lecture Notes in Computer Science, Vol. 1490. Berlin: Springer, 1998. p. 73–88. Sterling, 1986 Apt, 1994, On the occur-check free Prolog programs, ACM Toplas, 16, 687, 10.1145/177492.177673