Loading [MathJax]/extensions/tex2jax.js

Nonclassical logics: parametrised and enumeration complexity

Project: Research

Participants

  • Arne Meier (Principal Investigator)
  • Yasir Mahmood (Project staff)
  • Irena Schindler (Project staff)
21 - 29 out of 29Page size: 20

Publications

  1. 2017

  2. Published

    Parametrised complexity of satisfiability in temporal logic

    Luck, M., Meier, A. & Schindler, I., Jan 2017, In: ACM Transactions on Computational Logic. 18, 1, 1.

    Research output: Contribution to journalArticleResearchpeer review

  3. 2016

  4. Published

    Backdoors for Linear Temporal Logic

    Meier, A., Ordyniak, S., Sridharan, R. & Schindler, I., 2016, 11th International Symposium on Parameterized and Exact Computation, IPEC 2016, August 24-26, 2016, Aarhus, Denmark. Guo, J. & Hermelin, D. (eds.). Vol. 63. p. 23:1-23:17 23. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 63).

    Research output: Chapter in book/report/conference proceedingConference contributionResearchpeer review

  5. Published

    Strong Backdoors for Default Logic

    Fichte, J. K., Meier, A. & Schindler, I., 2016, Theory and Applications of Satisfiability Testing – SAT 2016 - 19th International Conference, Proceedings. Le Berre, D. & Creignou, N. (eds.). Cham, p. 45-59 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9710).

    Research output: Chapter in book/report/conference proceedingConference contributionResearchpeer review

  6. 2015

  7. Published

    A Team Based Variant of CTL.

    Krebs, A., Meier, A. & Virtema, J., 2015, 22nd International Symposium on Temporal Representation and Reasoning, TIME 2015, Kassel, Germany, September 23-25, 2015. p. 140-149

    Research output: Chapter in book/report/conference proceedingConference contributionResearchpeer review

  8. Published

    LTL Fragments are Hard for Standard Parameterisations

    Lück, M. & Meier, A., 2015, 22nd International Symposium on Temporal Representation and Reasoning, TIME 2015, Kassel, Germany, September 23-25, 2015. p. 59-68

    Research output: Chapter in book/report/conference proceedingConference contributionResearchpeer review

  9. Published

    On the parameterized complexity of non-monotonic logics.

    Meier, A., Schindler, I., Schmidt, J., Thomas, M. & Vollmer, H., 2015, In: Arch. Math. Log.. 54, 5-6, p. 685-710

    Research output: Contribution to journalArticleResearchpeer review

  10. Published

    Parallel Computational Tree Logic.

    Krebs, A., Meier, A. & Virtema, J., 2015, (CoRR).

    Research output: Working paper/PreprintTechnical reportResearch

  11. Published

    Parameterized Complexity of CTL - A Generalization of Courcelle's Theorem

    Lück, M., Meier, A. & Schindler, I., 2015, Language and Automata Theory and Applications - 9th International Conference, LATA 2015, Nice, France, March 2-6, 2015, Proceedings. Dediu, A.-H., Formenti, E., Martín-Vide, C. & Truthe, B. (eds.). Vol. 8977. p. 549-560 12 p. (Lecture Notes in Computer Science).

    Research output: Chapter in book/report/conference proceedingConference contributionResearchpeer review

  12. 2012

  13. Published

    On the Parameterized Complexity of Default Logic and Autoepistemic Logic.

    Meier, A., Schmidt, J., Thomas, M. & Vollmer, H., 2012, Language and Automata Theory and Applications: 6th International Conference, LATA 2012, A Coruña, Spain, March 5-9, 2012. Proceedings. p. 389-400

    Research output: Chapter in book/report/conference proceedingConference contributionResearchpeer review

Previous 1 2 Next