TU Wien Informatics

20 Years

Role

2019

  • Backdoors to planning / Kronegger, M., Ordyniak, S., & Pfandler, A. (2019). Backdoors to planning. Artificial Intelligence, 269, 49–75. https://doi.org/10.1016/j.artint.2018.10.002
    Projects: FAIR (2013–2018) / START (2014–2022)
  • A Multiparametric View on Answer Set Programming / Fichte, J. K., Kronegger, M., & Woltran, S. (2019). A Multiparametric View on Answer Set Programming. Annals of Mathematics and Artificial Intelligence, 86(1–3), 121–147. https://doi.org/10.1007/s10472-019-09633-x
  • Parameterized Complexity of Asynchronous Border Minimization / Ganian, R., Kronegger, M., Pfandler, A., & Popa, A. (2019). Parameterized Complexity of Asynchronous Border Minimization. Algorithmica, 81(1), 201–223. https://doi.org/10.1007/s00453-018-0442-5
    Projects: FAIR (2013–2018) / START (2014–2022) / X-TRACT (2014–2018)

2017

  • A Multiparametric View on Answer Set Programming / Fichte, J., Kronegger, M., & Woltran, S. (2017). A Multiparametric View on Answer Set Programming. In Proceedings of the 10th Workshop on Answer Set Programming and Other Computing Paradigms co-located with the 14th International Conference on Logic Programming and Nonmonotonic Reasoning (ASPOCP@LPNMR’17) (pp. 1–14). http://hdl.handle.net/20.500.12708/57098
    Project: START (2014–2022)
  • Conformant planning as a case study of incremental QBF solving / Egly, U., Kronegger, M., Lonsing, F., & Pfandler, A. (2017). Conformant planning as a case study of incremental QBF solving. Annals of Mathematics and Artificial Intelligence, 80(1), 21–45. http://hdl.handle.net/20.500.12708/147186
    Projects: FAIR (2013–2018) / START (2014–2022)

2016

2015

  • Intra- and interdiagram consistency checking of behavioral multiview models / Kaufmann, P., Kronegger, M., Pfandler, A., Seidl, M., & Widl, M. (2015). Intra- and interdiagram consistency checking of behavioral multiview models. Computer Languages, Systems and Structures, 44, 72–88. https://doi.org/10.1016/j.cl.2015.08.003
    Project: FAIR (2013–2018)
  • Fixed-parameter Tractable Reductions to SAT for Planning / de Haan, R., Kronegger, M., & Pfandler, A. (2015). Fixed-parameter Tractable Reductions to SAT for Planning. In Q. Yang & M. Wooldridge (Eds.), Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence - IJCAI 2015 (pp. 2897–2903). AAAI Press. http://hdl.handle.net/20.500.12708/56184
    Project: FAIR (2013–2018)
  • Parameterized Complexity of Asynchronous Border Minimization / Ganian, R., Kronegger, M., Pfandler, A., & Popa, A. (2015). Parameterized Complexity of Asynchronous Border Minimization. In R. Jain, S. Jain, & F. Stephan (Eds.), Lecture Notes in Computer Science (pp. 428–440). Springer. https://doi.org/10.1007/978-3-319-17142-5_36
    Project: FAIR (2013–2018)
  • Variable-Deletion Backdoors to Planning / Kronegger, M., Pfandler, A., & Ordyniak, S. (2015). Variable-Deletion Backdoors to Planning. In B. Bonet & S. Koenig (Eds.), Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, January 25-30, 2015, Austin, Texas, USA (pp. 3305–3312). AAAI Press. http://hdl.handle.net/20.500.12708/56214
    Project: FAIR (2013–2018)

