Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic
Y. Mahmood, A. Meier, in: Lecture Notes in Computer Science, Springer International Publishing, Cham, 2020.
Download
No fulltext has been uploaded.
Conference Paper
| Published
| English
Author
Mahmood, YasirLibreCat;
Meier, Arne
Publishing Year
Proceedings Title
Lecture Notes in Computer Science
ISBN
LibreCat-ID
Cite this
Mahmood Y, Meier A. Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic. In: Lecture Notes in Computer Science. Springer International Publishing; 2020. doi:10.1007/978-3-030-39951-1_10
Mahmood, Y., & Meier, A. (2020). Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-030-39951-1_10
@inproceedings{Mahmood_Meier_2020, place={Cham}, title={Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic}, DOI={10.1007/978-3-030-39951-1_10}, booktitle={Lecture Notes in Computer Science}, publisher={Springer International Publishing}, author={Mahmood, Yasir and Meier, Arne}, year={2020} }
Mahmood, Yasir, and Arne Meier. “Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic.” In Lecture Notes in Computer Science. Cham: Springer International Publishing, 2020. https://doi.org/10.1007/978-3-030-39951-1_10.
Y. Mahmood and A. Meier, “Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic,” 2020, doi: 10.1007/978-3-030-39951-1_10.
Mahmood, Yasir, and Arne Meier. “Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic.” Lecture Notes in Computer Science, Springer International Publishing, 2020, doi:10.1007/978-3-030-39951-1_10.
Google Scholar
ISBN Search