Skip to main content Accessibility help

A declarative extension of horn clauses, and its significance for datalog and its applications



FS-rules provide a powerful monotonic extension for Horn clauses that supports monotonic aggregates in recursion by reasoning on the multiplicity of occurrences satisfying existential goals. The least fixpoint semantics, and its equivalent least model semantics, hold for logic programs with FS-rules; moreover, generalized notions of stratification and stable models are easily derived when negated goals are allowed. Finally, the generalization of techniques such as seminaive fixpoint and magic sets, make possible the efficient implementation of DatalogFS, i.e., Datalog with rules with Frequency Support (FS-rules) and stratified negation. A large number of applications that could not be supported efficiently, or could not be expressed at all in stratified Datalog can now be easily expressed and efficiently supported in DatalogFS and a powerful DatalogFS system is now being developed at UCLA.



Hide All
Abiteboul, S., Bienvenu, M., Galland, A. and Antoine, E. 2011. A rule-based language for web data management. In PODS, 293–304.
Afrati, F. N., Borkar, V. R., Carey, M. J., Polyzotis, N. and Ullman, J. D. 2011. Map-reduce extensions and recursive queries. In EDBT, 1–8.
Agrawal, R. and Srikant, R. 1994. Fast algorithms for mining association rules in large databases. In VLDB, 487–499.
Barceló, P. and Pichler, R., Eds. 2012. Datalog in Academia and Industry–2nd International Workshop, Datalog 2.0. LNCS, vol. 7494. Springer.
Chomicki, J. and Imielinski, T. 1988. Temporal deductive databases and infinite objects. In PODS, 61–73.
Gelfond, M. and Lifschitz, V. 1988. The stable model semantics for logic programming. MIT Press, 10701080.
Gottlob, G., Orsi, G. and Pieris, A. 2011. Ontological queries: Rewriting and optimization. In ICDE, 2–13.
Greco, S. and Zaniolo, C. 2001. Greedy algorithms in datalog. TPLP 1, 4, 381407.
Hellerstein, J. M. 2010. Datalog redux: Experience and conjecture. In PODS, 1–2.
Kolaitis, P. G. 1991. The expressive power of stratified logic programs. Inf. Comp. 90, 5066.
Lloyd, J. W. 1987. Foundations of Logic Programming, 2nd ed.Springer.
Mazuran, M., Serra, E. and Zaniolo, C. 2012. Extending the power of datalog recursion. In The VLDB Journal. Springer-Verlag, 123.
Mazuran, M., Serra, E. and Zaniolo, C. July 2013. A Declarative Extension of Horn Clauses, and its Significance for Datalog and its Applications. Tech. Rep., UCLA, Computer Science Department, Technical Report No. 130011.
Mumick, I. S., Pirahesh, H. and Ramakrishnan, R. 1990. The magic of duplicates and aggregates. In VLDB, 264–277.
Mumick, I. S. and Shmueli, O. 1995. How expressive is stratified aggregation? Annals of Mathematics and Artificial Intelligence 15, 407435.
Ross, K. A. and Sagiv, Y. 1997. Monotonic aggregation in deductive database. Journal of Computer and System Sciences 54, 1, 7997.
Shkapsky, A., Zeng, K. and Zaniolo, C. 2013. Graph queries in a next-generation datalog system. In VLDB 2013, Demo Track, 100–104.
van Emden, M. H. and Kowalski, R. A. 1976. The semantics of predicate logic as a programming language. Journal of the ACM 23, 4, 733742.
Zaniolo, C. 2011. The logic of query languages for data streams. In Logic and Databases 2011. EDBT 2011 Workshops, 1–2.
Zaniolo, C., Ceri, S., Faloutsos, C., Snodgrass, R. T., Subrahmanian, V. S. and Zicari, R. 1997. Advanced Database Systems. Morgan Kaufmann.


Type Description Title
Supplementary materials

Mazuaran supplementary material

 PDF (392 KB)
392 KB

A declarative extension of horn clauses, and its significance for datalog and its applications



Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed