{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:43:48Z","timestamp":1743086628522,"version":"3.40.3"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030495589"},{"type":"electronic","value":"9783030495596"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-49559-6_6","type":"book-chapter","created":{"date-parts":[[2020,6,25]],"date-time":"2020-06-25T16:04:55Z","timestamp":1593101095000},"page":"114-136","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Reasoning over Ontologies with DLV"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7305-3790","authenticated-orcid":false,"given":"Carlo","family":"Allocca","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2052-2063","authenticated-orcid":false,"given":"Mario","family":"Alviano","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0866-0834","authenticated-orcid":false,"given":"Francesco","family":"Calimeri","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3285-8621","authenticated-orcid":false,"given":"Roberta","family":"Costabile","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3298-0256","authenticated-orcid":false,"given":"Alessio","family":"Fiorentino","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6944-6869","authenticated-orcid":false,"given":"Davide","family":"Fusc\u00e0","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6993-0618","authenticated-orcid":false,"given":"Stefano","family":"Germano","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8048-7343","authenticated-orcid":false,"given":"Giovanni","family":"Laboccetta","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9742-1252","authenticated-orcid":false,"given":"Nicola","family":"Leone","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3323-9328","authenticated-orcid":false,"given":"Marco","family":"Manna","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8036-5709","authenticated-orcid":false,"given":"Simona","family":"Perri","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5988-2429","authenticated-orcid":false,"given":"Kristian","family":"Reale","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8218-3178","authenticated-orcid":false,"given":"Francesco","family":"Ricca","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2804-6628","authenticated-orcid":false,"given":"Pierfrancesco","family":"Veltri","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6418-7711","authenticated-orcid":false,"given":"Jessica","family":"Zangari","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,26]]},"reference":[{"key":"6_CR1","volume-title":"Foundations of Databases","author":"S Abiteboul","year":"1995","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Boston (1995). http:\/\/webdam.inria.fr\/Alice\/"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-319-61660-5_19","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Alviano","year":"2017","unstructured":"Alviano, M., et al.: The ASP system DLV2. In: Balduccini, M., Janhunen, T. (eds.) LPNMR 2017. LNCS (LNAI), vol. 10377, pp. 215\u2013221. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-61660-5_19"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-319-23264-5_5","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Alviano","year":"2015","unstructured":"Alviano, M., Dodaro, C., Leone, N., Ricca, F.: Advances in WASP. In: Calimeri, F., Ianni, G., Truszczynski, M. (eds.) LPNMR 2015. LNCS (LNAI), vol. 9345, pp. 40\u201354. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23264-5_5"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-642-32925-8_5","volume-title":"Datalog in Academia and Industry","author":"M Alviano","year":"2012","unstructured":"Alviano, M., Leone, N., Manna, M., Terracina, G., Veltri, P.: Magic-sets for datalog with existential quantifiers. In: Barcel\u00f3, P., Pichler, R. (eds.) Datalog 2.0 2012. LNCS, vol. 7494, pp. 31\u201343. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32925-8_5"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Baader, F., Brandt, S., Lutz, C.: Pushing the EL envelope. In: Kaelbling, L.P., Saffiotti, A. (eds.) Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI), pp. 364\u2013369. Professional Book Center (2005). http:\/\/ijcai.org\/Proceedings\/05\/Papers\/0372.pdf","DOI":"10.25368\/2022.144"},{"volume-title":"The Description Logic Handbook: Theory, Implementation, and Applications","year":"2003","key":"6_CR6","unstructured":"Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, Cambridge (2003)"},{"issue":"9\u201310","key":"6_CR7","doi-asserted-by":"publisher","first-page":"1620","DOI":"10.1016\/j.artint.2011.03.002","volume":"175","author":"J Baget","year":"2011","unstructured":"Baget, J., Lecl\u00e8re, M., Mugnier, M., Salvat, E.: On rules with existential variables: walking the decidability line. Artif. Intell. 175(9\u201310), 1620\u20131654 (2011). https:\/\/doi.org\/10.1016\/j.artint.2011.03.002","journal-title":"Artif. Intell."},{"key":"6_CR8","doi-asserted-by":"publisher","unstructured":"B\u00e1r\u00e1ny, V., Gottlob, G., Otto, M.: Querying the guarded fragment. Log. Methods Comput. Sci. 10(2) (2014). https:\/\/doi.org\/10.2168\/LMCS-10(2:3)2014","DOI":"10.2168\/LMCS-10(2:3)2014"},{"issue":"4","key":"6_CR9","doi-asserted-by":"publisher","first-page":"33:1","DOI":"10.1145\/2661643","volume":"39","author":"M Bienvenu","year":"2014","unstructured":"Bienvenu, M., ten Cate, B., Lutz, C., Wolter, F.: Ontology-based data access: a study through disjunctive datalog, CSP, and MMSNP. ACM Trans. Database Syst. 39(4), 33:1\u201333:44 (2014). https:\/\/doi.org\/10.1145\/2661643","journal-title":"ACM Trans. Database Syst."},{"issue":"4","key":"6_CR10","doi-asserted-by":"publisher","first-page":"27:1","DOI":"10.1145\/2976736","volume":"41","author":"P Bourhis","year":"2016","unstructured":"Bourhis, P., Manna, M., Morak, M., Pieris, A.: Guarded-based disjunctive tuple-generating dependencies. ACM Trans. Database Syst. 41(4), 27:1\u201327:45 (2016). https:\/\/doi.org\/10.1145\/2976736","journal-title":"ACM Trans. Database Syst."},{"key":"6_CR11","unstructured":"Brandt, S.: Polynomial time reasoning in a description logic with existential restrictions, GCI axioms, and - what else? In: de M\u00e1ntaras, R.L., Saitta, L. (eds.) Proceedings of the 16th Eureopean Conference on Artificial Intelligence (ECAI), pp. 298\u2013302. IOS Press, Amsterdam (2004)"},{"issue":"12","key":"6_CR12","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/2043174.2043195","volume":"54","author":"G Brewka","year":"2011","unstructured":"Brewka, G., Eiter, T., Truszczynski, M.: Answer set programming at a glance. Commun. ACM 54(12), 92\u2013103 (2011). https:\/\/doi.org\/10.1145\/2043174.2043195","journal-title":"Commun. ACM"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1613\/jair.3873","volume":"48","author":"A Cal\u00ec","year":"2013","unstructured":"Cal\u00ec, A., Gottlob, G., Kifer, M.: Taming the infinite chase: query answering under expressive relational constraints. J. Artif. Intell. Res. 48, 115\u2013174 (2013). https:\/\/doi.org\/10.1613\/jair.3873","journal-title":"J. Artif. Intell. Res."},{"key":"6_CR14","unstructured":"Cal\u00ec, A., Gottlob, G., Lukasiewicz, T.: Tractable query answering over ontologies with datalog$$^\\pm $$. In: Grau, B.C., Horrocks, I., Motik, B., Sattler, U. (eds.) Proceedings of the 22nd International Workshop on Description Logics (DL). CEUR Workshop Proceedings, vol. 477. CEUR-WS.org (2009). http:\/\/ceur-ws.org\/Vol-477\/paper_46.pdf"},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.websem.2012.03.001","volume":"14","author":"A Cal\u00ec","year":"2012","unstructured":"Cal\u00ec, A., Gottlob, G., Lukasiewicz, T.: A general datalog-based framework for tractable query answering over ontologies. J. Web Semant. 14, 57\u201383 (2012). https:\/\/doi.org\/10.1016\/j.websem.2012.03.001","journal-title":"J. Web Semant."},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-540-89982-2_37","volume-title":"Logic Programming","author":"F Calimeri","year":"2008","unstructured":"Calimeri, F., Cozza, S., Ianni, G., Leone, N.: Computable functions in ASP: theory and implementation. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol. 5366, pp. 407\u2013424. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89982-2_37"},{"issue":"1","key":"6_CR17","doi-asserted-by":"publisher","first-page":"5","DOI":"10.3233\/IA-170104","volume":"11","author":"F Calimeri","year":"2017","unstructured":"Calimeri, F., Fusc\u00e0, D., Perri, S., Zangari, J.: I-DLV: the new intelligent grounder of DLV. Intell. Artif. 11(1), 5\u201320 (2017). https:\/\/doi.org\/10.3233\/IA-170104","journal-title":"Intell. Artif."},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.artint.2012.10.003","volume":"195","author":"D Calvanese","year":"2013","unstructured":"Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Data complexity of query answering in description logics. Artif. Intell. 195, 335\u2013360 (2013). https:\/\/doi.org\/10.1016\/j.artint.2012.10.003","journal-title":"Artif. Intell."},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-540-27775-0_26","volume-title":"Logic Programming","author":"C Cumbo","year":"2004","unstructured":"Cumbo, C., Faber, W., Greco, G., Leone, N.: Enhancing the magic-set method for disjunctive datalog programs. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol. 3132, pp. 371\u2013385. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27775-0_26"},{"issue":"3","key":"6_CR20","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1145\/261124.261126","volume":"22","author":"T Eiter","year":"1997","unstructured":"Eiter, T., Gottlob, G., Mannila, H.: Disjunctive datalog. ACM Trans. Database Syst. 22(3), 364\u2013418 (1997). https:\/\/doi.org\/10.1145\/261124.261126","journal-title":"ACM Trans. Database Syst."},{"key":"6_CR21","doi-asserted-by":"publisher","DOI":"10.1002\/9780470050118.ecse226","volume-title":"Wiley Encyclopedia of Computer Science and Engineering","author":"W Faber","year":"2008","unstructured":"Faber, W., Leone, N., Ricca, F.: Answer set programming. In: Wah, B.W. (ed.) Wiley Encyclopedia of Computer Science and Engineering. Wiley, Hoboken (2008). https:\/\/doi.org\/10.1002\/9780470050118.ecse226"},{"issue":"5\u20136","key":"6_CR22","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1017\/S1471068408003323","volume":"8","author":"W Faber","year":"2008","unstructured":"Faber, W., Pfeifer, G., Leone, N., Dell\u2019Armi, T., Ielpa, G.: Design and implementation of aggregate functions in the DLV system. TPLP 8(5\u20136), 545\u2013580 (2008). https:\/\/doi.org\/10.1017\/S1471068408003323","journal-title":"TPLP"},{"issue":"3\/4","key":"6_CR23","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M Gelfond","year":"1991","unstructured":"Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Gener. Comput. 9(3\/4), 365\u2013386 (1991). https:\/\/doi.org\/10.1007\/BF03037169","journal-title":"New Gener. Comput."},{"key":"6_CR24","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.artint.2014.04.004","volume":"213","author":"G Gottlob","year":"2014","unstructured":"Gottlob, G., Kikot, S., Kontchakov, R., Podolskii, V.V., Schwentick, T., Zakharyaschev, M.: The price of query rewriting in ontology-based data access. Artif. Intell. 213, 42\u201359 (2014). https:\/\/doi.org\/10.1016\/j.artint.2014.04.004","journal-title":"Artif. Intell."},{"issue":"3","key":"6_CR25","doi-asserted-by":"publisher","first-page":"25:1","DOI":"10.1145\/2638546","volume":"39","author":"G Gottlob","year":"2014","unstructured":"Gottlob, G., Orsi, G., Pieris, A.: Query rewriting and optimization for ontological databases. ACM Trans. Database Syst. 39(3), 25:1\u201325:46 (2014). https:\/\/doi.org\/10.1145\/2638546","journal-title":"ACM Trans. Database Syst."},{"key":"6_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-642-39212-2_27","volume-title":"Automata, Languages, and Programming","author":"G Gottlob","year":"2013","unstructured":"Gottlob, G., Pieris, A., Tendera, L.: Querying the guarded fragment with transitivity. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013. LNCS, vol. 7966, pp. 287\u2013298. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39212-2_27"},{"key":"6_CR27","doi-asserted-by":"publisher","unstructured":"Grosof, B.N., Horrocks, I., Volz, R., Decker, S.: Description logic programs: combining logic programs with description logic. In: Hencsey, G., White, B., Chen, Y.R., Kov\u00e1cs, L., Lawrence, S. (eds.) Proceedings of the Twelfth International World Wide Web Conference (WWW), pp. 48\u201357. ACM (2003). https:\/\/doi.org\/10.1145\/775152.775160","DOI":"10.1145\/775152.775160"},{"issue":"2\u20133","key":"6_CR28","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.websem.2005.06.005","volume":"3","author":"Y Guo","year":"2005","unstructured":"Guo, Y., Pan, Z., Heflin, J.: LUBM: a benchmark for OWL knowledge base systems. J. Web Semant. 3(2\u20133), 158\u2013182 (2005). https:\/\/doi.org\/10.1016\/j.websem.2005.06.005","journal-title":"J. Web Semant."},{"key":"6_CR29","unstructured":"Hustadt, U., Motik, B., Sattler, U.: Data complexity of reasoning in very expressive description logics. In: Kaelbling, L.P., Saffiotti, A. (eds.) Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI), pp. 466\u2013471. Professional Book Center (2005). http:\/\/ijcai.org\/Proceedings\/05\/Papers\/0326.pdf"},{"issue":"1","key":"6_CR30","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0022-0000(84)90081-3","volume":"28","author":"DS Johnson","year":"1984","unstructured":"Johnson, D.S., Klug, A.C.: Testing containment of conjunctive queries under functional and inclusion dependencies. J. Comput. Syst. Sci. 28(1), 167\u2013189 (1984). https:\/\/doi.org\/10.1016\/0022-0000(84)90081-3","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR31","unstructured":"Keet, C.M., Alberts, R., Gerber, A., Chimamiwa, G.: Enhancing web portals with ontology-based data access: the case study of South Africa\u2019s accessibility portal for people with disabilities. In: Dolbear, C., Ruttenberg, A., Sattler, U. (eds.) Proceedings of the Fifth Workshop on OWL: Experiences and Directions (OWLED). CEUR Workshop Proceedings, vol. 432. CEUR-WS.org (2008). http:\/\/ceur-ws.org\/Vol-432\/owled2008eu_submission_7.pdf"},{"key":"6_CR32","doi-asserted-by":"publisher","unstructured":"Kr\u00f6tzsch, M., Rudolph, S.: Extending decidable existential rules by joining acyclicity and guardedness. In: Walsh, T. (ed.) Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI), pp. 963\u2013968. IJCAI\/AAAI (2011). https:\/\/doi.org\/10.5591\/978-1-57735-516-8\/IJCAI11-166","DOI":"10.5591\/978-1-57735-516-8\/IJCAI11-166"},{"key":"6_CR33","unstructured":"Leone, N., Manna, M., Terracina, G., Veltri, P.: Efficiently computable datalog$$^\\exists $$ programs. In: Brewka, G., Eiter, T., McIlraith, S.A. (eds.) Proceedings of the Thirteenth International Conference on Principles of Knowledge Representation and Reasoning (KR). AAAI Press (2012). http:\/\/www.aaai.org\/ocs\/index.php\/KR\/KR12\/paper\/view\/4521"},{"issue":"3","key":"6_CR34","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/1149114.1149117","volume":"7","author":"N Leone","year":"2006","unstructured":"Leone, N., et al.: The DLV system for knowledge representation and reasoning. ACM Trans. Comput. Log. 7(3), 499\u2013562 (2006). https:\/\/doi.org\/10.1145\/1149114.1149117","journal-title":"ACM Trans. Comput. Log."},{"key":"6_CR35","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/978-3-642-15675-5_33","volume-title":"Logics in Artificial Intelligence","author":"M Maratea","year":"2010","unstructured":"Maratea, M., Ricca, F., Veltri, P.: DLVMC: enhanced model checking in DLV. In: Janhunen, T., Niemel\u00e4, I. (eds.) JELIA 2010. LNCS (LNAI), vol. 6341, pp. 365\u2013368. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15675-5_33"},{"key":"6_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-25010-6_1","volume-title":"The Semantic Web - ISWC 2015","author":"Y Nenov","year":"2015","unstructured":"Nenov, Y., Piro, R., Motik, B., Horrocks, I., Wu, Z., Banerjee, J.: RDFox: a highly-scalable RDF store. In: Arenas, M., et al. (eds.) ISWC 2015. LNCS, vol. 9367, pp. 3\u201320. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-25010-6_1"},{"key":"6_CR37","unstructured":"Ortiz, M.: Ontology based query answering: the story so far. In: Bravo, L., Lenzerini, M. (eds.) Proceedings of the 7th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW). CEUR Workshop Proceedings, vol. 1087. CEUR-WS.org (2013). http:\/\/ceur-ws.org\/Vol-1087\/keynote3.pdf"},{"issue":"2","key":"6_CR38","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.jal.2009.09.004","volume":"8","author":"H P\u00e9rez-Urbina","year":"2010","unstructured":"P\u00e9rez-Urbina, H., Motik, B., Horrocks, I.: Tractable query answering and rewriting under description logic constraints. J. Appl. Logic 8(2), 186\u2013209 (2010). https:\/\/doi.org\/10.1016\/j.jal.2009.09.004","journal-title":"J. Appl. Logic"},{"key":"6_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/11965893_12","volume-title":"Database Theory \u2013 ICDT 2007","author":"R Rosati","year":"2006","unstructured":"Rosati, R.: The limits of querying ontologies. In: Schwentick, T., Suciu, D. (eds.) ICDT 2007. LNCS, vol. 4353, pp. 164\u2013178. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11965893_12"},{"key":"6_CR40","unstructured":"Rosati, R., Almatelli, A.: Improving query answering over dl-lite ontologies. In: Lin, F., Sattler, U., Truszczynski, M. (eds.) Proceedings of the Twelfth International Conference on Principles of Knowledge Representation and Reasoning (KR). AAAI Press (2010). http:\/\/aaai.org\/ocs\/index.php\/KR\/KR2010\/paper\/view\/1400"},{"key":"6_CR41","doi-asserted-by":"publisher","unstructured":"Vardi, M.Y.: The complexity of relational query languages (extended abstract). In: Lewis, H.R., Simons, B.B., Burkhard, W.A., Landweber, L.H. (eds.) Proceedings of the 14th Annual ACM Symposium on Theory of Computing (STOC), pp. 137\u2013146. ACM (1982). https:\/\/doi.org\/10.1145\/800070.802186","DOI":"10.1145\/800070.802186"}],"container-title":["Communications in Computer and Information Science","Knowledge Discovery, Knowledge Engineering and Knowledge Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-49559-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,30]],"date-time":"2022-10-30T10:25:12Z","timestamp":1667125512000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-49559-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030495589","9783030495596"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-49559-6_6","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"26 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IC3K","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Joint Conference on Knowledge Discovery, Knowledge Engineering, and Knowledge Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Seville","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ic3k2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ic3k.org\/?y=2018","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"PRIMORIS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"167","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}