{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:13:34Z","timestamp":1760202814488,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662595329"},{"type":"electronic","value":"9783662595336"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-662-59533-6_19","type":"book-chapter","created":{"date-parts":[[2019,6,22]],"date-time":"2019-06-22T19:02:35Z","timestamp":1561230155000},"page":"301-322","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Complexity Thresholds in Inclusion Logic"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9637-6664","authenticated-orcid":false,"given":"Miika","family":"Hannula","sequence":"first","affiliation":[]},{"given":"Lauri","family":"Hella","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,9]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Afrati, F.N., Kolaitis, P.G.: Repair checking in inconsistent databases: algorithms and complexity. In: 12th International Conference on Database Theory - ICDT 2009, St. Petersburg, Russia, 23\u201325 March 2009, pp. 31\u201341 (2009)","DOI":"10.1145\/1514894.1514899"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Arenas, M., Bertossi, L.E., Chomicki, J.: Consistent query answers in inconsistent databases. In: Proceedings of the Eighteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Philadelphia, Pennsylvania, USA, 31 May\u20132 June 1999, pp. 68\u201379 (1999)","DOI":"10.1145\/303976.303983"},{"issue":"1\u20132","key":"19_CR3","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.ic.2004.04.007","volume":"197","author":"J Chomicki","year":"2005","unstructured":"Chomicki, J., Marcinkowski, J.: Minimal-change integrity maintenance using tuple deletions. Inf. Comput. 197(1\u20132), 90\u2013121 (2005)","journal-title":"Inf. Comput."},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-662-52921-8_11","volume-title":"Logic, Language, Information, and Computation","author":"J Corander","year":"2016","unstructured":"Corander, J., Hyttinen, A., Kontinen, J., Pensar, J., V\u00e4\u00e4n\u00e4nen, J.: A logical approach to context-specific independence. In: V\u00e4\u00e4n\u00e4nen, J., Hirvonen, \u00c5., de Queiroz, R. (eds.) WoLLIC 2016. LNCS, vol. 9803, pp. 165\u2013182. Springer, Heidelberg (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-662-52921-8_11"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s10472-017-9568-4","volume":"83","author":"A Durand","year":"2018","unstructured":"Durand, A., Hannula, M., Kontinen, J., Meier, A., Virtema, J.: Approximation and dependence via multiteam semantics. Ann. Math. Artif. Intell. 83, 297\u2013320 (2018)","journal-title":"Ann. Math. Artif. Intell."},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"73","DOI":"10.4204\/EPTCS.193.6","volume":"193","author":"Arnaud Durand","year":"2015","unstructured":"Durand, A., Kontinen, J., de Rugy-Altherre, N., V\u00e4\u00e4n\u00e4nen, J.: Tractability frontier of data complexity in team semantics. In: Proceedings Sixth International Symposium on Games, Automata, Logics and Formal Verification, GandALF 2015, Genoa, Italy, 21\u201322nd September 2015, pp. 73\u201385 (2015)","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-642-39992-3_13","volume-title":"Logic, Language, Information, and Computation","author":"J Ebbing","year":"2013","unstructured":"Ebbing, J., Hella, L., Meier, A., M\u00fcller, J.-S., Virtema, J., Vollmer, H.: Extended modal dependence logic $$\\cal{EMDL}$$. In: Libkin, L., Kohlenbach, U., de Queiroz, R. (eds.) WoLLIC 2013. LNCS, vol. 8071, pp. 126\u2013137. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-39992-3_13"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Ebbing, J., Kontinen, J., M\u00fcller, J.-S., Vollmer, H.: A fragment of dependence logic capturing polynomial time. Log. Methods Comput. Sci. 10(3) (2014)","DOI":"10.2168\/LMCS-10(3:3)2014"},{"issue":"1","key":"19_CR9","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.apal.2011.08.005","volume":"163","author":"P Galliani","year":"2012","unstructured":"Galliani, P.: Inclusion and exclusion dependencies in team semantics: on some logics of imperfect information. Ann. Pure Appl. Log. 163(1), 68\u201384 (2012)","journal-title":"Ann. Pure Appl. Log."},{"key":"19_CR10","unstructured":"Galliani, P., Hella, L.: Inclusion logic and fixed point logic. In: Rocca, S.R.D. (ed.) Computer Science Logic 2013 (CSL 2013). Leibniz International Proceedings in Informatics (LIPIcs), Dagstuhl, Germany, vol. 23, pp. 281\u2013295. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2013)"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2012.10.033","volume":"493","author":"E Gr\u00e4del","year":"2012","unstructured":"Gr\u00e4del, E.: Model-checking games for logics of imperfect information. Theor. Comput. Sci. 493, 2\u201314 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-319-31803-5_5","volume-title":"Dependence Logic","author":"E Gr\u00e4del","year":"2016","unstructured":"Gr\u00e4del, E.: Games for inclusion logic and fixed-point logic. In: Abramsky, S., Kontinen, J., V\u00e4\u00e4n\u00e4nen, J., Vollmer, H. (eds.) Dependence Logic, pp. 73\u201398. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-31803-5_5"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Hannula, M., Hella, L.: Complexity thresholds in inclusion logic. CoRR, abs\/1903.10706 (2019)","DOI":"10.1007\/978-3-662-59533-6_19"},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.ic.2016.04.001","volume":"249","author":"M Hannula","year":"2016","unstructured":"Hannula, M., Kontinen, J.: A finite axiomatization of conditional independence and inclusion dependencies. Inf. Comput. 249, 121\u2013137 (2016)","journal-title":"Inf. Comput."},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-319-72056-2_12","volume-title":"Logical Foundations of Computer Science","author":"M Hannula","year":"2018","unstructured":"Hannula, M., Kontinen, J., Virtema, J.: Polyteam semantics. In: Artemov, S., Nerode, A. (eds.) LFCS 2018. LNCS, vol. 10703, pp. 190\u2013210. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-72056-2_12"},{"issue":"1","key":"19_CR16","doi-asserted-by":"publisher","first-page":"2:1","DOI":"10.1145\/3157054","volume":"19","author":"M Hannula","year":"2018","unstructured":"Hannula, M., Kontinen, J., Virtema, J., Vollmer, H.: Complexity of propositional logics in team semantic. ACM Trans. Comput. Log. 19(1), 2:1\u20132:14 (2018)","journal-title":"ACM Trans. Comput. Log."},{"issue":"4","key":"19_CR17","first-page":"539","volume":"5","author":"W Hodges","year":"1997","unstructured":"Hodges, W.: Compositional semantics for a language of imperfect information. J. Interest Group Pure Appl. Log. 5(4), 539\u2013563 (1997)","journal-title":"J. Interest Group Pure Appl. Log."},{"issue":"1","key":"19_CR18","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/S0019-9958(86)80029-8","volume":"68","author":"N Immerman","year":"1986","unstructured":"Immerman, N.: Relational queries computable in polynomial time. Inf. Control 68(1), 86\u2013104 (1986)","journal-title":"Inf. Control"},{"issue":"4","key":"19_CR19","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1137\/0216051","volume":"16","author":"N Immerman","year":"1987","unstructured":"Immerman, N.: Languages that capture complexity classes. SIAM J. Comput. 16(4), 760\u2013778 (1987)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"19_CR20","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0217058","volume":"17","author":"N Immerman","year":"1988","unstructured":"Immerman, N.: Nondeterministic space is closed under complementation. SIAM J. Comput. 17(5), 935\u2013938 (1988)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"19_CR21","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s11225-013-9481-8","volume":"101","author":"J Kontinen","year":"2013","unstructured":"Kontinen, J.: Coherence and computational complexity of quantifier-free dependence logic formulas. Studia Logica 101(2), 267\u2013291 (2013)","journal-title":"Studia Logica"},{"key":"19_CR22","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/j.ic.2014.08.004","volume":"239","author":"J Kontinen","year":"2014","unstructured":"Kontinen, J., Kuusisto, A., Lohmann, P., Virtema, J.: Complexity of two-variable dependence logic and if-logic. Inf. Comput. 239, 237\u2013253 (2014)","journal-title":"Inf. Comput."},{"key":"19_CR23","unstructured":"Koutris, P., Wijsen, J.: Consistent query answering for primary keys in logspace. In: 22nd International Conference on Database Theory, ICDT 2019, Lisbon, Portugal, 26\u201328 March 2019, pp. 23:1\u201323:19 (2019)"},{"key":"19_CR24","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-319-31803-5_11","volume-title":"Dependence Logic","author":"E Pacuit","year":"2016","unstructured":"Pacuit, E., Yang, F.: Dependence and independence in social choice: Arrow\u2019s theorem. In: Abramsky, S., Kontinen, J., V\u00e4\u00e4n\u00e4nen, J., Vollmer, H. (eds.) Dependence Logic, pp. 235\u2013260. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-31803-5_11"},{"issue":"4","key":"19_CR25","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1007\/s00224-014-9586-0","volume":"57","author":"B Cate ten","year":"2015","unstructured":"ten Cate, B., Fontaine, G., Kolaitis, P.G.: On the data complexity of consistent query answering. Theory Comput. Syst. 57(4), 843\u2013891 (2015)","journal-title":"Theory Comput. Syst."},{"key":"19_CR26","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511611193","volume-title":"Dependence Logic","author":"J V\u00e4\u00e4n\u00e4nen","year":"2007","unstructured":"V\u00e4\u00e4n\u00e4nen, J.: Dependence Logic. Cambridge University Press, Cambridge (2007)"},{"key":"19_CR27","volume-title":"New Perspectives on Games and Interaction","author":"J V\u00e4\u00e4n\u00e4nen","year":"2008","unstructured":"V\u00e4\u00e4n\u00e4nen, J.: Modal dependence logic. In: Apt, K.R., van Rooij, R. (eds.) New Perspectives on Games and Interaction. Amsterdam University Press, Amsterdam (2008)"},{"key":"19_CR28","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: The complexity of relational query languages. In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, pp. 137\u2013146. ACM (1982)","DOI":"10.1145\/800070.802186"},{"key":"19_CR29","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/j.ic.2016.07.008","volume":"253","author":"J Virtema","year":"2017","unstructured":"Virtema, J.: Complexity of validity for propositional dependence logics. Inf. Comput. 253, 224\u2013236 (2017)","journal-title":"Inf. Comput."},{"key":"19_CR30","series-title":"EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03927-4","volume-title":"Introduction to Circuit Complexity - A Uniform Approach","author":"H Vollmer","year":"1999","unstructured":"Vollmer, H.: Introduction to Circuit Complexity - A Uniform Approach. EATCS Series. Springer, Heidelberg (1999). \nhttps:\/\/doi.org\/10.1007\/978-3-662-03927-4"},{"issue":"7","key":"19_CR31","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/j.apal.2016.03.003","volume":"167","author":"F Yang","year":"2016","unstructured":"Yang, F., V\u00e4\u00e4n\u00e4nen, J.: Propositional logics of dependence. Ann. Pure Appl. Logic 167(7), 557\u2013589 (2016)","journal-title":"Ann. Pure Appl. Logic"}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information, and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-59533-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,6]],"date-time":"2019-12-06T15:04:44Z","timestamp":1575644684000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-59533-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783662595329","9783662595336"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-59533-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"9 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WoLLIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Logic, Language, Information, and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Utrecht","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wollic2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wollic2019.sites.uu.nl\/","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":"60","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":"41","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":"6","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":"68% - 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,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":"8","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)"}}]}}