Advertisement

A solved form algorithm for ask and tell Herbrand constraints

  • Maurizio Gabbrielli
  • Giorgio Levi
CAAP Colloquium On Trees In Algebra And Programming
Part of the Lecture Notes in Computer Science book series (LNCS, volume 493)

Abstract

We consider the problem of defining a solved form for ask and tell equalities over the Herbrand universe used as semantic domain of concurrent constraint programs. We give a solved form which is unique up to renaming for equivalent constraints, and we show an algorithm to compute it. The solved form and the related algorithm are extended to reactive trees consisting of ask and tell constraints. The algorithms are finally shown to be correct, i.e. to preserve the semantics of ask and tell constraints and of reactive trees.

Keywords

Logic Program Reactive Sequence Logic Programming Reactive Tree Constraint Logic Programming 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. [1]
    K.R. Apt. Introduction to Logic Programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics. Elsevier, Amsterdam and The MIT Press, Cambridge, 1990.Google Scholar
  2. [2]
    K.L. Clark and S. Gregory. PARLOG: parallel programming in logic. ACM Transactions on Programming Languages and Systems, 8:1–49, 1986.Google Scholar
  3. [3]
    H. Comon and P. Lescanne. Equational Problems and Disunification. Journal of Symbolic Computation, 7:371–425, 1989.Google Scholar
  4. [4]
    F.S. de Boer, J.N. Kok, C. Palamidessi, and J.J.M.M. Rutten. Semantic models for a version of PARLOG. In G. Levi and M. Martelli, editors, Proc. Sixth Int'l Conf. on Logic Programming, pages 621–636. The MIT Press, Cambridge, Mass., 1989. Extended version to appear in Theoretical Computer Science.Google Scholar
  5. [5]
    F.S. de Boer and C. Palamidessi. Concurrent logic languages: Asynchronism and language comparison. In S. Debray and M. Hermenegildo, editors, Proc. North American Conf. on Logic Programming '90, pages 99–114. The MIT Press, Cambridge, Mass., 1990.Google Scholar
  6. [6]
    F.S. de Boer and C. Palamidessi. A Fully Abstract Model of Concurrent Logic Languages. Technical report, Dipartimento di Informatica, Università di Pisa, 1990.Google Scholar
  7. [7]
    F.S. de Boer and C. Palamidessi. On the asynchronous nature of communication in concurrent logic languages: A fully abstract model based on sequences. In J.C.M. Baeten and J.W. Klop, editors, Proc. of Concur 90, volume 458 of Lecture Notes in Computer Science, pages 175–194. Springer-Verlag, Berlin, 1990.Google Scholar
  8. [8]
    M. Falaschi, M. Gabbrielli, G. Levi, and M. Murakami. Nested Guarded Horn Clauses: a language provided with a complete set of Unfolding Rules. International Journal on Foundations of Computer Science, 1990. to appear.Google Scholar
  9. [9]
    M. Gabbrielli and G. Levi. Modeling answer constraints in Constraint Logic Programs. Technical report, Dipartimento di Informatica, Università di Pisa, 1990.Google Scholar
  10. [10]
    M. Gabbrielli and G. Levi. Unfolding and Fixpoint Semantics of Concurrent Constraint Programs. In H. Kirchner and W. Wechler, editors, Proc. Second Int'l Conf. on Algebraic and Logic Programming, volume 463 of Lecture Notes in Computer Science, pages 204–216. Springer-Verlag, Berlin, 1990.Google Scholar
  11. [11]
    H. Gaifman, M.J. Maher, and E.Y. Shapiro. Reactive Behavior Semantics for Concurrent Constraint Logic Programs. In E. Lusk and R. Overbeck, editors, Proc. North American Conf. on Logic Programming'89, pages 553–572. The MIT Press, Cambridge, Mass., 1989.Google Scholar
  12. [12]
    S. Gregory. Parallel Logic Programming in PARLOG: the Language and its Implementation. Addison-Wesley, 1987.Google Scholar
  13. [13]
    J. Jaffar and J.-L. Lassez. Constraint Logic Programming. In Proc. Fourteenth Annual ACM Symp. on Principles of Programming Languages, pages 111–119. ACM, 1987.Google Scholar
  14. [14]
    J. Jaffar and J.-L. Lassez. Constraint Logic Programming. Technical report, Department of Computer Science, Monash University, June 1986.Google Scholar
  15. [15]
    C. Kirchner and P. Lescanne. Solving Disequations. In Proc. Second IEEE Symp. on Logic In Computer Science, pages 347–352. IEEE Computer Society Press, 1987.Google Scholar
  16. [16]
    J.-L. Lassez, M.J. Maher, and K. Marriott. Unification Revisited. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 587–625. Morgan Kaufmann, Los Altos, Ca., 1988.Google Scholar
  17. [17]
    J.L. Lassez and K. McAloon. Applications of a canonical form for generalized linear constraints. In Proc. Int'l Conf. on Fifth Generation Computer Systems, pages 703–710, Tokyo, 1988. Institute for New Generation Computer Technology.Google Scholar
  18. [18]
    G. Levi. Models, Unfolding Rules and Fixpoint Semantics. In R.A. Kowalski and K.A. Bowen, editors, Proc. Fifth Int'l Conf. on Logic Programming, pages 1649–1665. The MIT Press, Cambridge, Mass., 1988.Google Scholar
  19. [19]
    J.W. Lloyd. Foundations of logic programming. Springer-Verlag, Berlin, 1987. second edition.Google Scholar
  20. [20]
    M.J. Maher. Logic semantics for a class of committed-choice programs. In J.-L. Lassez, editor, Proc. Fourth Int'l Conf. on Logic Programming, pages 858–876. The MIT Press, Cambridge, Mass., 1987.Google Scholar
  21. [21]
    A. Martelli and U. Montanari. An efficient unification algorithm. ACM Transactions on Programming Languages and Systems, 4:258–282, 1982.Google Scholar
  22. [22]
    D.S. Parker and R.R. Muntz. A theory of directed logic programs and streams. In R.A. Kowalski and K.A. Bowen, editors, Proc. Fifth Int'l Conf. on Logic Programming, pages 620–650. The MIT Press, Cambridge, Mass., 1988.Google Scholar
  23. [23]
    V.A. Saraswat. Partial Correctness Semantics for CP(ø,|,&). In Proc. of the Conf. on Foundations of Software Computing and Theoretical Computer Science, volume 206 of Lecture Notes in Computer Science, pages 347–368. Springer-Verlag, Berlin, 1985.Google Scholar
  24. [24]
    V.A. Saraswat. Concurrent Constraint Programming Languages. PhD thesis, Carnegie-Mellon University, January 1989.Google Scholar
  25. [25]
    V.A. Saraswat and M. Rinard. Concurrent constraint programming. In Proc. Seventeenth Annual ACM Symp. on Principles of Programming Languages. ACM, 1990.Google Scholar
  26. [26]
    E.Y. Shapiro. Concurrent Prolog: Collected Papers. The MIT Press, Cambridge, Mass., 1988.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Maurizio Gabbrielli
    • 1
  • Giorgio Levi
    • 1
  1. 1.Dipartimento di InformaticaUniversità di PisaPisaItaly

Personalised recommendations