Semantics of input-consuming logic programs

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 1861, Issue , 2000, Pages 194-208

  Bossi, Annalisa ^a   Etalle, Sandro ^b   Rossi, Sabina ^a  

^a CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

^b MAASTRICHT UNIVERSITY   (Netherlands)

Author keywords

dynamic scheduling; Logic programming; semantics

Indexed keywords

DYNAMIC SCHEDULING; DYNAMIC SELECTION; LOGIC PROGRAMS; MODEL LOGIC; MODEL-THEORETIC SEMANTICS;

EQUIVALENCE CLASSES; SEMANTICS;

LOGIC PROGRAMMING;

EID: 84867799087     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-44957-4_13     Document Type: Conference Paper

References (17)

1. K . R. Apt. Introduction to Logic Programming. In J. Van Leeuwen, editor, Hand-book of Theoretical Computer Science, volume B: Formal Models and Semantics, pages 495-574. Elsevier, Amsterdam and The MIT Press, Cambridge, 1990.
2. K. R. Apt. From Logic Programming to Prolog. Prentice Hall, 1997.
3. K. R. Apt and I. Luitjes. Verification of logic programs with delay declarations. In A. Borzyszkowski and S. Soko lowski, editors, Proceedings of the Fourth International Conference on Algebraic Methodology and Software Technology, (AMAST'95), Lecture Notes in Computer Science, Berlin, 1995. Springer-Verlag.
4. K. R. Apt and A. Pel legrini. On the occur-check free Prolog programs. ACM Toplas, 16(3):687-726, 1994.
5. A. Bossi, S. Etalle, and S. Rossi. Properties of input-consuming derivations. Electronic Not es in Theoretical Computer Science, 30(1), 1999. http://www.elsevier.nl/locate/entcs
6. temporarily available at http://www.cs.unimaas.nl/~etalle/papers/index.htm.
7. A. Bossi, S. Etalle, and S. Rossi . Properties of input-consuming derivations. Technical Report CS 99-06, Universiteit Maastricht, 1999.
8. A. Bossi, S. Etalle, and S. Rossi. Semantics of input-consuming programs. Technical Report CS 00-01, Universiteit Maastricht, 2000.
9. Annalisa Bossi, Maurizio Gabrielli, Giorgio Levi, and Maurizio Martelli. The Ssemantics approach: Theory and applications. The Journal of Logic Programming, 19 & 20:149-198, May 1994.
10. R. Chadha and D.A. Plaisted. Correctness of uni-cation without occur check in Prolog. Technical report, Department of Computer Science, University of North Carolina, Chapel Hill, N.C., 1991.
11. P. Demb inski and J. Maluszynski. AND-parallelism with intelligent backtracking for annotated logic programs. In Proceedings of the International Symposium on Logic Programming, pages 29-38, Boston, 1985.
12. M. Fal aschi, G. Levi, M. Martelli, and C. Palamidessi. Declarative modeling of the operational behavior of logic languages. Theoretical Computer Science, 69(3):289-318, 1989.
13. J. W. Lloyd. Fou ndations of Logic Programming. Symbolic Computation-Artificial Intelligence. Springer-Verlag, Berlin, 1987. Second edition.
14. L. Naish. An introduction to mu-prolog. Technical Report 82/2, The University of Melbourne, 1982.
15. J. G. Smaus Proving termination of input-consuming logic programs In D. De Schreye, editor, 16th International Conference on Logic Programming. MIT press 1999.
16. 5] J.-G. Smaus, P. M. Hill, and A. M. King. Termination of logic programs with block declarations running in several modes. In C. Palamidessi, editor, Proceed-ings of the 10th Symposium on Programming Language Implementations an d Logic Programming, LNCS. Springer-Verlag, 1998.
17. M.H. Van Emden and G.J. De Lucena. Predicate logic as a language for parallel programming. In K.L. Clark and S.-A. Tärnlund, editors, Logic Programming, London, 1982. Academic Press.