| Hecher M, Mahmood Y, Meier A and Schmidt J (2024), "Quantitative Claim-Centric Reasoning in Logic-Based Argumentation", In IJCAI. ijcai.org.
[BibTeX] |
BibTeX:
@inproceedings{DBLP:conf/ijcai/HecherMMS24,
author = {Markus Hecher and Yasir Mahmood and Arne Meier and Johannes Schmidt},
title = {Quantitative Claim-Centric Reasoning in Logic-Based Argumentation},
booktitle = {IJCAI},
publisher = {ijcai.org},
year = {2024},
note = {accepted for publication}
}
|
| Fröhlich N and Meier A (2024), "Submodel Enumeration for CTL Is Hard", In AAAI. , pp. 10517-10524. AAAI Press.
[BibTeX] |
BibTeX:
@inproceedings{DBLP:conf/aaai/FrohlichM24,
author = {Nicolas Fröhlich and Arne Meier},
title = {Submodel Enumeration for CTL Is Hard},
booktitle = {AAAI},
publisher = {AAAI Press},
year = {2024},
pages = {10517--10524}
}
|
| Fröhlich N and Meier A (2024), "Submodel Enumeration for CTL Is Hard", In AAAI. AAAI Press.
[BibTeX] |
BibTeX:
@inproceedings{fm24,
author = {Nicolas Fröhlich and Arne Meier},
title = {Submodel Enumeration for CTL Is Hard},
booktitle = {AAAI},
publisher = {AAAI Press},
year = {2024}
}
|
| Durand A, Hannula M, Kontinen J, Meier A and Virtema J (2018), "Probabilistic Team Semantics", In FoIKS. Vol. 10833, pp. 186-206. Springer.
[BibTeX] |
BibTeX:
@inproceedings{DBLP:conf/foiks/0001HKMV18,
author = {Arnaud Durand and Miika Hannula and Juha Kontinen and Arne Meier and Jonni Virtema},
title = {Probabilistic Team Semantics},
booktitle = {FoIKS},
publisher = {Springer},
year = {2018},
volume = {10833},
pages = {186--206}
}
|
| Hannula M, Hirvonen M, Kontinen J, Mahmood Y, Meier A and Virtema J (2023), "Logics with Probabilistic Team Semantics and the Boolean Negation", In JELIA. Vol. 14281, pp. 665-680. Springer.
[BibTeX] |
BibTeX:
@inproceedings{DBLP:conf/jelia/HannulaHKMMV23,
author = {Miika Hannula and Minna Hirvonen and Juha Kontinen and Yasir Mahmood and Arne Meier and Jonni Virtema},
title = {Logics with Probabilistic Team Semantics and the Boolean Negation},
booktitle = {JELIA},
publisher = {Springer},
year = {2023},
volume = {14281},
pages = {665--680}
}
|
| Hecher M, Fichte JK, Mahmood Y and Meier A (2023), "Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation", In Proc. IJCAI 2023.
[BibTeX] |
BibTeX:
@inproceedings{HKMM23,
author = {Markus Hecher and Johannes K. Fichte and Yasir Mahmood and Arne Meier},
title = {Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation},
booktitle = {Proc. IJCAI 2023},
year = {2023}
}
|
| Fröhlich N and Meier A (2022), "Submodel Enumeration of Kripke Structures in Modal Logic", In AiML. , pp. 391-406. College Publications.
[BibTeX] |
BibTeX:
@inproceedings{DBLP:conf/aiml/FrohlichM22,
author = {Nicolas Fröhlich and Arne Meier},
title = {Submodel Enumeration of Kripke Structures in Modal Logic},
booktitle = {AiML},
publisher = {College Publications},
year = {2022},
pages = {391--406}
}
|
| Gutsfeld JO, Meier A, Ohrem C and Virtema J (2022), "Temporal Team Semantics Revisited", In LICS. , pp. 44:1-44:13. ACM.
[BibTeX] |
BibTeX:
@inproceedings{DBLP:conf/lics/GutsfeldMOV22,
author = {Jens Oliver Gutsfeld and Arne Meier and Christoph Ohrem and Jonni Virtema},
title = {Temporal Team Semantics Revisited},
booktitle = {LICS},
publisher = {ACM},
year = {2022},
pages = {44:1--44:13}
}
|
| Kontinen J, Meier A and Mahmood Y (2022), "A Parameterized View on the Complexity of Dependence Logic", In LFCS. Vol. 13137, pp. 125-142. Springer.
[BibTeX] |
BibTeX:
@inproceedings{DBLP:conf/lfcs/KontinenMM22,
author = {Juha Kontinen and Arne Meier and Yasir Mahmood},
title = {A Parameterized View on the Complexity of Dependence Logic},
booktitle = {LFCS},
publisher = {Springer},
year = {2022},
volume = {13137},
pages = {125--142}
}
|
| Haak A, Meier A, Prakash O and Rao BVR (2021), "Parameterised Counting in Logspace", In STACS. Vol. 187, pp. 40:1-40:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[BibTeX] |
BibTeX:
@inproceedings{DBLP:conf/stacs/HaakM0R21,
author = {Anselm Haak and Arne Meier and Om Prakash and B. V. Raghavendra Rao},
title = {Parameterised Counting in Logspace},
booktitle = {STACS},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
year = {2021},
volume = {187},
pages = {40:1--40:17}
}
|
| Fichte JK, Hecher M, Mahmood Y and Meier A (2021), "Decomposition-Guided Reductions for Argumentation and Treewidth", In IJCAI. , pp. 1880-1886. ijcai.org.
[BibTeX] |
BibTeX:
@inproceedings{DBLP:conf/ijcai/FichteH0M21,
author = {Johannes Klaus Fichte and Markus Hecher and Yasir Mahmood and Arne Meier},
title = {Decomposition-Guided Reductions for Argumentation and Treewidth},
booktitle = {IJCAI},
publisher = {ijcai.org},
year = {2021},
pages = {1880--1886}
}
|
| Mahmood Y, Meier A and Schmidt J (2021), "Parameterized Complexity of Logic-Based Argumentation in Schaefer's Framework", In AAAI. , pp. 6426-6434. AAAI Press.
[BibTeX] |
BibTeX:
@inproceedings{DBLP:conf/aaai/0002M021,
author = {Yasir Mahmood and Arne Meier and Johannes Schmidt},
title = {Parameterized Complexity of Logic-Based Argumentation in Schaefer's Framework},
booktitle = {AAAI},
publisher = {AAAI Press},
year = {2021},
pages = {6426--6434}
}
|
| Fichte JK, Hecher M and Meier A (2021), "Knowledge-Base Degrees of Inconsistency: Complexity and Counting", In AAAI. , pp. 6349-6357. AAAI Press.
[BibTeX] |
BibTeX:
@inproceedings{DBLP:conf/aaai/FichteHM21,
author = {Johannes Klaus Fichte and Markus Hecher and Arne Meier},
title = {Knowledge-Base Degrees of Inconsistency: Complexity and Counting},
booktitle = {AAAI},
publisher = {AAAI Press},
year = {2021},
pages = {6349--6357}
}
|
| Mahmood Y and Meier A (2020), "Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic", In FoIKS. Vol. 12012, pp. 157-174. Springer.
[BibTeX] |
BibTeX:
@inproceedings{DBLP:conf/foiks/0002M20,
author = {Yasir Mahmood and Arne Meier},
title = {Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic},
booktitle = {FoIKS},
publisher = {Springer},
year = {2020},
volume = {12012},
pages = {157--174}
}
|
| Mahmood Y, Meier A and Schmidt J (2020), "Parameterised Complexity of Abduction in Schaefer's Framework", In LFCS. Vol. 11972, pp. 195-213. Springer.
[BibTeX] |
BibTeX:
@inproceedings{DBLP:conf/lfcs/0002M020,
author = {Yasir Mahmood and Arne Meier and Johannes Schmidt},
title = {Parameterised Complexity of Abduction in Schaefer's Framework},
booktitle = {LFCS},
publisher = {Springer},
year = {2020},
volume = {11972},
pages = {195--213}
}
|
| Fichte JK, Hecher M and Meier A (2019), "Counting Complexity for Reasoning in Abstract Argumentation", In AAAI. , pp. 2827-2834. AAAI Press.
[BibTeX] |
BibTeX:
@inproceedings{DBLP:conf/aaai/FichteHM19,
author = {Johannes Klaus Fichte and Markus Hecher and Arne Meier},
title = {Counting Complexity for Reasoning in Abstract Argumentation},
booktitle = {AAAI},
publisher = {AAAI Press},
year = {2019},
pages = {2827--2834}
}
|
| Krebs A, Meier A, Virtema J and Zimmermann M (2018), "Team Semantics for the Specification and Verification of Hyperproperties", In Proc. of the 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS). , pp. 10:1-10:16. LIPIcs.
[BibTeX] |
BibTeX:
@inproceedings{kmvz18,
author = {A. Krebs and A. Meier and J. Virtema and M. Zimmermann},
title = {Team Semantics for the Specification and Verification of Hyperproperties},
booktitle = {Proc. of the 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS)},
publisher = {LIPIcs},
year = {2018},
pages = {10:1--10:16}
}
|
| Meier A and Reinbold C (2018), "Enumeration Complexity of Poor Man's Propositional Dependence Logic", In Foundations of Information and Knowledge Systems - 10th International Symposium, FoIKS 2018, Budapest, Hungary, May 14-18, 2018. Proceedings. Springer.
[BibTeX] |
BibTeX:
@inproceedings{DBLP:conf/foiks/0001MR18,
author = {Arne Meier and Christian Reinbold},
editor = {Flavio Ferrarotti and Stefan Woltran},
title = {Enumeration Complexity of Poor Man's Propositional Dependence Logic},
booktitle = {Foundations of Information and Knowledge Systems - 10th International Symposium, FoIKS 2018, Budapest, Hungary, May 14-18, 2018. Proceedings},
publisher = {Springer},
year = {2018}
}
|
| Hella L, Kuusisto A, Meier A and Virtema J (2017), "Model Checking and Validity in Propositional and Modal Inclusion Logics", In 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, August 21-25, 2017 - Aalborg, Denmark. Vol. 83, pp. 32:1-32:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. |
BibTeX:
@inproceedings{DBLP:conf/mfcs/HellaKMV17,
author = {Lauri Hella and Antti Kuusisto and Arne Meier and Jonni Virtema},
editor = {Kim G. Larsen and Hans L. Bodlaender and Jean-François Raskin},
title = {Model Checking and Validity in Propositional and Modal Inclusion Logics},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, August 21-25, 2017 - Aalborg, Denmark},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
year = {2017},
volume = {83},
pages = {32:1--32:14},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2017.32},
doi = {10.4230/LIPIcs.MFCS.2017.32}
}
|
| Durand A, Hannula M, Kontinen J, Meier A and Virtema J (2016), "Approximation and Dependence via Multiteam Semantics", In Proc. FoIKS. , pp. 271-291.
[BibTeX] |
BibTeX:
@inproceedings{dhkmv16,
author = {Arnaud Durand and Mikka Hannula and Juha Kontinen and Arne Meier and Jonni Virtema},
title = {Approximation and Dependence via Multiteam Semantics},
booktitle = {Proc. FoIKS},
year = {2016},
pages = {271--291}
}
|
| Fichte JK, Meier A and Schindler I (2016), "Strong Backdoors for Default Logic", In Proc. SAT. , pp. 45-59.
[BibTeX] |
BibTeX:
@inproceedings{fms16,
author = {Johannes K. Fichte and Arne Meier and Irena Schindler},
title = {Strong Backdoors for Default Logic},
booktitle = {Proc. SAT},
year = {2016},
pages = {45--59}
}
|
| Meier A, Ordyniak S, Ramanujan MS and Schindler I (2016), "Backdoors for Linear Temporal Logic", In Proc. IPEC.
[BibTeX] |
BibTeX:
@inproceedings{mors16,
author = {Arne Meier and Sebastian Ordyniak and M. S. Ramanujan and Irena Schindler},
title = {Backdoors for Linear Temporal Logic},
booktitle = {Proc. IPEC},
year = {2016},
note = {Invited to Algorithmica Special Issue}
}
|
| Lück M and Meier A (2015), "LTL Fragments are Hard for Standard Parameterisations", In 22nd International Symposium on Temporal Representation and Reasoning. , pp. 59-68.
[BibTeX] |
BibTeX:
@inproceedings{lm15,
author = {Martin Lück and Arne Meier},
title = {LTL Fragments are Hard for Standard Parameterisations},
booktitle = {22nd International Symposium on Temporal Representation and Reasoning},
year = {2015},
pages = {59-68}
}
|
| Krebs A, Meier A and Mundhenk M (2015), "The model checking fingerprints of CTL operators", In 22nd International Symposium on Temporal Representation and Reasoning. , pp. 101-110.
[BibTeX] |
BibTeX:
@inproceedings{kmm15,
author = {Andreas Krebs and Arne Meier and Martin Mundhenk},
title = {The model checking fingerprints of CTL operators},
booktitle = {22nd International Symposium on Temporal Representation and Reasoning},
year = {2015},
pages = {101-110}
}
|
| Krebs A, Meier A and Virtema J (2015), "A Team Based Variant of CTL", In Proc. 22nd International Symposium on Temporal Representation and Reasoning. , pp. 140-149.
[BibTeX] |
BibTeX:
@inproceedings{kmv15,
author = {Andreas Krebs and Arne Meier and Jonni Virtema},
title = {A Team Based Variant of CTL},
booktitle = {Proc. 22nd International Symposium on Temporal Representation and Reasoning},
year = {2015},
pages = {140-149}
}
|
| Hella L, Kuusisto A, Meier A and Vollmer H (2015), "Modal Inclusion Logic: Being Lax is Simpler than Being Strict", In Proc. of the 40th International Symposium on Mathematical Foundations of Compter Science. , pp. 281-292.
[BibTeX] |
BibTeX:
@inproceedings{lkmv15,
author = {Lauri Hella and Antti Kuusisto and Arne Meier and Heribert Vollmer},
title = {Modal Inclusion Logic: Being Lax is Simpler than Being Strict},
booktitle = {Proc. of the 40th International Symposium on Mathematical Foundations of Compter Science},
year = {2015},
pages = {281-292}
}
|
| Creignou N, Ktari R, Meier A, Müller J-S, Olive F and Vollmer H (2015), "Parameterized Enumeration for Modification Problems", In Proc. 9th International Conference on Language and Automata Theory and Applications LATA. , pp. 524-536.
[BibTeX] |
BibTeX:
@inproceedings{ckmmov15,
author = {Nadia Creignou and Ra\ida Ktari and Arne Meier and Julian-Steffen Müller and Frédéric Olive and Heribert Vollmer},
title = {Parameterized Enumeration for Modification Problems},
booktitle = {Proc. 9th International Conference on Language and Automata Theory and Applications LATA},
year = {2015},
pages = {524-536}
}
|
| Lück M, Meier A and Schindler I (2015), "Parameterized Complexity of CTL: A Generalization of Courcelle's Theorem", In Proc. 9th International Conference on Language and Automata Theory and Applications LATA. , pp. 549-560.
[BibTeX] |
BibTeX:
@inproceedings{lms15,
author = {Martin Lück and Arne Meier and Irina Schindler},
title = {Parameterized Complexity of CTL: A Generalization of Courcelle's Theorem},
booktitle = {Proc. 9th International Conference on Language and Automata Theory and Applications LATA},
year = {2015},
pages = {549-560}
}
|
| Creignou N, Meier A, Müller J-S, Schmidt J and Vollmer H (2013), "Paradigms for Parameterized Enumeration", In Proc. 38th MFCS 2013, LNCS. Vol. 8087, pp. 290-301. |
BibTeX:
@inproceedings{Nadia-Creignou:2013uq,
author = {Nadia Creignou and Arne Meier and Julian-Steffen Müller and Johannes Schmidt and Heribert Vollmer},
title = {Paradigms for Parameterized Enumeration},
booktitle = {Proc. 38th MFCS 2013, LNCS},
year = {2013},
volume = {8087},
pages = {290--301},
doi = {10.1007/978-3-642-40313-2_27}
}
|
| Ebbing J, Hella L, Meier A, Müller J-S, Virtema J and Vollmer H (2013), "Extended Modal Dependence Logic EMDL", In Proc. 20th WoLLIC, LNCS. Vol. 8071, pp. 126-137.
[BibTeX] |
BibTeX:
@inproceedings{Ebbing:2013fk,
author = {Johannes Ebbing and Lauri Hella and Arne Meier and Julian-Steffen Müller and Jonni Virtema and Heribert Vollmer},
title = {Extended Modal Dependence Logic EMDL},
booktitle = {Proc. 20th WoLLIC, LNCS},
year = {2013},
volume = {8071},
pages = {126--137}
}
|
| Göller S, Meier A, Mundhenk M, Schneider T, Thomas M and Weiss F (2012), "The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers", In Proc. Advances in Modal Logic. , pp. 261-278.
[BibTeX] |
BibTeX:
@inproceedings{Goller:2012fk,
author = {Stefan Göller and Arne Meier and Martin Mundhenk and Thomas Schneider and Michael Thomas and Felix Weiss},
title = {The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers},
booktitle = {Proc. Advances in Modal Logic},
year = {2012},
pages = {261-278}
}
|
| Meier A (2012), "Generalized Complexity of ALC Subsumption", In Proc. 10th International Workshop on Boolean Problems.
[BibTeX] |
BibTeX:
@inproceedings{m12,
author = {Arne Meier},
title = {Generalized Complexity of ALC Subsumption},
booktitle = {Proc. 10th International Workshop on Boolean Problems},
year = {2012}
}
|
| Meier A, Mundhenk M, Schneider T, Thomas M and Weiss F (2010), "The Complexity of Satisfiability for Fragments of Hybrid Logic -- Part II", In Proc. of the International Workshop on Hybrid Logic and Applications (HyLo 2010).
[BibTeX] |
BibTeX:
@inproceedings{MeMuScThWe10,
author = {Arne Meier and Martin Mundhenk and Thomas Schneider and Michael Thomas and Felix Weiss},
title = {The Complexity of Satisfiability for Fragments of Hybrid Logic -- Part II},
booktitle = {Proc. of the International Workshop on Hybrid Logic and Applications (HyLo 2010)},
year = {2010}
}
|
| Beyersdorff O, Meier A, Mundhenk M, Vollmer H, Schneider T and Thomas M (2009), "Model Checking CTL is Almost Always Inherently Sequential", In Proc. of the 16th International Symposium on Temporal Representation and Reasoning. , pp. 21-28.
[BibTeX] |
BibTeX:
@inproceedings{MeBeMuVoScTh09,
author = {Olaf Beyersdorff and Arne Meier and Martin Mundhenk and Heribert Vollmer and Thomas Schneider and Michael Thomas},
title = {Model Checking CTL is Almost Always Inherently Sequential},
booktitle = {Proc. of the 16th International Symposium on Temporal Representation and Reasoning},
year = {2009},
pages = {21--28}
}
|
| Beyersdorff O, Meier A, Thomas M and Vollmer H (2009), "The Complexity of Reasoning for Fragments of Default Logic", In Theory and Applications of Satisfiability Testing - SAT 2009. , pp. 51-64. Springer.
[BibTeX] |
BibTeX:
@inproceedings{BeMeThVo09,
author = {Olaf Beyersdorff and Arne Meier and Michael Thomas and Heribert Vollmer},
title = {The Complexity of Reasoning for Fragments of Default Logic},
booktitle = {Theory and Applications of Satisfiability Testing - SAT 2009},
publisher = {Springer},
year = {2009},
pages = {51--64}
}
|
| Meier A, Mundhenk M, Schneider T, Thomas M, Weber V and Weiss F (2009), "The Complexity of Satisfiability for Fragments of Hybrid Logic -- Part I", In Proc. of the 34th International Symposium on Mathematical Foundations of Computer Science. , pp. 587-599.
[BibTeX] |
BibTeX:
@inproceedings{MeMuScThWeWe09,
author = {Arne Meier and Martin Mundhenk and Thomas Schneider and Michael Thomas and Volker Weber and Felix Weiss},
title = {The Complexity of Satisfiability for Fragments of Hybrid Logic -- Part I},
booktitle = {Proc. of the 34th International Symposium on Mathematical Foundations of Computer Science},
year = {2009},
pages = {587--599}
}
|
| Meier A and Schneider T (2010), "The Complexity of Satisfiability for Sub-Boolean Fragments of ALC", In Proc. of the 23rd International Workshop on Description Logics (DL 2010). Waterloo, Canada , pp. 279-290.
[BibTeX] |
BibTeX:
@inproceedings{mesc10,
author = {Arne Meier and Thomas Schneider},
editor = {Haarslev, V and Toman, D and Weddell, G},
title = {The Complexity of Satisfiability for Sub-Boolean Fragments of ALC},
booktitle = {Proc. of the 23rd International Workshop on Description Logics (DL 2010)},
year = {2010},
pages = {279--290}
}
|
| Meier A, Schmidt J, Thomas M and Vollmer H (2012), "On the Parameterized Complexity of Default Logic and Autoepistemic Logic", In 6th International Conference on Language and Automata Theory and Applications. Vol. 7183, pp. 389-400.
[BibTeX] |
BibTeX:
@inproceedings{mstv12,
author = {Arne Meier and Johannes Schmidt and Michael Thomas and Heribert Vollmer},
title = {On the Parameterized Complexity of Default Logic and Autoepistemic Logic},
booktitle = {6th International Conference on Language and Automata Theory and Applications},
year = {2012},
volume = {7183},
pages = {389--400}
}
|
| Meier A, Mundhenk M, Thomas M and Vollmer H (2008), "The Complexity of Satisfiability for Fragments of CTL and CTL*", In Electronic Notes in Theoretical Computer Science. , pp. 201-213.
[BibTeX] |
BibTeX:
@inproceedings{MeMuThVo08,
author = {Arne Meier and Martin Mundhenk and Michael Thomas and Heribert Vollmer},
title = {The Complexity of Satisfiability for Fragments of CTL and CTL*},
booktitle = {Electronic Notes in Theoretical Computer Science},
year = {2008},
pages = {201--213}
}
|
| Meier A and Schneider T (2011), "Generalized Satisfiability for the Description Logic ALC", In Proceedings of the 8th Annual Conference on Theory and Application of Models of Computation. , pp. 552-562. Springer Verlag.
[BibTeX] |
BibTeX:
@inproceedings{Meier2011,
author = {Arne Meier and Thomas Schneider},
title = {Generalized Satisfiability for the Description Logic ALC},
booktitle = {Proceedings of the 8th Annual Conference on Theory and Application of Models of Computation},
publisher = {Springer Verlag},
year = {2011},
pages = {552--562}
}
|
| Beyersdorff O, Meier A, Müller S, Thomas M and Vollmer H (2010), "Proof Complexity of Propositional Default Logic", In Proc. of the 13rd International Conference on Theory and Applications of Satisfiability Testing. , pp. 30-43. Springer-Verlag.
[BibTeX] |
BibTeX:
@inproceedings{BeMeMuThVo10,
author = {Olaf Beyersdorff and Arne Meier and Sebastian Müller and Michael Thomas and Heribert Vollmer},
title = {Proof Complexity of Propositional Default Logic},
booktitle = {Proc. of the 13rd International Conference on Theory and Applications of Satisfiability Testing},
publisher = {Springer-Verlag},
year = {2010},
pages = {30--43}
}
|