Forms of logic specifications: A preliminary study

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1207, Issue , 1997, Pages 295-312

  Lau, Kung Kiu ^a   Ornaghi, Mario ^b  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

^b UNIVERSITY OF MILAN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; LOGIC PROGRAMMING; SPECIFICATIONS;

EXECUTABLE SPECIFICATIONS; LOGIC PROGRAMS; LOGIC SPECIFICATIONS; PARTIAL SPECIFICATIONS; PROBLEM DOMAIN;

COMPUTER CIRCUITS;

EID: 84949436164     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62718-9_17     Document Type: Conference Paper

References (24)

1. J.L. Bates and R.L. Constable. Proofs as programs. ACM TOPLAS 7 (1):113-136, 1985.
2. A. Bundy, A. Smaill and G. Wiggins. The synthesis of logic programs from inductive proofs. In J.W. Lloyd, editor, Proc. Esprit Symposium on Computational Logic, pages 135-149, Springer-Verlag, 1990.
3. C.C. Chang and H.J. Keisler. Model Theory. North-Holland, 1973.
4. K.L. Clark. Predicate Logic as a Computational Formalism. Tech. Rep. 79/59, Imperial College, 1979.
5. K.L. Clark. The Synthesis and Verification of Logic Programs. Tech. Rep. 81/36, Imperial College, 1981.
6. Y. Deville and K.K. Lau. Logic program synthesis. J. Logic Programming 19, 20:321-350, 1994. Special issue: Ten years of logic programming.
7. th Int. Conf. on Logic Programming, pages 685-699, MIT Press, 1990.
8. J. Goguen and J. Meseguer. Unifying functional, object-oriented and relational programming with logical semantics. In B. Shriver and P. Wegner, editors, Research Directions in Object-Oriented Programming, pages 417-477, MIT Press, 1987.
9. Å. Hansson and S.-Å. Tärnlund. A natural programming calculus. In Proc. IJCAI 79, pages 348-355, 1979.
10. P.M. Hill and J.W. Lloyd. The Gödel Programming Language. MIT Press, 1994.
11. W. Hodges. Logical features of Horn clauses. In D.M. Gabbay, C.J. Hogger, and J.A. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, Vol 1, pages 449-503, Oxford University Press, 1993.
12. C.J. Hogger. Derivation of logic programs. J. ACM, 28 (2):372-392, April 1981.
13. C.J. Hogger. Introduction to Logic Programming. Academic Press, 1984.
14. C.B. Jones. Systematic Software Development Using VDM. Prentice Hall, 2nd edition, 1990.
15. rd Int. Conf. on Logic Programming, Lecture Notes in Computer Science 225, pages 475-489, 1986.
16. K.K. Lau and M. Ornaghi. On specification frameworks and deductive synthesis of logic programs. In L. Fribourg and F. Turini, editors, Proc. LOPSTR 94 and META 94, Lecture Notes in Computer Science 883, pages 104-121, Springer-Verlag, 1994.
17. th Int. Conf. on Logic Programming, pages 665-683, MIT Press, 1994.
18. K.K. Lau and M. Ornaghi. A formal approach to deductive synthesis of constraint logic programs. In J.W. Lloyd, editor, Proc. 1995 Int. Logic Programming Symp., pages 543-557, MIT Press, 1995.
19. K.K. Lau and M. Ornaghi. The relationship between logic programs and specifications - the subset example revisited. To appear in J. Logic Programming.
20. Z. Manna and R. Waldinger. Fundamentals of deductive program synthesis. IEEE Trans, on Soft. Eng., 18 (8):53-79, 1992.
21. P. Miglioli, U. Moscato and M. Ornaghi. Abstract parametric classes and abstract data types defined by classical and constructive logical methods. J. Symb. Comp. 18:41-81, 1994.
22. R.A. O’Keefe. What does subset mean? ALP Newsletter 8(3):1Q, August 1995.
23. J.M. Spivey. Understanding Z. Cambridge University Press, 1988.
24. M. Wirsing. Algebraic specification. In J. Van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 675-788. Elsevier, 1990.