{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T11:04:11Z","timestamp":1769079851228,"version":"3.49.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030911669","type":"print"},{"value":"9783030911676","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-91167-6_18","type":"book-chapter","created":{"date-parts":[[2021,12,2]],"date-time":"2021-12-02T14:13:49Z","timestamp":1638454429000},"page":"267-275","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Eliminating Harmful Joins in Warded Datalog+\/\u2212"],"prefix":"10.1007","author":[{"given":"Teodoro","family":"Baldazzi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luigi","family":"Bellomarini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emanuel","family":"Sallinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Atzeni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,1]]},"reference":[{"issue":"1\u20133","key":"18_CR1","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0304-3975(02)00730-2","volume":"308","author":"F Afrati","year":"2003","unstructured":"Afrati, F., Gergatsoulis, M., Toni, F.: Linearisability on datalog programs. Theoret. Comput. Sci. 308(1\u20133), 199\u2013226 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR2","unstructured":"Ahmetaj, S., Ortiz, M., Simkus, M.: Polynomial datalog rewritings for expressive description logics with closed predicates. In: IJCAI, pp. 878\u2013885 (2016)"},{"key":"18_CR3","unstructured":"Baldazzi, T., Bellomarini, L., Sallinger, E., Atzeni, P.: iWarded: a system for benchmarking datalog+\/-reasoning (tr). arXiv preprint arXiv:2103.08588 (2021)"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Bellomarini, L., Benedetto, D., Gottlob, G., Sallinger, E.: Vadalog: a modern architecture for automated reasoning with large knowledge graphs. IS (2020)","DOI":"10.1016\/j.is.2020.101528"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Bellomarini, L., Sallinger, E., Gottlob, G.: The vadalog system: datalog-based reasoning for knowledge graphs. VLDB, 11(9) (2018)","DOI":"10.14778\/3213880.3213888"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Berger, G., Gottlob, G., Pieris, A., Sallinger, E.: The space-efficient core of Vadalog. In: PODS, pp. 270\u2013284 (2019)","DOI":"10.1145\/3294052.3319688"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Cal\u00ec, A., Gottlob, G., Lukasiewicz, T.: A general datalog-based framework for tractable query answering over ontologies. In: PODS, pp. 77\u201386 (2009)","DOI":"10.1145\/1559795.1559809"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Cal\u00ec, A., Gottlob, G., Lukasiewicz, T., Marnette, B., Pieris, A.: Datalog+\/-: a family of logical knowledge representation and query languages for new applications. In: 2010 25th Annual IEEE LICS, pp. 228\u2013242. IEEE (2010)","DOI":"10.1109\/LICS.2010.27"},{"issue":"4","key":"18_CR9","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1145\/321978.321991","volume":"23","author":"MH van Emden","year":"1976","unstructured":"van Emden, M.H., Kowalski, R.A.: The semantics of predicate logic as a programming language. J. ACM 23(4), 733\u2013742 (1976)","journal-title":"J. ACM"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Francis, N., Segoufin, L., Sirangelo, C.: Datalog rewritings of regular path queries using views. arXiv preprint arXiv:1511.00938 (2015)","DOI":"10.2168\/LMCS-11(4:14)2015"},{"key":"18_CR11","unstructured":"Gottlob, G., Pieris, A.: Beyond SPARQL under OWL 2 QL entailment regime: rules to the rescue. In: IJCAI (2015)"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-030-19570-0_2","volume-title":"Logics in Artificial Intelligence","author":"G Gottlob","year":"2019","unstructured":"Gottlob, G., Pieris, A., Sallinger, E.: Vadalog: recent advances and applications. In: Calimeri, F., Leone, N., Manna, M. (eds.) JELIA 2019. LNCS (LNAI), vol. 11468, pp. 21\u201337. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-19570-0_2"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Rudolph, S., Simkus, M.: Expressiveness of guarded existential rule languages. In: PODS, pp. 27\u201338 (2014)","DOI":"10.1145\/2594538.2594556"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.artint.2016.03.006","volume":"236","author":"M Kaminski","year":"2016","unstructured":"Kaminski, M., Nenov, Y., Grau, B.C.: Datalog rewritability of disjunctive datalog programs and non-Horn ontologies. Artif. Intell. 236, 90\u2013118 (2016)","journal-title":"Artif. Intell."},{"key":"18_CR15","unstructured":"K\u00f3nig, M., Leclere, M., Mugnier, M.L.: Query rewriting for existential rules with compiled preorder. In: IJCAI, pp. 3006\u20133112 (2015)"},{"issue":"4","key":"18_CR16","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1145\/320107.320115","volume":"4","author":"D Maier","year":"1979","unstructured":"Maier, D., Mendelzon, A.O., Sagiv, Y.: Testing implications of data dependencies. ACM Trans. Database Syst. 4(4), 455\u2013469 (1979)","journal-title":"ACM Trans. Database Syst."},{"key":"18_CR17","unstructured":"Tamaki, H., Sato, T.: Unfold\/fold transformation of logic programs. In: ICLP, pp. 127\u2013138. Uppsala University (1984)"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Wang, Z., Xiao, P., Wang, K., Zhuang, Z., Wan, H.: Query answering for existential rules via efficient datalog rewriting. In: IJCAI, pp. 1933\u20131939 (2020)","DOI":"10.24963\/ijcai.2020\/268"}],"container-title":["Lecture Notes in Computer Science","Rules and Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-91167-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,2]],"date-time":"2021-12-02T14:30:02Z","timestamp":1638455402000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-91167-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030911669","9783030911676"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-91167-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RuleML+RR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Joint Conference on Rules and Reasoning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leuven","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgium","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rulemlrr2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/declarativeai2021.net\/ruleml-rr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39","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":"17","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":"2","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":"44% - 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":"2.9","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5 reviews were done by sub-reviewers, who were invited by individual PC members.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}