{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T11:48:29Z","timestamp":1763466509431},"reference-count":20,"publisher":"Cambridge University Press (CUP)","issue":"4-5","license":[{"start":{"date-parts":[[2013,9,25]],"date-time":"2013-09-25T00:00:00Z","timestamp":1380067200000},"content-version":"unspecified","delay-in-days":86,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2013,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>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 Datalog<jats:sup><jats:italic>FS<\/jats:italic><\/jats:sup>, 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 Datalog<jats:sup><jats:italic>FS<\/jats:italic><\/jats:sup> and a powerful Datalog<jats:sup><jats:italic>FS<\/jats:italic><\/jats:sup> system is now being developed at UCLA.<\/jats:p>","DOI":"10.1017\/s1471068413000380","type":"journal-article","created":{"date-parts":[[2013,9,25]],"date-time":"2013-09-25T16:24:58Z","timestamp":1380126298000},"page":"609-623","source":"Crossref","is-referenced-by-count":8,"title":["A declarative extension of horn clauses, and its significance for datalog and its applications"],"prefix":"10.1017","volume":"13","author":[{"given":"MIRJANA","family":"MAZURAN","sequence":"first","affiliation":[]},{"given":"EDOARDO","family":"SERRA","sequence":"additional","affiliation":[]},{"given":"CARLO","family":"ZANIOLO","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2013,9,25]]},"reference":[{"key":"S1471068413000380_ref9","doi-asserted-by":"crossref","unstructured":"Hellerstein J. M. 2010. Datalog redux: Experience and conjecture. In PODS, 1\u20132.","DOI":"10.1145\/1807085.1807087"},{"key":"S1471068413000380_ref14","unstructured":"Mumick I. S. , Pirahesh H. and Ramakrishnan R. 1990. The magic of duplicates and aggregates. In VLDB, 264\u2013277."},{"key":"S1471068413000380_ref6","first-page":"1070","volume-title":"The stable model semantics for logic programming","author":"Gelfond","year":"1988"},{"key":"S1471068413000380_ref2","unstructured":"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\u20138."},{"key":"S1471068413000380_ref17","unstructured":"Shkapsky A. , Zeng K. and Zaniolo C. 2013. Graph queries in a next-generation datalog system. In VLDB 2013, Demo Track, 100\u2013104."},{"key":"S1471068413000380_ref1","unstructured":"Abiteboul S. , Bienvenu M. , Galland A. and Antoine E. 2011. A rule-based language for web data management. In PODS, 293\u2013304."},{"key":"S1471068413000380_ref13","doi-asserted-by":"crossref","DOI":"10.1017\/S1471068413000380","volume-title":"A Declarative Extension of Horn Clauses, and its Significance for Datalog and its Applications","author":"Mazuran","year":"2013"},{"key":"S1471068413000380_ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-83189-8"},{"key":"S1471068413000380_ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(91)90059-B"},{"key":"S1471068413000380_ref3","unstructured":"Agrawal R. and Srikant R. 1994. Fast algorithms for mining association rules in large databases. In VLDB, 487\u2013499."},{"key":"S1471068413000380_ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32925-8"},{"key":"S1471068413000380_ref5","unstructured":"Chomicki J. and Imielinski T. 1988. Temporal deductive databases and infinite objects. In PODS, 61\u201373."},{"key":"S1471068413000380_ref7","unstructured":"Gottlob G. , Orsi G. and Pieris A. 2011. Ontological queries: Rewriting and optimization. In ICDE, 2\u201313."},{"key":"S1471068413000380_ref12","first-page":"1","volume-title":"The VLDB Journal","author":"Mazuran","year":"2012"},{"key":"S1471068413000380_ref18","doi-asserted-by":"publisher","DOI":"10.1145\/321978.321991"},{"key":"S1471068413000380_ref15","doi-asserted-by":"publisher","DOI":"10.1007\/BF01536403"},{"key":"S1471068413000380_ref16","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1453"},{"key":"S1471068413000380_ref19","unstructured":"Zaniolo C. 2011. The logic of query languages for data streams. In Logic and Databases 2011. EDBT 2011 Workshops, 1\u20132."},{"key":"S1471068413000380_ref20","volume-title":"Advanced Database Systems","author":"Zaniolo","year":"1997"},{"key":"S1471068413000380_ref8","first-page":"381","article-title":"Greedy algorithms in datalog.","volume":"1","author":"Greco","year":"2001","journal-title":"TPLP"}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068413000380","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T09:28:57Z","timestamp":1715592537000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068413000380\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":20,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["S1471068413000380"],"URL":"https:\/\/doi.org\/10.1017\/s1471068413000380","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7]]}}}