A framed temporal logic programming language

Journal of Computer Science and Technology

Volumn 19, Issue 3, 2004, Pages 341-351

  Duan, ZhenHua ^a,c   Koutny, Maciej ^b  

^a XIDIAN UNIVERSITY   (China)

^b NEWCASTLE UNIVERSITY   (United Kingdom)

^c ISCAS   (China)

Author keywords

Concurrency; Frame; Projection; Temporal logic; Temporal logic programming

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTER PROGRAMMING LANGUAGES; CONCURRENCY CONTROL; MATHEMATICAL MODELS; PARAMETER ESTIMATION; QUERY LANGUAGES; SEMANTICS;

CONCURRENCY; FRAME; PROJECTION; TEMPORAL LOGIC; TEMPORAL LOGIC PROGRAMMING;

LOGIC PROGRAMMING;

EID: 2442647627     PISSN: 10009000     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02944904     Document Type: Article

References (20)

1. Barringer H, Fisher M, Gabbay D et al. METATEM: A framework for programming in temporal logic. In Proc. REX Workshop on Stepwise Refinement of Distributed Systems: Models, Formulisms, Correctness, Mook, Netherlands, Lecture Notes in Computer Science 430, Springer-Verlag, 1989, pp.94-129.
2. Fujita M, Kono S, Tanaka H et al. Tokio: Logic programming language based on temporal logic and its compilation to PROLOG. Third International Conference on Logic Programming, London, Lecture Notes in Computer Science 225, Springer-Verlag, July, 1986, pp.695-709.
3. Lamport L. The temporal logic of actions. ACM TOPLAS, 1994, 16: 872-923.
4. Moszkowski B. Executing Temporal Logic Programs. Cambridge University Press, Cambridge, 1986.
5. Tang C S. Toward a unified logic basis for programming languages. In Proc. IFIP Congress 83, Amsterdam, Elsevier Science Publishers B.V. (North-Holland), 1983, pp.425-429.
6. Tang C S. A temporal logic language oriented toward software engineering - Introduction to XYZ system (I). Chinese Journal of Advanced Software Research, 1994, 1(1): 1-27.
7. Duan Z, Koutny M, Holt C. Projection in temporal logic programming. In: Proc. 5th International Conference on Logic Programming and Automated Reasoning, Lecture Notes in Computer Science 822, Springer, 1994, pp.333-344.
8. Milner R. Communication and Concurrency. Prentice Hall, London, 1989.
9. Hoare C A R. Communicating Sequential Processes. Prentice Hall International, London, 1985.
10. Manna Z, Pnueli A. The Temporal Logic of Reactive and Concurrent Systems. Springer-Verlag, 1992.
11. Duan Z. An extended interval temporal logic and a framing technique for temporal logic programming [Dissertation]. Technical Report 556, Department of Computing Science, University of Newcastle upon Tyne, September, 1996.
12. McDermott D. Non-monotonic logic I. Artificial Intelligence, 1980, 13(1/2): 41-72.
13. McCarthy J. Circumscription-A form of non-monotonic reasoning. Artificial Intelligence, 1980, 13(1/2): 27-39.
14. Reiter R. A logic for default reasoning. Artificial Intelligence, 1980, 13(1/2): 81-132.
15. Rosner R, Pnueli A. A choppy logic. In Proc. First Annual IEEE Symposium on Logic in Computer Science, 1986, pp.306-314.
16. Kröger F. Temporal Logic of Programs. Springer-Verlag, 1987.
17. Moszkowski B, Some very compositional temporal properties. In Programming Concepts, Methods and Calculi, Olderog E R (Ed.), IFIP Transactions A-56, pp.307-326. IFIP, Elsevier Science B.V., North-Holland, 1994.
18. Dijkstra E W. Guarded commands, nondeterminacy, and formal derivation of programs. Communication of the ACM, 1975, 18(8): 453-457.
19. Duan Z. An algorithm of constructing even order magic square. Chinese Journal of Micro-Electronics and Computer, 1990, 4: 13-16.
20. Ben-Ari M. Principles of Concurrent Programming. Prentice-Hall International, London, England, New Jersey, 1982.