{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,9]],"date-time":"2025-02-09T04:10:02Z","timestamp":1739074202204,"version":"3.37.0"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2002,12,1]],"date-time":"2002-12-01T00:00:00Z","timestamp":1038700800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["New Gener Comput"],"published-print":{"date-parts":[[2002,12]]},"DOI":"10.1007\/bf03037371","type":"journal-article","created":{"date-parts":[[2009,4,22]],"date-time":"2009-04-22T06:41:17Z","timestamp":1240382477000},"page":"339-371","source":"Crossref","is-referenced-by-count":0,"title":["Functional queries in Datalog"],"prefix":"10.1007","volume":"20","author":[{"given":"Stefano","family":"Basta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergio","family":"Flesca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergio","family":"Greco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,12,1]]},"reference":[{"key":"BF03037371_CR1","unstructured":"Abiteboul, S., Hull, R. and Vianu, V.,Foundations of Databases, Addison-Wesley, 1994."},{"key":"BF03037371_CR2","doi-asserted-by":"crossref","unstructured":"Abiteboul, S., Simon, E. and Vianu, V., \u201cNon-deterministic Languages to Express Deterministic Transformations,\u201d inProc. of ACM PODS Symp., pp. 218\u2013229, 1990.","DOI":"10.1145\/298514.298575"},{"key":"BF03037371_CR3","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/0022-0000(91)90032-Z","volume":"43","author":"S. Abiteboul","year":"1991","unstructured":"Abiteboul, S. and Vianu, V., \u201cDatalog Extensions for Databases Queries and Updates,\u201dJournal of Computer and System Science, 43, pp. 62\u2013124, 1991.","journal-title":"Journal of Computer and System Science"},{"key":"BF03037371_CR4","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/B978-0-934613-40-8.50006-3","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"Krzysztof R. Apt","year":"1988","unstructured":"Apt, K., Blair, H. and Walker, A., \u201cTowards a Theory of Declarative Knowledge,\u201d inFoundations of Deductive Databases and Logic Programming, pp. 89\u2013142, 1988."},{"issue":"3","key":"BF03037371_CR5","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF02341854","volume":"8","author":"Chitta R. Baral","year":"1992","unstructured":"Baral, V. and Subrahmanian, V., \u201cStable and Extension Class Theory for Logic Programs and Default Logic,\u201dJournal of Automated Reasoning, pp. 345\u2013366, 1992.","journal-title":"Journal of Automated Reasoning"},{"key":"BF03037371_CR6","unstructured":"Basta, S., \u201cA System Prototype for the Evaluation of Functional Datalog Queries,\u201dDegree thesis (in Italian), 1997."},{"key":"BF03037371_CR7","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(80)90032-X","volume":"21","author":"A. Chandra","year":"1980","unstructured":"Chandra, A. and Harel, D., \u201cComputable Queries for Relational Databases,\u201dJournal of Computer and System Sciences, 21, pp. 156\u2013178, 1980.","journal-title":"Journal of Computer and System Sciences"},{"key":"BF03037371_CR8","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0022-0000(82)90012-5","volume":"25","author":"A. Chandra","year":"1982","unstructured":"Chandra, A. and Harel, D., \u201cStructure and Complexity of Relational Queries,\u201dJournal of Computer and System Sciences, 25, pp. 99\u2013128, 1982.","journal-title":"Journal of Computer and System Sciences"},{"key":"BF03037371_CR9","unstructured":"Dix, J., \u201cClassifying Semantics of Logic Programs,\u201d inInt. Workshop, on Logic Programming and Non-Monotonic Reasoning, pp. 166\u2013180, 1991."},{"key":"BF03037371_CR10","unstructured":"Fagin, R., \u201cGeneralized First-Order Spectra and Polynomial-Time Recognizable Sets,\u201d inSIAM-AMS Proc., 7, pp. 43\u201373, 1974."},{"key":"BF03037371_CR11","doi-asserted-by":"crossref","unstructured":"Flum, J., Kubierschky, M. and Ludascher, B., \u201cTotal and Partial Well-founded DATALOG Coincide,\u201d inProc. of the Int. Conf. on Database Theory, Springer-Verlag, pp. 113\u2013124, 1997.","DOI":"10.1007\/3-540-62222-5_40"},{"key":"BF03037371_CR12","first-page":"1070","volume-title":"Proc. of 5th Int. Conf. and Symp. on Logic Programming","author":"M. Gelfond","year":"1988","unstructured":"Gelfond, M. and Lifschitz, V., \u201cThe Stable Model Semantics for Logic Programming,\u201d inProc. of 5th Int. Conf. and Symp. on Logic Programming, MIT Press, Cambridge, pp. 1070\u20131080, 1988."},{"key":"BF03037371_CR13","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-55015-1_7","volume-title":"Deductive and Object-Oriented Databases","author":"Fosca Giannotti","year":"1991","unstructured":"Giannotti, F., Pedreschi, D., Sacc\u00e0, D. and Zaniolo, C., \u201cNon-determinism in Deductive Databases,\u201d inProc. of 2nd Conf. on Deductive and Object-Oriented Databases, 1991."},{"key":"BF03037371_CR14","doi-asserted-by":"crossref","unstructured":"Greco, S., Sacc\u00e0, D. and Zaniolo C., \u201cDATALOG Queries with Stratified Negation and Choice: fromP toD p ,\u201d inProc. of the Fifth Int. Conf. on Database Theory, 1995.","DOI":"10.1007\/3-540-58907-4_8"},{"key":"BF03037371_CR15","unstructured":"Greco, S. and Sacc\u00e0, D., \u201cPossible-is-certain, is Desiderable and Can Be Expressive,\u201dAnnals of Mathematics and Artificial Intelligence (preliminary version in ASIAN'97), 1997."},{"key":"BF03037371_CR16","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/BF03037430","volume":"16","author":"S. Greco","year":"1998","unstructured":"Greco, S., \u201cNon-determinism and Weak Constraints in Datalog,\u201dNew Generation Computing (preliminary version in AGP Conf., 1996)16, 4, 1998.","journal-title":"New Generation Computing"},{"issue":"2","key":"BF03037371_CR17","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1109\/69.761663","volume":"11","author":"S. Greco","year":"1999","unstructured":"Greco, S., \u201cDynamic Programming in Datalog with Aggregates,\u201dIEEE Transactions on Knowledge and Data Engineering, pp. 265\u2013283, 1999.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"BF03037371_CR18","unstructured":"Gurevich, Y., \u201cLogic and the Challenge of Computer Science,\u201d inTrends in Theoretical Computer Science, Computer Science Press, 1988."},{"key":"BF03037371_CR19","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1137\/0216051","volume":"16","author":"N. Immerman","year":"1987","unstructured":"Immerman, N., \u201cLanguages Which Capture Complexity Classes,\u201dSIAM Journal on Computing, 16, pp. 760\u2013778, 1987.","journal-title":"SIAM Journal on Computing"},{"key":"BF03037371_CR20","doi-asserted-by":"crossref","unstructured":"Johnson, D. S., \u201cA Catalog of Complexity Classes,\u201dHandbook of Theoretical Computer Science, 1, North-Holland, 1990.","DOI":"10.1016\/B978-0-444-88071-0.50007-2"},{"key":"BF03037371_CR21","unstructured":"Kanellakis, P. C., \u201cElements of Relational Database Theory,\u201dHandbook of Theoretical Computer Science, 2, North-Holland, 1991."},{"key":"BF03037371_CR22","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/0890-5401(91)90059-B","volume":"90","author":"P. Kolaitis","year":"1990","unstructured":"Kolaitis, P., \u201cThe Expressive Power of Stratified Logic Programs,\u201dInformation an Computation, 90, pp. 50\u201366, 1990.","journal-title":"Information an Computation"},{"key":"BF03037371_CR23","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0022-0000(91)90033-2","volume":"43","author":"P. G. Kolaitis","year":"1991","unstructured":"Kolaitis, P. G. and Papadimitriou, C. H., \u201cWhy not Negation by Fixpoint?,\u201dJournal of Computer and System Sciences, 43, pp. 125\u2013144, 1991.","journal-title":"Journal of Computer and System Sciences"},{"key":"BF03037371_CR24","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1016\/B978-1-4832-1313-2.50038-X","volume-title":"Proceedings of the Third International Conference on Data and Knowledge Bases","author":"Ravi Krishnamurthy","year":"1988","unstructured":"Krishnamurthy, R. and Naqvi, S. A., \u201cNon-deterministic Choice in Datalog,\u201d inProc. of 3rd Int. Conf. on Data and Knowledge Bases, pp. 416\u2013424, 1988."},{"key":"BF03037371_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"J. W. Lloyd","year":"1987","unstructured":"Lloyd, J. W.,Foundations of Logic Programming, Springer Verlag, Berlin, 1987."},{"key":"BF03037371_CR26","doi-asserted-by":"crossref","unstructured":"Makinson, D., \u201cGeneral Pattern in Nonmonotonic Reasoning,\u201dHandbook of Logic in Artificial Intelligence and Logic Programming, (D. M. Gabbay, C. J. Hogger and J. A. Robinson eds.),2, Oxford University Press, 1993.","DOI":"10.1093\/oso\/9780198537472.003.0002"},{"key":"BF03037371_CR27","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1145\/116825.116836","volume":"38","author":"W. Marek","year":"1991","unstructured":"Marek, W. and Truszcynski, M., \u201cAutoepistemic Logic,\u201dJournal of the ACM, 38, pp. 588\u2013619, 1991.","journal-title":"Journal of the ACM"},{"key":"BF03037371_CR28","unstructured":"Papadimitriou, C. H.,Computational Complexity, Addison Wesley, 1994."},{"issue":"1","key":"BF03037371_CR29","first-page":"48","volume":"54","author":"C. H. Papadimitriou","year":"1997","unstructured":"Papadimitriou, C. H. and Yannakakis, M., \u201cTie-Breaking Semantics and Structural Totality,\u201dJCSS, 54, 1, pp. 48\u201360, 1997.","journal-title":"JCSS"},{"key":"BF03037371_CR30","doi-asserted-by":"crossref","first-page":"445","DOI":"10.3233\/FI-1990-13404","volume":"13","author":"T. C. Przymusinski","year":"1990","unstructured":"Przymusinski, T. C., \u201cWell-founded Semantics Coincides with Three-valued Stable Semantics,\u201dFoundamenta Informaticae, 13, pp. 445\u2013463, 1990.","journal-title":"Foundamenta Informaticae"},{"key":"BF03037371_CR31","doi-asserted-by":"crossref","unstructured":"Ross, K. A., \u201cStructural Totality and Constraint Stratification,\u201d inPODS, pp. 184\u2013195.","DOI":"10.1145\/212433.220211"},{"key":"BF03037371_CR32","unstructured":"Ross, K. A., \u201cA Syntactic Stratification Condition Using Constraints,\u201d inSLP, 76\u201390, 1994."},{"issue":"6","key":"BF03037371_CR33","doi-asserted-by":"publisher","first-page":"1216","DOI":"10.1145\/195613.195646","volume":"41","author":"K. A. Ross","year":"1994","unstructured":"Ross, K. A., \u201cModular Stratification and Magic Sets for Datalog Programs with Negation,\u201dJACM, 41, 6, pp. 1216\u20131266, 1994.","journal-title":"JACM"},{"key":"BF03037371_CR34","doi-asserted-by":"crossref","unstructured":"Sacc\u00e0, D., \u201cThe Expressive Powers of Stable Models for Bound and Unbound DATALOG Queries,\u201dJournal of Computer and System Science, 1997.","DOI":"10.1006\/jcss.1997.1446"},{"key":"BF03037371_CR35","doi-asserted-by":"crossref","unstructured":"Sacc\u00e0, D. and Zaniolo, C., \u201cStable Models and Non-Determinism in Logic Programs with Negation,\u201d inProc. ACM PODS Symp., pp. 205\u2013218, 1990.","DOI":"10.1145\/298514.298572"},{"key":"BF03037371_CR36","doi-asserted-by":"crossref","unstructured":"Sacc\u00e0, D. and Zaniolo, C., \u201cDeterministic and Non-deterministic Stable Models,\u201d Journal of Logic and Computation, 1997.","DOI":"10.1093\/logcom\/7.5.555"},{"key":"BF03037371_CR37","doi-asserted-by":"crossref","unstructured":"Schlipf, J. S., \u201cThe Expressive Powers of the Logic Programming Semantics,\u201d inProc. of ACM PODS Symp., pp. 196\u2013204, 1990.","DOI":"10.1145\/298514.298564"},{"key":"BF03037371_CR38","unstructured":"Ullman, J. D., \u201cPrinciples of Database and Knowledge Base Systems,\u201d1\u20132, Computer Science Press, 1989."},{"key":"BF03037371_CR39","doi-asserted-by":"crossref","unstructured":"Vardi, M. Y., \u201cThe Complexity of Relational Query Languages,\u201d inProc. of ACM Symp. on Theory of Computing, pp. 137\u2013146, 1982.","DOI":"10.1145\/800070.802186"},{"issue":"3","key":"BF03037371_CR40","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","volume":"38","author":"A. Gelder Van","year":"1991","unstructured":"Van Gelder, A., Ross, K. and Schlipf, J. S., \u201cThe Well-Founded Semantics for General Logic Programs,\u201dJournal of the ACM, 38, 3, pp. 620\u2013650, 1991.","journal-title":"Journal of the ACM"},{"key":"BF03037371_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(89)90088-1","volume":"69","author":"L. Vielle","year":"1989","unstructured":"Vielle, L., \u201cRecursive Query Processing: The Power of Logic,\u201dTheoretical Computer Science, 69, pp. 1\u201353, 1989.","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"BF03037371_CR42","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0743-1066(94)00023-Y","volume":"22","author":"Jia-Huai You","year":"1995","unstructured":"You, J., and Yuan, L. Y., \u201cOn the Equivalence of Semantics for Normal Logic Programs,\u201dJournal of Logic Programming, pp. 211\u2013222, 1995.","journal-title":"The Journal of Logic Programming"}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037371.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF03037371\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037371","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037371.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,9]],"date-time":"2025-02-09T03:43:33Z","timestamp":1739072613000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF03037371"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12]]},"references-count":42,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2002,12]]}},"alternative-id":["BF03037371"],"URL":"https:\/\/doi.org\/10.1007\/bf03037371","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"type":"print","value":"0288-3635"},{"type":"electronic","value":"1882-7055"}],"subject":[],"published":{"date-parts":[[2002,12]]}}}