Timed default concurrent constraint programming

Journal of Symbolic Computation

Volumn 22, Issue 5-6, 1996, Pages 475-520

  Saraswat, Vijay ^a   Jagadeesan, Radha ^b   Gupta, Vineet ^a  

^a PALO ALTO RESEARCH CENTER   (United States)

^b LOYOLA UNIVERSITY CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030295477     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.1996.0064     Document Type: Article

References (46)

1. Abramsky, S. (1993). Interaction categories. Available by anonymous ftp from papers/ Abramsky: theory.doc.ic.ac.uk
2. Barringer, H., Fisher, M., Gabbay, D., Gough, G., Owens, R. (1990). Metatem: A framework for programming in temporal logic. In de Bakker, J.W., de Roevere, W.P., Rozenberg, G., eds, Stepwise Refinement of Distributed Systems - Models, Formalisms, Correctness. Heidelberg, Springer-Verlag. LNCS 430.
3. Baudinet, M. (1989). Temporal logic programming is complete and expressive. In Proc. of the Sixteenth ACM conference on Principles of Programming Languages.
4. Benveniste, A., Berry, G., eds (1991a). Another Look at Real-time Systems, Special issue of Proceedings of the IEEE, September 1991.
5. Benveniste, A., Berry, G. (1991b). The synchronous approach to reactive and real-time systems. In Benveniste and Berry (1991a).
6. Berry, G., Gonthier, G. (1992). The ESTEREL programming language: design, semantics and implementation. Science of Computer Programming, 19(2):87-152.
7. Berry, G. (1989). Real-time programming: General purpose or special-purpose languages. In Ritter, G., ed., Information Processing 89, pp. 11-17. Elsevier Science Publishers B.V. (North Holland).
8. Berry, G. (1993). Preemption in concurrent systems. In Proc. of FSTTCS. Springer-Verlag. LNCS 761, pp. 72-88 R.K. Shyamasundar, ed.
9. Borning, A. (1979). THINGLAB - A constraint oriented simulation laboratory. PhD thesis, Stanford. Also published as Xerox PARC Report SSL-79-3, July 1979.
10. Brzoska, C. (1991). Temporal logic programming and its relation to constraint logic programming. In Saraswat, V.A., Ueda, K., eds, Logic Programming: Proceedings of the 1991 International Symposium, pp. 661-677.
11. Clarke, E.M., Long, D.E., McMillan, K.L. (1991). A language for compositional specification and verification of finite state hardware controllers. In Benveniste and Berry (1991a).
12. de Boer, F.S., Kok, J.N., Palamidessi, C., Rutten, J.J. (1993). Logic Programming - Proceedings of the 1993 International Symposium, chapter Non-monotonic Concurrent Constraint Programming. MIT Press.
13. Forbus, K. (1988). Exploring Artificial Intelligence. In H.E. Shobe, ed., Qualitative Physics: Past, Present and Future, pp. 239-296. AAAI and Morgan Kaufmann.
14. Gabbay, D.M., Hogger, C., Robinson, J., eds (1994). Handbook of Logic in Artificial Intelligence and Logic Programming, Vol 3: Non-monotonic Reasoning and Uncertain Reasoning. Oxford Science Publications.
15. Gelfond, M., Lifschitz, V. (1988). The stable model semantics for logic programming. In Logic Programming: Proceedings of the Fifth International Conference and Symposium, pp. 1070-1080.
16. Guernic, P.L., Borgne, M.L., Gauthier, T., Maire, C.L. (1991). Programming real time applications with SIGNAL. In Benveniste and Berry (1991a).
17. Gupta, V., Jagadeesan, R., Saraswat, V. Computing with continuous change. Science of Computer Programming. To appear.
18. Gupta, V., Saraswat, V., Struss, P. (1995). A model of a photocopier paper path. In Proc. of the 2nd IJCAI Workshop on Engineering Problems for Qualitative Reasoning.
19. Halbwachs, N. (1993). Synchronous programming of reactive systems. The Kluwer international series in Engineering and Computer Science. Kluwer Academic publishers.
20. Halbwachs, N., Caspi, P., Pilaud, D. (1991). The synchronous programming language LUSTRE. In Benveniste and Berry (1991a).
21. Harel, D., Pnueli, A. (1985). Logics and Models of Concurrent Systems, volume 13. In K.R. Ant, ed., On the development of reactive systems, pp. 471-498. NATO Advanced Study Institute.
22. Harel, D. (1987). Statecharts: A visual approach to complex systems. Science of Computer Programming, 8:231-274.
23. Hentenryck, P.V., Saraswat, V.A., Deville, Y. (1992). Constraint processing in cc(fd). Technical report, Computer Science Department, Brown University.
24. Hoare, C.A.R. (1985). Communicating Sequential Processes. Series in Computer Science. London: Prentice-Hall International.
25. Jagadeesan, R., Panangaden, P., Pingali, K. (1991). A fully-abstract semantics for a first order functional language with logic variables. ACM Transactions on Programming Languages and Systems, 13(4) 577-625.
26. Janson, S., Haridi, S. (1991). Programming Paradigms of the Andorra Kernel Language. In Logic Programming: Proc. of the 1991 International Symposium. MIT Press.
27. Kaci, H.A. (1993). An introduction to LIFE - Programming with Logic, Inheritance, Functions and Equations. In Miller, D., ed., Logic Programming: Proceedings of the 1993 International Symposium. MIT Press.
28. Kahn, G. (1974). The semantics of a simple language for parallel programming. In Rosenfeld, J., ed., Proc. IFIP Congress 74, pp. 471-475.
29. Marek, V.W., Truszczynski, M. (1993). Nonmonotonic Logic. Berlin: Springer-Verlag.
30. Marek, W., Nerode, A., Remmel, J. (1990). A theory of non-monotonic rule systems - I. Annals of Mathematics and Artificial Intelligence, 1:241-273.
31. Marek, W., Nerode, A., Remmel, J. (1992). A theory of non-monotonic rule systems - II. Annals of Mathematics and Artificial Intelligence, 5:229-264.
32. Merz, R. (1993). Efficiently executing temporal logic programs. In Fisher, M., Owens, R., eds, Proc. of IJCAI.
33. Milner, R. (1989). Communication and Concurrency. Prentice-Hall.
34. Milner, R., Parrow, J., Walker, D. (1989). Mobile processes. Technical report, University of Edinburgh.
35. Moszkowski, B. (1986). Executing Temporal Logic Programs. Cambridge Univ. Press.
36. Murakami, G.J., Sethi, R. (1990). Terminal call processing in ESTEREL. Technical report, AT&T Bell Laboratories. Abridged version appeared as Parallelism as a Structuring Technique: Call Processing using the ESTEREL Language in IFIP Transactions in Computer Science and Technology, 1990.
37. Pingali, K., Beck, M., Johnson, R., Moudgill, M., Stodghill, P. (1991). Dependence Flow Graphs: An algebraic approach to program dependencies. In Proc. of the 18th ACM Symposium on Principles of Programming Languages, pp. 67-78.
38. Reiter, R. (1980). A logic for default reasoning. Artificial Intelligence, 13.
39. Saraswat, V.A. (1993). Concurrent constraint programming. Doctoral Dissertation Award and Logic Programming Series. Cambridge, MA: MIT Press.
40. Saraswat, V.A., Kahn, K., Levy, J. (1990). Janus: a step towards distributed constraint programming. In Proc. of the North American Conference on Logic Programming.
41. Saraswat, V.A., Rinard, M., Panangaden, P. (1991). Semantic foundations of concurrent constraint programming. In Proc. of Eighteenth ACM Symposium on Principles of Programming Languages, Orlando.
42. Saraswat, V.A., Jagadeesan, R., Gupta, V. (1994). Foundations of Timed Concurrent Constraint Programming. In Abramsky, S., ed., Proceedings of the Ninth Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Press.
43. Saraswat, V.A., Jagadeesan, R., Gupta, V. (1994). Programming in timed concurrent constraint languages. In Mayoh, B., Tougu, E., Penjam, J., eds, Constraint Programming, volume 131 of NATO Advanced Science Institute Series F: Computer and System Sciences, pp. 367-413. Springer-Verlag.
44. Saraswat, V.A., Jagadeesan, R., Gupta, V. (1995). Default Timed Concurrent Constraint Programming. In Proc. of Twenty Second ACM Symposium on Principles of Programming Languages, San Francisco.
45. Shoham, Y. (1988). Chronological ignorance: Experiments in non-monotonic temporal reasoning. Artificial Intelligence, 36:279-331.
46. Smolka, G., Henz, M., Werz, J. (1994). Constraint Programming: The Newport Papers, chapter Object-oriented programming in Oz. MIT Press.