[{"citation":{"mla":"Mahmood, Yasir, and Arne Meier. “Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic.” <i>Lecture Notes in Computer Science</i>, Springer International Publishing, 2020, doi:<a href=\"https://doi.org/10.1007/978-3-030-39951-1_10\">10.1007/978-3-030-39951-1_10</a>.","bibtex":"@inproceedings{Mahmood_Meier_2020, place={Cham}, title={Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-39951-1_10\">10.1007/978-3-030-39951-1_10</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer International Publishing}, author={Mahmood, Yasir and Meier, Arne}, year={2020} }","ama":"Mahmood Y, Meier A. Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic. In: <i>Lecture Notes in Computer Science</i>. Springer International Publishing; 2020. doi:<a href=\"https://doi.org/10.1007/978-3-030-39951-1_10\">10.1007/978-3-030-39951-1_10</a>","ieee":"Y. Mahmood and A. Meier, “Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic,” 2020, doi: <a href=\"https://doi.org/10.1007/978-3-030-39951-1_10\">10.1007/978-3-030-39951-1_10</a>.","apa":"Mahmood, Y., &#38; Meier, A. (2020). Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic. <i>Lecture Notes in Computer Science</i>. <a href=\"https://doi.org/10.1007/978-3-030-39951-1_10\">https://doi.org/10.1007/978-3-030-39951-1_10</a>","short":"Y. Mahmood, A. Meier, in: Lecture Notes in Computer Science, Springer International Publishing, Cham, 2020.","chicago":"Mahmood, Yasir, and Arne Meier. “Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic.” In <i>Lecture Notes in Computer Science</i>. Cham: Springer International Publishing, 2020. <a href=\"https://doi.org/10.1007/978-3-030-39951-1_10\">https://doi.org/10.1007/978-3-030-39951-1_10</a>."},"publication":"Lecture Notes in Computer Science","type":"conference","date_created":"2023-07-03T11:41:58Z","place":"Cham","publication_status":"published","date_updated":"2024-06-04T15:56:56Z","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030399504","9783030399511"]},"author":[{"id":"99353","full_name":"Mahmood, Yasir","first_name":"Yasir","last_name":"Mahmood"},{"full_name":"Meier, Arne","first_name":"Arne","last_name":"Meier"}],"year":"2020","status":"public","title":"Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic","user_id":"99353","doi":"10.1007/978-3-030-39951-1_10","publisher":"Springer International Publishing","_id":"45848","language":[{"iso":"eng"}]}]