{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:44:49Z","timestamp":1740123889439,"version":"3.37.3"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2021,2,27]],"date-time":"2021-02-27T00:00:00Z","timestamp":1614384000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,2,27]],"date-time":"2021-02-27T00:00:00Z","timestamp":1614384000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2022,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Dependence Logic was introduced by Jouko V\u00e4\u00e4n\u00e4nen in 2007. We study a propositional variant of this logic<jats:italic>(PDL)<\/jats:italic>and investigate a variety of parameterisations with respect to central decision problems. The model checking problem (MC) of<jats:italic>PDL<\/jats:italic>is<jats:bold>NP<\/jats:bold>-complete (Ebbing and Lohmann, SOFSEM 2012). The subject of this research is to identify a list of parameterisations (formula-size, formula-depth, treewidth, team-size, number of variables) under which MC becomes fixed-parameter tractable. Furthermore, we show that the number of disjunctions or the arity of dependence atoms (dep-arity) as a parameter both yield a paraNP-completeness result. Then, we consider the satisfiability problem (SAT) which classically is known to be<jats:bold>NP<\/jats:bold>-complete as well (Lohmann and Vollmer, Studia Logica 2013). There we are presenting a different picture: under team-size, or dep-arity SAT is<jats:bold>paraNP<\/jats:bold>-complete whereas under all other mentioned parameters the problem is<jats:bold>FPT<\/jats:bold>. Finally, we introduce a variant of the satisfiability problem, asking for a team of a given size, and show for this problem an almost complete picture.<\/jats:p>","DOI":"10.1007\/s10472-021-09730-w","type":"journal-article","created":{"date-parts":[[2021,2,27]],"date-time":"2021-02-27T12:02:56Z","timestamp":1614427376000},"page":"271-296","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Parameterised complexity of model checking and satisfiability in propositional dependence logic"],"prefix":"10.1007","volume":"90","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5651-5391","authenticated-orcid":false,"given":"Yasir","family":"Mahmood","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arne","family":"Meier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,27]]},"reference":[{"key":"9730_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-31803-5","volume-title":"Dependence Logic, Theory and Applications","author":"S Abramsky","year":"2016","unstructured":"Abramsky, S., Kontinen, J., V\u00e4\u00e4n\u00e4nen, J., Vollmer, H.: Dependence Logic, Theory and Applications. Springer, Berlin (2016). https:\/\/doi.org\/10.1007\/978-3-319-31803-5"},{"key":"9730_CR2","doi-asserted-by":"publisher","unstructured":"Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. Algebraic Discrete Methods 8(2), 277\u2013284 (1987). https:\/\/doi.org\/10.1137\/0608024","DOI":"10.1137\/0608024"},{"key":"9730_CR3","doi-asserted-by":"publisher","unstructured":"Beeri, C., Dowd, M., Fagin, R., Statman, R.: On the structure of armstrong relations for functional dependencies. J. ACM 31(1), 30\u201346 (1984). https:\/\/doi.org\/10.1145\/2422.322414","DOI":"10.1145\/2422.322414"},{"key":"9730_CR4","doi-asserted-by":"publisher","unstructured":"Bl\u00e4sius, T., Friedrich, T., Schirneck, M.: The Parameterized Complexity of Dependency Detection in Relational Databases. In: Guo, J., Hermelin, D. (eds.) 11th International Symposium on Parameterized and Exact Computation (IPEC 2016), Leibniz International Proceedings in Informatics (LIPIcs). https:\/\/doi.org\/10.4230\/LIPIcs.IPEC.2016.6. http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2017\/6920, vol. 63, pp 6:1\u20136:13. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl (2017)","DOI":"10.4230\/LIPIcs.IPEC.2016.6"},{"key":"9730_CR5","unstructured":"Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybern. 11(1-2), 1\u201321 (1993). https:\/\/cyber.bibl.u-szeged.hu\/index.php\/actcybern\/article\/view\/3417"},{"key":"9730_CR6","doi-asserted-by":"publisher","unstructured":"Chen, H., Mengel, S.: A trichotomy in the complexity of counting answers to conjunctive queries. In: Arenas, M., Ugarte, M. (eds.) 18th International Conference on Database Theory, ICDT 2015, March 23-27, 2015, Brussels, Belgium, LIPIcs. https:\/\/doi.org\/10.4230\/LIPIcs.ICDT.2015.110, vol. 31, pp 110\u2013126. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2015)","DOI":"10.4230\/LIPIcs.ICDT.2015.110"},{"key":"9730_CR7","doi-asserted-by":"publisher","unstructured":"Chen, H., Mengel, S.: Counting answers to existential positive queries: A complexity classification. In: Milo, T., Tan, W. (eds.) Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2016. https:\/\/doi.org\/10.1145\/2902251.2902279, pp 315\u2013326. ACM, San Francisco (2016)","DOI":"10.1145\/2902251.2902279"},{"key":"9730_CR8","doi-asserted-by":"publisher","unstructured":"Chen, H., Mengel, S.: The logic of counting query answers. In: 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2017, pp. 1\u201312. IEEE Computer Society, Reykjavik (2017). https:\/\/doi.org\/10.1109\/LICS.2017.8005085","DOI":"10.1109\/LICS.2017.8005085"},{"key":"9730_CR9","doi-asserted-by":"publisher","unstructured":"Chen, H., M\u00fcller, M.: The fine classification of conjunctive queries and parameterized logarithmic space. TOCT 7(2), 7:1\u20137:27 (2015). https:\/\/doi.org\/10.1145\/2751316","DOI":"10.1145\/2751316"},{"key":"9730_CR10","doi-asserted-by":"publisher","unstructured":"Ciardelli, I., Groenendijk, J., Roelofsen, F.: Towards a logic of information exchange - an inquisitive witness semantics. In: Logic, Language, and Computation - 9th International Tbilisi Symposium on Logic, Language, and Computation, TbiLLC 2011, Kutaisi, Revised Selected Papers, pp. 51\u201372 (2011). https:\/\/doi.org\/10.1007\/978-3-642-36976-6\u2216_6","DOI":"10.1007\/978-3-642-36976-6\u2216_6"},{"key":"9730_CR11","doi-asserted-by":"publisher","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: Harrison, M.A., Banerji, R.B., Ullman, J.D. (eds.) Proceedings of the 3rd Annual ACM Symposium on Theory of Computing. https:\/\/doi.org\/10.1145\/800157.805047, pp 151\u2013158. ACM, Shaker Heights (1971)","DOI":"10.1145\/800157.805047"},{"key":"9730_CR12","doi-asserted-by":"publisher","unstructured":"Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., varPilipczuk, M., varPilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3","DOI":"10.1007\/978-3-319-21275-3"},{"key":"9730_CR13","doi-asserted-by":"publisher","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer (2013). https:\/\/doi.org\/10.1007\/978-1-4471-5559-1","DOI":"10.1007\/978-1-4471-5559-1"},{"key":"9730_CR14","doi-asserted-by":"publisher","unstructured":"Durand, A., Hannula, M., Kontinen, J., Meier, A., Virtema, J.: Approximation and dependence via multiteam semantics. Ann. Math. Artif. Intell. 83(3-4), 297\u2013320 (2018). https:\/\/doi.org\/10.1007\/s10472-017-9568-4https:\/\/doi.org\/10.1007\/s10472-017-9568-4","DOI":"10.1007\/s10472-017-9568-4 10.1007\/s10472-017-9568-4"},{"key":"9730_CR15","doi-asserted-by":"publisher","unstructured":"Durand, A., Hannula, M., Kontinen, J., Meier, A., Virtema, J.: Probabilistic team semantics. In: Ferrarotti, F., Woltran, S. (eds.) Foundations of Information and Knowledge Systems - 10th International Symposium, FoIKS 2018, Proceedings, Lecture Notes in Computer Science. https:\/\/doi.org\/10.1007\/978-3-319-90050-6\u2216_11, vol. 10833, pp 186\u2013206. Springer, Budapest (2018)","DOI":"10.1007\/978-3-319-90050-6\u2216_11"},{"key":"9730_CR16","doi-asserted-by":"publisher","unstructured":"Durand, A., Mengel, S.: Structural tractability of counting of solutions to conjunctive queries. Theory Comput. Syst. 57(4), 1202\u20131249 (2015). https:\/\/doi.org\/10.1007\/s00224-014-9543-y","DOI":"10.1007\/s00224-014-9543-y"},{"key":"9730_CR17","doi-asserted-by":"publisher","unstructured":"Dvo\u0159\u00e1k, W., Ordyniak, S., Szeider, S.: Augmenting tractable fragments of abstract argumentation. 186, 157\u2013173 (2012). https:\/\/doi.org\/10.1016\/j.artint.2012.03.002","DOI":"10.1016\/j.artint.2012.03.002"},{"key":"9730_CR18","doi-asserted-by":"publisher","unstructured":"Ebbing, J., Lohmann, P.: Complexity of model checking for modal dependence logic. In: Bielikov\u00e1, M., Friedrich, G., Gottlob, G., Katzenbeisser, S., Tur\u00e1n, G. (eds.) SOFSEM 2012: Theory and Practice of Computer Science - 38th Conference on Current Trends in Theory and Practice of Computer Science, Proceedings, Lecture Notes in Computer Science. https:\/\/doi.org\/10.1007\/978-3-642-27660-6\u2216_19, vol. 7147, pp 226\u2013237. Springer, \u0160pindler\u016fv Ml\u00fdn (2012)","DOI":"10.1007\/978-3-642-27660-6\u2216_19"},{"key":"9730_CR19","doi-asserted-by":"publisher","unstructured":"Fagin, R., Vardi, M.Y.: Armstrong databases for functional and inclusion dependencies. Inf. Process. Lett. 16(1), 13\u201319 (1983). https:\/\/doi.org\/10.1016\/0020-0190(83)90005-4","DOI":"10.1016\/0020-0190(83)90005-4"},{"key":"9730_CR20","doi-asserted-by":"publisher","unstructured":"Fichte, J.K., Meier, A., Schindler, I.: Strong backdoors for default logic. In: Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference, Proceedings, pp. 45\u201359, Bordeaux (2016). https:\/\/doi.org\/10.1007\/978-3-319-40970-2\u2216_4","DOI":"10.1007\/978-3-319-40970-2\u2216_4"},{"key":"9730_CR21","doi-asserted-by":"publisher","unstructured":"Fichte, J.K., Szeider, S.: Backdoors to normality for disjunctive logic programs. ACM Trans. Comput. Log. 17(1), 7:1\u20137:23 (2015). https:\/\/doi.org\/10.1145\/2818646","DOI":"10.1145\/2818646"},{"key":"9730_CR22","doi-asserted-by":"publisher","unstructured":"Fichte, J.K., Szeider, S.: Backdoors to tractable answer set programming. Artif. Intell. 220, 64\u2013103 (2015). https:\/\/doi.org\/10.1016\/j.artint.2014.12.001","DOI":"10.1016\/j.artint.2014.12.001"},{"key":"9730_CR23","doi-asserted-by":"publisher","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer (2006). https:\/\/doi.org\/10.1007\/3-540-29953-X","DOI":"10.1007\/3-540-29953-X"},{"key":"9730_CR24","doi-asserted-by":"publisher","unstructured":"Galliani, P.: Inclusion and exclusion dependencies in team semantics - on some logics of imperfect information. Ann. Pure Appl. Logic 163(1), 68\u201384 (2012). https:\/\/doi.org\/10.1016\/j.apal.2011.08.005","DOI":"10.1016\/j.apal.2011.08.005"},{"key":"9730_CR25","doi-asserted-by":"publisher","unstructured":"Gaspers, S., Misra, N., Ordyniak, S., Szeider, S., Zivny, S.: Backdoors into heterogeneous classes of SAT and CSP. J. Comput. Syst. Sci. 85, 38\u201356 (2017). https:\/\/doi.org\/10.1016\/j.jcss.2016.10.007","DOI":"10.1016\/j.jcss.2016.10.007"},{"key":"9730_CR26","doi-asserted-by":"publisher","unstructured":"Gr\u00e4del, E.: Model-checking games for logics of imperfect information. Theor. Comput. Sci. 493, 2\u201314 (2013). https:\/\/doi.org\/10.1016\/j.tcs.2012.10.033","DOI":"10.1016\/j.tcs.2012.10.033"},{"key":"9730_CR27","doi-asserted-by":"publisher","unstructured":"Gr\u00e4del, E., Kontinen, J., V\u00e4\u00e4n\u00e4nen, J., Vollmer, H.: Logics for Dependence and Independence (Dagstuhl Seminar 15261). Dagstuhl Reports 5(6), 70\u201385 (2016). https:\/\/doi.org\/10.4230\/DagRep.5.6.70. http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2016\/5508","DOI":"10.4230\/DagRep.5.6.70"},{"key":"9730_CR28","doi-asserted-by":"publisher","unstructured":"Grohe, M., Schwentick, T., Segoufin, L.: When is the evaluation of conjunctive queries tractable?. In: Vitter, J.S., Spirakis, P.G., Yannakakis, M. (eds.) Proceedings on 33rd Annual ACM Symposium on Theory of Computing. https:\/\/doi.org\/10.1145\/380752.380867, pp 657\u2013666. ACM, Heraklion (2001)","DOI":"10.1145\/380752.380867"},{"key":"9730_CR29","doi-asserted-by":"publisher","unstructured":"Hannula, M., Kontinen, J., Virtema, J.: Polyteam semantics. In: Art\u00ebmov, S.N., Nerode, A. (eds.) Logical Foundations of Computer Science - International Symposium, LFCS 2018, Proceedings, Lecture Notes in Computer Science. https:\/\/doi.org\/10.1007\/978-3-319-72056-2\u2216_12, vol. 10703, pp 190\u2013210. Springer, Deerfield Beach (2018)","DOI":"10.1007\/978-3-319-72056-2\u2216_12"},{"key":"9730_CR30","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1145\/3157054","DOI":"10.1145\/3157054"},{"key":"9730_CR31","doi-asserted-by":"publisher","unstructured":"Hella, L., Kuusisto, A., Meier, A., Virtema, J.: Model checking and validity in propositional and modal inclusion logics. J. Log. Comput (2019). https:\/\/doi.org\/10.1093\/logcom\/exz008","DOI":"10.1093\/logcom\/exz008"},{"key":"9730_CR32","doi-asserted-by":"publisher","unstructured":"Kontinen, J., M\u00fcller, J., Schnoor, H., Vollmer, H.: Modal independence logic. J. Log. Comput. 27(5), 1333\u20131352 (2017). https:\/\/doi.org\/10.1093\/logcom\/exw019","DOI":"10.1093\/logcom\/exw019"},{"key":"9730_CR33","doi-asserted-by":"publisher","unstructured":"Krebs, A., Meier, A., Virtema, J.: A team based variant of CTL. In: Grandi, F., Lange, M., Lomuscio, A. (eds.) 22nd International Symposium on Temporal Representation and Reasoning, TIME 2015. https:\/\/doi.org\/10.1109\/TIME.2015.11, pp 140\u2013149. IEEE Computer Society, Kassel (2015)","DOI":"10.1109\/TIME.2015.11"},{"key":"9730_CR34","doi-asserted-by":"publisher","unstructured":"Krebs, A., Meier, A., Virtema, J., Zimmermann, M.: Team semantics for the specification and verification of hyperproperties. In: Potapov, I., Spirakis, P.G., Worrell, J. (eds.) 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, LIPIcs. https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2018.10, vol. 117, pp 10:1\u201310:16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Liverpool (2018)","DOI":"10.4230\/LIPIcs.MFCS.2018.10"},{"key":"9730_CR35","unstructured":"Kronegger, M., Ordyniak, S., Pfandler, A.: Variable-deletion backdoors to planning. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, pp. 3305\u20133312, Austin (2015). http:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI15\/paper\/view\/9885"},{"key":"9730_CR36","unstructured":"Levin, L.: Universal search problems. Problems of Information Transmission 9(3), 115\u2013116 (1973)"},{"issue":"2","key":"9730_CR37","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s11225-013-9483-6","volume":"101","author":"P Lohmann","year":"2013","unstructured":"Lohmann, P., Vollmer, H.: Complexity results for modal dependence logic. Studia Logica 101(2), 343\u2013366 (2013). https:\/\/doi.org\/10.1007\/s11225-013-9483-6","journal-title":"Studia Logica"},{"key":"9730_CR38","doi-asserted-by":"publisher","unstructured":"L\u00fcck, M., Meier, A., Schindler, I.: Parameterised complexity of satisfiability in temporal logic. ACM Trans. Comput. Log. 18(1), 1:1\u20131:32 (2017). https:\/\/doi.org\/10.1145\/3001835","DOI":"10.1145\/3001835"},{"key":"9730_CR39","doi-asserted-by":"publisher","unstructured":"Mahmood, Y., Meier, A.: Parameterised complexity of model checking and satisfiability in propositional dependence logic. In: Herzig, A., Kontinen, J. (eds.) Foundations of Information and Knowledge Systems - 11th International Symposium, FoIKS 2020, Proceedings, Lecture Notes in Computer Science. https:\/\/doi.org\/10.1007\/978-3-030-39951-1\u2216_10, vol. 12012, pp 157\u2013174. Springer, Dortmund (2020)","DOI":"10.1007\/978-3-030-39951-1\u2216_10"},{"key":"9730_CR40","doi-asserted-by":"publisher","unstructured":"Meier, A., Ordyniak, S., Sridharan, R., Schindler, I.: Backdoors for linear temporal logic. In: 11th International Symposium on Parameterized and Exact Computation, IPEC 2016, pp. 23:1\u201323:17, Aarhus (2016). https:\/\/doi.org\/10.4230\/LIPIcs.IPEC.2016.23","DOI":"10.4230\/LIPIcs.IPEC.2016.23"},{"key":"9730_CR41","doi-asserted-by":"publisher","unstructured":"Meier, A., Reinbold, C.: Enumeration complexity of poor man\u2019s propositional dependence logic. In: Ferrarotti, F., Woltran, S. (eds.) Foundations of Information and Knowledge Systems - 10th International Symposium, FoIKS 2018, Proceedings, Lecture Notes in Computer Science. https:\/\/doi.org\/10.1007\/978-3-319-90050-6\u2216_17, vol. 10833, pp 303\u2013321. Springer, Budapest (2018)","DOI":"10.1007\/978-3-319-90050-6\u2216_17"},{"key":"9730_CR42","unstructured":"Pfandler, A., R\u00fcmmele, S., Szeider, S.: Backdoors to abduction. In: Rossi, F. (ed.) Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI\u201913), pp 1046\u20131052, Beijing (2013)"},{"key":"9730_CR43","unstructured":"varPippenger, N.: Theories of computability. Cambridge University Press (1997)"},{"key":"9730_CR44","doi-asserted-by":"publisher","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. v. excluding a planar graph. J. Comb. Theory, Ser. B 41(1), 92\u2013114 (1986). https:\/\/doi.org\/10.1016\/0095-8956(86)90030-4","DOI":"10.1016\/0095-8956(86)90030-4"},{"key":"9730_CR45","doi-asserted-by":"publisher","unstructured":"Samer, M., Szeider, S.: Fixed-parameter tractability. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications. https:\/\/doi.org\/10.3233\/978-1-58603-929-5-425, vol. 185, pp 425\u2013454. IOS Press (2009)","DOI":"10.3233\/978-1-58603-929-5-425"},{"key":"9730_CR46","doi-asserted-by":"crossref","unstructured":"Samer, M., Szeider, S.: Algorithms for propositional model counting. J. Discrete Algorithm. 8(1), 50\u201364 (2010)","DOI":"10.1016\/j.jda.2009.06.002"},{"key":"9730_CR47","doi-asserted-by":"crossref","unstructured":"V\u00e4\u00e4n\u00e4nen, J.A.: Dependence Logic - A New Approach to Independence Friendly Logic, London Mathematical Society student texts, vol. 70. Cambridge University Press (2007). http:\/\/www.cambridge.org\/de\/knowledge\/isbn\/item1164246\/?site%_locale=de_DE","DOI":"10.1017\/CBO9780511611193"},{"key":"9730_CR48","unstructured":"V\u00e4\u00e4n\u00e4nen, J.A.: Modal dependence logic. In: Apt, K., van Rooij, R. (eds.) New Perspectives on Games and Interaction. Amsterdam University Press (2008)"},{"key":"9730_CR49","doi-asserted-by":"publisher","unstructured":"Virtema, J.: Complexity of validity for propositional dependence logics. Inf. Comput. 253, 224\u2013236 (2017). https:\/\/doi.org\/10.1016\/j.ic.2016.07.008","DOI":"10.1016\/j.ic.2016.07.008"},{"key":"9730_CR50","unstructured":"Williams, R., Gomes, C.P., Selman, B.: Backdoors to typical case complexity. In: IJCAI-03, Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, Acapulco, pp. 1173\u20131178 (2003)"},{"key":"9730_CR51","doi-asserted-by":"publisher","unstructured":"Yang, F., V\u00e4\u00e4n\u00e4nen, J.: Propositional logics of dependence. Ann. Pure Appl. Logic 167(7), 557\u2013589 (2016). https:\/\/doi.org\/10.1016\/j.apal.2016.03.003","DOI":"10.1016\/j.apal.2016.03.003"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-021-09730-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10472-021-09730-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-021-09730-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,19]],"date-time":"2022-12-19T07:19:34Z","timestamp":1671434374000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10472-021-09730-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,27]]},"references-count":51,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["9730"],"URL":"https:\/\/doi.org\/10.1007\/s10472-021-09730-w","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"type":"print","value":"1012-2443"},{"type":"electronic","value":"1573-7470"}],"subject":[],"published":{"date-parts":[[2021,2,27]]},"assertion":[{"value":"1 February 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 February 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}