Search and imperative programming

Conference object, Part of book or chapter of book, Report English OPEN
Apt, K.R.; Schaerf, A.;
(1997)
  • Publisher: A.C.M.
  • References (20)
    20 references, page 1 of 2

    Apt, K. (1996), 'Arrays, bounded quantification and iteration in logic and constraint logic programming', Science of Computer Programming 26(1-3), 133- 148.

    Barklund, J. & Bevemyr, J. (1993), Prolog with arrays and bounded quantifications, in A. Voronkov, ed., 'Logic Programming and Automated ReasoningProc. 4th Intl. Conf.', LNCS 698, Springer-Verlag, Berlin, pp. 28-39.

    Bonsangue, M. M. & Kok, J. (1994), 'The weakest precondition calculus: recursion and duality', Formal Aspects of Computing 6(6A), 788-800.

    Bylander, T. (1991), Complexity results for planning, in 'Proceedings of the Twelfth International Joint Conference on Artificial Intelligence (IJCAI-91)', pp. 274-279.

    Coelho, H. & Cotta, J. C. (1988), Prolog by Example, Springer-Verlag, Berlin.

    Cohen, J. (1979), 'Non-Deterministic algorithms', ACM Computing Surveys 11(2), 79-94.

    Colmerauer, A. (1990), 'An introduction to Prolog III', Communications of ACM 33(7), 69-90.

    Eriksson, L.-H. & Rayner, M. (1984), Incorporating mutable arrays into logic programming, in S. A. Tarnlund, ed., 'Proc. Second Int'l Conf. on Logic Programming', Uppsala University, pp. 101-114.

    Fikes, R. E. & Nilsson, N. J. (1971), 'STRIPS: A new approach to the application of theorem proving to problem solving', Artificial Intelligence Journal 2, 189-208.

    Griswold, R. E. & Griswold, M. T. (1983), The Icon Programming Language, Prentice-Hall, Englewood Cliffs, New Jersey, USA.

  • Related Organizations (5)
  • Metrics
Share - Bookmark