Datalog LITE: A Deductive Query Language with Linear Time Model Checking

ACM Transactions on Computational Logic

Volumn 3, Issue 1, 2002, Pages 42-79

  Gottlob, Georg ^a   Veith, Helmut ^a   Grádel, Erich ^b  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Algorithms; Complexity; databases; guarded logics; temporal logics; Theory; Verification; verification

Indexed keywords

EID: 85025388590     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/504077.504079     Document Type: Article

References (68)

1. Abadi, M. and Manna, Z. 1989. Temporal logic programming. J. Logic Prog. 8, 3, 277-295
2. Abiteboul, S., Hull, R., and Vianu, V. 1995. Foundations of Databases. Addison-Wesley, Reading, Mass
3. Abiteboul, S., Vianu, V., Fordham, B. S., and Yesha, Y. 1998. Relational transducers for electronic commerce. In Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. J. Paredaens, Ed. ACM Press. New York, pp. 179-187
4. Andréka, H., Van Benthem, J., and Nemeti, I. 1998. Modal languages and bounded fragments of predicate logic. J. Philos. Logic 27, 217-274
5. Apt, K. R., Blair, H. A., and Walker, A. 1988. Towards a theory of declarative knowledge. In Foundations of DD and LP, J. Minker, Ed. pp. 89-148
6. Baudinet, M. 1989a. Logic programming semantics: Techniques and applications. Ph.D. dissertation, Stanford Univ., Stanford, Calif
7. Baudinet, M. 1989b. Temporal logic programming is complete and expressive. In Proceedings of the ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages. ACM, New York, pp. 276-280
8. Baudinet, M. 1992. A simple proof of the completeness of temporal logic programming. In Inten-sional Logics for Programming. L. F. del Cerro and M. Penttonen, Eds. Oxford University Press, Oxford, England
9. Baudinet, M. 1995. On the expressiveness of temporal logic programming. Inf. Comput. 117, 2, 157-180
10. Baudinet, M., Chomicki, J., and Wolper, P. 1993. Temporal deductive databases. In Temporal Databases. A. Tansel, J. Clifford, S. Gadia, S. Jajodia, A. Segev, and R. Snodgrass, Eds. Benjamin/Cummings
11. Berman, K. A., Schlipf, J. S., and Franco, J. V. 1995. Computing well-founded semantics faster. In LPNMR'95, V. Marek and A. Nerode, Eds. Lecture Notes in Computer Science. Springer-Verlag, New York, pp. 113-126
12. Berwanger, D. 2000. Games and model checking for guarded logics. Diplomarbeit, RWTH Aachen
13. Biere, A., Cimatti, A., Clarke, E., and Zhu, Y. 1999. Symbolic model checking without BDDs. In TACAS. Springer-Verlag, New York, 193-207
14. Bryant, R. E. 1986. Graph-based algorithms for boolean function manipulation. IEEE Trans. Comput. 35, 8, 677-691
15. Burch, J. R., Clarke, E. M., Mcmillan, K. L., Dill, D. L., and Hwang, L. J. 1992. Symbolic model checking: 1020 states and beyond. Inf. Comput. 98, 2, 142-170
16. Ceri, S., Gottlob, G., and Tanca, L. 1990. Logic Programming and Databases. Surveys in Computer Science. Springer-Verlag, New York
17. Charatonik, W. and Podelski, A. 1998. Set-based analysis of reactive infinite-state systems. In TACAS'98. B. Steffen, Ed. Lecture Notes in Computer Services, vol, 1384. Springer-Verlag, New York
18. Chomicki, J. 1990a. Functional deductive databases: Query processing in the presence of limited function symbols. Ph.D., Rutgers Univ
19. Chomicki, J. 1990b. Polynomial-time computable queries in temporal deductive databases. In Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS). ACM, New York, pp. 379-391
20. Chomicki, J. and Imielinnski, T. 1988. Temporal deductive databases and infinite objects. In Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS). ACM, New York, pp. 61-73
21. Chomicki, J. and Imielinski, T. 1989. Relational specifications of infinite query answers. In Proceedings of the ACM SIGMOD International Conference on Management of Data. ACM, New York, pp. 174-183
22. Clarke, E. and Emerson, E. A. 1981. Design and synthesis of synchronization skeletons using branching time temporal logic. In Logics of Programs: Workshop. Lecture Notes in Computer Science, vol. 131. Springer-Verlag, New York, pp. 52-71
23. Clarke, E., Grumberg, O., Jha, S., Lu, Y., and Veith, H. 2000a. Counterexample-guided abstraction refinement. In Computer-Aided Verification (CAV) 2000. Lecture Notes in Computer Science, vol. 1855. Springer-Verlag, New York. (Full version available as Technical Report CMU-CS-00-103, Carnegie Mellon University)
24. Clarke, E., Grumberg, O., and Peled, D. 2000b. Model Checking. MIT Press, Cambridge, Mass
25. Clabke, E. and Schlingloff, H. 2000. Model checking. In Handbook of Automated Reasoning. J. Robinson and A. Voronkov, Eds. Elsevier, North-Holland, Amsterdam, The Netherlands, pp. 1635-1790
26. Clarke, E. M., Grumberg, O., and Long, D. E. 1994. Model checking and abstraction. ACM Trans. Prog. Lang. Syst. (TOPLAS) 16, 5 (Sept.) 1512-1542
27. Codd, E. 1972. Relational completeness of database sublanguages. In Courant Computer Science Symposium 6: Database Systems, R. Rustin, Ed. vol. 3. Prentice-Hall, Englewood Cliffs, NJ, pp. 65-98
28. Consens, M. P. and Mendelzon, A. O. 1993. Low-complexity aggregation in GraphLog and Datalog. Theoret. Comput. Sci. 116, 95-116
29. Courcelle, B. 1990. Graph rewriting: An algebraic and logic approach. In Handbook of Theoretical Computer Science, Vol. B. Elsevier, North-Holland, Amsterdam, The Netherlands, pp. 193-242
30. Cui, B., Dong, Y., Du, X., Kumar, K. N., Ramakrishnan, C. R., Amakrishnan, I. V., Roychoudhury, A., Smolka, S. A., and Warren, D. S. 1998. Logic programming and model checking. In PLAP/ALP'98. C. Palamidessi, H. Glaser, and K. Meinke, Eds. Lecture Notes in Computer Science, vol. 1490. Springer-Verlag, New York, pp. 1-20
31. Dahlhaus, E. 1987. Skolem normal forms concerning the least fixpoint. In Computation Theory and Logic. Lecture Notes in Computer Science, vol. 270. Springer-Verlag, New York, pp. 101-106
32. Dantsin, E., Eiter, T., Gottlob, G., and Voronkov, A. 2001. Complexity and expressive power of logic programming. ACM Comput. Surv., to appear
33. Dowling, W. F. and Gallier, J. H. 1984. Linear-time algorithms for testing the satisfiability of propositional Horn formulae. J. Logic Prog. 1, 3 (Oct.), 267-284
34. Ebbinghaus, H.-D. and Flum, J. 1999. Finite Model Theory (2nd edition). Springer-Verlag, New York
35. Eiter, T., Gottlob, G., and Veith, H. 1997. Modular logic programming and generalized quantifiers. In LPNMR'97. J. Dix, U. Furbach, and A. Nerode, Eds. Lecture Notes in Computer Science, vol. 1265. Springer-Verlag, New York, pp. 290-309
36. Eiter, T., Gottlob, G., and Veith, H. 1999. Generalized quantifiers in logic programs. In Proceedings of the ESSLLI Workshop on Generalized Quantifiers (Aix-en-Provence), France, J. Vaananen, Ed. Lecture Notes in Computer Science, vol. 1754. Springer-Verlag, New York
37. Emerson, E. 1990. Temporal and modal logic. In Handbook of Theoretical Computer Science. Vol. B., J. van Leeuven, Ed. Elsevier, North-Holland, Amsterdam, The Netherlands, pp. 995-1072
38. Flum, J. 1999. On the (infinite) model theory of fixed-point logics. In Models, algebras, and proofs. X. Caicedo and C. Montenegro, Eds. Number 2003 in Lecture Notes in Pure and Applied Mathematics Series. Marcel Dekker, pp. 67-75
39. Gelder, A. V., Ross, K. A., and Schlipf, J. S. 1991. The well-founded semantics for general logic programs. J. ACM 38, 3 (July), 620-650
40. Gottlob, G., Graadel, E., and Veith, H. 2000. Linear-time datalog and branching time logic. In Logic-Based Artificial Intelligence, J. Minker, Ed. Kluwer, pp. 443-468
41. Gottlob, G., Leone, N., and Veith, H. 1999. Succinctness as a source of complexity in logical formalisms. Ann. Pure Appl. Logic 97(1-3), 231-260
42. Graadel, E. 1992. On transitive closure logic. In CSL 91. Lecture Notes in Computer Science, vol. 626. Springer-Verlag, New York, pp. 149-163
43. Graadel, E. 1999a. Decision procedures for guarded logics. In Automated Deduction-CADE16. Proceedings of 16th International Conference on Automated Deduction (Trento, Italy). Lecture Notes in Artificial Intelligence, vol. 1632. Springer-Verlag, New York
44. Graadel, E. 1999b. On the restraining power of guards. J. Symb. Logic 64, 1719-1742
45. Graadel, E. 1999c. Why are modal logics so robustly decidable? Bull. EATCS 68, 90-103
46. Graadel, E. and Walukiewicz, I. 1999. Guarded fixed point logic. In Proceedings of the 14th IEEE Symposium on Logic in Computer Science. G. Longo, Ed. IEEE Computer Society Press, Los Alamitos, Calif., pp. 45-54
47. Immerman, N. 1988. Nondeterministic space is closed under complementation. SIAM J. Comput. 17, 5, 935-938
48. Immerman, N. and Vardi, M. Y. 1997. Model checking and transitive-closure logic. In Proceedings of the CAV1997. O. Grumberg, Ed. Lecture Notes in Computer Science, vol. 1254. Springer-Verlag, New York, pp. 291-302
49. Itai, A. and Makowsky, J. A. 1987. Unification as a complexity measure for logic programming. J. Logic Prog. 4, 2 (June), 105-117
50. Janin, D. and Walukiewicz, I. 1996. On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic. In CONCUR 96. Lecture Notes in Computer Science, vol. 1119. Springer-Verlag, New York, pp. 263-277
51. Jurdzinski, M. 2000. Small progress measures for solving parity games. In STACS 2000, Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science, vol. 1770. Springer-Verlag, New York, pp. 290-301
52. Kolaitis, P. G. 1990. Implicit definability on finite structures and unambiguous computations. Inf. Comput. 90, 50-66
53. Kozen, D. 1983. Results on the propositional μ-calculus. Theoret. Comput. Sci. 27, 3 (Dec.), 333-354
54. Kurshan, R. P. 1994. Computer-Aided Verification of Coordinating Processes. Princeton University Press, Princeton, N.J
55. Liu, X., Ramakrishnan, C., and Smolka, S. 1998. Fully local and efficient evaluation of alternating fixed points. In TACAS'98. Lecture Notes in Computer Science, vol. 1384. Springer-Verlag, New York
56. Mcmillan, K. L. 1993. Symbolic Model Checking. Kluwer
57. Minoux, M. 1988. LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation. Inf. Proc. Lett. 29, 1 (15 Sept.), 1-12
58. Moret, B. and Shapiro, H. 1990. Algorithms from P to NP. Benjamin/Cummings
59. Murakami, M. 1990. A declarative semantics of flat guarded Horn clauses for programs with perpetual processes. Theoret. Comput. Sci. 75, 1-2 (25 Sept.), 67-83
60. Peled, D. A., Pratt, V. R., and Holzmann, G. J., Eds. 1997. Partial Order Methods in Verification. DIMACS series, vol. 29. American Mathematical Society, Providence, R.I
61. Ramakrishnan, Y. S., Ramakrishnan, C. R., Ramakrishnan, I. V., Smolka, S. A., Swift, T., and Warren, D. S. 1997. Efficient model checking using tabled resolution. In Proceedings of the CAV'97, O. Grumberg, Ed. Lectures Notes in Computer Science, vol. 1254. Springer-Verlag, New York, pp. 143-154
62. Seese, D. 1996. Linear time computable problems and first-order descriptions. Math. Struct. Comput. Sci. 6, 6 (Dec.), 505-526
63. Ullman, J. D. 1989. Principles of Data Base Systems. Computer Science Press
64. Van Emde Boas, P. 1990. Machine models and simulation. In Handbook of Theoretical Computer Science, vol. A. J. van Leeuven, Ed. Elsevier, North-Holland, Amsterdam, The Netherlands, pp. 1-66
65. Vardi, M. 1982. Complexity of relational query languages. In Proceedings of the 14th Annual ACM Symposium on Theory of Computing (San Francisco, Calif.). ACM, New York, pp. 137-146
66. Vardi, M. Y. 1998. Reasoning about the past with two-way automata. In ICALP, K. G. Larsen, S. Skyum, and G. Winskel, Eds. Lecture Notes in Computer Science, vol. 1443. Springer-Verlag, New York, pp. 628-641
67. Vardi, M. and Wolper, P. 1994. Reasoning about infinite computations. Inf. Comput. 115, 1, 1-37
68. Wolper, P. 1983. Temporal logic can be more expressive. Inf. Cont. 56, 1-2, 72-99