Parameterised complexity of model checking and satisfiability in propositional dependence logic
Dependence Logic was introduced by Jouko Väänänen in 2007. We study a propositional variant of this logic (PDL) and investigate a variety of parameterisations with respect to central decision problems. The model checking problem (MC) of PDL is NP -complete (Ebbing and Lohmann, SOFSEM 2012). The subj...
Saved in:
| Published in | Annals of mathematics and artificial intelligence Vol. 90; no. 2-3; pp. 271 - 296 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
Cham
Springer International Publishing
01.03.2022
Springer Springer Nature B.V |
| Subjects | |
| Online Access | Get full text |
| ISSN | 1012-2443 1573-7470 |
| DOI | 10.1007/s10472-021-09730-w |
Cover
| Abstract | Dependence Logic was introduced by Jouko Väänänen in 2007. We study a propositional variant of this logic
(PDL)
and investigate a variety of parameterisations with respect to central decision problems. The model checking problem (MC) of
PDL
is
NP
-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
NP
-complete as well (Lohmann and Vollmer, Studia Logica 2013). There we are presenting a different picture: under team-size, or dep-arity SAT is
paraNP
-complete whereas under all other mentioned parameters the problem is
FPT
. 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. |
|---|---|
| AbstractList | Dependence Logic was introduced by Jouko Väänänen in 2007. We study a propositional variant of this logic
(PDL)
and investigate a variety of parameterisations with respect to central decision problems. The model checking problem (MC) of
PDL
is
NP
-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
NP
-complete as well (Lohmann and Vollmer, Studia Logica 2013). There we are presenting a different picture: under team-size, or dep-arity SAT is
paraNP
-complete whereas under all other mentioned parameters the problem is
FPT
. 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. Dependence Logic was introduced by Jouko Väänänen in 2007. We study a propositional variant of this logic (PDL) and investigate a variety of parameterisations with respect to central decision problems. The model checking problem (MC) of PDL is NP-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 NP-complete as well (Lohmann and Vollmer, Studia Logica 2013). There we are presenting a different picture: under team-size, or dep-arity SAT is paraNP-complete whereas under all other mentioned parameters the problem is FPT. 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. Dependence Logic was introduced by Jouko Vaananen in 2007. We study a propositional variant of this logic (PDL) and investigate a variety of parameterisations with respect to central decision problems. The model checking problem (MC) of PDL is NP-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 NP-complete as well (Lohmann and Vollmer, Studia Logica 2013). There we are presenting a different picture: under team-size, or dep-arity SAT is paraNP-complete whereas under all other mentioned parameters the problem is FPT. 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. Keywords Propositional dependence logic * Parameterised complexity * Model checking * Satisfiability |
| Audience | Academic |
| Author | Mahmood, Yasir Meier, Arne |
| Author_xml | – sequence: 1 givenname: Yasir orcidid: 0000-0002-5651-5391 surname: Mahmood fullname: Mahmood, Yasir email: mahmood@thi.uni-hannover.de organization: Institut für Theoretische Informatik, Leibniz Universität Hannover – sequence: 2 givenname: Arne surname: Meier fullname: Meier, Arne organization: Institut für Theoretische Informatik, Leibniz Universität Hannover |
| BookMark | eNp9kM9LHTEQgENRqL76D_QU6Hltfr1kcxRRWxD0YM8hm0yesbvJNllR_3vz3ILgQeYwYZgvM_Mdo4OUEyD0nZJTSoj6WSkRinWE0Y5oxUn39AUd0a3inRKKHLQ3oaxjQvCv6LjWB0KIlr08QubWFjvBAiVW8NjlaR7hOS4vOAc8ZQ8jdvfg_sa0wzZ5XO0Sa4h2iOO-KSY8lzznGpeYkx2xhxmSh-QAj3kX3Td0GOxY4eR_3qA_lxd357-665ur3-dn150ThC2d55oGrlsMMEjFpLP9Vgnht9r1wdrBgteKciYIcWxgsg9KCSp08EH1kvMN-rH-29b59wh1MQ_5sbSNqmGa9kzxPb5Bp2vXzo5gYgp5Kda18DBF15SG2Opnikqx1VKyBrAVcCXXWiCYucTJlhdDidmbN6t508ybN_PmqUH9B8jFxe4FtWlx_BzlK1rbnLSD8n7GJ9Qr20Kbvw |
| CitedBy_id | crossref_primary_10_1017_S0960129524000033 |
| Cites_doi | 10.1007/978-3-319-72056-2∖_12 10.1017/CBO9780511611193 10.3233/978-1-58603-929-5-425 10.1007/s10472-017-9568-4 10.1007/s10472-017-9568-4 10.1007/978-3-319-31803-5 10.1016/0020-0190(83)90005-4 10.1007/978-3-319-90050-6∖_17 10.1007/978-1-4471-5559-1 10.1007/978-3-642-27660-6∖_19 10.1007/s00224-014-9543-y 10.4230/LIPIcs.IPEC.2016.23 10.4230/LIPIcs.MFCS.2018.10 10.1145/3001835 10.1145/2818646 10.1093/logcom/exz008 10.4230/LIPIcs.IPEC.2016.6 10.4230/LIPIcs.ICDT.2015.110 10.4230/DagRep.5.6.70 10.1145/2902251.2902279 10.1093/logcom/exw019 10.1007/978-3-030-39951-1∖_10 10.1109/TIME.2015.11 10.1016/j.ic.2016.07.008 10.1007/s11225-013-9483-6 10.1007/978-3-319-21275-3 10.1016/j.artint.2014.12.001 10.1145/800157.805047 10.1016/j.jda.2009.06.002 10.1145/3157054 10.1007/978-3-319-90050-6∖_11 10.1016/j.apal.2016.03.003 10.1016/j.apal.2011.08.005 10.1145/380752.380867 10.1016/j.tcs.2012.10.033 10.1016/0095-8956(86)90030-4 10.1137/0608024 10.1007/978-3-642-36976-6∖_6 10.1016/j.jcss.2016.10.007 10.1109/LICS.2017.8005085 10.1007/3-540-29953-X 10.1145/2422.322414 10.1007/978-3-319-40970-2∖_4 10.1145/2751316 10.1016/j.artint.2012.03.002 |
| ContentType | Journal Article |
| Copyright | The Author(s) 2021 COPYRIGHT 2022 Springer The Author(s) 2021. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| Copyright_xml | – notice: The Author(s) 2021 – notice: COPYRIGHT 2022 Springer – notice: The Author(s) 2021. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| DBID | C6C AAYXX CITATION 8FE 8FG ABJCF AFKRA ARAPS AZQEC BENPR BGLVJ CCPQU DWQXO GNUQQ HCIFZ JQ2 K7- L6V M7S P5Z P62 PHGZM PHGZT PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS |
| DOI | 10.1007/s10472-021-09730-w |
| DatabaseName | Open Access Journals from Springer Nature CrossRef ProQuest SciTech Collection ProQuest Technology Collection ProQuest Materials Science & Engineering Collection ProQuest Central UK/Ireland Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Central Technology Collection ProQuest One Community College ProQuest Central ProQuest Central Student ProQuest SciTech Premium Collection ProQuest Computer Science Collection Computer Science Database ProQuest Engineering Collection ProQuest Engineering Database (NC LIVE) Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection |
| DatabaseTitle | CrossRef Computer Science Database ProQuest Central Student Technology Collection ProQuest One Academic Middle East (New) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection SciTech Premium Collection ProQuest One Community College ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Engineering Collection ProQuest Central Korea ProQuest Central (New) Engineering Collection Advanced Technologies & Aerospace Collection Engineering Database ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection Advanced Technologies & Aerospace Database ProQuest One Academic UKI Edition Materials Science & Engineering Collection ProQuest One Academic ProQuest One Academic (New) |
| DatabaseTitleList | Computer Science Database CrossRef |
| Database_xml | – sequence: 1 dbid: C6C name: Springer Nature OA Free Journals url: http://www.springeropen.com/ sourceTypes: Publisher – sequence: 2 dbid: 8FG name: ProQuest Technology Collection url: https://search.proquest.com/technologycollection1 sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISSN | 1573-7470 |
| EndPage | 296 |
| ExternalDocumentID | A716459662 10_1007_s10472_021_09730_w |
| GroupedDBID | -4Z -59 -5G -BR -EM -Y2 -~C .86 .DC .VR 06D 0R~ 0VY 1N0 1SB 2.D 203 23M 28- 2J2 2JN 2JY 2KG 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAOBN AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDZT ABECU ABFTD ABFTV ABHLI ABHQN ABJCF ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACSNA ACZOJ ADHHG ADHIR ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFKRA AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARAPS ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN B-. BA0 BBWZM BDATZ BENPR BGLVJ BGNMA BSONS C6C CAG CCPQU COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP EBLON EBS EIOEI EJD ESBYG F5P FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GQ8 GXS HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I09 IAO IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K7- KDC KOV KOW LAK LLZTM M4Y M7S MA- N2Q NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM OVD P19 P2P P9O PF0 PT4 PT5 PTHSS QOK QOS R4E R89 R9I RHV RNI RNS ROL RPX RSV RZC RZE RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TEORI TN5 TSG TSK TSV TUC U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 Z7R Z7X Z81 Z83 Z88 Z92 ZMTXR ~A9 ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ACSTC ADHKG ADKFA AEZWR AFDZB AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION PHGZM PHGZT AEIIB PMFND 8FE 8FG ABRTQ AZQEC DWQXO GNUQQ JQ2 L6V P62 PKEHL PQEST PQGLB PQQKQ PQUKI PRINS |
| ID | FETCH-LOGICAL-c402t-d391f39393beb6726ca85744d59c8faabaed97132400c2b268f774149fdf78633 |
| IEDL.DBID | 8FG |
| ISSN | 1012-2443 |
| IngestDate | Fri Jul 25 11:08:22 EDT 2025 Tue Jun 10 20:09:32 EDT 2025 Thu Apr 24 23:12:42 EDT 2025 Tue Jul 01 03:19:44 EDT 2025 Fri Feb 21 02:46:18 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2-3 |
| Keywords | Model checking 68Q25 Propositional dependence logic 03B70 Parameterised complexity Satisfiability |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c402t-d391f39393beb6726ca85744d59c8faabaed97132400c2b268f774149fdf78633 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0002-5651-5391 |
| OpenAccessLink | https://doi.org/10.1007/s10472-021-09730-w |
| PQID | 2918273971 |
| PQPubID | 2043872 |
| PageCount | 26 |
| ParticipantIDs | proquest_journals_2918273971 gale_infotracacademiconefile_A716459662 crossref_primary_10_1007_s10472_021_09730_w crossref_citationtrail_10_1007_s10472_021_09730_w springer_journals_10_1007_s10472_021_09730_w |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 20220300 2022-03-00 20220301 |
| PublicationDateYYYYMMDD | 2022-03-01 |
| PublicationDate_xml | – month: 3 year: 2022 text: 20220300 |
| PublicationDecade | 2020 |
| PublicationPlace | Cham |
| PublicationPlace_xml | – name: Cham – name: Dordrecht |
| PublicationTitle | Annals of mathematics and artificial intelligence |
| PublicationTitleAbbrev | Ann Math Artif Intell |
| PublicationYear | 2022 |
| Publisher | Springer International Publishing Springer Springer Nature B.V |
| Publisher_xml | – name: Springer International Publishing – name: Springer – name: Springer Nature B.V |
| References | 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–12. IEEE Computer Society, Reykjavik (2017). https://doi.org/10.1109/LICS.2017.8005085 Virtema, J.: Complexity of validity for propositional dependence logics. Inf. Comput. 253, 224–236 (2017). https://doi.org/10.1016/j.ic.2016.07.008 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–23:17, Aarhus (2016). https://doi.org/10.4230/LIPIcs.IPEC.2016.23 Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybern. 11(1-2), 1–21 (1993). https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3417 Pfandler, A., Rümmele, S., Szeider, S.: Backdoors to abduction. In: Rossi, F. (ed.) Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI’13), pp 1046–1052, Beijing (2013) 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–1178 (2003) Väänänen, J.A.: Modal dependence logic. In: Apt, K., van Rooij, R. (eds.) New Perspectives on Games and Interaction. Amsterdam University Press (2008) 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∖_11, vol. 10833, pp 186–206. Springer, Budapest (2018) 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–72 (2011). https://doi.org/10.1007/978-3-642-36976-6∖_6 Chen, H., Müller, M.: The fine classification of conjunctive queries and parameterized logarithmic space. TOCT 7(2), 7:1–7:27 (2015). https://doi.org/10.1145/2751316 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 Ebbing, J., Lohmann, P.: Complexity of model checking for modal dependence logic. In: Bieliková, M., Friedrich, G., Gottlob, G., Katzenbeisser, S., Turán, 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∖_19, vol. 7147, pp 226–237. Springer, Špindlerův Mlýn (2012) Galliani, P.: Inclusion and exclusion dependencies in team semantics - on some logics of imperfect information. Ann. Pure Appl. Logic 163(1), 68–84 (2012). https://doi.org/10.1016/j.apal.2011.08.005 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∖_10, vol. 12012, pp 157–174. Springer, Dortmund (2020) 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–158. ACM, Shaker Heights (1971) 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–454. IOS Press (2009) Kontinen, J., Müller, J., Schnoor, H., Vollmer, H.: Modal independence logic. J. Log. Comput. 27(5), 1333–1352 (2017). https://doi.org/10.1093/logcom/exw019 Hannula, M., Kontinen, J., Virtema, J., Vollmer, H.: Complexity of propositional logics in team semantic. ACM Trans. Comput. Log. 19(1), 2:1–2:14 (2018). https://doi.org/10.1145/3157054 Gaspers, S., Misra, N., Ordyniak, S., Szeider, S., Zivny, S.: Backdoors into heterogeneous classes of SAT and CSP. J. Comput. Syst. Sci. 85, 38–56 (2017). https://doi.org/10.1016/j.jcss.2016.10.007 Kronegger, M., Ordyniak, S., Pfandler, A.: Variable-deletion backdoors to planning. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, pp. 3305–3312, Austin (2015). http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9885 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–149. IEEE Computer Society, Kassel (2015) Beeri, C., Dowd, M., Fagin, R., Statman, R.: On the structure of armstrong relations for functional dependencies. J. ACM 31(1), 30–46 (1984). https://doi.org/10.1145/2422.322414 Fichte, J.K., Szeider, S.: Backdoors to tractable answer set programming. Artif. Intell. 220, 64–103 (2015). https://doi.org/10.1016/j.artint.2014.12.001 LohmannPVollmerHComplexity results for modal dependence logicStudia Logica20131012343366303803710.1007/s11225-013-9483-6https://doi.org/10.1007/s11225-013-9483-6 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–326. ACM, San Francisco (2016) Robertson, N., Seymour, P.D.: Graph minors. v. excluding a planar graph. J. Comb. Theory, Ser. B 41(1), 92–114 (1986). https://doi.org/10.1016/0095-8956(86)90030-4 Durand, A., Hannula, M., Kontinen, J., Meier, A., Virtema, J.: Approximation and dependence via multiteam semantics. Ann. Math. Artif. Intell. 83(3-4), 297–320 (2018). https://doi.org/10.1007/s10472-017-9568-4https://doi.org/10.1007/s10472-017-9568-4 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 varPippenger, N.: Theories of computability. Cambridge University Press (1997) Samer, M., Szeider, S.: Algorithms for propositional model counting. J. Discrete Algorithm. 8(1), 50–64 (2010) AbramskySKontinenJVäänänenJVollmerHDependence Logic, Theory and Applications2016BerlinSpringer10.1007/978-3-319-31803-5https://doi.org/10.1007/978-3-319-31803-5 Grädel, E., Kontinen, J., Väänänen, J., Vollmer, H.: Logics for Dependence and Independence (Dagstuhl Seminar 15261). Dagstuhl Reports 5(6), 70–85 (2016). https://doi.org/10.4230/DagRep.5.6.70. http://drops.dagstuhl.de/opus/volltexte/2016/5508 Levin, L.: Universal search problems. Problems of Information Transmission 9(3), 115–116 (1973) Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. Algebraic Discrete Methods 8(2), 277–284 (1987). https://doi.org/10.1137/0608024 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 Dvořák, W., Ordyniak, S., Szeider, S.: Augmenting tractable fragments of abstract argumentation. 186, 157–173 (2012). https://doi.org/10.1016/j.artint.2012.03.002 Meier, A., Reinbold, C.: Enumeration complexity of poor man’s 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∖_17, vol. 10833, pp 303–321. Springer, Budapest (2018) Väänänen, 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 Fagin, R., Vardi, M.Y.: Armstrong databases for functional and inclusion dependencies. Inf. Process. Lett. 16(1), 13–19 (1983). https://doi.org/10.1016/0020-0190(83)90005-4 Durand, A., Mengel, S.: Structural tractability of counting of solutions to conjunctive queries. Theory Comput. Syst. 57(4), 1202–1249 (2015). https://doi.org/10.1007/s00224-014-9543-y Hannula, M., Kontinen, J., Virtema, J.: Polyteam semantics. In: Artëmov, 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∖_12, vol. 10703, pp 190–210. Springer, Deerfield Beach (2018) 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–59, Bordeaux (2016). https://doi.org/10.1007/978-3-319-40970-2∖_4 Yang, F., Väänänen, J.: Propositional logics of dependence. Ann. Pure Appl. Logic 167(7), 557–589 (2016). https://doi.org/10.1016/j.apal.2016.03.003 Bläsius, 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–6:13. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl (2017) 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 S 9730_CR29 9730_CR27 9730_CR28 9730_CR25 9730_CR26 9730_CR23 9730_CR24 9730_CR21 9730_CR22 9730_CR20 9730_CR4 9730_CR3 9730_CR6 9730_CR5 9730_CR8 9730_CR7 9730_CR9 9730_CR18 9730_CR19 9730_CR16 9730_CR17 9730_CR14 9730_CR15 9730_CR12 9730_CR13 9730_CR10 9730_CR11 9730_CR2 9730_CR50 9730_CR51 9730_CR49 9730_CR47 S Abramsky (9730_CR1) 2016 9730_CR48 9730_CR45 9730_CR46 9730_CR43 9730_CR44 9730_CR41 9730_CR42 9730_CR40 9730_CR38 9730_CR39 9730_CR36 9730_CR34 9730_CR35 9730_CR32 9730_CR33 9730_CR30 9730_CR31 P Lohmann (9730_CR37) 2013; 101 |
| References_xml | – reference: AbramskySKontinenJVäänänenJVollmerHDependence Logic, Theory and Applications2016BerlinSpringer10.1007/978-3-319-31803-5https://doi.org/10.1007/978-3-319-31803-5 – reference: Pfandler, A., Rümmele, S., Szeider, S.: Backdoors to abduction. In: Rossi, F. (ed.) Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI’13), pp 1046–1052, Beijing (2013) – reference: varPippenger, N.: Theories of computability. Cambridge University Press (1997) – reference: Galliani, P.: Inclusion and exclusion dependencies in team semantics - on some logics of imperfect information. Ann. Pure Appl. Logic 163(1), 68–84 (2012). https://doi.org/10.1016/j.apal.2011.08.005 – reference: Väänänen, J.A.: Modal dependence logic. In: Apt, K., van Rooij, R. (eds.) New Perspectives on Games and Interaction. Amsterdam University Press (2008) – reference: Kronegger, M., Ordyniak, S., Pfandler, A.: Variable-deletion backdoors to planning. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, pp. 3305–3312, Austin (2015). http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9885 – reference: Beeri, C., Dowd, M., Fagin, R., Statman, R.: On the structure of armstrong relations for functional dependencies. J. ACM 31(1), 30–46 (1984). https://doi.org/10.1145/2422.322414 – reference: Durand, A., Hannula, M., Kontinen, J., Meier, A., Virtema, J.: Approximation and dependence via multiteam semantics. Ann. Math. Artif. Intell. 83(3-4), 297–320 (2018). https://doi.org/10.1007/s10472-017-9568-4https://doi.org/10.1007/s10472-017-9568-4 – reference: 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–23:17, Aarhus (2016). https://doi.org/10.4230/LIPIcs.IPEC.2016.23 – reference: 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–126. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2015) – reference: 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–1178 (2003) – reference: 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–10:16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Liverpool (2018) – reference: Meier, A., Reinbold, C.: Enumeration complexity of poor man’s 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∖_17, vol. 10833, pp 303–321. Springer, Budapest (2018) – reference: Fichte, J.K., Szeider, S.: Backdoors to normality for disjunctive logic programs. ACM Trans. Comput. Log. 17(1), 7:1–7:23 (2015). https://doi.org/10.1145/2818646 – reference: Grädel, E., Kontinen, J., Väänänen, J., Vollmer, H.: Logics for Dependence and Independence (Dagstuhl Seminar 15261). Dagstuhl Reports 5(6), 70–85 (2016). https://doi.org/10.4230/DagRep.5.6.70. http://drops.dagstuhl.de/opus/volltexte/2016/5508 – reference: 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–666. ACM, Heraklion (2001) – reference: 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 – reference: Robertson, N., Seymour, P.D.: Graph minors. v. excluding a planar graph. J. Comb. Theory, Ser. B 41(1), 92–114 (1986). https://doi.org/10.1016/0095-8956(86)90030-4 – reference: Durand, A., Mengel, S.: Structural tractability of counting of solutions to conjunctive queries. Theory Comput. Syst. 57(4), 1202–1249 (2015). https://doi.org/10.1007/s00224-014-9543-y – reference: 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–158. ACM, Shaker Heights (1971) – reference: Virtema, J.: Complexity of validity for propositional dependence logics. Inf. Comput. 253, 224–236 (2017). https://doi.org/10.1016/j.ic.2016.07.008 – reference: Samer, M., Szeider, S.: Algorithms for propositional model counting. J. Discrete Algorithm. 8(1), 50–64 (2010) – reference: 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–72 (2011). https://doi.org/10.1007/978-3-642-36976-6∖_6 – reference: Levin, L.: Universal search problems. Problems of Information Transmission 9(3), 115–116 (1973) – reference: Bläsius, 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–6:13. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl (2017) – reference: Dvořák, W., Ordyniak, S., Szeider, S.: Augmenting tractable fragments of abstract argumentation. 186, 157–173 (2012). https://doi.org/10.1016/j.artint.2012.03.002 – reference: 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 – reference: LohmannPVollmerHComplexity results for modal dependence logicStudia Logica20131012343366303803710.1007/s11225-013-9483-6https://doi.org/10.1007/s11225-013-9483-6 – reference: Hannula, M., Kontinen, J., Virtema, J., Vollmer, H.: Complexity of propositional logics in team semantic. ACM Trans. Comput. Log. 19(1), 2:1–2:14 (2018). https://doi.org/10.1145/3157054 – reference: 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∖_10, vol. 12012, pp 157–174. Springer, Dortmund (2020) – reference: Yang, F., Väänänen, J.: Propositional logics of dependence. Ann. Pure Appl. Logic 167(7), 557–589 (2016). https://doi.org/10.1016/j.apal.2016.03.003 – reference: 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–149. IEEE Computer Society, Kassel (2015) – reference: 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 – reference: Ebbing, J., Lohmann, P.: Complexity of model checking for modal dependence logic. In: Bieliková, M., Friedrich, G., Gottlob, G., Katzenbeisser, S., Turán, 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∖_19, vol. 7147, pp 226–237. Springer, Špindlerův Mlýn (2012) – reference: Gaspers, S., Misra, N., Ordyniak, S., Szeider, S., Zivny, S.: Backdoors into heterogeneous classes of SAT and CSP. J. Comput. Syst. Sci. 85, 38–56 (2017). https://doi.org/10.1016/j.jcss.2016.10.007 – reference: 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–12. IEEE Computer Society, Reykjavik (2017). https://doi.org/10.1109/LICS.2017.8005085 – reference: Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. Algebraic Discrete Methods 8(2), 277–284 (1987). https://doi.org/10.1137/0608024 – reference: Väänänen, 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 – reference: Kontinen, J., Müller, J., Schnoor, H., Vollmer, H.: Modal independence logic. J. Log. Comput. 27(5), 1333–1352 (2017). https://doi.org/10.1093/logcom/exw019 – reference: Hannula, M., Kontinen, J., Virtema, J.: Polyteam semantics. In: Artëmov, 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∖_12, vol. 10703, pp 190–210. Springer, Deerfield Beach (2018) – reference: Chen, H., Müller, M.: The fine classification of conjunctive queries and parameterized logarithmic space. TOCT 7(2), 7:1–7:27 (2015). https://doi.org/10.1145/2751316 – reference: 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–59, Bordeaux (2016). https://doi.org/10.1007/978-3-319-40970-2∖_4 – reference: Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybern. 11(1-2), 1–21 (1993). https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3417 – reference: Grädel, E.: Model-checking games for logics of imperfect information. Theor. Comput. Sci. 493, 2–14 (2013). https://doi.org/10.1016/j.tcs.2012.10.033 – reference: 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∖_11, vol. 10833, pp 186–206. Springer, Budapest (2018) – reference: Fichte, J.K., Szeider, S.: Backdoors to tractable answer set programming. Artif. Intell. 220, 64–103 (2015). https://doi.org/10.1016/j.artint.2014.12.001 – reference: 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–326. ACM, San Francisco (2016) – reference: Fagin, R., Vardi, M.Y.: Armstrong databases for functional and inclusion dependencies. Inf. Process. Lett. 16(1), 13–19 (1983). https://doi.org/10.1016/0020-0190(83)90005-4 – reference: 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–454. IOS Press (2009) – reference: 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 – reference: Lück, M., Meier, A., Schindler, I.: Parameterised complexity of satisfiability in temporal logic. ACM Trans. Comput. Log. 18(1), 1:1–1:32 (2017). https://doi.org/10.1145/3001835 – ident: 9730_CR29 doi: 10.1007/978-3-319-72056-2∖_12 – ident: 9730_CR47 doi: 10.1017/CBO9780511611193 – ident: 9730_CR36 – ident: 9730_CR45 doi: 10.3233/978-1-58603-929-5-425 – ident: 9730_CR14 doi: 10.1007/s10472-017-9568-4 10.1007/s10472-017-9568-4 – volume-title: Dependence Logic, Theory and Applications year: 2016 ident: 9730_CR1 doi: 10.1007/978-3-319-31803-5 – ident: 9730_CR19 doi: 10.1016/0020-0190(83)90005-4 – ident: 9730_CR41 doi: 10.1007/978-3-319-90050-6∖_17 – ident: 9730_CR13 doi: 10.1007/978-1-4471-5559-1 – ident: 9730_CR18 doi: 10.1007/978-3-642-27660-6∖_19 – ident: 9730_CR16 doi: 10.1007/s00224-014-9543-y – ident: 9730_CR40 doi: 10.4230/LIPIcs.IPEC.2016.23 – ident: 9730_CR34 doi: 10.4230/LIPIcs.MFCS.2018.10 – ident: 9730_CR38 doi: 10.1145/3001835 – ident: 9730_CR43 – ident: 9730_CR21 doi: 10.1145/2818646 – ident: 9730_CR31 doi: 10.1093/logcom/exz008 – ident: 9730_CR4 doi: 10.4230/LIPIcs.IPEC.2016.6 – ident: 9730_CR6 doi: 10.4230/LIPIcs.ICDT.2015.110 – ident: 9730_CR27 doi: 10.4230/DagRep.5.6.70 – ident: 9730_CR7 doi: 10.1145/2902251.2902279 – ident: 9730_CR32 doi: 10.1093/logcom/exw019 – ident: 9730_CR5 – ident: 9730_CR39 doi: 10.1007/978-3-030-39951-1∖_10 – ident: 9730_CR33 doi: 10.1109/TIME.2015.11 – ident: 9730_CR42 – ident: 9730_CR49 doi: 10.1016/j.ic.2016.07.008 – volume: 101 start-page: 343 issue: 2 year: 2013 ident: 9730_CR37 publication-title: Studia Logica doi: 10.1007/s11225-013-9483-6 – ident: 9730_CR12 doi: 10.1007/978-3-319-21275-3 – ident: 9730_CR22 doi: 10.1016/j.artint.2014.12.001 – ident: 9730_CR11 doi: 10.1145/800157.805047 – ident: 9730_CR46 doi: 10.1016/j.jda.2009.06.002 – ident: 9730_CR30 doi: 10.1145/3157054 – ident: 9730_CR15 doi: 10.1007/978-3-319-90050-6∖_11 – ident: 9730_CR50 – ident: 9730_CR51 doi: 10.1016/j.apal.2016.03.003 – ident: 9730_CR35 – ident: 9730_CR24 doi: 10.1016/j.apal.2011.08.005 – ident: 9730_CR28 doi: 10.1145/380752.380867 – ident: 9730_CR26 doi: 10.1016/j.tcs.2012.10.033 – ident: 9730_CR44 doi: 10.1016/0095-8956(86)90030-4 – ident: 9730_CR2 doi: 10.1137/0608024 – ident: 9730_CR10 doi: 10.1007/978-3-642-36976-6∖_6 – ident: 9730_CR25 doi: 10.1016/j.jcss.2016.10.007 – ident: 9730_CR8 doi: 10.1109/LICS.2017.8005085 – ident: 9730_CR23 doi: 10.1007/3-540-29953-X – ident: 9730_CR3 doi: 10.1145/2422.322414 – ident: 9730_CR20 doi: 10.1007/978-3-319-40970-2∖_4 – ident: 9730_CR9 doi: 10.1145/2751316 – ident: 9730_CR17 doi: 10.1016/j.artint.2012.03.002 – ident: 9730_CR48 |
| SSID | ssj0009686 |
| Score | 2.3041244 |
| Snippet | Dependence Logic was introduced by Jouko Väänänen in 2007. We study a propositional variant of this logic
(PDL)
and investigate a variety of parameterisations... Dependence Logic was introduced by Jouko Vaananen in 2007. We study a propositional variant of this logic (PDL) and investigate a variety of parameterisations... Dependence Logic was introduced by Jouko Väänänen in 2007. We study a propositional variant of this logic (PDL) and investigate a variety of parameterisations... |
| SourceID | proquest gale crossref springer |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 271 |
| SubjectTerms | Artificial Intelligence Atomic properties Complex Systems Computer Science Logic Mathematical models Mathematics Parameters Semantics Teams |
| SummonAdditionalLinks | – databaseName: Open Access Journals from Springer Nature dbid: C6C link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEB60XvTgoypWq-QgeNBA95XtHkuxFKHiwUJvIZsHFGRbbKX6751Jd1usD5A9bjZZ9ksmM5uZ7wO4NhlOIqsCHqR5i8ehczwXseG4vSqnEiLGpRPdwaPoD-OHUTIqaXKoFmbj_J5K3OI05JRIQMQyLb7Yhp0EDS-l73VFd02wK7yqI9FVcdyyorJA5uc-vmxCm6b425mo32p6h7Bf-oisswT1CLZsUYeDSn-BlcuxDnuDFefq7Bjkk6JEK8-9bA3zueL2HZ1sNnHMC94wBEjTr3GmCsNmvq5hvOTp_mDjgk1JMWGZw4XDV_K42jJvH09g2Lt_7vZ5KZ_ANQaFc26iLHBRhlduc5GGQqt2ksaxSTLddkrlypoMY1TKItVhHoq2Q18QIyZnXNoWUXQKtWJS2DNgJJMrbEvrSBD9fqRsjAYbnYfYmRxdugYE1feUuuQWJ4mLF7lmRSYMJGIgPQZy0YDb1TPTJbPGn61vCCZJyw571qqsHsD3IwIr2aG4L8HYLWxAs0JSlutxJsMM46gUfa-gAXcVuuvbv497_r_mF7AbUn2ET1JrQm3--mYv0WuZ51d-un4CqQziYw priority: 102 providerName: Springer Nature |
| Title | Parameterised complexity of model checking and satisfiability in propositional dependence logic |
| URI | https://link.springer.com/article/10.1007/s10472-021-09730-w https://www.proquest.com/docview/2918273971 |
| Volume | 90 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVLSH databaseName: SpringerLink Journals customDbUrl: mediaType: online eissn: 1573-7470 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0009686 issn: 1012-2443 databaseCode: AFBBN dateStart: 19900301 isFulltext: true providerName: Library Specific Holdings – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: http://www.proquest.com/pqcentral?accountid=15518 eissn: 1573-7470 dateEnd: 20240930 omitProxy: true ssIdentifier: ssj0009686 issn: 1012-2443 databaseCode: BENPR dateStart: 19970301 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVAVX databaseName: SpringerLINK - Czech Republic Consortium customDbUrl: eissn: 1573-7470 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0009686 issn: 1012-2443 databaseCode: AGYKE dateStart: 19970101 isFulltext: true titleUrlDefault: http://link.springer.com providerName: Springer Nature – providerCode: PRVAVX databaseName: SpringerLink Journals (ICM) customDbUrl: eissn: 1573-7470 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0009686 issn: 1012-2443 databaseCode: U2A dateStart: 19970101 isFulltext: true titleUrlDefault: http://www.springerlink.com/journals/ providerName: Springer Nature |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV3dT9swED8xeNke-Nomypf8MGkPm7XGSZzmCbVVCwJRoWmV2JPl-ENCQmmhRcB_z53rUAECRYofnMSRz74723e_H8APW-IgcjrhSVG1eSa855XMLEfzqr3OCRiXTnTPR_JknJ1e5pdxw20WwyobnRgUtZ0Y2iP_I0r0hAu0nsnR9IYTaxSdrkYKjU-wlggcSZQpPjxegu7KwPRIEFYczVgak2Zi6lxWCE4BCgRY0-b3LwzTa_X85pw0mJ_hJqxHv5F1F4LeghVXb8NGw8nA4hTdhi_nzziss6-gLjQFXwU8ZmdZiB93D-h4s4lngQSHodAMbZczXVs2C7kOVwvs7kd2VbMpsSgs4rqw-YYy1zgWdOY3GA8H__onPFIqcIMLxTm3aZn4tMSrcpUshDS6kxdZZvPSdLzWlXYWu5hQ-tpGVEJ2PPqHuIry1hcdmabfYbWe1G4HGFHnStc2JpUEyZ9ql6ESR4ci87ZCN68FSdOfykS8caK9uFZLpGSSgUIZqCADdd-CX8_vTBdoGx8-_ZPEpGgq4peNjhkF-H8EaqW6tBbMcT0nWrDfSFLFOTpTyxHVgt-NdJfV77e7-_HX9uCzoByJEKi2D6vz2zt3gJ7LvDoMw_MQ1rrDXm9E5fH_swGWvcHo4i_W9mUf72PRfQJGru-d |
| linkProvider | ProQuest |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LT9wwEB4hOLQ9FEpbsTxaH1r10FrdOI6THBBCbbdLYVEPIHFzHT8kpCq7sIsW_hS_kRknYdVW5YZyzMORZzwPe-b7AN65EpXIm4QnedXnUoTAKyUdR_dqgskIGJdOdEfHangqf5xlZ0tw2_XCUFllZxOjoXZjS3vkn0WJkXCO3jPZm1xwYo2i09WOQqNRi0N_M8eUbbp78BXl-16IwbeTL0Pesgpwi7nSjLu0TEJa4lX5SuVCWVNkuZQuK20RjKmMdzgKAdX1raiEKgKGSJhIBBfyQtEGKJr8FZmmKWH1F4PvC5BfFZklCTKLo9tM2yadtlVP5oJTQQQB5PT5_A9H-Lc7-OdcNrq7wRo8b-NUtt8o1gtY8vU6rHYcEKw1CevwbHSP-zp9CfqnoWKviP_sHYv16v4aA302DiyS7jBUEkvb88zUjk1jb8V5gxV-w85rNiHWhqaODIfvKHqtZ9FGv4LTR5ns17Bcj2u_AYyoepXvW5sqogBIjZfoNDCAkcFVGFb2IOnmU9sW35xoNn7rBTIzyUCjDHSUgZ734OP9O5MG3ePBpz-QmDQtffyyNW0HA_4fgWjpfco9M8wfRQ-2O0nq1iZM9UKDe_Cpk-7i9v_H3Xz4a2_hyfBkdKSPDo4Pt-CpoP6MWCS3Dcuzyyu_g1HTrHoTVZXBr8deG3d5DyVM |
| linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT9wwEB6VrYTgQFsoYoG2PlTiABYbx3E2xxXtipaHOLASN8vxQ0JCYcUuWvj3zDgJy7NSlWMcO8pne2bime8D-OkKnETeJDzJyx6XIgReKuk4mlcTTEbEuHSie3KqDkfy70V28aSKP2a7t0eSdU0DsTRV0_2xC_tPCt9kLjilFxDdTI_PFuCjRFtN4ddIDOa0uypqPRKJFUdDljZlM2_38cw0vdygX52URgM0_AwrjefIBjXUX-CDr1bhU6vKwJpFugrLJ49MrJM10GeG0q8iI7N3LGaQ-zt0vdl1YFEGhyFsln6YM1M5NonVDpc1e_c9u6zYmHQU6swuHL4VzbWexV3zK4yGv88PDnkjqsAthopT7tIiCWmBV-lLlQtlTT_LpXRZYfvBmNJ4V2DkSrmlVpRC9QN6iBhHBRfyvkrTdehU15XfAEbiucr3rE0VkfKnxkvcxtGlkMGV6Oh1IWm_p7YN4zgJX1zpOVcyYaARAx0x0LMu7D4-M675Nv7Zeodg0rQYsWdrmpoCfD-itdIDigYzjOhEF7ZbJHWzSidaFBhd5eiRJV3Ya9Gd335_3M3_a_4DFs9-DfXxn9OjLVgSVEARs9i2oTO9ufXf0K2Zlt_jzH0AofLtuA |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Parameterised+complexity+of+model+checking+and+satisfiability+in+propositional+dependence+logic&rft.jtitle=Annals+of+mathematics+and+artificial+intelligence&rft.au=YasirMahmood&rft.au=Meier%2C+Arne&rft.date=2022-03-01&rft.pub=Springer&rft.issn=1012-2443&rft.volume=90&rft.issue=2-3&rft.spage=271&rft_id=info:doi/10.1007%2Fs10472-021-09730-w&rft.externalDocID=A716459662 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1012-2443&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1012-2443&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1012-2443&client=summon |