Declarative semantics for active rules

Theory and Practice of Logic Programming

Volumn 1, Issue 1, 2001, Pages 43-69

  Flesca, Sergio ^a   Greco, Sergio ^a  

^a UNIVERSITY OF CALABRIA   (Italy)

Author keywords

Active databases; Deductive databases; Semantics; Stable models

Indexed keywords

EID: 0012480907     PISSN: 14710684     EISSN: None     Source Type: Journal    
DOI: 10.1017/S1471068400001009     Document Type: Article

References (42)

1. Abiteboul S., Hull R. and Vianu, V. (1994) Foundations of Databases. Addison-Wesley.
2. Abiteboul, S., Simon, E. and Vianu, V. (1990) Non-deterministic languages to express deterministic transformations, Proc. ACM Symp. on Principles of Database Systems, pp. 218-229.
3. Abiteboul, S. and Vianu, V. (1991) Datalog Extensions for Databases Queries and Updates. J. Computer & System Sci. 43(1), 62-124.
4. Aiken, A., Widom, J. and Hellerstein, J. M. (1992) Behaviour of database production rules: termination, confluence and observable determinism. Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 59-68.
5. Bailey, J., Crnogorac, L., Ramamoharanao, K. and Sondergaard, H. (1997) Abstract interpretation of active rules and its use in termination analysis. In Proc. Int. Conf. on Database Theory, pp. 188-202.
6. Baralis, E., Ceri, S. and Paraboschi, S. (1996) Improved rule analysis by means of triggering and activation graphs. In: T. Sellis (ed.), Rules in Database Systems, pp. 165-181. Springer-Verlag.
7. Baralis, E. and Widom, J. (1994) An algebraic approach to rule analysis in expert database systems. Proc. Int. Conf. on Very Large Data Bases, pp. 475-486.
8. Baral, C. and Lobo, J. (1996) Formal characterization of active databases. Proc. Int. Workshop on Logic in Databases, pp. 175-195.
9. Bidoit, N. and Maabout, S. (1997) A model theoretic approach to update rule programs. In Proc. Int. Conf. on Database Theory, pp. 173-187.
10. Blass, A. and Gurevich, Y. (1982) On the Unique Satisfiability Problem. Infor. & Control, 80-88.
11. Ceri, S. and Fraternali, P. (1997) The IDEA Methodology. Addison-Wesley.
12. De Schreye, D. and Decorte, S. (1994) Termination of logic programs: the never-ending story. Journal of Logic Programming, 19/20, 199-260.
13. Gelfond, M. and Lifschitz, V. (1988) The stable model semantics for logic programming. Proc. 5th Int. Conf. on Logic Programming, pp. 1070-1080.
14. Greco, S. and Saccà, D. (1996) 'Possible is Certain' is desirable and can be expressive. Annals of Mathematics & Artif. Intell. 19(1-2) 147-168.
15. Greco, S. and Saccà, D. (1997) Complexity and expressive power of deterministic stable model semantics. Proc. Int. Conf. on Deductive and Object Oriented Databases, pp. 337-350.
16. p, Proc. Int. Conf. on Database Theory, pp. 82-96.
17. Grumbach, S., Lacroix, Z. and Lindell, S. (1995) Implicit definitions on finite structures. Proc. Conf. on Computer Science Logic, pp. 252-265.
18. Johnson, D. S. (1990) A catalog of complexity classes. In: J. van Leewen (ed.), Handbook of Theoretical Computer Science, Vol. 1, pp. 67-161. North-Holland.
19. Kifer, M., Ramakrishnan, R. and Silbershatz, A. (1988) An axiomatic approach to deciding query safety in deductive databases. Proc. ACM Symposium on Principles of Database Systems, pp. 52-60.
20. Kolaitis, P. G. (1990) Implicit definability of finite structures and unambiguous computations. Proc. 5th IEEE Symposium on Logic in Computer Science, pp. 168-180.
21. Kolaitis, P. G. and Papadimitriou, C. (1991) Why not negation by fixpoint. J.f Computer & System Sci. 43(1), 125-144.
22. Krishbamurty, R., Ramakrishnan, R. and Shmueli, O. (1988) A framework for testing safety and effective computability of extended datalog. Proc. ACM SIGMOD Conf. on Management of Data, pp. 154-163.
23. Lausen, G., Ludascher, B. and May, W. (1998) On logical foundations of active databases. Logics for Databases and Information Systems, pp. 389-422
24. Ludascher, B. (1998) Integration of Active and Deductive Database Rules. Phd Thesis, Institut für Informatik, Universität Freiburg, Germany.
25. Lloyd, J. W. (1987) Foundations of Logic Programming. Springer-Verlag.
26. Marek, W. and Truszczynski, M. (1991) Autoepistemic logic. J. ACM, 38(3), 588-619.
27. Papadimitriou, C. (1994) Computational Complexity. Addison-Wesley.
28. Picouet, P. and V. Vianu, V. (1995) Semantics and expressiveness issues in Active Databases. Proc. Int. Symposium on Principles of Database Systems, pp. 126-138.
29. Przymusinski, T. C. (1990) Well-founded semantics coincides with three-valued stable semantics. Foundamenta Informaticae, 13, 445-463.
30. Ramakrishnan, R., Bancilhon, F. and A. Silbershatz, A. (1987) Safety of recursive horn clauses with infinite relations. Proc. ACM Symposium on Principles of Database Systems, pp. 328-339.
31. Saccà D. (1997) The expressive powers of stable models for bound and unbound queries. J. Computer and System Sci. 54(3), 441-464.
32. Saccà, D. and Zaniolo, C. (1990) Stable models and non-determinism in logic programs with negation. Proc. ACM Symposium on Principles of Database Systems, pp. 205-218.
33. Saccà, D. and Zaniolo, C. (1997) Deterministic and non-deterministic stable models. J. Logic & Computation, 7(5), 555-579.
34. Sagiv, Y. and Vardi, M. (1989) Safety of Catalog queries over infinite databases. Proc. ACM Symposium on Principles of Database Systems, pp. 160-171.
35. Ullman, J. D. (1988) Principles of Database and Knowledge Base Systems. Computer Science Press.
36. Van Gelder, A., Ross, K. and Schlipf, J. S. (1991) The well-founded semantics for general logic programs. J. ACM, 38(3), 620-650.
37. Vardi, M. Y. (1982) The complexity of relational query languages. Proc. ACM Symposium on Theory of Computing, pp. 137-146.
38. Widom, J. (1992) A denotational semantics for starbust production rule language. SIGMOD Record, 21(3), 4-9.
39. Widom, J. (1993) Deductive and active databases: two paradigms or ends of a spectrum. Proc. Int. Workshop on Rules in Database Systems, pp. 306-315.
40. Widom, J. and Ceri, S. (eds.) (1996) Active Databases: Triggers and rules for Advanced Database Processing. Morgan-Kaufman.
41. Zaniolo, C. (1993) A unified semantics for Active and Databases. Proc. Int. Workshop on Rules in Database Systems, pp. 271-287.
42. Zaniolo, C. (1995) Active database rules with transaction-conscious stable-model semantics. Proc. Int. Conf. on Deductive and Object Oriented Databases, pp. 55-72.