{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:09:00Z","timestamp":1760202540526},"reference-count":42,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2008,3,1]],"date-time":"2008-03-01T00:00:00Z","timestamp":1204329600000},"content-version":"unspecified","delay-in-days":0,"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":[[2008,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This article considers the problem of reasoning on massive amounts of (possibly distributed) data. Presently, existing proposals show some limitations: (i) the quantity of data that can be handled contemporarily is limited, because reasoning is generally carried out in main-memory; (ii) the interaction with external (and independent) Database Management Systems is not trivial and, in several cases, not allowed at all; and (iii) the efficiency of present implementations is still not sufficient for their utilization in complex reasoning tasks involving massive amounts of data. This article provides a contribution in this setting; it presents a new system, called DLV<jats:sup><jats:italic>DB<\/jats:italic><\/jats:sup>, which aims to solve these problems. Moreover, it reports the results of a thorough experimental analysis we have carried out for comparing our system with several state-of-the-art systems (both logic and databases) on some classical deductive problems; the other tested systems are LDL++, XSB, Smodels, and three top-level commercial Database Management Systems. DLV<jats:sup><jats:italic>DB<\/jats:italic><\/jats:sup> significantly outperforms even the commercial database systems on recursive queries.<\/jats:p>","DOI":"10.1017\/s1471068407003158","type":"journal-article","created":{"date-parts":[[2007,6,21]],"date-time":"2007-06-21T04:20:36Z","timestamp":1182399636000},"page":"129-165","source":"Crossref","is-referenced-by-count":28,"title":["Experimenting with recursive queries in database and logic programming systems"],"prefix":"10.1017","volume":"8","author":[{"given":"G.","family":"TERRACINA","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"LEONE","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.","family":"LIO","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"PANETTA","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2008,3,1]]},"reference":[{"key":"S1471068407003158_ref41","doi-asserted-by":"publisher","DOI":"10.1145\/1147376.1147393"},{"key":"S1471068407003158_ref40","volume-title":"Principles of Database and Knowledge Base Systems","author":"Ullman","year":"1989"},{"key":"S1471068407003158_ref39","first-page":"161","volume-title":"Proc. of the ACM Symposium on Principles of Database Systems","author":"Ross","year":"1990"},{"key":"S1471068407003158_ref37","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-934613-40-8.50009-9"},{"key":"S1471068407003158_ref33","doi-asserted-by":"publisher","DOI":"10.1109\/69.542029"},{"key":"S1471068407003158_ref29","doi-asserted-by":"crossref","DOI":"10.1145\/1149114.1149117","volume-title":"The DLV System for Knowledge Representation and Reasoning","author":"Leone","year":"2006"},{"key":"S1471068407003158_ref28","volume-title":"The Stanford GraphBase: A Platform for Combinatorial Computing","author":"Knuth","year":"1994"},{"key":"S1471068407003158_ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF01530761"},{"key":"S1471068407003158_ref32","first-page":"289","volume-title":"Proceedings of the ACM SIGCOMM 2005 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications","author":"Loo","year":"2005"},{"key":"S1471068407003158_ref30","first-page":"112","volume-title":"American Association for Artificial Intelligence","author":"Lin","year":"2002"},{"key":"S1471068407003158_ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(87)90004-5"},{"key":"S1471068407003158_ref19","unstructured":"Faber W. & Pfeifer G. 1996. DLV homepage. URL: http:\/\/www.dlvsystem.com\/. Access date: 30\/10\/2006."},{"key":"S1471068407003158_ref25","first-page":"61","volume-title":"American Association for Artificial Intelligence","author":"Giunchiglia","year":"2004"},{"key":"S1471068407003158_ref34","doi-asserted-by":"publisher","DOI":"10.1145\/227604.227624"},{"key":"S1471068407003158_ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BF02136172"},{"key":"S1471068407003158_ref23","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037169"},{"key":"S1471068407003158_ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1065167.1065214"},{"key":"S1471068407003158_ref8","volume-title":"Knowledge Representation, Reasoning and Declarative Problem Solving","author":"Baral","year":"2002"},{"key":"S1471068407003158_ref6","first-page":"1","volume-title":"Proc. of the ACM Symposium on Principles of Database Systems (PODS'86)","author":"Bancilhon","year":"1986"},{"key":"S1471068407003158_ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2003.1185840"},{"key":"S1471068407003158_ref36","unstructured":"Niemel\u00e4 I. , Simons P. & Syrj\u00e4nen T. 2000. Smodels: A system for answer set programming. In Proceedings of the 8th International Workshop on Non-Monotonic Reasoning (NMR'2000), Breckenridge, CO, Baral C. & Truszczy\u0144ski M. , Eds. Electronic proceedings; available at: http:\/\/xxx.lanl.gov\/abs\/cs.AI\/0003033 Access date: 30\/10\/2006."},{"key":"S1471068407003158_ref15","unstructured":"Faber W. , Leone N. , Mateis C. & Pfeifer G. 1999a. Using database optimization techniques for nonmonotonic reasoning. In Proceedings of the 7th International Workshop on Deductive Databases and Logic Programming (DDLP'99), I. O. Committee, Ed. Prolog Association of Japan, 135\u2013139."},{"key":"S1471068407003158_ref3","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-934613-40-8.50006-3"},{"key":"S1471068407003158_ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2004.04.004"},{"key":"S1471068407003158_ref7","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-934613-40-8.50016-6"},{"key":"S1471068407003158_ref38","first-page":"430","volume-title":"Proc. of 4th International Conference on Logic Programming and Non Monotonic Reasoning (LPNMR'97)","author":"Rao","year":"1997"},{"key":"S1471068407003158_ref1","unstructured":"American National Standards Institute. 1999. ANSI\/ISO\/IEC 9075-1999 (SQL:1999, Parts 1\u20135). American National Standards Institute, New York."},{"key":"S1471068407003158_ref35","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63255-7_32"},{"key":"S1471068407003158_ref4","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068402001515"},{"key":"S1471068407003158_ref9","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(91)90038-Q"},{"key":"S1471068407003158_ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-83952-8"},{"key":"S1471068407003158_ref13","first-page":"847","volume-title":"Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI) 2003","author":"Dell'Armi","year":"2003"},{"key":"S1471068407003158_ref14","unstructured":"Dell'Armi T. , Faber W. , Ielpa G. , Leone N. & Pfeifer G. 2003b. Aggregate Functions in DLV. In Proceedings ASP03\u2014Answer Set Programming: Advances in Theory and Implementation, Messina, Italy, de Vos M. & Provetti A. , Eds. 274\u2013288. URL: http:\/\/CEUR-WS.org\/Vol-78\/ Access date: 30\/10\/2006."},{"key":"S1471068407003158_ref16","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46767-X_13"},{"key":"S1471068407003158_ref17","first-page":"635","volume-title":"Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI) 2001","author":"Faber","year":"2001"},{"key":"S1471068407003158_ref18","doi-asserted-by":"crossref","unstructured":"Faber W. , Leone N. & Pfeifer G. 2004. Recursive aggregates in disjunctive logic programs: Semantics and complexity. In Proc. of JELIA 2004. 200\u2013212.","DOI":"10.1007\/978-3-540-30227-8_19"},{"key":"S1471068407003158_ref20","doi-asserted-by":"publisher","DOI":"10.1145\/356924.356929"},{"key":"S1471068407003158_ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-006-9033-2"},{"key":"S1471068407003158_ref21","volume-title":"Database System Implementation","author":"Garcia-Molina","year":"2000"},{"key":"S1471068407003158_ref22","first-page":"386","volume-title":"Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI)","author":"Gebser","year":"2007"},{"key":"S1471068407003158_ref42","volume-title":"Advanced Database Systems","author":"Zaniolo","year":"1997"},{"key":"S1471068407003158_ref26","doi-asserted-by":"publisher","DOI":"10.1145\/131295.131297"}],"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\/S1471068407003158","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T15:08:25Z","timestamp":1554131305000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068407003158\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3]]},"references-count":42,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,3]]}},"alternative-id":["S1471068407003158"],"URL":"https:\/\/doi.org\/10.1017\/s1471068407003158","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,3]]}}}