2014

  • Conformant Planning as a Case Study of Incremental QBF Solving / Egly, U., Kronegger, M., Lonsing, F., & Pfandler, A. (2014). Conformant Planning as a Case Study of Incremental QBF Solving. In Artificial Intelligence and Symbolic Computation (pp. 120–131). Springer. https://doi.org/10.1007/978-3-319-13770-4_11
    Projects: Boolean (2011–2019) / FAIR (2013–2018)
  • Backdoors to Planning / Kronegger, M., Pfandler, A., & Ordyniak, S. (2014). Backdoors to Planning. In C. E. Brodley & P. Stone (Eds.), Proceedings of the Twenty-Eighth AAAI Conference on Aritifical Intelligence (pp. 2300–2307). AAAI Press. http://hdl.handle.net/20.500.12708/55794
    Project: FAIR (2013–2018)
  • Backdoors to Planning / Kronegger, M., Pfandler, A., & Ordyniak, S. (2014). Backdoors to Planning. In M. R. Fellows, S. Gaspers, & T. Walsh (Eds.), Proceedings of the 2nd Workshop on the Parameterized Complexity of Computational Reasoning (PCCR) (p. 2). http://hdl.handle.net/20.500.12708/55774
    Project: FAIR (2013–2018)
  • A Parameterized Complexity Analysis of Generalized CP-Nets / Kronegger, M., Lackner, M., Pfandler, A., & Pichler, R. (2014). A Parameterized Complexity Analysis of Generalized CP-Nets. In M. R. Fellows, S. Gaspers, & T. Walsh (Eds.), Proceedings of the 2nd Workshop on the Parameterized Complexity of Computational Reasoning (PCCR) (p. 2). http://hdl.handle.net/20.500.12708/55773
    Project: FAIR (2013–2018)
  • A SAT-based Debugging Tool for State Machines and Sequence Diagrams / Kaufmann, P., Kronegger, M., Pfandler, A., Seidl, M., & Widl, M. (2014). A SAT-based Debugging Tool for State Machines and Sequence Diagrams. PUMA/RiSE Workshop, Mondsee, Austria. http://hdl.handle.net/20.500.12708/86017
  • Conformant Planning as a Case Study of Incremental QBF Solving / Egly, U., Kronegger, M., Lonsing, F., & Pfandler, A. (2014). Conformant Planning as a Case Study of Incremental QBF Solving. International Workshop on Quantified Boolean Formulas, Helsinki, EU. http://hdl.handle.net/20.500.12708/85946
    Projects: Boolean (2011–2019) / FAIR (2013–2018)
  • On the Parameterized Complexity of Generalized CP-Nets / Kronegger, M., Lackner, M., Pfandler, A., & Pichler, R. (2014). On the Parameterized Complexity of Generalized CP-Nets. Workshop on Challenges in Algorithmic Social Choice (CASC), Bad Belzig, Deutschland, EU. http://hdl.handle.net/20.500.12708/85939
    Project: FAIR (2013–2018)
  • A Parameterized Complexity Analysis of Generalized CP-Nets / Kronegger, M., Lackner, M., Pfandler, A., & Pichler, R. (2014). A Parameterized Complexity Analysis of Generalized CP-Nets. In C. E. Brodley & P. Stone (Eds.), Proceedings of the Twenty-Eighth AAAI Conference on Aritifical Intelligence (pp. 1091–1097). http://hdl.handle.net/20.500.12708/55793
    Project: FAIR (2013–2018)
  • A SAT-Based Debugging Tool for State Machines and Sequence Diagrams / Kaufmann, P., Kronegger, M., Pfandler, A., Seidl, M., & Widl, M. (2014). A SAT-Based Debugging Tool for State Machines and Sequence Diagrams. In Proceedings of the 7th International Conference on Software Language Engineering (SLE) (pp. 21–40). http://hdl.handle.net/20.500.12708/55748
    Projects: Boolean (2011–2019) / FAIR (2013–2018) / FAME (2011–2014)

2013

  • A Parameterized Complexity Analysis of Generalized CP-Nets / Kronegger, M., Lackner, M., Pfandler, A., & Pichler, R. (2013). A Parameterized Complexity Analysis of Generalized CP-Nets. In 7th Multidisciplinary Workshop on Advances in Preference Handling (p. 7). http://hdl.handle.net/20.500.12708/54788
    Project: FAIR (2013–2018)
  • The Fourth Answer Set Programming Competition: Preliminary Report / Alviano, M., Calimeri, F., Charwat, G., Dao-Tran, M., Dodaro, C., Ianni, G., Krennwallner, T., Kronegger, M., Oetsch, J., Pfandler, A., Puehrer, J., Redl, C., Ricca, F., Schneider, P., Schwengerer, M., Spendier, L., Wallner, J. P., & Xiao, G. (2013). The Fourth Answer Set Programming Competition: Preliminary Report. In P. Cabalar & T. C. Son (Eds.), 12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2013) (pp. 42–53). Springer. http://hdl.handle.net/20.500.12708/54640
    Projects: ASP (2012–2015) / HEX-Programme (2008–2012)
  • VCWC: A Versioning Competition Workflow Compiler / Charwat, G., Ianni, G., Krennwallner, T., Kronegger, M., Pfandler, A., Redl, C., Schwengerer, M., Spendier, L., Wallner, J. P., & Xiao, G. (2013). VCWC: A Versioning Competition Workflow Compiler. In T. C. Son & P. Cabalar (Eds.), 12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2013) (pp. 233–238). Springer. http://hdl.handle.net/20.500.12708/54641
    Projects: ASP (2012–2015) / HEX-Programme (2008–2012)
  • Global State Checker: Towards SAT-Based Reachability Analysis of Communicating State Machines / Kaufmann, P., Kronegger, M., Pfandler, A., Seidl, M., & Widl, M. (2013). Global State Checker: Towards SAT-Based Reachability Analysis of Communicating State Machines. In Proceedings of the 10th International Workshop on Model Driven Engineering, Verification and Validation co-located with 16th International Conference on Model Driven Engineering Languages and Systems (MODELS 2013) (pp. 31–40). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/54717
    Projects: Boolean (2011–2019) / FAIR (2013–2018) / FAME (2011–2014)
  • Conformant Planning as a Benchmark for QBF-Solvers / Kronegger, M., Pfandler, A., & Pichler, R. (2013). Conformant Planning as a Benchmark for QBF-Solvers. In International Workshop on Quantified Boolean Formulas (QBF 2013) (p. 5). http://hdl.handle.net/20.500.12708/54793
    Project: FAIR (2013–2018)
  • Parameterized Complexity of Optimal Planning: A Detailed Map / Kronegger, M., Pfandler, A., & Pichler, R. (2013). Parameterized Complexity of Optimal Planning: A Detailed Map. In F. Rossi (Ed.), Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence (pp. 954–961). AAAI Press. http://hdl.handle.net/20.500.12708/54787
    Project: FAIR (2013–2018)

2011

  • Efficient planning with QBF-solvers / Kronegger, M. (2011). Efficient planning with QBF-solvers [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/160797

 

  • A modular portfolio solver for planning / Benuska, V. (2017). A modular portfolio solver for planning [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2017.27685
    Download: PDF (2.65 MB)