Abstract
Input-consuming programs are logic programs with an additional restriction on the selectability (actually, on the resolvability) of atoms. This class of programs arguably allows to model logic programs employing a dynamic selection rule and constructs such as delay declarations: as shown also in [5], a large number of them are actually input-consuming.
In this paper we show that - under some syntactic restrictions - the S-semantics of a program is correct and fully abstract also for input-consuming programs. This allows us to conclude that for a large class of programs employing delay declarations there exists a model-theoretic semantics which is equivalent to the operational one.
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
K.R. Apt. Introduction to Logic Programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, pages 495–574. Elsevier, Amsterdam and The MIT Press, Cambridge, 1990.
K. R. Apt. From Logic Programming to Prolog. Prentice Hall, 1997.
K. R. Apt and I. Luitjes. Verification of logic programs with delay declarations. In A. Borzyszkowski and S. Sokolowski, editors, Proceedings of the Fourth International Conference on Algebraic Methodology and Software Technology, (AMAST’95), Lecture Notes in Computer Science, Berlin, 1995. Springer-Verlag.
R. Apt and A. Pellegrini. On the occur-check free Prolog programs. ACM Toplas, 16(3):687–726, 1994.
A. Bossi, S. Etalle, and S. Rossi. Properties of input-consuming derivations. Electronic Notes in Theoretical Computer Science, 30(1), 1999. http://www.elsevier.nl/locate/entcs, temporarily available at http://www.cs.unimaas.nl/~etalle/papers/index.htm.
A. Bossi, S. Etalle, and S. Rossi. Properties of input-consuming derivations. Technical Report CS 99-06, Universiteit Maastricht, 1999.
A. Bossi, S. Etalle, and S. Rossi. Semantics of input-consuming programs. Technical Report CS 00-01, Universiteit Maastricht, 2000.
Annalisa Bossi, Maurizio Gabrielli, Giorgio Levi, and Maurizio Martelli. The S-semantics approach: Theory and applications. The Journal of Logic Programming, 19 & 20:149–198, May 1994.
R. Chadha and D.A. Plaisted. Correctness of unification without occur check in Prolog. Technical report, Department of Computer Science, University of North Carolina, Chapel Hill, N.C., 1991.
P. Dembinski 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.
M. Falaschi, G. Levi, M. Martelli, and C. Palamidessi. Declarative modeling of the operational behavior of logic languages. Theoretical Computer Science, 69(3):289–318, 1989.
J. W. Lloyd. Foundations of Logic Programming Symbolic Computation-Artificial Intelligence. Springer-Verlag, Berlin, 1987. Second edition.
L. Naish. An introduction to mu-prolog. Technical Report 82/2, The University of Melbourne, 1982.
J. G. Smaus. Proving termination of input-consuming logic programs. In D. De Schreye, editor, 16th International Conference on Logic Programming. MIT press, 1999.
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, Proceedings of the 10th Symposium on Programming Language Implementations and Logic Programming, LNCS. Springer-Verlag, 1998.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bossi, A., Etalle, S., Rossi, S. (2000). Semantics of Input-Consuming Logic Programs. In: Lloyd, J., et al. Computational Logic — CL 2000. CL 2000. Lecture Notes in Computer Science(), vol 1861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44957-4_13
Download citation
DOI: https://doi.org/10.1007/3-540-44957-4_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67797-0
Online ISBN: 978-3-540-44957-7
eBook Packages: Springer Book Archive