Steadfast logic programs

Journal of Logic Programming

Volumn 38, Issue 3, 1999, Pages 259-294

  Lau, Kung Kiu ^a   Ornaghi, Mario ^b   Tärnlund, Sten Åke ^c  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

^b UNIVERSITY OF MILAN   (Italy)

^c UPPSALA UNIVERSITY   (Sweden)

Author keywords

Correctness; Modularity; Open programs; Parametric programs; Parametric specifications; Reusability

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTER SOFTWARE REUSABILITY; FORMAL LOGIC; HIERARCHICAL SYSTEMS; MATHEMATICAL MODELS;

OPEN PROGRAMS; STEADFAST LOGIC PROGRAMS;

LOGIC PROGRAMMING;

EID: 0033101510     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(98)10023-7     Document Type: Article

References (39)

1. K.R. Apt, Logic Programming, in: J. Van Leeuwen (Ed.), Handbook of Theoretical Computer Science, vol. B, Elsevier, Amsterdam, 1990, pp. 493-574.
2. K.R. Apt, From Logic Programming to Prolog, Prentice-Hall, Englewood Cliffs, NJ, 1997.
3. A. Brogi, E. Lamma, P. Mello, Compositional model-theoretic semantics for logic programs, New Generation Comput. 11 (1992) 1-21.
4. A. Brogi, P. Mancarella, D. Pedreschi, F. Turini, Modular logic programming, ACM TOPLAS 16 (4) (1994) 1361-1398.
5. M. Bugliesi, E. Lamma, P. Mello, Modularity in logic programming, J. Logic Program. 19, 20 (1994) 443-502; Special issue: Ten years of logic programming.
6. K.L. Clark, Negation as failure, in: H. Gallaire, J. Minker (Eds.), Logic and Data Bases, Plenum Press, New York, 1978.
7. K.L. Clark, Predicate Logic as a Computational Formalism, Research Report 79/59, Department of Computing, Imperial College, 1979.
8. K.L. Clark, S.-Å. Tärnlund, A first order theory of data and programs, Proceedings of the IFIP 77, North-Holland, Amsterdam, 1977,pp. 939-944.
9. D. De Schreye, S. Decorte, Termination of logic programs: The never-ending story, J. Logic Program. 19, 20 (1994) 199-260 .
10. Y. Deville, Logic Programming: Systematic Program Development, Addison-Wesley, Reading, MA, 1990.
11. H. Ehrig, B. Mahr, Fundamentals of Algebraic Specification 1, Springer, Berlin, 1985.
12. H. Ehrig, B. Mahr, Fundamentals of Algebraic Specification 2, Springer, Berlin, 1989.
13. J.A. Goguen, R.M. Burstall, Institutions: Abstract model theory for specification and programming, J. ACM 39 (1) (1992) 95-146.
14. C.J. Hogger, Introduction to Logic Programming, Academic Press, New York, 1984.
15. J. Jaffar, M. Maher, Constraint logic programming: A survey, J. Logic Programming 19, 20 (1994) 503-581. Special issue: Ten years of logic programming.
16. C. Kreitz, K.-K. Lau, M. Ornaghi, Formal reasoning about modules, reuse and their correctness, in: D.M. Gabbay, H.J. Ohlbach (Eds.), Proceedings of the International Conference on Formal and Applied Practical Reasoning, LNAI 1085, Springer, Berlin, 1996, pp. 384-399.
17. K.-K. Lau, C.D.M. Moss, M. Ornaghi, Formal development of correct classes in computational logic, in: D.J. Duke, A.S. Evans (Eds.), Proceedings of the BCS-FACS Northern Formal Methods Workshop, Springer, electronic Workshops in Computing Series, 1997; Abstract on p. 3 (http:// ewic.springer.co.uk).
18. K.-K. Lau, M. Ornaghi, S.-.Å. Tärnlund, The halting problem for deductive synthesis of logic programs, in: P. van Hentenryck (Ed.), Proceedings of the 11th International Conference on Logic Programming, MIT Press, Cambridge, MA, 1994, pp. 665-683.
19. K.-K. Lau, M. Ornaghi, On specification frameworks and deductive synthesis of logic programs, in: L. Fribourg, F. Turini (Ed.), Proceedings of the LOPSTR 94 and META 94, LNCS 883, Springer, Berlin, 1994, pp. 104-121.
20. K.-K. Lau, M. Ornaghi, A formal approach to deductive synthesis of constraint logic programs, in: J.W. Lloyd (Ed.), Proceedings of the 1995 International Logic Programming Symposium, MIT Press, Cambridge, MA, 1995, pp. 543-557.
21. K.-K. Lau, M. Ornaghi, Towards an object-oriented methodology for deductive synthesis of logic programs, in: M. Proietti (Ed.), Proceedings of the LOPSTR 95, LNCS 1048, Springer, Berlin, 1996, pp. 152-169.
22. K.-K. Lau, M. Ornaghi, Forms of Logic Specifications: A Preliminary Study, in: J. Gallagher (Ed.), Proceedings of the LOPSTR 96, LNCS 1207, Springer, Berlin, 1997, pp. 295-312.
23. K.-K. Lau, M. Ornaghi, The relationship between logic programs and specifications - the subset example revisited, J. Logic Program. 30 (3) (1997) 239-257.
24. K.-K. Lau, M. Ornaghi, A. Wills, Frameworks in Catalysis: Pictorial Notation and Formal Semantics, Proceedings of the First IEEE International Conference on Formal Engineering Methods, IEEE Computer Society, 1997, pp. 213-220 .
25. K.-K. Lau, S.D. Prestwich, Synthesis of a family of recursive sorting procedures, in: V. Saraswat, K. Ueda (Eds.), Proceedings of the 1991 International Logic Programming Symposium, MIT Press, Cambridge, MA, 1991, pp. 641-658.
26. J.W. Lloyd, Foundations of Logic Programming, 2nd ed., Springer, Berlin, 1987.
27. B. Meyer, Object-oriented Software Construction, Prentice-Hall, Englewood Cliffs, NJ, 1988.
28. D. Miller, A logical analysis of modules in logic programming, J. Logic Program. 6 (1989) 79-108.
29. D. Miller, Abstractions in logic programs, in: P. Odifreddi (Ed.), Logic in Computer Science, Academic Press, New York, 1990, pp. 329-356.
30. L. Monteiro, A. Porto, Contextual Logic Programming, in: G. Levi, M. Martelli (Eds.), Proc. 6th Int. Conf. on Logic Programming, MIT Press, Cambridge, MA, 1989, pp. 284-299.
31. L. Naish, Coroutining and the construction of terminating logic programs, Australian Comput. Sci. Comm. 15 (1) (1993) 181-190.
32. F. Pfenning, Types in Logic Programming, MIT Press, Cambridge, MA, 1992.
33. R. O'Keefe, The Craft of Prolog, MIT Press, Cambridge, MA, 1990.
34. F. Orejas, E. Pino, H. Ehrig, Institutions for logic programming, Theoret. Comput. Sci. 173 (1997) 485-511.
35. D. Sannella, S. Sokolowski, A. Tarlecki, Towards formal development of programs from algebraic specifications: parameterisation revisited, Acta Informatica 29 (1992) 689-736.
36. D. Sannella, A. Tarlecki, Toward formal development of programs from algebraic specifications: model-theoretic foundations, Lecture Notes in Computer Science 623, Springer, Berlin, 1992, pp. 656-671.
37. J.C. Shepherdson, Negation in logic programming, in: J. Minker (Ed.), Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann, Los Altos, CA, 1988, pp. 19-88.
38. M.H. van Emden, R. Kowalski, The semantics of predicate logic as a programming language, J. ACM 23 (4) (1976) 733-742.
39. M. Wirsing, Algebraic specification, in: J. Van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Elsevier, Amsterdam, 1990, pp. 675-788.