Multi-dimensional logic programming: Theoretical foundations

Theoretical Computer Science

Volumn 185, Issue 2, 1997, Pages 319-345

  Orgun, Mehmet A ^a   Du, Weichang ^b  

^a MACQUARIE UNIVERSITY   (Australia)

^b UNIVERSITY OF NEW BRUNSWICK   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTER PROGRAMMING LANGUAGES; FORMAL LOGIC; PROGRAMMING THEORY; THEOREM PROVING;

MULTIDIMENSIONAL LOGIC PROGRAMMING;

LOGIC PROGRAMMING;

EID: 0031251579     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00048-0     Document Type: Article

References (44)

1. M. Abadi, The power of temporal proofs, Theoret. Comput. Sci. 65 (1989) 35-83.
2. M. Abadi, Z. Manna, Temporal logic programming, J. Symbol. Comput. 8 (1989) 277-295.
3. T. Aoyagi, M. Fujita, T. Moto-oka, Temporal logic programming language Tokio, in: E. Wada (Ed.), Logic Programming '85, Lecture Notes in Computer Science, vol. 221, Springer, Berlin, 1986, pp. 138-147.
4. K.R. Apt, M.H. van Emden, Contributions to the theory of logic programming, J. Assoc. Comput. Machinery 29 (1982) 841-862.
5. E.A. Ashcroft, A.A. Faustini, B. Huey, Eduction: a model of parallel computation and the programming language Lucid, in: Proc. Phoenix Conf. on Computers and Communications, IEEE Computer Society Press, Silver Spring, MD, 1985, pp. 9-15.
6. P. Balbiani, L. Farinas del Cerro, A. Herzig, Declarative semantics for modal logic programs, in: Proc. 1988 Internat. Conf. on Fifth Generation Computer Systems, ICOT, 1988, pp. 507-514.
7. P. Balbiani, A. Herzig, M. Lima-Marques, TIM: The Toulouse inference machine for non-classical logic programming, in: PDK'91: Internat. Workshop on Processing Declarative Knowledge, Lecture Notes in Artificial Intelligence, vol. 567, Springer, Berlin, 1991, pp. 365-382.
8. M. Baudinet, Temporal logic programming is complete and expressive, in: Conf. Record of the 16th ACM Symp. on Principles of Programming Languages, Austin, Texas, ACM, New York, 1989, pp. 267-280.
9. M. Baudinet, On the expressiveness of temporal logic programming, Inform. and Comput. 117 (1995) 157-180.
10. M. Baudinet, J. Chomicki, P. Wolper, Temporal deductive databases, in: A. Tansel et al. (Eds.), Temporal Databases: Theory, Design, and Implementation, Benjamin/Cummings, Redwood City, CA, 1993.
11. C. Brzoska, Temporal logic programming with metric and past operators, in: M. Fisher, R. Owens (Eds.) Executable Modal and Temporal Logics, Springer, Berlin, 1995, pp. 21-39.
12. C. Brzoska, K. Schäfer, Temporal logic programming applied to image sequence evaluation, in: C. Beierle, L. Plümer (Eds.), Logic Programming: Formal Methods and Practical Applications, Elsevier, Amsterdam, 1995, pp. 381-395.
13. B.F. Chellas, Modal Logic: An Introduction, Cambridge University Press, Cambridge, 1980.
14. F. Debart, P. Enjalbert, M. Lescot, Multimodal logic programming using equational and order-sorted logic, Theoret. Comput. Sci. 105 (1992) 141-166.
15. W. Du, W.W. Wadge, A 3d spreadsheet based on intensional logic, IEEE Software (1990) 78-89.
16. L. Farinas del Cerro, MOLOG: a system that extends PROLOG with modal logic, New Generation Comput. 4 (1986) 35-50.
17. M. Finger, M. Fisher, R. Owens, METATEM at work: modelling reactive systems using executable temporal logic, in: Proc. 6th Internat. Conf. on Industrial and Engineering Applications of AI and Expert Systems, Edinburgh, UK, 1993.
18. M. Fisher, R. Owens, An introduction to executable modal and temporal logics, in: M. Fisher, R. Owens (Eds.), Executable Modal and Temporal Logics, Springer, Berlin, 1995, pp. 1-21.
19. D.M. Gabbay, Modal and temporal logic programming, in: A. Galton (Ed.), Temporal Logics and Their Applications, Academic Press, New York, 1987, pp. 197-237.
20. B. Gabor, Action planning in intensional programming language, Master's thesis, Institute of Mathematics, Technical University of Budapest, Hungary, 1995.
21. P. Jackson, H. Reichgelt, A general proof method for modal predicate logic, in: P. Jackson, H. Reichgelt, F. van Harmelen (Eds.), Logic-Based Knowledge Representation, MIT Press, Cambridge, MA, 1989, pp. 177-228.
22. R.A. Kowalski, Logic for Problem Solving, North-Holland, Amsterdam, 1979.
23. F. Kriwaczek, LogiCalc: a Prolog spreadsheet, in: J.E. Hayes, D. Michie, J. Richards (Eds.), Machine Intelligence, Clarendon Press, Oxford, 1988, pp. 193-208.
24. C. Liu, M.A. Orgun, Knowledge-based simulation with Chronolog, in: M.A. Orgun, E.A. Ashcroft (Eds.), Intensional Programming I, World Scientific, Singapore, 1996, pp. 273-286.
25. C. Liu, M.A. Orgun, K. Zhang, A framework for exploiting parallelism in Chronolog, in: Proc. 1st IEEE Internat. Conf. on Algorithms and Architectures for Parallel Processing, IEEE Press, New York, 1995, pp. 163-172.
26. J.W. Lloyd, Foundations of Logic Programming, Springer, Berlin, 1984.
27. Z. Manna, A. Pnueli, Verification of concurrent programs: the temporal framework, in: Boyer, Moore (Eds.), Correctness Problem in Computer Science, Academic Press, New York, 1981, pp. 215-273.
28. W.H. Mitchell, Intensional Horn clause logic as a programming language - its use and implementation, Master's thesis, Department of Computer Science and Engineering, Arizona State University, Tempe, Arizona, 1988.
29. W.H. Mitchell, A.A. Faustini, The intensional logic language InTense, in: Proc. 1989 Internat. Symp. on Lucid and Intensional Programming, Arizona State University, 1989.
30. B. Moszkowski, Executing Temporal Logic Programs, Cambridge University Press, Cambridge, 1986.
31. M.A. Orgun, On temporal deductive databases, Comput. Intell. 12 (2) (1996) 235-259.
32. M.A. Orgun, W. Du, Multi-dimensional logic programming, in: Special Issue: Proc. ICCI'94: 6th Internat. Conf. on Computing and Information, Trent University, Peterborough, Ont., Canada, 1994. Special Issue of J. Comput. and Inform. 1 (1) (1994) 1462-1481.
33. M.A. Orgun, W. Ma, An overview of temporal and modal logic programming, in: D.M. Gabbay, H.J. Ohlbach (Eds.), Proc. ICTL '94: 1st Internat. Conf. Temporal Logic, Lecture Notes in Artificial Intelligence, vol. 827, Springer, Berlin, 1994, pp. 445-479.
34. M.A. Orgun, W.W. Wadge, Theory and practice of temporal logic programming, in: L. Fariñas del Cerro, M. Penttonen (Eds.), Intensional Logics for Programming, Oxford University Press, Oxford, 1992, pp. 23-50.
35. M.A. Orgun, W.W. Wadge, Towards a unified theory of intensional logic programming, J. Logic Programming 13 (4) (1992) 413-440.
36. M.A. Orgun, W.W. Wadge, Chronolog admits a complete proof procedure, in: Proc. 6th Internat. Symp. on Lucid and Intensional Programming, Université Laval, Québec City, Canada, 1993, pp. 120-135.
37. D.W. Rolston, A.A. Faustini, An overview of an eductive evaluation mechanism for logic programs, in: Proc. 6th Internal. Symp. on Lucid and Intensional Programming, Université Laval, Québec City, Canada, 1993, pp. 136-157.
38. F. Sadri, Three approaches to temporal reasoning, in: A Galton (Ed.), Temporal Logics and their Applications, Academic Press, New York, 1987, pp. 121-168.
39. P. Smets, A. Mamdani, D. Dubois, H. Prade (Eds.), Non-Standard Logics for Automated Reasoning, Academic Press, New York, 1988.
40. A. Szalas, Concerning the semantic consequence relation in first-order temporal logic, Theoret. Comput. Sci. 47 (1986) 329-334.
41. A. Tuzhilin, SimTL: A simulation language based on temporal logic, Trans. Soc. Comput. Simulation 9 (1992) 86-99.
42. M.H. van Emden, M. Ohki, A. Takeuchi, Spreadsheets with incremental queries as a user interface for logic programming, New Generation Comput. 4 (1986) 287-304.
43. M.H. van Emden, R.A. Kowalski, The semantics of predicate logic as a programming languge, J. Assoc. Comput. Machinery 23 (1976) 733-42.
44. W.W. Wadge, E.A. Ashcroft, Lucid, the Dataflow Programming Language, Academic Press, New York, 1985.