TU Home
Diese Publikationsliste wurde automatisch aus den Publikationsdaten der Fakultät für Informatik erstellt. Wenn Sie komplexere Suchabfragen vornehmen wollen, rufen Sie bitte die Seite "Publikationen der Fakultät" direkt auf, oder verwenden Sie die globale Suchfunktion der Publikationsdatenbank der Technischen Universität Wien!

 Publikationsdatenbank Home  

Publikationsliste für Angehörige von
E192 - Institut für Logic and Computation
als Autorinnen / Autoren bzw. wesentlich beteiligte Personen

4908 Datensätze (1993 - 2022)

Die Publikationen der Fakultät für Informatik sind erst ab dem Jahr 2002 vollzählig in der Publikationsdatenbank enthalten. Publikationen aus den Jahren vor 2002 können, müssen aber nicht in der Datenbank vorhanden sein.


Bücher und Buch-Herausgaben

  1. Autor/innen: Salvador Abreu; Johannes Oetsch, E192-03; Joerg Puehrer, E192-03; Dietmar Seipel; Hans Tompits, E192-03; Masanobu Umeda; Armin Wolf

     S. Abreu, J. Oetsch, J. Puehrer, D. Seipel, H. Tompits, M. Umeda, A. Wolf (Hrg.):
    "Proceedings of the 19th International Conference on Applications of Declarative Programming and Knowledge Management (INAP 2011) and 25th Workshop on Logic Programming (WLP 2011)";
    TU Wien, Wien, 2011, 290 S.
  2. Autor/innen: Elvira Albert; Laura Kovacs, E192-04

     E Albert, L. Kovacs (Hrg.):
    "Proceedings of the 23rd International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR-23)";
    EasyChair EPiC Series in Computing, Alicante, Spain, 2020, ISSN: 2398-7340; 516 S.
  3. Autor/innen: Alexander Artikis; Thomas Eiter, E192-03; Alessandro Margara; Stijn Vansummeren
    Andere beteiligte Person: Schloss Dagstuhl

     A. Artikis, T. Eiter, A. Margara, S. Vansummeren:
    "Foundations of Composite Event Recognition (Dagstuhl Seminar 20071)";
    in Buchreihe "Dagstuhl Reports", Buchreihen-Herausgeber: Schloss Dagstuhl; Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, 2020, ISSN: 2192-5283, 31 S.

    Zusätzliche Informationen
  4. Autor/innen: Franz Baader; Gerd Brewka; Thomas Eiter, E192-03

     F. Baader, G. Brewka, T. Eiter (Hrg.):
    "The European Journal on Artificial Intelligence (AI Communications), vol. 15, no. 1: Special issue on KI-2001";
    IOS Press, 2002, ISBN: 3-540-42612-4.
  5. Autor/innen: Matthias Baaz, E104-02; Alexander Leitsch, E192-05

     M. Baaz, A. Leitsch:
    "Methods of cut-elimination";
    Springer Verlag, 2011, ISBN: 978-94-007-0319-3; 287 S.
  6. Autor/innen: Marcello Balduccini; Yuliya Lierler; Stefan Woltran, E192-02
    Andere beteiligte Personen: G. Goos; J. Hartmanis; J. van Leeuwen

     M. Balduccini, Y. Lierler, S. Woltran:
    "Logic Programming and Nonmonotonic Reasoning - 15th International Conference, LPNMR 2019";
    in Buchreihe "Logic Programming and Nonmonotonic Reasoning", Buchreihen-Herausgeber: G. Goos, J. Hartmanis, J. van Leeuwen; herausgegeben von: Springer International Publishing; Springer LNCS, 2019, ISBN: 978-3-030-20527-0, 348 S.
  7. Autor/innen: Chitta Baral; Giuseppe De Giacomo; Thomas Eiter, E192-03

     C. Baral, G. De Giacomo, T. Eiter (Hrg.):
    "Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, KR 2014, Vienna, Austria, July 20-24, 2014";
    AAAI Press, California, USA, 2014, ISBN: 978-1-57735-657-8; 714 S.
  8. Autor/innen: Arnold Beckmann, E192-05; Jan Johannsen

     A. Beckmann, J Johannsen:
    "Bounded Arithmetic and Resolution-Based Proof Systems";
    Kurt Gödel Society, Wien, 2004, ISBN: 3-901546-02-2; 130 S.
  9. Autor/innen: Michael A. Bekos; Benjamin Niedermann; Martin Nöllenburg, E192-01

     M. Bekos, B. Niedermann, M. Nöllenburg:
    "External Labeling: Fundamental Concepts and Algorithmic Techniques";
    Morgan & Claypool, 2021, ISBN: 9781636392042; 130 S.

    Zusätzliche Informationen
  10. Autor/innen: Hans-Georg Beyer; Günther Raidl, E192-01

     H. Beyer, G. Raidl et al. (Hrg.):
    "GECCO: Genetic And Evolutionary Computation Conference Conference Proceedings";
    ACM Press, 2005, ISBN: 1-59593-038-8; 2229 S.
  11. Autor/innen: Olaf Beyersdorff; Uwe Egly, E192-03; Meena Mahajan; Claudia Nalon
    Andere beteiligte Person: Schloss Dagstuhl

     O. Beyersdorff, U. Egly, M. Mahajan, C. Nalon:
    "SAT and Interactions (Dagstuhl Seminar 20061)";
    in Buchreihe "Dagstuhl Reports", Buchreihen-Herausgeber: Schloss Dagstuhl; Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, 2020, ISSN: 2192-5283, 18 S.
  12. Autor/innen: Meghyn Bienvenu; M.Magdalena Ortiz de la Fuente, E192-03; Riccardo Rosati; Mantas Simkus, E192-02

     M. Bienvenu, M. Ortiz de la Fuente, R. Rosati, M. Simkus (Hrg.):
    "Informal Proceedings of the 27th International Workshop on Description Logics";
    CEUR-Proceedings, Vol. 1193. Aachen, Deutschland, 2014, ISSN: 1613-0073; 756 S.
  13. Autor/innen: Maria José Blesa; Christian Blum; Günther Raidl, E192-01; Andrea Roli; Michael Sampels

     M. Blesa, C. Blum, G. Raidl, A. Roli, M. Sampels (Hrg.):
    "Hybrid Metaheuristics, 7th Int. Workshop, HM 2010";
    Springer, 2010, ISBN: 978-3642160530.
  14. Autor/innen: Roderick Bloem; Swen Jacobs, TU Graz; Ayrat Khalimov, TU Graz; Igor Konnov, E192; Sasha Rubin, E192-04; Helmut Veith, E192-04; Josef Widder, E191-02

     R. Bloem, S. Jacobs, A. Khalimov, I. Konnov, S. Rubin, H. Veith, J. Widder:
    "Decidability of Parameterized Verification";
    Morgan & Claypool Publishers, San Rafael, CA, USA, 2015, ISBN: 9781627057431; 170 S.
  15. Autor/innen: Christian Blum; Günther Raidl, E192-01

     C. Blum, G. Raidl (Hrg.):
    "Hybrid Metaheuristics -- Powerful Tools for Optimization";
    Springer, 2016, ISBN: 978-3-319-30883-8; 172 S.
  16. Autor/innen: Fernando Bobillo; Rommel Carvalho; Paulo C. G. da Costa; Claudia d´Amato; Nicola Fanizzi; Kathryn B. Laskey; Kenneth J. Laskey; Thomas Lukasiewicz, E192-03; Trevor Martin; Matthias Nickles; Michael Pool

     F. Bobillo, R. Carvalho, P. da Costa, C. d´Amato, N. Fanizzi, K.B. Laskey, K.J. Laskey, T. Lukasiewicz, T. Martin, N. Nickles, M. Pool (Hrg.):
    "Proceedings of the 6th International Workshop on Uncertainty Reasoning for the Semantic Web (URSW 2010)";
    CEUR-Proceedings, Aachen, Vol. 654, 2010, ISSN: 1613-0073; 112 S.
  17. Autor/innen: Fernando Bobillo; Paulo Costa; Nicola Fanizzi; Francis Fung; Thomas Lukasiewicz, E192-03; Trevor Martin; Matthias Nickles; Yun Peng; Michael Pool; Pavel Smrz; Peter Vojt

     F. Bobillo, P. Costa, N. Fanizzi, F. Fung, T. Lukasiewicz, T. Martin, N. Nickles, Y. Peng, M. Pool, S. Smrz, P. Vojt (Hrg.):
    "Proceedings of the ISWC-2007 Workshop on Uncertainty Reasoning for the Semantic Web (URSW 2007).";
    CEUR-Proceedings, 2007, ISSN: 1613-0073; 137 S.
  18. Autor/innen: Fernando Bobillo; Paulo C. G. da Costa; Claudia d´Amato; Nicola Fanizzi; Kathryn B. Laskey; Kenneth J. Laskey; Thomas Lukasiewicz, E192-03; Trevor Martin; Matthias Nickles; Michael Pool; Pavel Smrz

     F. Bobillo, P. da Costa, C. d´Amato, N. Fanizzi, K.B. Laskey, K.J. Laskey, T. Lukasiewicz, T. Martin, N. Nickles, M. Pool, S. Smrz (Hrg.):
    "Proceedings of the 4th International Workshop on Uncertainty Reasoning for the Semantic Web (URSW 2008). Volume 423 of CEUR Workshop Proceedings";
    CEUR-WS.org, 2008, ISSN: 1613-0073; 145 S.
  19. Autor/innen: Fernando Bobillo; Paulo C. G. da Costa; Claudia d´Amato; Nicola Fanizzi; Kathryn B. Laskey; Kenneth J. Laskey; Thomas Lukasiewicz, E192-03; Trevor Martin; Matthias Nickles; Michael Pool; Pavel Smrz

     F. Bobillo, P. da Costa, C. d´Amato, N. Fanizzi, K.B. Laskey, K.J. Laskey, T. Lukasiewicz, T. Martin, N. Nickles, M. Pool, S. Smrz (Hrg.):
    "Proceedings of the Fifth International Workshop on Uncertainty Reasoning for the Semantic Web (URSW 2009)";
    CEUR-Proceedings, Aachen, Vol. 527, 2009, ISSN: 1613-0073; 88 S.
  20. Autor/innen: Henning Bordihn; Rudolf Freund, E192-05
    Andere beteiligte Personen: Gerhard Chroust; G. Kotis

     H. Bordihn, R. Freund et al.:
    "Second Workshop on Non-Classical Models for Automata and Applications (NCMA 2010)";
    in Buchreihe "Books@ocg.at", Buchreihen-Herausgeber: G Chroust, G. Kotis et al.; Österreichische Computer Gesellschaft, 2010, ISBN: 978-3-85403-263-2.
  21. Autor/innen: Gerd Brewka; Thomas Eiter, E192-03; Sheila McIlraith

     G. Brewka, T. Eiter, S. McIlraith (Hrg.):
    "Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference, KR 2012";
    AAAI Press, Menlo Park, California, U.S.A., 2012, ISBN: 978-1-57735-560-1; 676 S.
  22. Autor/innen: Ricardo Caferra; Alexander Leitsch, E192-05; Nicolas Peltier

     R. Caferra, A. Leitsch, N. Peltier:
    "Automated Model Building";
    Kluwer Academic Publishers, Dordrecht, The Netherlands, 2004, ISBN: 1-4020-2652-8; 341 S.
  23. Autor/innen: Christian S. Calude; José Félix Costa; Rudolf Freund, E192-05; Marion Oswald, E192-05; Grzegorz Rozenberg

     C. Calude, J.F. Costa, R. Freund, M. Oswald, G. Rozenberg (Hrg.):
    "Unconventional Computing - 7th International Conference, UC 2008 Vienna, Austria, August 25-28, 2008. Proceedings";
    Springer LNCS, Berlin / Heidelberg, 2008, ISBN: 978-3-540-85193-6; 259 S.
  24. Autor/innen: Andres Cano; Fabio G. Cozman; Thomas Lukasiewicz, E192-03

     A. Cano, F. Cozman, T. Lukasiewicz (Hrg.):
    "Special Issue on Imprecise Probabilities, International Journal of Approximate Reasoning 44 (3).";
    Elsevier Science Publishers, Amsterdam, The Netherlands, 2007, ISSN: 0888-613x; 190 S.
  25. Autor/innen: Bernadette Charron-Bost; Andrey Rybalchenko; Stephan Merz, INRIA, Nancy, France; Josef Widder, E192-04
    Andere beteiligte Person: Schloss Dagstuhl

     B. Charron-Bost, A. Rybalchenko, S. Merz, J. Widder:
    "Formal Verification of Distributed Algorithms (Dagstuhl Seminar 13141)";
    in Buchreihe "Dagstuhl Reports", Buchreihen-Herausgeber: Schloss Dagstuhl; herausgegeben von: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik; Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, Dagstuhl, Deutschland, 2013, ISSN: 2192-5283, 16 S.
  26. Autor/innen: Hana Chockler, IET; Georg Weissenbacher, E192-04

     H. Chockler, G. Weissenbacher (Hrg.):
    "Computer Aided Verification 2018 - Part I";
    Springer, 2018, ISBN: 978-3-319-96144-6.

    Zusätzliche Informationen
  27. Autor/innen: Hana Chockler, IET; Georg Weissenbacher, E192-04

     H. Chockler, G. Weissenbacher (Hrg.):
    "Computer Aided Verification 2018 - Part II";
    Springer, 2018, ISBN: 978-3-319-96141-5.

    Zusätzliche Informationen
  28. Autor/innen: Petr Cintula, E104-02; Christian Fermüller, E192-05; Lluis Godo; Petr Hajek

     P. Cintula, C. Fermüller, L. Godo, P. Hajek (Hrg.):
    "Understanding Vagueness. Logical, Philosophical and Linguistic Perspectives";
    College Publications, London, 2011, ISBN: 978-1-84890-037-0.
  29. Autor/innen: Petr Cintula; Christian Fermüller, E192-05; Carles Noguera
    Andere beteiligte Person: Sergei Artemov

     P. Cintula, C. Fermüller, C. Noguera:
    "Handbook of Mathematical Fuzzy Logic, Volume 3";
    in Buchreihe "Mathematical Logic and Foundations", Buchreihen-Herausgeber: S. Artemov et al.; College Publications, 2015, ISBN: 978-1-84890-193-3.
  30. Autor/innen: Madalina Croitoru; Sebastian Rudolph; Stefan Woltran, E192-03; Christophe Gonzales

     M. Croitoru, S. Rudolph, S. Woltran, C. Gonzales (Hrg.):
    "Graph Structures for Knowledge Representation and Reasoning - Third International Workshop, GKR 2013, Beijing, China, August 3, 2013. Revised Selected Papers";
    Springer, 2014, ISBN: 978-3-319-04533-7; 210 S.
  31. Autor/innen: Erzsébet Csuhaj-Varjú; Rudolf Freund, E192-05; Marion Oswald, E192-05; Kai Salomaa

     E. Csuhaj-Varjú, R. Freund, M. Oswald, K. Salomaa (Hrg.):
    "International Workshop on Computing with Biomolecules";
    Österreichische Computer Gesellschaft, Wien, 2008, ISBN: 978-3-85403-244-1; 101 S.
  32. Autor/innen: Paulo C. G. da Costa; Claudia d´Amato; Nicola Fanizzi; Kathryn B. Laskey; Kenneth J. Laskey; Thomas Lukasiewicz, E192-03; Matthias Nickles; Michael Pool

     P. da Costa, C. d´Amato, N. Fanizzi, K.B. Laskey, K.J. Laskey, T. Lukasiewicz, N. Nickles, M. Pool (Hrg.):
    "Uncertainty Reasoning for the Semantic Web I. Volume 5327 of Lecture Notes in Computer Science";
    Springer LNCS, Berlin / Heidelberg, 2008, ISBN: 978-3-540-89764-4; 403 S.
  33. Autor/innen: Marina De Vos; Thomas Eiter, E192-03; Yuliya Lierler; Francesca Toni
    Andere beteiligte Personen: Marina De Vos; Thomas Eiter, E192-03; Yuliya Lierler; Francesca Toni

     M. De Vos, T. Eiter, Y. Lierler, F. Toni:
    "Proceedings of the Technical Communications of the 31st International Conference on Logic Programming (ICLP 2015)";
    in Buchreihe "CEUR Workshop Proceedings", Buchreihen-Herausgeber: M. De Vos, T. Eiter, Y. Lierler, F. Toni; CEUR-WS.org, 2015, ISSN: 1613-0073.
  34. Autor/innen: Daniele Dell´Aglio, IFI; Darko Anicic; Payam Barnaghi; Emanuele Della Valle; Deborah McGuinness; Loris Bozzato; Thomas Eiter, E192-03; Martin Homola; Daniele Porello

     D. Dell´Aglio, D. Anicic, P. Barnaghi, E. Della Valle, D. McGuinness, L. Bozzato, T. Eiter, M. Homola, D. Porello (Hrg.):
    "Joint Proceedings of the Web Stream Processing workshop (WSP 2017) and the 2nd International Workshop on Ontology Modularity, Contextuality, and Evolution (WOMoCoE 2017) co-located with 16th International Semantic Web Conference (ISWC 2017), Vienna, Austria, October 22nd, 2017";
    CEUR-WS.org, 2017, ISSN: 1613-0073; 113 S.
  35. Autor/innen: Daniele Dell´Aglio, IFI; Emanuele Della Valle; Thomas Eiter, E192-03; Markus Krötzsch; Maria Maleshkova; Ruben Verborgh; Federico Michele Facca, CREATE-NET; Michael Mrissa

     D. Dell´Aglio, E. Della Valle, T. Eiter, M. Krötzsch, M. Maleshkova, R. Verborgh, F. Facca, M. Mrissa (Hrg.):
    "Joint Proceedings of the 3rd Stream Reasoning (SR 2016) and the 1st Semantic Web Technologies for the Internet of Things (SWIT 2016) workshops co-located with 15th International Semantic Web Conference (ISWC 2016)";
    CEUR-WS.org, Aachen, 2016, ISSN: 1613-0073; 99 S.
  36. Autor/innen: Jürgen Dorn, E192-02; Karl Anton Froeschl

     J. Dorn, K.A. Froeschl (Hrg.):
    "Scheduling of Production Processes";
    Ellis Horwood, Chichester, 1993.
  37. Autor/innen: Uwe Egly, E192-03; Christian Fermüller, E192-05

     U. Egly, C. Fermüller (Hrg.):
    "Proceedings of the Eleventh Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX-02)";
    Springer, 2002, ISBN: 3-540-43929-3; 340 S.
  38. Autor/innen: Thomas Eiter, E192-03; Adil El Ghali; Sergio Fernández; Stijn Heymans, E192-03; Thomas Krennwallner, E192-03; François Lévy

     T. Eiter, A. El Ghali, S. Fernández, S. Heymans, T. Krennwallner, F. Lévy (Hrg.):
    "BuRO 2010: 1st International Workshop on Business Models, Business Rules and Ontologies, 21 September 2010, Proceedings";
    Ontorule Project, 2010, 50 S.

    Zusätzliche Informationen
  39. Autor/innen: Thomas Eiter, E192-03; Enrico Franconi; Ralph Hodgson; Michael Kifer; Susie Stephens

     T. Eiter, E. Franconi, R. Hodgson, M. Kifer, S. Stephens (Hrg.):
    "Proceedings of the Second International Conference on Rules and Rule Markup Languages for the Semantic Web";
    IEEE Computer Society Press, Los Alamitos, California, USA, 2006, ISBN: 0-7695-2652-7; 128 S.
  40. Autor/innen: Thomas Eiter, E192-03; Enrico Franconi; Michael Kifer

     T. Eiter, E. Franconi, M. Kifer (Hrg.):
    "Special issue on RuleML 2006. Fundamenta Informaticae Volume 82, number 3";
    IOS Press, 2008, ISSN: 0169-2968; 98 S.
  41. Autor/innen: Thomas Eiter, E192-03; Birte Glimm; Yevgeny Kazakov; Markus Krötzsch
    Andere beteiligte Person: Manfred Jeusfeld

     T. Eiter, B. Glimm, Y. Kazakov, M. Krötzsch:
    "Informal Proceedings of the 26th International Workshop on Description Logics";
    in Buchreihe "CEUR Workshop Proceedings", Buchreihen-Herausgeber: M. Jeusfeld; CEUR-WS.org, 2013, ISSN: 1613-0073.
  42. Autor/innen: Thomas Eiter, E192-03; Thomas Krennwallner, E192-03

     T. Eiter, T. Krennwallner (Hrg.):
    "Reasoning Web: Semantic Technologies for Advanced Query Answering";
    Springer LNCS 7487, Heidelberg, 2012, ISBN: 978-3-642-33157-2; 386 S.

    Zusätzliche Informationen
  43. Autor/innen: Thomas Eiter, E192-03; Leonid Libkin

     T. Eiter, L. Libkin (Hrg.):
    "Database Theory. Theoretical Computer Science. Volume 371, Issue 3, Pages 147-264";
    Elsevier Science Publishers, Meppel, The Netherlands, 2007, ISSN: 0304-3975; 117 S.
  44. Autor/innen: Thomas Eiter, E192-03; Leonid Libkin

     T. Eiter, L. Libkin (Hrg.):
    "Proceedings of the 10th International Conference on Database Theory (ICDT 2005)";
    Springer, LNCS 3363, 2005, ISBN: 3-540-24288-0.
  45. Autor/innen: Thomas Eiter, E192-03; Marco Maratea; Mauro Vallati
    Andere beteiligte Person: Damian Niwinski

     T. Eiter, M. Maratea, M. Vallati:
    "Special issue of the 25th RCRA International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion";
    in Buchreihe "Fundamenta Informaticae", Buchreihen-Herausgeber: D. Niwinski; IOS Press, 2020, ISSN: 1875-8681.

    Zusätzliche Informationen
  46. Autor/innen: Thomas Eiter, E192-03; David Sands

     T. Eiter, D. Sands (Hrg.):
    "LPAR-21, 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Maun, Botswana, May 7-12, 2017. EPiC Series in Computing 46";
    EasyChair EPiC Series in Computing, 2017, ISSN: 2398-7340.
  47. Autor/innen: Thomas Eiter, E192-03; David Sands; Geoff Sutcliffe, University of Miami; Andrei Voronkov

     T. Eiter, D. Sands, G. Sutcliffe, A. Voronkov (Hrg.):
    "IWIL@LPAR 2017 Workshop and LPAR-21 Short Presentations, Maun, Botswana, May 7-12, 2017. Kalpa Publications in Computing, Volume 1";
    EasyChair, 2017, ISSN: 2515-1762; 134 S.
  48. Autor/innen: Thomas Eiter, E192-03; K.-D. Schewe

     T. Eiter, K. Schewe (Hrg.):
    "Annals of Mathematics and Artificial Intelligence (AMAI), vol. 40, no. 1-2: Special issue on FOIKS-2002";
    Kluwer Academic Publishers, 2004, ISSN: 1012-2443.
  49. Autor/innen: Thomas Eiter, E192-03; K.-D. Schewe

     T. Eiter, K. Schewe (Hrg.):
    "Proceedings of the 2nd International Symposium on Foundations of Information and Knowledge Systems (FoIKS 2002), Salzau Castle, Germany";
    Springer, 2002, ISBN: 3-540-43220-5.
  50. Autor/innen: Thomas Eiter, E192-03; Hannes Strass; Miroslaw Truszczynski; Stefan Woltran, E192-02
    Andere beteiligte Personen: Randy Goebel, University of Al ...; Yuzuru Tanaka, Hokkaido University; Wolfgang Wahlster, Uni. of Saarland

     T. Eiter, H. Strass, M. Truszczynski, S. Woltran:
    "Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation -- Essays Dedicated to Gerhard Brewka on the Occasion of His 60th Birthday";
    in Buchreihe "Lecture Notes in Computer Science", Buchreihen-Herausgeber: R. Goebel, Y. Tanaka, W. Wahlster; Springer, 2015, ISBN: 978-3-319-14725-3, 359 S.
  51. Autor/innen: Markus Endres; Nicholas Mattei; Andreas Pfandler, E192-02

     M. Endres, N. Mattei, A. Pfandler (Hrg.):
    "10th Workshop on Advances in Preference Handling (M-PREF)";
    Online Publication, http://www.mpref-2016.preflib.org/program/, 2016, 68 S.
  52. Autor/innen: Christian Fermüller, E192-05; Andrei Voronkov
    Andere beteiligte Personen: G. Goos; J. Hartmanis; J. van Leeuwen

     C. Fermüller, A. Voronkov:
    "Logic for Programming, Artificial Intelligence, and Reasoning, Proceedings LPAR-17";
    in Buchreihe "LNCS", Buchreihen-Herausgeber: G. Goos, J. Hartmanis, J. van Leeuwen; Springer, Heidelberg, 2010, ISBN: 978-3-642-16241-1, 656 S.
  53. Autor/innen: Flavio Ferrarotti; Stefan Woltran, E192-02
    Andere beteiligte Personen: G. Goos; J. Hartmanis; Jan van Leeuwen

     F. Ferrarotti, S. Woltran:
    "Foundations of Information and Knowledge Systems - 10th International Symposium, FoIKS 2018, Budapest, Hungary, May 14-18, 2018, Proceedings";
    in Buchreihe "LNCS", Buchreihen-Herausgeber: G. Goos, J. Hartmanis, J. van Leeuwen; Springer, 2018, ISBN: 978-3-319-90049-0.
  54. Autor/innen: Michael Fink, E192-03; Martin Homola; Alessandra Mileo

     M. Fink, M. Homola, A. Mileo (Hrg.):
    "Workshop Notes of the 6th International Workshop on Acquisition, Representation and Reasoning about Context with Logic (ARCOE-Logic 2014)";
    Computing Research Repository (CoRR), 2014, 49 S.
  55. Autor/innen: Michael Fink, E192-03; Martin Homola; Alessandra Mileo; Ivan Varzinczak

     M. Fink, M. Homola, A. Mileo, I. Varzinczak (Hrg.):
    "Workshop Notes of the 4th International Workshop on Acquisition, Representation and Reasoning with Contextualized Knowledge ARCOE-12 August 28, 2012 Montpellier, France";
    Online Publication, held at the European Conference on Artificial Intelligence (ECAI), 2012, 66 S.
  56. Autor/innen: Michael Fink, E192-03; Martin Homola; Alessandra Mileo; Ivan Varzinczak

     M. Fink, M. Homola, A. Mileo, I. Varzinczak (Hrg.):
    "Workshop Notes of the 5th International Workshop on Acquisition, Representation and Reasoning with Contextualized Knowledge ARCOE-13 September 15, 2013, La Corunna, Spain";
    Online Publication, held at the International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), 2013, 49 S.
  57. Autor/innen: Michael Fink, E192-03; Yuliya Lierler

     M. Fink, Y. Lierler (Hrg.):
    "Proceedings of Answer Set Programming and Other Computing Paradigms (ASPOCP 2012), 5th International Workshop, September 4, 2012, Budapest, Hungary";
    Computing Research Repository (CoRR), arXiv:1301.2215v1, 2012, 177 S.
  58. Autor/innen: Michael Fink, E192-03; Yuliya Lierler

     M. Fink, Y. Lierler (Hrg.):
    "Proceedings of Answer Set Programming and Other Computing Paradigms (ASPOCP 2013), 6th International Workshop, August 25, 2013, Istanbul, Turkey";
    Computing Research Repository (CoRR), arXiv:1312.7422v1, 2013, 175 S.
  59. Autor/innen: Michael Fink, E192-03; Hans Tompits, E192-03; Stefan Woltran, E192-03

     M. Fink, H. Tompits, S. Woltran (Hrg.):
    "Proceedings of the 20th Workshop on Logic Programming (WLP 2006), Vienna, Austria, February 22--24";
    TU Wien, Vienna, Austria, 2006, 210 S.
  60. Autor/in: Rudolf Freund, E192-05
    Andere beteiligte Person: Rudolf Freund, E192-05

     R. Freund:
    "Membrane Computing - 21st International Conference, CMC 2020";
    in Buchreihe "Membrane Computing - 21st International Conference, {CMC} 2020, Virtual Event, September 14-18, 2020, Revised Selected Papers", Buchreihen-Herausgeber: R. Freund; Springer International Publishing, 2021, ISBN: 978-3-030-77102-7, 179 S.
  61. Autor/in: Rudolf Freund, E192-05
    Andere beteiligte Person: Gerhard Chroust

     R. Freund:
    "Proceedings of the Tenth Workshop on Non-Classical Models of Automata and Applications, (NCMA)";
    in Buchreihe "Books@ocg.at", Buchreihen-Herausgeber: G Chroust et al.; OCG (Österreichische Computer Gesellschaft), Wien, 2018, ISBN: 978-3-903035-21-8, 215 S.
  62. Autor/innen: Rudolf Freund, E192-05; Henning Bordihn

     R. Freund, H. Bordihn et al. (Hrg.):
    "Eighth Workshop on Non-Classical Models of Automata and Applications (NCMA 2016)";
    OCG (Österreichische Computer Gesellschaft), Wien, 2016, ISBN: 978-3-903035-10-2; 300 S.
  63. Autor/in: Rudolf Freund, E192-05
    Andere beteiligte Person: Rudolf Freund, E192-05

     R. Freund et al.:
    "Ninth Workshop on Non-Classical Models of Automata and Applications, {NCMA} 2017, Prague, Czech Republic";
    in Buchreihe "Workshop on Non-Classical Models of Automata and Applications", Buchreihen-Herausgeber: R. Freund; herausgegeben von: österreichische Computer Ges; Österreichische Computer Gesellschaft, 2017, ISBN: 978-3-903035-18-8.
  64. Autor/in: Rudolf Freund, E192-05

     R. Freund et al. (Hrg.):
    "Seventh Workshop on Non-Classical Models of Automata and Applications";
    OCG (Österreichische Computer Gesellschaft), Wien, 2015, ISBN: 978-3-903035-07-2; 206 S.
  65. Autor/in: Rudolf Freund, E192-05
    Andere beteiligte Person: Rudolf Freund, E192-05

     R. Freund et al.:
    "Tenth Workshop on Non-Classical Models of Automata and Applications - Short papers";
    in Buchreihe "Workshop on Non-Classical Models of Automata and Applications - Short papers", Buchreihen-Herausgeber: R. Freund et al.; TU Wien, Wien, 2018, 53 S.
  66. Autor/innen: Rudolf Freund, E192-05; Marian Gheorghe
    Andere beteiligte Person: Oscar Ibarra

     R. Freund, M. Gheorghe et al.:
    "International Journal of Foundations of Comuter Science";
    in Buchreihe "Special Issue: Natural Computing: Theory and Applications", Buchreihen-Herausgeber: O. Ibarra; World Scientific Publishing Co. Pte. Ltd., New Jersey, 2011.
  67. Autor/innen: Rudolf Freund, E192-05; Markus Holzer

     R. Freund, M Holzer et al. (Hrg.):
    "Eleventh Workshop on Non-Classical Models of Automata and Applications, NCMA 2019, Valencia, Spain, July 2-3, 2019";
    OCG (Österreichische Computer Gesellschaft), Wien, 2019, ISBN: 978-3-903035-25-6; 204 S.
  68. Autor/innen: Rudolf Freund, E192-05; Markus Holzer

     R. Freund, M Holzer et al. (Hrg.):
    "Third Workshop on Non-Classical Models for Automata and Applications - NCMA 2011";
    Austrian Computer Society, 2011, ISBN: 978-3-85403-282-3.
  69. Autor/innen: Rudolf Freund, E192-05; Sergui Ivanov

     R. Freund, S. Ivanov (Hrg.):
    "Proceedings of the Workshop on Membrane Computing at UCNC 2018.";
    TU Wien, Wien, 2018, 71 S.
  70. Autor/innen: Rudolf Freund, E192-05; Marion Oswald, E192-05

     R. Freund, M. Oswald (Hrg.):
    "Proceedings 16.Theorietag Automaten und Formale Sprachen";
    TU Wien, Wien, 2006.
  71. Autor/innen: Rudolf Freund, E192-05; Gheorghe Paun; Grzegorz Rozenberg; Arto Salomaa

     R. Freund, Gh. Paun, G. Rozenberg, A. Salomaa (Hrg.):
    "Membrane Computing · 6th International Workshop, WMC 2005, Vienna, Austria, July 18-21, 2005, Revised Selected and Invited Papers";
    Springer LNCS 3850, Berlin, 2006, ISBN: 978-3-540-30948-2; 371 S.
  72. Autor/innen: Jens Gottlieb; Günther Raidl, E192-01

     J. Gottlieb, G. Raidl (Hrg.):
    "Evolutionary Computation in Combinatorial Optimization - 6th European Conference, EvoCOP 2006, Budapest, Hungary, April 10-12, 2006. Proceedings.";
    Springer, Heidelberg, 2006, ISBN: 978-3-540-33178-0; 293 S.

    Zusätzliche Informationen
  73. Autor/innen: Jens Gottlieb; Günther Raidl, E192-01

     J. Gottlieb, G. Raidl (Hrg.):
    "Evolutionary Computation in Combinatorial Optimization: 4th European Conference, EvoCOP 2004, Coimbra, Portugal, April 5-7, 2004. Proceedings";
    Springer, Heidelberg, 2004, ISBN: 3-540-21367-8; 241 S.
  74. Autor/in: Bernhard Gramlich, E192-05

     B. Gramlich (Hrg.):
    "Frontiers of Combining Systems, 5th International Workshop, FroCoS 2005, Vienna, Austria, Septemebr 2005, Proceedings, LNAI 3717";
    Springer-Verlag, Berlin Heidelberg New York, 2005, ISBN: 3-540-29051-6; 321 S.

    Zusätzliche Informationen
  75. Autor/innen: Bernhard Gramlich, E192-05; Salvador Lucas

     B. Gramlich, S. Lucas (Hrg.):
    "2nd International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2002) - Final Proceedings";
    Elsevier Science Publishers, 2002, ISBN: 0444513132.
  76. Autor/innen: Bernhard Gramlich, E192-05; Salvador Lucas

     B. Gramlich, S. Lucas (Hrg.):
    "3rd International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2003) - Final Proceedings";
    Elsevier Science Publishers, 2003, ISSN: 1571-0661.
  77. Autor/innen: Bernhard Gramlich, E192-05; Salvador Lucas

     B. Gramlich, S. Lucas (Hrg.):
    "Reduction Strategies in Rewriting and Programming, Proceedings of WRS'03";
    Universidad Politecnica de Valencia, 2003, ISBN: 84-96221-03-2.
  78. Autor/innen: Bernhard Gramlich, E192-05; Salvador Lucas

     B. Gramlich, S. Lucas (Hrg.):
    "Reduction Strategies in Rewriting and Programming, Special Issue of Journal of Symbolic Computation, Volume 40, 2005, pp. 745-903";
    Elsevier, Elsevier, 2005, ISSN: 0747-7171; 169 S.

    Zusätzliche Informationen
  79. Autor/innen: Bernhard Gramlich, E192-05; Dale Miller; Uli Sattler
    Andere beteiligte Personen: Randy Goebel, University of Al ...; Yuzuru Tanaka, Hokkaido University; Wolfgang Wahlster, Uni. of Saarland

     B. Gramlich, D. Miller, U. Sattler:
    "Automated Reasoning - 6th International Joint Conference, IJCAR 2012, Manchester, UK, June 26-29, 2012. Proceedings.";
    in Buchreihe "Lecture Notes in Artifical Intelligence (Subseries of: Lecture Notes in Computer Science)", Buchreihen-Herausgeber: R. Goebel, Y. Tanaka, W. Wahlster; herausgegeben von: Springer; Springer-Verlag, Berlin Heidelberg, 2012, ISBN: 978-3-642-31364-6, 568 S.

    Zusätzliche Informationen
  80. Autor/innen: Sergio Greco; Thomas Lukasiewicz, E192-03

     S. Greco, T. Lukasiewicz (Hrg.):
    "Proceedings of the 2nd International Conference on Scalable Uncertainty Management (SUM 2008), Springer LNCS 5291";
    Springer, LNCS, Heidelberg, 2008, ISSN: 0302-9743; 401 S.
  81. Autor/innen: Gregory Gutin; Stefan Szeider, E192-03
    Andere beteiligte Person: Springer Verlag

     G. Gutin, St. Szeider:
    "Parameterized and Exact Computation, 8th International Symposium, IPEC 2013 (LNCS 8246)";
    in Buchreihe "Lecture Notes in Computer Science", Buchreihen-Herausgeber: Springer Verlag; Springer-Verlag, 2013, ISBN: 978-3-319-03898-8.

    Zusätzliche Informationen
  82. Autor/innen: Emmanuel Hebrard, LAAS-CNRS, Toulo ...; Nysret Musliu, E192-02

     E. Hebrard, N. Musliu (Hrg.):
    "International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research - 17th International Conference, CPAIOR 2020, Vienna, Austria, September 21-24, 2020, Proceedings";
    Springer, 2020, ISBN: 978-3-030-58941-7.

    Zusätzliche Informationen
  83. Autor/innen: Pascal Hitzler; Thomas Lukasiewicz, E192-03

     P. Hitzler, T. Lukasiewicz (Hrg.):
    "Proceedings of the 4th International Conference on Web Reasoning and Rule Systems (RR 2010)";
    Springer LNCS, Heidelberg, 2010, ISBN: 978-3-642-15917-6.

    Zusätzliche Informationen
  84. Autor/innen: Yifan Hu; Luana Micallef, HIIT; Martin Nöllenburg, E192-01; Peter Rodgers, University of Kent
    Andere beteiligte Personen: Yifan Hu; Luana Micallef, HIIT; Martin Nöllenburg, E192-01; Peter Rodgers, University of Kent

     Y. Hu, L. Micallef, M. Nöllenburg, P. Rodgers:
    "Scalable Set Visualizations (Dagstuhl Seminar 17332)";
    in Buchreihe "Dagstuhl Reports", Buchreihen-Herausgeber: Y. Hu, L. Micallef, M. Nöllenburg, P. Rodgers; Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, 2018, ISSN: 2192-5283, 22 S.

    Zusätzliche Informationen
  85. Autor/innen: Yifan Hu; Martin Nöllenburg, E192-01

     Y. Hu, M. Nöllenburg (Hrg.):
    "Graph Drawing and Network Visualization 24th International Symposium";
    Springer LNCS, 2016, ISBN: 978-3-319-50105-5.
  86. Autor/innen: Alexander Ivrii, IBM; Ofer Strichman
    Andere beteiligte Personen: Warren Hunt, UT Austin; Georg Weissenbacher, E192-04

     A. Ivrii, O. Strichman:
    "Formal Methods in Computer-Aided Design";
    in Buchreihe "Conference Series: Formal Methods in Computer-Aided Design", Buchreihen-Herausgeber: W. Hunt, G. Weissenbacher; TU Wien Academic Press, 2020, ISBN: 978-3-85448-042-6.

    Zusätzliche Informationen
  87. Autor/innen: Michael Jünger; Petra Mutzel, E192-01

     M. Jünger, P. Mutzel (Hrg.):
    "Graph Drawing Software";
    Springer, 2003, ISBN: 3-540-00881-0; 378 S.
  88. Autor/innen: Andreas Kerren, E192-01; Daniel Cernea; Margit Pohl, E193-05

     A. Kerren, D. Cernea, M. Pohl (Hrg.):
    "Proceedings of EmoVis 2016, ACM IUI 2016 Workshop on Emotion and Visualization";
    Linköping Electronic Conference Proceedings, Linköping, Schweden, 2016, ISBN: 978-91-7685-817-2; 38 S.

    Zusätzliche Informationen
  89. Autor/innen: Igor Konnov, E192-04; Laura Kovacs, E192-04

     I. Konnov, L. Kovacs (Hrg.):
    "Proceedings of the 31st International Conference on Concurrency Theory (CONCUR)";
    Dagstuhl Publishing LIPICS, Vienna, Austria, 2020, ISBN: 978-3-95977-160-3; 984 S.
  90. Autor/innen: Laura Kovacs, E192-04; Andrei Voronkov
    Andere beteiligte Personen: Laura Kovacs, E192-04; Andrei Voronkov

     L. Kovacs, A. Voronkov:
    "Proceedings of the 1st and 2nd Vampire Workshops";
    in Buchreihe "Proceedings of the 1st and 2nd Vampire Workshops", Buchreihen-Herausgeber: L. Kovacs, A. Voronkov; herausgegeben von: EasyChair; EasyChair EPiC Series in Computing, 2016.
  91. Autor/innen: Laura Kovacs, E192-04; Andrei Voronkov
    Andere beteiligte Person: Andrei Voronkov

     L. Kovacs, A. Voronkov:
    "Vampire 2017. Proceedings of the 4th Vampire Workshop";
    in Buchreihe "Vampire 2017. Proceedings of the 4th Vampire Workshop", Buchreihen-Herausgeber: A. Voronkov; herausgegeben von: EasyChair; EasyChair EPiC Series in Computing, EasyChair, 2018.
  92. Autor/innen: Antonin Kucera; Igor Potapov; Agata Ciabattoni, E192-05; Stefan Szeider, E192-03; Rusins Freivalds

     A. Kucera, I. Potapov, A. Ciabattoni, St. Szeider, R. Freivalds (Hrg.):
    "MFCS & CSL 2010 Satellite Workshops: Selected Papers, Fundamenta Informaticae 123";
    IOS Press, 2013, ISSN: 0169-2968.

    Zusätzliche Informationen
  93. Autor/innen: Roman Kuznets, E192-05; George Metcalfe

     R. Kuznets, G Metcalfe (Hrg.):
    "GSB 2014 Electronic Proceedings";
    Workshop "Gentzen Systems and Beyond, 2014.
  94. Autor/innen: Hoong Chuin Lau; Günther Raidl, E192-01; Pascal Van Hentenryck

     H. C. Lau, G. Raidl, P. Van Hentenryck (Hrg.):
    "Proceedings of the 10th Metaheuristics International Conference";
    Singapore Management University, Singapore, 2013.
  95. Autor/innen: Joao Leite; Tran Cao Son; Paolo Torroni; Leon van der Torre; Stefan Woltran, E192-02

     J. Leite, T. Son, P. Torroni, L. van der Torre, S. Woltran (Hrg.):
    "Computational Logic in Multi-Agent Systems";
    Springer, 2013, ISBN: 978-3-642-40623-2.
  96. Autor/innen: Florian Lonsing, E192-03; Martina Seidl

     F. Lonsing, M. Seidl (Hrg.):
    "Proceedings of the 4th International Workshop on Quantified Boolean Formulas (QBF 2016)";
    CEUR-WS.org, 2016, ISSN: 1613-0073; 70 S.

    Zusätzliche Informationen
  97. Autor/in: Thomas Lukasiewicz, E192-03

     T. Lukasiewicz (Hrg.):
    "Logical Approaches to Imprecise Probabilities. International Journal of Approximate Reasoning, 49(1)";
    Elsevier, 2008, ISSN: 0888-613x; 99 S.
  98. Autor/innen: Thomas Lukasiewicz, E192-03; Rafael Penaloza; Anni-Yasmin Turhan

     T. Lukasiewicz, R. Penaloza, A. Turhan (Hrg.):
    "Proceedings of the 1st International Workshop on Uncertainty in Description Logics (UniDL 2010)";
    CEUR-Proceedings, Aachen, Vol. 613, 2010, ISSN: 1613-0073; 87 S.
  99. Autor/innen: Matteo Maffei, E192-06; Mark Ryan, BHAM; Patrick Ah-Fat; Mohammed Alabbad; Mario Alvim; Zaruhi Aslanyan; Nicola Atzei, University of Caglia; Kushal Babel, IIT Bombay; Massimo Bartoletti, UNICA; Lujo Bauer, CMU, ECE; Arthur Blot, ens-lion; Sergiu Bursuc, LORIA; Pablo Cañones, IMDEA Software; Giovanni Casini, uni.lu; Vincent Cheval, LORIA; Tiziana Cimoli, UNICA; Marcos Cramer, uni.lu; Jannik Dreier, LORIA; Charles Duménil, INRIA; Daniel Hedin, MDH; Michael Hicks, UMD; Michael Huth, IMPERIAL; Limin Jia, CMU, ECE; Christian Johansen, UiO; Owain Jones, CMC; Ridha Khedri, McMaster; Boris Köpf, IMDEA Software; Steve Kremer, INRIA; Peeter Laud, Cybernetica AS; Piotr Mardziel, CMU, CyLab; Flemming Nielson, DTU; Martin Pettai, Cybernetica AS; Frank Piessens, DistriNet; Willard Rafnsson, MPI; Jan Reineke, UNI-Saarland; Andrei Sabelfeld, CHALMERS; Ralf Sasse, ETH Zurich; Tachio Terauchi, Waseda; Shiwei Xu, Wuhan; Masaki Yamamoto, Nagoya University; Alexander Sjösten, E192-06

     M. Maffei, M. Ryan, P. Ah-Fat, M. Alabbad, M. Alvim, Z. Aslanyan, N. Atzei, K. Babel, M. Bartoletti, L. Bauer, A. Blot, S. Bursuc, P. Cañones, G. Casini, V. Cheval, T. Cimoli, M. Cramer, J. Dreier, C. Duménil, D. Hedin, M. Hicks, M. Huth, L. Jia, C. Johansen, O. Jones, R. Khedri, B. Köpf, S. Kremer, P. Laud, P. Mardziel, F. Nielson, M. Pettai, F. Piessens, W. Rafnsson, J. Reineke, A. Sabelfeld, R. Sasse, T. Terauchi, S. Xu, M. Yamamoto, A. Sjösten (Hrg.):
    "Principles of Security and Trust";
    Springer-Verlag, Berlin, Heidelberg, 2017, ISBN: 978-3-662-54454-9; 321 S.

    Zusätzliche Informationen
  100. Autor/innen: Alessandra Mileo; Michael Fink, E192-03

     A. Mileo, M. Fink (Hrg.):
    "Proceedings of the 2nd International Workshop on Logic-Based Interpretation of Context: Modelling and Applications, Vancouver, Canada, May 16, 2011";
    CEUR-WS.org, urn:nbn:de:0074-738-1, 2011, ISSN: 1613-0073; 53 S.

    Zusätzliche Informationen
  101. Autor/innen: Petra Mutzel, E192-01; Michael Jünger; Sebastian Leipert

     P. Mutzel, M. Jünger, S. Leipert (Hrg.):
    "Graph Drawing";
    Springer, 2002.
  102. Autor/innen: Oliver Niggemann; Peter Schüller, E192-03
    Andere beteiligte Personen: Oliver Niggemann; Peter Schüller, E192-03

     O. Niggemann, P. Schüller:
    "IMPROVE - Innovative Modelling Approaches for Production Systems to Raise Validatable Efficiency";
    in Buchreihe "Technologien für die intelligente Automation", Buchreihen-Herausgeber: O. Niggemann, P. Schüller; herausgegeben von: Springer; Springer, Vieweg, Berlin, Heidelberg, 2018, ISBN: 978-3-662-57805-6, 129 S.
  103. Autor/innen: M.Magdalena Ortiz de la Fuente, E192-03; Stefan Schlobach

     M. Ortiz de la Fuente, S. Schlobach (Hrg.):
    "Web Reasoning and Rule Systems - 10th International Conference, RR 2016, Aberdeen, UK, September 9-11, 2016, Proceedings";
    Springer, LNCS, Heidelberg, 2016, ISBN: 978-3-319-45275-3; 183 S.

    Zusätzliche Informationen
  104. Autor/innen: M.Magdalena Ortiz de la Fuente, E192-03; Thomas Schneider

     M. Ortiz de la Fuente, T. Schneider (Hrg.):
    "Proceedings of the 31st International Workshop on Description Logics co-located with 16th International Conference on Principles of Knowledge Representation and Reasoning (KR 2018), Tempe, Arizona, US, October 27-29, 2018.";
    CEUR-WS.org, Aachen, Deutschland, 2018, ISSN: 1613-0073; 460 S.
  105. Autor/innen: Jeff Z. Pan; Diego Calvanese; Thomas Eiter, E192-03; Ian Horrocks; Michael Kifer; Fangzhen Lin; Yuting Zhao

     J. Z. Pan, D. Calvanese, T. Eiter, I. Horrocks, M. Kifer, F. Lin, Y. Zhao (Hrg.):
    "Reasoning Web: Logical Foundation of Knowledge Graph Construction and Query Answering - 12th International Summer School 2016";
    Springer LNCS, 2017, ISBN: 978-3-319-49493-7; 259 S.

    Zusätzliche Informationen
  106. Autor/in: Xavier Parent, E192-05

     X. Parent et al. (Hrg.):
    "The handbook of Deontic Logic and Normative Systems";
    College Publications, 2021, ISBN: 978-1-84890-363-0; 790 S.
  107. Autor/innen: David Pearce; Axel Florian Polleres; Agustin Valverde; Stefan Woltran, E192-03

     D. Pearce, A. Polleres, A. Valverde, S. Woltran (Hrg.):
    "Workshop on Correspondence and Equivalence for Nonmonotonic Theories (CENT 2007)";
    CEUR-Proceedings, Aachen, Vol. 265, 2007, ISSN: 1613-0073; 72 S.
  108. Autor/innen: Reinhard Pichler, E192-02; Altigran Soares da Silva

     R. Pichler, A. da Silva (Hrg.):
    "Proceedings of the 10th Alberto Mendelzon International Workshop on Foundations of Data Management, Panama City, Panama, May 8-10, 2016";
    CEUR-WS.org, 2016.
  109. Autor/innen: Reinhard Pichler, E192-02; Norman May, 192-02; Erhard Rahm, 192-02; Shan-Hung Wu, 192-02; Katja Hose, 192-02

     R. Pichler, N. May, E. Rahm, S. Wu, K. Hose (Hrg.):
    "Proceedings of the 21th International Conference on Extending Database Technology";
    EDBT 2018, Edbt / Icdt 2018, 2018, ISBN: 978-3-89318-078-3; 717 S.
  110. Autor/innen: Ulrich Pofahl; Reinhard Viertl, E105-08
    Andere beteiligte Personen: Reinhard Viertl, E105-08; Dieter Bökemann; Kurt Bretterbauer, E120-04; U. Gamer; Hans Kaiser, E104; H. Kirchmayr; Alexander Leitsch, E192-05; Gottfried Magerl, E354-01; Herbert A. Mang, E202-01; M. Wehdorn; F. Wurst

     U. Pofahl, R. Viertl:
    "Exakte Zahlen genügen nicht: Mathematik und Ungewissheit";
    in Buchreihe "Schriftenreihe der Technischen Universität Wien", Buchreihen-Herausgeber: R. Viertl, D. Bökemann, K. Bretterbauer, U. Gamer, H. Kaiser, H. Kirchmayr, A. Leitsch, G. Magerl, H.A. Mang, M. Wehdorn, F. Wurst; TU WIEN, 2006, 89 S.
  111. Autor/in: Günther Raidl, E192-01

     G. Raidl et al. (Hrg.):
    "Applications of Evolutionary Computing";
    Springer, LNCS 2611, 2003, ISBN: 3-540-00976-0; 708 S.
  112. Autor/in: Günther Raidl, E192-01

     G. Raidl et al. (Hrg.):
    "Applications of Evolutionary Computing: EvoWorkshops 2004 - Lecture Notes in Computer Science 3004";
    Springer, Berlin Heidelberg New York, 2004, ISBN: 3-540-21378-3; 562 S.
  113. Autor/in: Günther Raidl, E192-01

     G. Raidl et al. (Hrg.):
    "Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference";
    ACM Press, 2009, ISBN: 978-1-60558-505-5; 1728 S.
  114. Autor/innen: Günther Raidl, E192-01; Jens Gottlieb

     G. Raidl, J. Gottlieb (Hrg.):
    "Evolutionary Computation in Combinatorial Optimization, 5th European Conference, EvoCOP 2005, Lausanne, Switzerland, March 30 - April 1, 2005, Proceedings (LNCS 3448)";
    Springer, Heidelberg, 2005, ISBN: 3-540-25337-8; 271 S.

    Zusätzliche Informationen
  115. Autor/innen: Alexander Reiterer, E120-05; Uwe Egly, E192-03

     A. Reiterer, U. Egly (Hrg.):
    "Application of Artificial Intelligence in Engineering Geodesy";
    Eigenverlag, 2008, ISBN: 978-3-9501492-4-1; 116 S.

    Zusätzliche Informationen
  116. Autor/in: Jochen Renz, E192-02

     J. Renz:
    "Qualitative Spatial reasoning with Topological Information, LNCS 2293";
    Springer, Berlin, 2002, ISBN: 3-540-43346-5; 190 S.
  117. Autor/innen: Natasha Sharygina, Università della ...; Helmut Veith, E192-04
    Andere beteiligte Person: Springer Verlag

     N. Sharygina, H. Veith:
    "CAV";
    in Buchreihe "Lecture Notes in Computer Science (LNCS 8044)", Buchreihen-Herausgeber: Springer Verlag; Springer, 2013, ISBN: 978-3-642-39798-1, 1015 S.
  118. Autor/innen: Mantas Simkus, E192-02; Grant Weddell

     M. Simkus, G. Weddell (Hrg.):
    "Proceedings of the 32nd International Workshop on Description Logics, Oslo, Norway, June 18-21, 2019";
    CEUR, Aachen, Deutschland, 2019, ISSN: 1613-0073; 410 S.
  119. Autor/innen: Carsten Sinz; Uwe Egly, E192-03
    Andere beteiligte Personen: Carsten Sinz; Uwe Egly, E192-03

     C. Sinz, U. Egly:
    "Theory and Applications of Satisfiability Testing - SAT 2014 - 17th International Conference, Proceedings";
    in Buchreihe "Lecture Notes in Computer Science", Buchreihen-Herausgeber: C. Sinz, U. Egly; Springer, 2014, ISBN: 978-3-319-09283-6.

    Zusätzliche Informationen
  120. Autor/innen: Sebastian Skritek, E192-02; Dan Suciu; Christoph Koch
    Andere beteiligte Personen: Sebastian Skritek, E192-02; Dan Suciu; Christoph Koch

     S. Skritek, D. Suciu, C. Koch:
    "Proceedings of the 38th {ACM} {SIGMOD-SIGACT-SIGAI} Symposium on Principles of Database Systems, {PODS} 2019,";
    in Buchreihe "Proceedings of the 38th {ACM} {SIGMOD-SIGACT-SIGAI} Symposium on Principles of Database Systems, {PODS} 2019,", Buchreihen-Herausgeber: S. Skritek, D. Suciu, C. Koch; ACM, New York, NY, USA, 2019, ISBN: 978-1-4503-6227-6, 482 S.

    Zusätzliche Informationen
  121. Autor/innen: Ahmet Soylu; Sotiris Moschoyiannis; Guido Governatori; Mantas Simkus, E192-02; Petros Stefaneas; Alexander Steen; Adrian Giurca, Brandenburg Techn.

     A. Soylu, S. Moschoyiannis, G. Governatori, M. Simkus, P. Stefaneas, A. Steen, A. Giurca (Hrg.):
    "Proceedings of the 13th RuleML+RR 2019 Doctoral Consortium and Rule Challenge, September 16-19, 2019 - Bolzano, Italy";
    CEUR, Aachen, Deutschland, 2019, ISSN: 1613-0073; 81 S.
  122. Autor/innen: Daryl Stewart, ARM; Georg Weissenbacher, E192-04

     D. Stewart, G. Weissenbacher (Hrg.):
    "FMCAD'17: Proceedings of the 17th Conference on Formal Methods in Computer-Aided Design";
    FMCAD Inc., Austin, TX, 2017, ISBN: 978-0-9835678-7-5; 241 S.

    Zusätzliche Informationen
  123. Autor/innen: Ofer Strichman; Stefan Szeider, E192-03

     O. Strichman, St. Szeider (Hrg.):
    "Theory and Applications of Satisfiability Testing - SAT 2010";
    Springer, Edinburgh, UK, 2010, ISBN: 978-3-642-14185-0.
  124. Autor/innen: Sergio Tessaris; Enrico Franconi; Thomas Eiter, E192-03; Claudio Gutierrez; Siegfried Handschuh; Marie-Christine Rousset; Renate Schmidt, Univ. of Manchester
    Andere beteiligte Personen: Sergio Tessaris; Enrico Franconi; Thomas Eiter, E192-03; Claudio Gutierrez; Siegfried Handschuh; Marie-Christine Rousset; Renate Schmidt, Univ. of Manchester

     S. Tessaris, E. Franconi, T. Eiter, C. Gutierrez, S. Handschuh, M. Rousset, R. Schmidt:
    "Reasoning Web, Fifth International Summer School 2008, Bressanone Italy, August 30 - September 4 2009, Tutorial Lectures";
    in Buchreihe "Lecture Notes in Computer Science", Buchreihen-Herausgeber: S. Tessaris, E. Franconi, T. Eiter, C. Gutierrez, S. Handschuh, M. Rousset, R. Schmidt; herausgegeben von: Springer; Springer LNCS, Heidelberg, 2009, ISBN: 978-3-642-03753-5, 357 S.

    Zusätzliche Informationen
  125. Autor/innen: Hans Tompits, E192-03; Salvador Abreu; Johannes Oetsch, E192-03; Joerg Puehrer, E192-03; Dietmar Seipel; Masanobu Umeda; Armin Wolf

     H. Tompits, S. Abreu, J. Oetsch, J. Puehrer, D. Seipel, M. Umeda, A. Wolf (Hrg.):
    "Applications of Declarative Programming and Knowledge Management, 19th International Conference, INAP 2011 and 25th Workshop on Logic Programming, WLP 2011 Vienna, Austria, September 28-30, 2011, Revised Selected Papers";
    Springer, LNAI, 2013, ISBN: 978-3-642-41523-4.

    Zusätzliche Informationen
  126. Autor/innen: Bart Verheij; Stefan Szeider, E192-03; Stefan Woltran, E192-03
    Andere beteiligte Personen: J. Breuker; N. Guarino; Ji Liu; R. López de Mántaras; Riichiro Mizoguchi; M. Musen; S.K. Pal; N. Zhong

     B. Verheij, St. Szeider, S. Woltran:
    "Fourth International Conference on Computational Models of Argument (COMMA 2012)";
    in Buchreihe "Computational Models of Argument", Buchreihen-Herausgeber: J. Breuker, N. Guarino, J. Liu, R. de Mántaras, R. Mizoguchi, M. Musen, S. Pal, N. Zhong; IOS Press, Amsterdam, 2012, ISBN: 1614991103.

    Zusätzliche Informationen
  127. Autor/innen: Andrei Voronkov; Geoff Sutcliffe; Matthias Baaz, E104-02; Christian Fermüller, E192-05
    Andere beteiligte Personen: Andrei Voronkov; Geoff Sutcliffe; Matthias Baaz, E104-02; Christian Fermüller, E192-05

     A. Voronkov, G. Sutcliffe, M. Baaz, C. Fermüller:
    "LPAR-17-short. short papers for 17th International Conference on Logic for Programming, Artificial intelligence, and Reasoning.";
    in Buchreihe "EasyChair Proceedings in Computing", Buchreihen-Herausgeber: A. Voronkov, G. Sutcliffe, M. Baaz, C. Fermüller; EasyChair, 2013, ISSN: 2040-557x, 63 S.
  128. Autor/in: Bruno Woltzenlogel-Paleo, E192-05
    Andere beteiligte Person: Bruno Woltzenlogel-Paleo, E192-05

     B. Woltzenlogel-Paleo et al.:
    "All about Proofs, Proofs for All";
    in Buchreihe "Mathematical Logic and Foundations", Buchreihen-Herausgeber: B. Woltzenlogel-Paleo et al.; College Publications, 2015, ISBN: 978-1-84890-166-7.

Zeitschriftenartikel

  1. Autor/innen: Serge Abiteboul; Marcelo Arenas; Pablo Barceló; Meghyn Bienvenu; Diego Calvanese; Claire David; Richard Hull; Eyke Hüllermeier; Benny Kimelfeld; Leonid Libkin; Wim Martens; Tova Milo; Filip Murlak; Frank Neven; M.Magdalena Ortiz de la Fuente, E192-03; Thomas Schwentick; Julia Stoyanovich; Jianwen Su; Dan Suciu; Victor Vianu; Ke Yi

     S. Abiteboul, M. Arenas, P. Barceló, M. Bienvenu, D. Calvanese, C. David, R. Hull, E. Hüllermeier, B. Kimelfeld, L. Libkin, W. Martens, T. Milo, F. Murlak, F. Neven, M. Ortiz de la Fuente, T. Schwentick, J. Stoyanovich, J. Su, D. Suciu, V. Vianu, K. Yi:
    "Research Directions for Principles of Data Management (Abridged)";
    ACM SIGMOD Record (eingeladen), 45 (2016), 4; 13 S.

    Zusätzliche Informationen
  2. Autor/innen: Serge Abiteboul; Marcelo Arenas; Pablo Barceló; Meghyn Bienvenu; Diego Calvanese; Claire David; Richard Hull; Eyke Hüllermeier; Benny Kimelfeld; Leonid Libkin; Wim Martens; Tova Milo; Filip Murlak; Frank Neven; M.Magdalena Ortiz de la Fuente, E192-03; Thomas Schwentick; Julia Stoyanovich; Jianwen Su; Dan Suciu; Victor Vianu; Ke Yi

     S. Abiteboul, M. Arenas, P. Barceló, M. Bienvenu, D. Calvanese, C. David, R. Hull, E. Hüllermeier, B. Kimelfeld, L. Libkin, W. Martens, T. Milo, F. Murlak, F. Neven, M. Ortiz de la Fuente, T. Schwentick, J. Stoyanovich, J. Su, D. Suciu, V. Vianu, K. Yi:
    "Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151)";
    Dagstuhl Manifestos, 7 (2018), 1; S. 1 - 29.

    Zusätzliche Informationen
  3. Autor/innen: Michael Abseher, E192-02; Bernhard Bliem, 192-02; Günther Charwat, E192-02; Frederico Dusberger; Stefan Woltran, E192-02

     M. Abseher, B. Bliem, G. Charwat, F. Dusberger, S. Woltran:
    "Computing secure sets in graphs using answer set programming";
    Journal of Logic and Computation, 30 (2020), 4; S. 837 - 862.

    Zusätzliche Informationen
  4. Autor/innen: Michael Abseher, E192-02; Martin Gebser; Nysret Musliu, E192-02; Torsten Schaub; Stefan Woltran, E192-02

     M. Abseher, M. Gebser, N. Musliu, T. Schaub, S. Woltran:
    "Shift Design with Answer Set Programming";
    Fundamenta Informaticae, 147 (2016), 1; S. 1 - 25.

    Zusätzliche Informationen
  5. Autor/innen: Michael Abseher, E192-02; Markus Hecher, E192-02; Marius Moldovan, E192-02; Stefan Woltran, E192-02; Bernhard Bliem, 192-02

     M. Abseher, M. Hecher, M. Moldovan, S. Woltran, B. Bliem:
    "Dynamic Programming on Tree Decompositions with {D-FLAT}";
    KI - Künstliche Intelligenz, 32 (2018), 2-3; S. 191 - 192.

    Zusätzliche Informationen
  6. Autor/innen: Michael Abseher, E192-02; Nysret Musliu, E192-02; Stefan Woltran, E192-02

     M. Abseher, N. Musliu, S. Woltran:
    "Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning";
    Journal of Artificial Intelligence Research, 58 (2017), S. 829 - 858.

    Zusätzliche Informationen
  7. Autor/in: Shqiponja Ahmetaj, E192-02

     S. Ahmetaj:
    "Rewriting Approaches for Ontology-Mediated Query Answering";
    KI - Künstliche Intelligenz, 34 (2020), 4; S. 523 - 526.

    Zusätzliche Informationen
  8. Autor/innen: Shqiponja Ahmetaj, E192-02; M.Magdalena Ortiz de la Fuente, E192-03; Diego Calvanese; Mantas Simkus, E192-02

     S. Ahmetaj, M. Ortiz de la Fuente, D. Calvanese, M. Simkus:
    "Managing Change in Graph-Structured Data Using Description Logics";
    ACM Transactions on Computational Logic, 18 (2017), 4; S. 1 - 35.

    Zusätzliche Informationen
  9. Autor/innen: Shqiponja Ahmetaj, E192-02; M.Magdalena Ortiz de la Fuente, E192-03; Mantas Simkus, E192-02

     S. Ahmetaj, M. Ortiz de la Fuente, M. Simkus:
    "Polynomial rewritings from expressive Description Logics with closed predicates to variants of Datalog";
    Artificial Intelligence, 280 (2020), 103220; S. 1 - 27.

    Zusätzliche Informationen
  10. Autor/in: Jesse Alama, E192-05

     J. Alama:
    "The simplest axiom system for plane hyperbolic geometry revisited, again";
    Studia Logica, 102 (2014), 3; S. 609 - 615.

    Zusätzliche Informationen
  11. Autor/innen: Jesse Alama, E192-05; Tom Heskes; Daniel Kühlwein; Evgeni Tsivtsivadze; Josef Urban

     J. Alama, T. Heskes, D. Kühlwein, E. Tsivtsivadze, J. Urban:
    "Premise selection for mathematics by corpus analysis and kernel methods";
    Journal of Automated Reasoning, 52 (2014), 2; S. 191 - 213.

    Zusätzliche Informationen
  12. Autor/innen: Artiom Alhazov; Rudolf Freund, E192-05; Alberto Leporati; Marion Oswald, E192-05; Claudio Zandron

     A. Alhazov, R. Freund, A. Leporati, M. Oswald, C. Zandron:
    "(Tissue) P Systems with Unit Rules and Energy Assigned to Membranes";
    Fundamenta Informaticae, 74 (2006), 4; S. 391 - 408.
  13. Autor/innen: Artiom Alhazov; Rudolf Freund, E192-05; Marion Oswald, E192-05

     A. Alhazov, R. Freund, M. Oswald:
    "Cell/symbol complexity of tissue P systems with symport/antiport rules";
    International Journal of Foundations of Computer Science, 17 (2006), 1; S. 3 - 25.
  14. Autor/innen: Artiom Alhazov; Rudolf Freund, E192-05; Marion Oswald, E192-05; Sergey Verlan

     A. Alhazov, R. Freund, M. Oswald, S. Verlan:
    "Partial Halting and Minimal Parallelism Based on Arbitrary Rule Partitions.";
    Fundamenta Informaticae, 91 (2009), 1; S. 17 - 34.
  15. Autor/innen: Artiom Alhazov; Rudolf Freund, E192-05; Agustín Riscos-Núñez

     A. Alhazov, R. Freund, A. Riscos-Núñez:
    "Membrane division, restricted membrane creation and object complexity in P systems";
    International Journal of Computer Mathematics, 83 (2006), 7; S. 529 - 548.
  16. Autor/innen: Noga Alon; Gregory Gutin; Eun Jun Kim; Stefan Szeider, E192-03; Anders Yeo

     N. Alon, G. Gutin, E. Kim, St. Szeider, A. Yeo:
    "Solving MAX-r-SAT Above a Tight Lower Bound";
    Algorithmica, 61 (2011), 3; S. 638 - 655.

    Zusätzliche Informationen
  17. Autor/innen: Maria Alpuente; Santiago Escobar; Bernhard Gramlich, E192-05; Salvador Lucas

     M. Alpuente, S. Escobar, B. Gramlich, S. Lucas:
    "On-Demand Strategy Annotations Revisited: An Improved On-Demand Evaluation Strategy";
    Theoretical Computer Science, 411 (2010), 2; S. 504 - 541.

    Zusätzliche Informationen
  18. Autor/innen: Maria Alpuente; Bernhard Gramlich, E192-05; Alicia Villanueva

     M. Alpuente, B. Gramlich, A. Villanueva:
    "A Framework for Timed Concurrent Constraint Programming with External Functions";
    Electronic Notes in Theoretical Computer Science (ENTCS), 188 (2007), S. 143 - 155.

    Zusätzliche Informationen
  19. Autor/innen: Mario Alviano; Wolfgang Faber; Stefan Woltran, E192-02

     M. Alviano, W. Faber, S. Woltran:
    "Complexity of super-coherence problems in ASP";
    Theory and Practice of Logic Programming, 14 (2014), 3; S. 339 - 361.
  20. Autor/innen: Giovanni Amendola; Thomas Eiter, E192-03; Michael Fink, E192-03; Nicola Leone; Joao Moura

     G. Amendola, T. Eiter, M. Fink, N. Leone, J. Moura:
    "Semi-equilibrium models for paracoherent answer set programs";
    Artificial Intelligence, 234 (2016), S. 219 - 271.

    Zusätzliche Informationen
  21. Autor/innen: Benjamin Aminof, E192-04; Tomer Kotek, E192-04; Sasha Rubin; Francesco Spegni, UnivPM; Helmut Veith, E192-04

     B. Aminof, T. Kotek, S. Rubin, F. Spegni, H. Veith:
    "Parameterized model checking of rendezvous systems";
    Distributed Computing, 31 (2018), 3; S. 187 - 222.

    Zusätzliche Informationen
  22. Autor/innen: Benjamin Aminof, E192-04; Vadim Malvone; Aniello Murano; Sasha Rubin

     B. Aminof, V. Malvone, A. Murano, S. Rubin:
    "Graded modalities in Strategy Logic";
    Information and Computation, 261 (2018), Part 4; S. 634 - 649.

    Zusätzliche Informationen
  23. Autor/innen: Benjamin Aminof, E192-04; Aniello Murano; Sasha Rubin

     B. Aminof, A. Murano, S. Rubin:
    "CTL* with graded path modalities";
    Information and Computation, 262 (2018), Part 1; S. 1 - 21.

    Zusätzliche Informationen
  24. Autor/innen: Benjamin Aminof, E192-04; Sasha Rubin

     B. Aminof, S. Rubin:
    "First-cycle games";
    Information and Computation, 254 (2017), 1; S. 195 - 216.
  25. Autor/innen: Elena Andreeva, E192-06; Bart Mennink, KU Leuven; Bart Preneel, KU Leuven

     E. Andreeva, B. Mennink, B. Preneel:
    "Open problems in hash function security";
    Designs Codes and Cryptography, 77 (2015), S. 611 - 631.

    Zusätzliche Informationen
  26. Autor/innen: Eugenio Angriman; Alexander van der Grinten; Moritz von Looz; Henning Meyerhenke; Martin Nöllenburg, E192-01; Maria Predari; Charilaos Tzovas

     E. Angriman, A. van der Grinten, M. von Looz, H. Meyerhenke, M. Nöllenburg, M. Predari, C. Tzovas:
    "Guidelines for Experimental Algorithmics: A Case Study in Network Analysis";
    Algorithms, Volume 12 (2019), Issue 7; S. 1 - 37.

    Zusätzliche Informationen
  27. Autor/in: Christian Antic, E192-03

     C. Antic:
    "Fixed point semantics for stream reasoning";
    Artificial Intelligence, 288 (2020).

    Zusätzliche Informationen
  28. Autor/in: Christian Antic, E192-03

     C. Antic:
    "On cascade products of answer set programs";
    Theory and Practice of Logic Programming, 14 (2014), 4-5; S. 711 - 723.
  29. Autor/innen: Grigoris Antoniou; Matteo Baldoni; Cristina Baroglio; Robert Baumgartner, E192-02; Francois Bry; Thomas Eiter, E192-03; Nicola Henze; Marcus Herzog, E192-02; Wolfgang May; Vivana Patti; Roman Schindlauer, E192-03; Hans Tompits, E192-03; Sebastian Schaffert

     G. Antoniou, M. Baldoni, C. Baroglio, R. Baumgartner, F. Bry, T. Eiter, N. Henze, M. Herzog, W. May, V. Patti, R. Schindlauer, H. Tompits, S. Schaffert:
    "Reasoning Methods for Personalization on the Semantic Web";
    Annals of Mathematics, Computing & Teleinformatics, 2 (2004), S. 1 - 24.

    Zusätzliche Informationen
  30. Autor/innen: Sergei Artemov; Roman Kuznets, E192-05

     S. Artemov, R. Kuznets:
    "Logical omniscience as infeasibility";
    Annals of Pure and Applied Logic, 165 (2014), 1; S. 6 - 25.

    Zusätzliche Informationen
  31. Autor/innen: Federico Aschieri, E192-05; Agata Ciabattoni, E192-05; Francesco Genco

     F. Aschieri, A. Ciabattoni, F. Genco:
    "Disjunctive Axioms and Concurrent lambda-Calculi: a Curry-Howard Approach";
    CoRR - Computing Research Repository, abs/1802.00961 (2018), abs/1802.00961.
  32. Autor/innen: Federico Aschieri, E192-05; Agata Ciabattoni, E192-05; Francesco Genco

     F. Aschieri, A. Ciabattoni, F. Genco:
    "On the concurrent computational content of intermediate logics";
    Theoretical Computer Science, 813 (2020), S. 375 - 409.
  33. Autor/innen: Federico Aschieri, E192-05; Francesco Genco

     F. Aschieri, F. Genco:
    "Par means parallel: multiplicative linear logic proofs as concurrent functional programs";
    Proceedings of the ACM on Programming Languages, 4 (2020), S. 1 - 18.
  34. Autor/innen: Federico Aschieri, E192-05; Stefan Hetzl, E104-02; Daniel Weller

     F. Aschieri, S. Hetzl, D. Weller:
    "Expansion trees with cut";
    Mathematical Structures In Computer Science, 29 (2019), 8; S. 1009 - 1029.
  35. Autor/innen: Federico Aschieri, E192-05; Daniel Weller

     F. Aschieri, D. Weller et al.:
    "Expansion trees with cut";
    Mathematical Structures In Computer Science, 29 (2019), 8; S. 1009 - 1029.
  36. Autor/innen: Albert Atserias; Johannes Fichte, E192-03; Marc Thurley

     A. Atserias, J. Fichte, M. Thurley:
    "Clause-learning algorithms with many restarts and bounded-width resolution";
    Journal of Artificial Intelligence Research, 40 (2011), 1; S. 353 - 373.

    Zusätzliche Informationen
  37. Autor/innen: Matthias Baaz, E104-02; Agata Ciabattoni, E192-05

     M. Baaz, A. Ciabattoni:
    "Proof theory of witnessed Gödel logic: A negative result";
    Journal of Logic and Computation, 23 (2013), 5; S. 1 - 14.
  38. Autor/innen: Matthias Baaz, E104-02; Agata Ciabattoni, E192-05

     M. Baaz, A. Ciabattoni:
    "Proof theory of witnesses Gödel logic: A negative result";
    Journal of Logic and Computation, 26 (2016), 1; S. 51 - 64.

    Zusätzliche Informationen
  39. Autor/innen: Matthias Baaz, E104-02; Agata Ciabattoni, E104-02; Christian Fermüller, E192-05

     M. Baaz, A. Ciabattoni, C. Fermüller:
    "Hypersequent Calculi for Gödel Logics - a Survey";
    Journal of Logic and Computation, 13 (2003), 6; S. 835 - 861.

    Zusätzliche Informationen
  40. Autor/innen: Matthias Baaz, E104-02; Agata Ciabattoni, E104-02; Christian Fermüller, E192-05

     M. Baaz, A. Ciabattoni, C. Fermüller:
    "Monadic fragments of Gödel logics: decidability and undecidability";
    Lecture Notes in Computer Science, 4790 (2007), S. 77 - 91.
  41. Autor/innen: Matthias Baaz, E104-02; Stefan Hetzl, E192-05

     M. Baaz, S. Hetzl:
    "On the non-confluence of cut-elimination";
    Journal of Symbolic Logic, 76 (2011), 1; S. 313 - 340.
  42. Autor/innen: Matthias Baaz, E104-02; Stefan Hetzl, E192-05; Alexander Leitsch, E192-05; Clemens Richter, E192-05; Hendrik Spohr, E192-05

     M. Baaz, S. Hetzl, A. Leitsch, Clemens Richter, H. Spohr:
    "CERES: An analysis of Fürstenberg's proof of the infinity of primes";
    Theoretical Computer Science, 403 (2008), 2-3; S. 160 - 175.
  43. Autor/innen: Matthias Baaz, E104-02; Stefan Hetzl, E192-05; Alexander Leitsch, E192-05; Clemens Richter, E192-05; Hendrik Spohr, E192-05

     M. Baaz, S. Hetzl, A. Leitsch, Clemens Richter, H. Spohr:
    "Proof transformation by CERES";
    Lecture Notes in Computer Science, 4108 (2006), S. 82 - 93.
  44. Autor/innen: Matthias Baaz, E104-02; Alexander Leitsch, E192-05

     M. Baaz, A. Leitsch:
    "Cut-Elimination: Syntax and Semantics";
    Studia Logica, 102 (2014), 6; S. 1217 - 1244.
  45. Autor/innen: Matthias Baaz, E104-02; Alexander Leitsch, E192-05

     M. Baaz, A. Leitsch:
    "Towards a clausal analysis of cut-elimination";
    Journal of Symbolic Computation, 41 (2006), S. 381 - 410.

    Zusätzliche Informationen
  46. Autor/innen: Matthias Baaz, E104-02; Alexander Leitsch, E192-05; Anela Lolic, E192-02

     M. Baaz, A. Leitsch, A. Lolic:
    "An abstract form of the first epsilon theorem";
    Journal of Logic and Computation, 30 (2021), 8; S. 1447 - 1468.
  47. Autor/innen: Matthias Baaz, E104-02; Anela Lolic, E192-02

     M. Baaz, A. Lolic:
    "Towards a proof theory for Henkin quantifiers";
    Journal of Logic and Computation, 31 (2021), 1; S. 40 - 66.

    Zusätzliche Informationen
  48. Autor/innen: Behrooz Bagheri Gh; Tomas Feder; Herbert Fleischner, E192-01; Carlos Subi

     B. Bagheri Gh, T. Feder, H. Fleischner, C. Subi:
    "Hamiltonian cycles in planar cubic graphs with facial 2-factors, and a new partial solution of Barnette's Conjecture";
    Journal of Graph Theory, 96 (2021), 2; S. 269 - 288.

    Zusätzliche Informationen
  49. Autor/in: Labinot Bajraktari, E192-03

     L. Bajraktari:
    "Querying Rich Ontologies by Exploiting the Structure of Data";
    KI - Künstliche Intelligenz, 34 (2020), 3; S. 395 - 398.

    Zusätzliche Informationen
  50. Autor/innen: Paolo Baldi; Agata Ciabattoni, E192-05

     P. Baldi, A. Ciabattoni:
    "Uniform proofs of standard completeness for extensions of first-order MTL";
    Theoretical Computer Science, 603 (2015), S. 43 - 57.
  51. Autor/innen: Paolo Baldi; Christian Fermüller, E192-05; Matthias Hofer, E192-05

     P. Baldi, C. Fermüller, M. Hofer:
    "On fuzzification mechanisms for unary quantification";
    Fuzzy Sets and Systems, 388 (2020), S. 90 - 123.
  52. Autor/innen: Marcello Balduccini; Stefan Woltran, E192-02

     M. Balduccini, S. Woltran:
    "Special issue on answer set programming";
    AI Communications, 24 (2011), 2; S. 105 - 106.

    Zusätzliche Informationen
  53. Autor/innen: Sayan Bandyapadhyay; Aritra Banik; Sujoy Bhore; Martin Nöllenburg, E192-01

     S. Bandyapadhyay, A. Banik, S. Bhore, M. Nöllenburg:
    "Geometric planar networks on bichromatic collinear points";
    Theoretical Computer Science, 895 (2021), S. 124 - 136.

    Zusätzliche Informationen
  54. Autor/innen: Chitta Baral; Thomas Eiter, E192-03; Marcus Bjäreland; Mutsumi Nakamura

     C. Baral, T. Eiter, M. Bjäreland, M. Nakamura:
    "Maintenance goals of agents in a dynamic environment: Formulation and policy construction";
    Artificial Intelligence, 172 (2008), 12-13; S. 1429 - 1469.
  55. Autor/innen: Moulay Barkatou; Maximilian Jaroschek, E192-04

     M. Barkatou, M. Jaroschek:
    "Removing apparent singularities of linear difference systems";
    Journal of Symbolic Computation, to appear (2019).

    Zusätzliche Informationen
  56. Autor/innen: Lukas Barth; Andreas Gemsa; Benjamin Niedermann; Martin Nöllenburg, E192-01

     L. Barth, A. Gemsa, B. Niedermann, M. Nöllenburg:
    "On the readability of leaders in boundary labeling";
    Information Visualization, 18 (2019), 1; S. 110 - 132.

    Zusätzliche Informationen
  57. Autor/innen: Andreas Bauer; Martin Leucker; Christian Schallhart; Michael Tautschnig, E192-04

     A. Bauer, M. Leucker, C. Schallhart, M. Tautschnig:
    "Don't care in SMT---Building flexible yet efficient abstraction/refinement solvers";
    International Journal on Software Tools for Technology Transfer, 12 (2010), 1; S. 23 - 37.

    Zusätzliche Informationen
  58. Autor/innen: Ringo Baumann; Wolfgang Dvorak, E192-02; Thomas Linsbichler, E192-02; Christof Spanring, E192-02; Hannes Strass; Stefan Woltran, E192-02

     R. Baumann, W. Dvorak, T. Linsbichler, C. Spanring, H. Strass, S. Woltran:
    "On rejected arguments and implicit conflicts: The hidden power of argumentation semantics";
    Artificial Intelligence, 241 (2016), S. 244 - 284.

    Zusätzliche Informationen
  59. Autor/innen: Ringo Baumann; Stefan Woltran, E192-02

     R. Baumann, S. Woltran:
    "The role of self-attacking arguments in characterizations of equivalence notions";
    Journal of Logic and Computation, 26 (2016), 4; S. 1293 - 1313.

    Zusätzliche Informationen
  60. Autor/innen: Robert Baumgartner, E192-02; Oliver Froelich, E192-02; Marcus Herzog, E192-02

     R. Baumgartner, O. Froelich, M. Herzog:
    "Vom Internet zu mobilen Applikationen: intelligente Einbindung von Webdaten mit Lixto";
    Elektrotechnik und Informationstechnik (e&i), 7-8 (2005), S. 247 - 252.

    Zusätzliche Informationen
  61. Autor/innen: Robert Baumgartner, E192-02; Georg Gottlob, E192

     R. Baumgartner, G. Gottlob:
    "Propositional Default Logics Made Easier: Computational Complexity of Model Checking";
    Theoretical Computer Science, 289 (2002), S. 591 - 627.
  62. Autor/innen: Robert Baumgartner, E192-02; Georg Gottlob, E192; Marcus Herzog, E192-02

     R. Baumgartner, G. Gottlob, M. Herzog:
    "Lixto - Halfway to the Semantic Web";
    ÖGAI Journal, 1 (2003), S. 19 - 24.
  63. Autor/innen: Robert Baumgartner, E192-02; Marcus Herzog, E192-02

     R. Baumgartner, M. Herzog:
    "Using Lixto for automating portal-based B2B processes in the automotive industry";
    International Journal of Electronic Business (IJEB), 2 (2004), 5; S. 519 - 530.
  64. Autor/innen: Harald Beck, E192-03; Minh Dao-Tran, E192-03; Thomas Eiter, E192-03

     H. Beck, M. Dao-Tran, T. Eiter:
    "LARS: A Logic-based Framework for Analytic Reasoning over Streams";
    Artificial Intelligence, 261 (2018), S. 16 - 70.

    Zusätzliche Informationen
  65. Autor/innen: Harald Beck, E192-03; Minh Dao-Tran, E192-03; Thomas Eiter, E192-03

     H. Beck, M. Dao-Tran, T. Eiter:
    "What is the Semantics of Your SPARQL Extension?";
    ALP Newsletter, Vol. 28, No. 4, December 2015, 28 (2015).
  66. Autor/innen: Harald Beck, E192-03; Minh Dao-Tran, E192-03; Thomas Eiter, E192-03; Christian Folie

     H. Beck, M. Dao-Tran, T. Eiter, C. Folie:
    "Stream Reasoning with LARS";
    KI - Künstliche Intelligenz, 32 (2018), 2-3; S. 193 - 195.

    Zusätzliche Informationen
  67. Autor/in: Arnold Beckmann, E192-05

     A. Beckmann:
    "Dynamic ordinal analysis";
    Archive for Mathematical Logic, 42 (2003), S. 303 - 334.

    Zusätzliche Informationen
  68. Autor/in: Arnold Beckmann, E192-05

     A. Beckmann:
    "Preservation theorems and restricted consistency statements in bounded arithmetic";
    Annals of Pure and Applied Logic, 126 (2004), S. 255 - 280.
  69. Autor/innen: Arnold Beckmann, E192-05; Sam Buss; Chris Pollett

     A. Beckmann, S Buss, C Pollett:
    "Ordinal Notations and Well-Orderings in Bounded Arithmetic";
    Annals of Pure and Applied Logic, 120 (2003), S. 197 - 222.

    Zusätzliche Informationen
  70. Autor/innen: Arnold Beckmann, E192-05; Jan Johannsen

     A. Beckmann, J Johannsen:
    "An unexpected separation result in linearly bounded arithmetic";
    Mathematical Logic Quarterly, 51 (2005), 2; S. 191 - 200.
  71. Autor/innen: Andreas Beer, TU Graz; Johannes Gärtner; Nysret Musliu, E192-02; Werner Schafhauser, E192-02; Wolfgang Slany, TU Graz

     A. Beer, J. Gärtner, N. Musliu, W. Schafhauser, W. Slany:
    "A Break Scheduling System for Supervision Personnel Using AI techniques.";
    IEEE Intelligent Systems, 25 (2010), 2; S. 60 - 73.
  72. Autor/innen: Libor Behounek; Petr Cintula; Christian Fermüller, E192-05; Tomas Kroupa

     L. Behounek, P. Cintula, C. Fermüller, T. Kroupa:
    "Representing strategic games and their equilibria in many-valued logics";
    Logic Journal of the IGPL, 24 (2016), 3; S. 238 - 267.
  73. Autor/innen: Mike Behrisch, E104-01; Miki Hermann; Stefan Mengel; Gernot Salzer, E192-05

     M. Behrisch, M. Hermann, S. Mengel, G. Salzer:
    "Minimal Distance of Propositional Models";
    Theory of Computing Systems, 63 (2019), 6; S. 1131 - 1184.

    Zusätzliche Informationen
  74. Autor/innen: Michael A. Bekos; Felice De Luca; Walter Didimo; Tamara Mchedlidze; Martin Nöllenburg, E192-01; Antonios Symvonis; Ioannis Tollis

     M. Bekos, F. De Luca, W. Didimo, T. Mchedlidze, M. Nöllenburg, A. Symvonis, I. Tollis:
    "Planar drawings of fixed-mobile bigraphs";
    Theoretical Computer Science, 795 (2019), S. 408 - 419.

    Zusätzliche Informationen
  75. Autor/innen: Michael A. Bekos; Benjamin Niedermann; Martin Nöllenburg, E192-01

     M. Bekos, B. Niedermann, M. Nöllenburg:
    "External Labeling Techniques: A Taxonomy and Survey";
    Computer Graphics Forum, 38 (2019), 3; S. 833 - 860.

    Zusätzliche Informationen
  76. Autor/innen: Gerald Berger, E192-02; Lev Beklemishev; Hans Tompits, E192-03

     G. Berger, L. Beklemishev, H. Tompits:
    "A many-sorted variant of Japaridze's polymodal provability logic";
    Logic Journal of the IGPL, 26 (2018), 5; S. 505 - 538.

    Zusätzliche Informationen
  77. Autor/innen: Benjamin Bergougnoux; Eduard Eiben; Robert Ganian, E192-01; Sebastian Ordyniak; M.S. Ramanujan

     B. Bergougnoux, E. Eiben, R. Ganian, S. Ordyniak, M. Ramanujan:
    "Towards a Polynomial Kernel for Directed Feedback VertexSet";
    Algorithmica, 82 (2020), S. 1 - 21.

    Zusätzliche Informationen
  78. Autor/innen: Philippe Besnard; Anthony Hunter; Stefan Woltran, E192-02

     P. Besnard, A. Hunter, S. Woltran:
    "Encoding deductive argumentation in quantified Boolean formulae";
    Artificial Intelligence, 173 (2009), 15; S. 1406 - 1423.

    Zusätzliche Informationen
  79. Autor/innen: Stéphane Bessy; Fedor Fomin; Serge Gaspers, E192-03; Christophe Paul; Anthony Perez; Saket Saurabh; Stéphan Thomassé

     S. Bessy, F. Fomin, S. Gaspers, C. Paul, A. Perez, S. Saurabh, S. Thomassé:
    "Kernels for Feedback Arc Set In Tournaments";
    Journal of Computer and System Sciences, 77 (2011), 6; S. 1071 - 1078.

    Zusätzliche Informationen
  80. Autor/innen: Olaf Beyersdorff; Joshua Blinkhorn; Leroy Chew, E192-01; Renate Schmidt, Univ. of Manchester; Martin Suda, E192-04

     O. Beyersdorff, J. Blinkhorn, L. Chew, R. Schmidt, M. Suda:
    "Reinterpreting Dependency Schemes: Soundness Meets Incompleteness in DQBF";
    Journal of Automated Reasoning, J Autom Reasoning (2018), S. 1 - 27.

    Zusätzliche Informationen
  81. Autor/innen: Sujoy Bhore; Robert Ganian, E192-01; Fabrizio Montecchiani; Martin Nöllenburg, E192-01

     S. Bhore, R. Ganian, F. Montecchiani, M. Nöllenburg:
    "Parameterized Algorithms for Book Embedding Problems";
    Journal of Graph Algorithms and Applications, 24 (2020), 4; S. 603 - 620.

    Zusätzliche Informationen
  82. Autor/innen: Veronica Biazzo; Angelo Gilio; Thomas Lukasiewicz, E192-03; Giuseppe Sanfilippo

     V. Biazzo, A. Gilio, T. Lukasiewicz, G. Sanfilippo:
    "Probabilistic Logic under Coherence: Complexity and Algorithms";
    Annals of Mathematics and Artificial Intelligence, Online First (2005), Online First.
  83. Autor/innen: Manuel Bichler, E192-02; Michael Morak; Stefan Woltran, E192-02

     M. Bichler, M. Morak, S. Woltran:
    "lpopt: A Rule Optimization Tool for Answer Set Programming";
    Fundamenta Informaticae, 177 (2020), 3-4; S. 275 - 296.

    Zusätzliche Informationen
  84. Autor/innen: Manuel Bichler, E192-02; Michael Morak; Stefan Woltran, E192-02

     M. Bichler, M. Morak, S. Woltran:
    "selp: A Single-Shot Epistemic Logic Program Solver";
    Theory and Practice of Logic Programming, 20 (2020), 4; S. 435 - 455.

    Zusätzliche Informationen
  85. Autor/innen: Manuel Bichler, E192-04; Michael Morak; Stefan Woltran, E192-02

     M. Bichler, M. Morak, S. Woltran:
    "The Power of Non-Ground Rules in Answer Set Programming";
    Theory and Practice of Logic Programming, 16 (2016), 5-6; S. 552 - 569.

    Zusätzliche Informationen
  86. Autor/innen: Meghyn Bienvenu; M.Magdalena Ortiz de la Fuente, E192-03; Mantas Simkus, E192-02

     M. Bienvenu, M. Ortiz de la Fuente, M. Simkus:
    "Regular Path Queries in Lightweight Description Logics: Complexity and Algorithms";
    Journal of Artificial Intelligence Research, 53 (2015), S. 315 - 374.

    Zusätzliche Informationen
  87. Autor/innen: Benjamin Biesinger, E192-01; Bin Hu; Günther Raidl, E192-01

     B. Biesinger, B. Hu, G. Raidl:
    "A hybrid genetic algorithm with solution archive for the discrete (r|p)-centroid problem";
    Journal of Heuristics, 21 (2015), 3; S. 391 - 431.

    Zusätzliche Informationen
  88. Autor/innen: Benjamin Biesinger, E192-01; Bin Hu; Günther Raidl, E192-01

     B. Biesinger, B. Hu, G. Raidl:
    "Models and algorithms for competitive facility location problems with different customer behavior.";
    Annals of Mathematics and Artificial Intelligence, 76 (2016), 1; S. 93 - 119.

    Zusätzliche Informationen
  89. Autor/innen: Antonis Bikakis; Andrea Cohen; Wolfgang Dvorak, E192-02; Giorgos Flouris; Simon Parsons

     A. Bikakis, A. Cohen, W. Dvorak, G. Flouris, S. Parsons:
    "Joint Attacks and Accrual in Argumentation Frameworks";
    Journal of Applied Logics - IfCoLog Journal (FLAP) - College Publications, 8 (2021), 6; S. 1437 - 1502.

    Zusätzliche Informationen
  90. Autor/innen: Aneta Binder, E192-05; Rudolf Freund, E192-05; Marion Oswald, E192-05

     A. Binder, R. Freund, M. Oswald:
    "Modelling Artificial Life by Attributed Eco-array Grammars";
    Artificial Life and Robotics, 9 (2005), 1; S. 63 - 66.
  91. Autor/innen: Daniel Binkele-Raible; Henning Fernau; Serge Gaspers, E192-03; Mathieu Liedloff

     D. Binkele-Raible, H. Fernau, S. Gaspers, M. Liedloff:
    "Exact exponential-time algorithms for finding bicliques";
    Information Processing Letters, 111 (2010), 2; S. 64 - 67.

    Zusätzliche Informationen
  92. Autor/innen: Stefan Bischof; Stefan Decker; Thomas Krennwallner, E192-03; Axel Polleres

     S. Bischof, D. Decker, T. Krennwallner, A. Polleres:
    "Mapping between RDF and XML with XSPARQL";
    LNCS Journal on Data Semantics, 1 (2012), 3; S. 147 - 185.

    Zusätzliche Informationen
  93. Autor/innen: Nikolaj Bjorner; Robert Nieuwenhuis; Helmut Veith, E192-04; Andrei Voronkov

     N. Bjorner, R. Nieuwenhuis, H. Veith, A. Voronkov:
    "Decision Procedures in Soft, Hard and Bio-ware - Follow Up (Dagstuhl Seminar 11272)";
    Dagstuhl Reports, 1 (2011), 7; S. 23 - 35.

    Zusätzliche Informationen
  94. Autor/innen: Bernhard Bliem, E192; Günther Charwat, E192; Markus Hecher, E192-02; Stefan Woltran, E192-02

     B. Bliem, G. Charwat, M. Hecher, S. Woltran:
    "D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy";
    Fundamenta Informaticae, 147 (2016), 1; S. 27 - 61.

    Zusätzliche Informationen
  95. Autor/innen: Bernhard Bliem, 192-02; Michael Morak; Marius Moldovan, E192-02; Stefan Woltran, E192-02

     B. Bliem, M. Morak, M. Moldovan, S. Woltran:
    "The Impact of Treewidth on Grounding and Solving of Answer Set Programs";
    Artificial Intelligence, 67 (2020), S. 35 - 80.

    Zusätzliche Informationen
  96. Autor/innen: Bernhard Bliem, E192; Michael Morak; Stefan Woltran, E192-02

     B. Bliem, M. Morak, S. Woltran:
    "D-FLAT: Declarative Problem Solving Using Tree Decompositions and Answer-Set Programming";
    Theory and Practice of Logic Programming, 12 (2012), 4-5; S. 445 - 464.

    Zusätzliche Informationen
  97. Autor/innen: Bernhard Bliem, E192; Reinhard Pichler, E192-02; Stefan Woltran, E192-02

     B. Bliem, R. Pichler, S. Woltran:
    "Implementing Courcelle's Theorem in a declarative framework for dynamic programming";
    Journal of Logic and Computation, 27 (2017), 4; S. 1067 - 1094.

    Zusätzliche Informationen
  98. Autor/innen: Bernhard Bliem, E192; Stefan Woltran, E192-02

     B. Bliem, S. Woltran:
    "Complexity of Secure Sets";
    Algorithmica, 80 (2018), 10; S. 2909 - 2940.

    Zusätzliche Informationen
  99. Autor/innen: Bernhard Bliem, E192-02; Stefan Woltran, E192-02

     B. Bliem, S. Woltran:
    "Defensive alliances in graphs of bounded treewidth";
    Discrete Applied Mathematics, 251 (2018), 251; S. 334 - 339.

    Zusätzliche Informationen
  100. Autor/innen: Bernhard Bliem, E192-02; Stefan Woltran, E192-02

     B. Bliem, S. Woltran:
    "Equivalence between answer-set programs under (partially) fixed input";
    Annals of Mathematics and Artificial Intelligence, 83 (2018), 3-4; S. 277 - 295.

    Zusätzliche Informationen
  101. Autor/innen: Roderick Bloem; Nicolas Braud-Santoni; Vedad Hadzic; Uwe Egly, E192-03; Florian Lonsing, E192-03; Martina Seidl

     R. Bloem, N. Braud-Santoni, V. Hadzic, U. Egly, F. Lonsing, M. Seidl:
    "Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations";
    Formal Methods in System Design, 57 (2021), 1; S. 157 - 177.

    Zusätzliche Informationen
  102. Autor/innen: Roderick Bloem; Swen Jacobs, TU Graz; Ayrat Khalimov, TU Graz; Igor Konnov, E192; Sasha Rubin; Helmut Veith, E192-04; Josef Widder, E191-02

     R. Bloem, S. Jacobs, A. Khalimov, I. Konnov, S. Rubin, H. Veith, J. Widder:
    "Decidability of Parameterized Verification";
    ACM SIGACT News, 47 (2016), 2; S. 53 - 64.

    Zusätzliche Informationen
  103. Autor/innen: Christian Blum; Marko Djukanovic, E192-01; Alberto Santini; Hua Jiang; Chu-Min Li; Felip Manya; Günther Raidl, E192-01

     C. Blum, M. Djukanovic, A. Santini, H. Jiang, C. Li, F. Manya, G. Raidl:
    "Solving longest common subsequence problems via a transformation to the maximum clique problem";
    Computers & Operations Research, 125 (2020), 17 S.

    Zusätzliche Informationen
  104. Autor/innen: Christian Blum; Jakob Puchinger; Günther Raidl, E192-01; Andrea Roli

     C. Blum, J. Puchinger, G. Raidl, A. Roli:
    "Hybrid metaheuristics in combinatorial optimization: A survey";
    Applied Soft Computing, Volume 11 (2011), Issue 6; S. 4135 - 4151.

    Zusätzliche Informationen
  105. Autor/innen: Christian Blum; Günther Raidl, E192-01

     C. Blum, G. Raidl:
    "Computational Performance Evaluation of Two Integer Linear Programming Models for the Minimum Common String Problem";
    Optimization Letters, online 07/2015 (2015), S. 1 - 17.

    Zusätzliche Informationen
  106. Autor/innen: Chiara Bodei, uniPi; Lorenzo Ceragioli, University di Pisa; Pierpaolo Degano, University of Pisa; Riccardo Focardi, DAIS; Letterio Galletta, IMT School for A ...; Flaminia L. Luccio, DIAS; Mauro Tempesta, E192-06; Lorenzo Veronese, E192-06

     C. Bodei, L. Ceragioli, P. Degano, R. Focardi, L. Galletta, F. Luccio, M. Tempesta, L. Veronese:
    "FWS: Analyzing, Maintaining and Transcompiling Firewalls";
    Journal of Computer Security, 29 (2021), 1; S. 77 - 134.

    Zusätzliche Informationen
  107. Autor/innen: Angela Bohn; Ingo Feinerer, E192-02; Kurt Hornik, WU Wien; Patrick Mair

     A. Bohn, I. Feinerer, K. Hornik, P. Mair:
    "Content-based social network analysis of mailing lists";
    R Journal, 3 (2011), 1; S. 11 - 18.

    Zusätzliche Informationen
  108. Autor/innen: Endre Boros; Benny Kimelfeld; Reinhard Pichler, E192-02; Nicole Schweikardt

     E. Boros, B. Kimelfeld, R. Pichler, N. Schweikardt:
    "Enumeration in Data Management (Dagstuhl Seminar 19211)";
    Dagstuhl Reports, 9 (2019), 5; S. 89 - 109.

    Zusätzliche Informationen
  109. Autor/innen: Pierre Bourhis; Marco Manna; Michael Morak; Andreas Pieris, E192-02

     P. Bourhis, M. Manna, M. Morak, A. Pieris:
    "Guarded-Based Disjunctive Tuple-Generating Dependencies";
    ACM Transactions on Database Systems, 41 (2016), 4; S. 27:1 - 27:45.

    Zusätzliche Informationen
  110. Autor/innen: Simone Bova, E192-03; Leonardo Cabrer

     S. Bova, L. Cabrer:
    "Unification and Projectivity in De Morgan and Kleene Algebras";
    Order, - (2013), S. 1 - 29.

    Zusätzliche Informationen
  111. Autor/innen: Simone Bova, E192-03; Hubie Chen; Matthew Valeriote

     S. Bova, H. Chen, M. Valeriote:
    "Generic Expression Hardness Results for Primitive Positive Formula Comparison";
    Information and Computation, Vol. 222 (2013), S. 108 - 120.

    Zusätzliche Informationen
  112. Autor/innen: Simone Maria Bova, E192-01; Robert Ganian, E192-01; Stefan Szeider, E192-01

     S. Bova, R. Ganian, S. Szeider:
    "Model Checking Existential Logic on Partially Ordered Sets";
    ACM Transactions on Computational Logic, 17 (2015), 2; S. 1 - 35.

    Zusätzliche Informationen
  113. Autor/innen: Simone Maria Bova, E192-01; Robert Ganian, E192-01; Stefan Szeider, E192-01

     S. Bova, R. Ganian, S. Szeider:
    "Quantified conjunctive queries on partially ordered sets";
    Theoretical Computer Science, 618 (2016), S. 72 - 84.

    Zusätzliche Informationen
  114. Autor/innen: Simone Maria Bova, E192-01; Friedrich Slivovsky, E192-01

     S. Bova, F. Slivovsky:
    "On Compiling Structured CNFs to OBDDs";
    Theory of Computing Systems, 61 (2017), S. 637 - 655.

    Zusätzliche Informationen
  115. Autor/innen: Loris Bozatto, Fondazione Bruno; Thomas Eiter, E192-03; Rafael Peter David Kiesel, E192-03

     L. Bozatto, T. Eiter, R. Kiesel:
    "Reasoning on Multirelational Contextual Hierarchies via Answer Set Programming with Algebraic Measures";
    TPLP - Theory and Practice of Logic Programming, 5 (2021), S. 593 - 609.

    Zusätzliche Informationen
  116. Autor/innen: Loris Bozzato; Thomas Eiter, E192-03; Luciano Serafini

     L. Bozzato, T. Eiter, L. Serafini:
    "Enhancing Contextualized Knowledge Repositories with Justifiable Exceptions";
    Artificial Intelligence, 257 (2018), S. 72 - 126.

    Zusätzliche Informationen
  117. Autor/innen: Martin Brain; Esra Erdem; Katsumi Inoue; Johannes Oetsch, E192-03; Joerg Puehrer, E192-03; Hans Tompits, E192-03; Cemal Yilmaz

     M. Brain, E. Erdem, K. Inoue, J. Oetsch, J. Puehrer, H. Tompits, C. Yilmaz:
    "Event-Sequence Testing using Answer-Set Programming";
    International Journal On Advances in Software, 5 (2012), 3 & 4; 15 S.

    Zusätzliche Informationen
  118. Autor/innen: Robert Bredereck; Jiehua Chen, E192-01; Ugo Paavo Finnendahl; Rolf Niedermeier

     R. Bredereck, J. Chen, U. Finnendahl, R. Niedermeier:
    "Stable roommates with narcissistic, single-peaked, andsingle-crossing preferences";
    Autonomous Agents and Multi-Agent Systems, 34 (2020), S. 1 - 29.

    Zusätzliche Informationen
  119. Autor/innen: Gerhard Brewka, Uni Leipzig; Martin Diller, E192-02; Georg Heissenberger; Thomas Linsbichler, E192-02; Stefan Woltran, E192-02

     G. Brewka, M. Diller, G. Heissenberger, T. Linsbichler, S. Woltran:
    "Solving Advanced Argumentation Problems with Answer Set Programming";
    Theory and Practice of Logic Programming, 20 (2020), 3; S. 391 - 431.

    Zusätzliche Informationen
  120. Autor/innen: Gerd Brewka; Thomas Eiter, E192-03; Miroslaw Truszczynski

     G. Brewka, T. Eiter, M. Truszczynski:
    "Answer Set Programming at a Glance";
    Communications of the ACM, 54 (2011), 12; S. 92 - 103.

    Zusätzliche Informationen
  121. Autor/innen: Gerhard Brewka, Uni Leipzig; Stefan Ellmauthaler; Hannes Strass; Johannes Peter Wallner, E192-02; Stefan Woltran, E192-02

     G. Brewka, St. Ellmauthaler, H. Strass, J. P. Wallner, S. Woltran:
    "Abstract Dialectical Frameworks. An Overview";
    IfCoLog Journal of Logics and their Applications, 4 (2017), 8; S. 2263 - 2318.

    Zusätzliche Informationen
  122. Autor/innen: Gerd Brewka; Sylwia Polberg, E192-02; Stefan Woltran, E192-02

     G. Brewka, S. Polberg, S. Woltran:
    "Generalizations of Dung Frameworks and Their Role in Formal Argumentation";
    IEEE Intelligent Systems, 29 (2014), 1; S. 30 - 38.

    Zusätzliche Informationen
  123. Autor/innen: Remi Brochenin; Thomas Linsbichler, E192-02; Marco Maratea; Johannes Peter Wallner, E192-02; Stefan Woltran, E192-02

     R. Brochenin, T. Linsbichler, M. Maratea, J. P. Wallner, S. Woltran:
    "Abstract Solvers for Dung's Argumentation Frameworks";
    Argument & Computation, 9 (2018), 1; S. 41 - 72.

    Zusätzliche Informationen
  124. Autor/innen: Hajo Broersma; Stefan S. Dantchev; Matthew Johnson; Stefan Szeider, E192-03

     H. Broersma, S. Dantchev, M. Johnson, St. Szeider:
    "Journal of Discrete Algorithms 8(2) - Editorial";
    Journal of Discrete Algorithms, 8 (2010), 2; S. 101.

    Zusätzliche Informationen
  125. Autor/innen: M. Broxvall; P. Jonsson; Jochen Renz, E192-02

     M. Broxvall, P. Jonsson, J. Renz:
    "Disjunctions, Independence, Refinements";
    Artificial Intelligence, 140 (2002), 1-2; S. 153 - 173.
  126. Autor/innen: Till Bruckdorfer; Sabine Cornelsen; Carsten Gutwenger; Michael Kaufmann; Fabrizioo Montecchiani; Martin Nöllenburg, E192-01; Alexander Wolff

     T. Bruckdorfer, S. Cornelsen, C. Gutwenger, M Kaufmann, F. Montecchiani, M. Nöllenburg, A. Wolff:
    "Progress on Partial Edge Drawings";
    Journal of Graph Algorithms and Applications, 21 (2017), 4; S. 757 - 786.

    Zusätzliche Informationen
  127. Autor/innen: Marie-Louise Bruner, E104-05; Martin Lackner, E192

     M. Bruner, M. Lackner:
    "A Fast Algorithm for Permutation Pattern Matching Based on Alternating Runs";
    Algorithmica (online), online (2015), 34 S.

    Zusätzliche Informationen
  128. Autor/innen: Marie-Louise Bruner, E104-05; Martin Lackner, E192

     M. Bruner, M. Lackner:
    "The computational landscape of permutation patterns";
    arXiv.org e-Print archive, http://arxiv.org/abs/1301.0340 (2013), 22 S.

    Zusätzliche Informationen
  129. Autor/innen: Francesco Buccafurri; Wolfgang Faber, E192-03; Nicola Leone

     F. Buccafurri, W. Faber, N. Leone:
    "Disjunctive Logic Programs with Inheritance";
    Theory and Practice of Logic Programming, 2 (2002), 3; S. 293 - 321.

    Zusätzliche Informationen
  130. Autor/innen: Samuel Bucheli; Roman Kuznets, E192-05; Thomas Studer

     S. Bucheli, R. Kuznets, T. Studer:
    "Realizing public announcements by justifications";
    Journal of Computer and System Sciences, 80 (2014), 6; S. 1046 - 1066.

    Zusätzliche Informationen
  131. Autor/innen: Kevin Buchin; David Eppstein; Maarten Löffler; Martin Nöllenburg, E192-01; Rodrigo I. Silveira

     K. Buchin, D. Eppstein, M. Löffler, M. Nöllenburg, R. Silveira:
    "Adjacency-Preserving Spatial Treemaps";
    Journal of Computational Geometry, 7 (2016), 1; S. 100 - 122.

    Zusätzliche Informationen
  132. Autor/innen: Laurent Bulteau; Niels Grüttemeier; Christian Komusiewicz; Manuel Sorge, E192-01

     L. Bulteau, N. Grüttemeier, C. Komusiewicz, M. Sorge:
    "Your rugby mates don´t need to know your colleagues: Triadic closure with edgecolors";
    Journal of Computer and System Sciences, 120 (2021), S. 75 - 96.

    Zusätzliche Informationen
  133. Autor/innen: Pedro Cabalar; Jorge Fandiño; Michael Fink, E192-03

     P. Cabalar, J. Fandiño, M. Fink:
    "Causal Graph Justifications of Logic Programs";
    Theory and Practice of Logic Programming, 14 (2014), 4-5; S. 603 - 618.

    Zusätzliche Informationen
  134. Autor/in: Leo Cabrer, E192-05

     L. Cabrer et al.:
    "A general framework for product representations: bilattices and beyond";
    Logic Journal of the IGPL, 23 (2015), 4; S. 816 - 841.
  135. Autor/in: Leo Cabrer, E192-05

     L. Cabrer et al.:
    "Classifying $\mathsf{GL}(n,\mathbb Z)$-orbits of points and rational subspaces.";
    Discrete And Continuous Dynamical Systems, 36 (2016), S. 4723 - 4738.
  136. Autor/in: Leo Cabrer, E192-05

     L. Cabrer et al.:
    "Classifying orbits of the affine group over the integers";
    Ergodic Theory and Dynamical Systems, 37 (2015), 1 S.
  137. Autor/in: Leo Cabrer, E192-05

     L. Cabrer et al.:
    "Idempotent Endomorphisms of free MV-algebras and unital $\ell$-groups";
    Journal of Pure and Applied Algebra, 221 (2016), S. 908 - 934.
  138. Autor/in: Leo Cabrer, E192-05

     L. Cabrer et al.:
    "MV-algebras, infinite dimensional polyhedra, and natural dualities";
    Archive for Mathematical Logic, 1603.01005 (2016), 1603.01005.

    Zusätzliche Informationen
  139. Autor/in: Leo Cabrer, E192-05

     L. Cabrer et al.:
    "Natural dualities through product representations: bilattices and beyond";
    Studia Logica, 104 (2016), 3; S. 567 - 592.
  140. Autor/in: Leo Cabrer, E192-05

     L. Cabrer et al.:
    "Product representation for default bilattices: an application of natural duality theory";
    Journal of Pure and Applied Algebra, 219 (2015), S. 2962 - 2988.
  141. Autor/innen: Leo Cabrer, E192-05; George Metcalfe

     L. Cabrer, G Metcalfe:
    "Admissibility via natural dualities.";
    Journal of Pure and Applied Algebra, 219 (2015), S. 4229 - 4253.
  142. Autor/innen: Leo Cabrer, E192-05; George Metcalfe

     L. Cabrer, G Metcalfe:
    "Exact unification and admissibility.";
    Logical Methods in Computer Science, 11 (2015), S. 1 - 15.
  143. Autor/innen: Leo Cabrer, E192-05; Daniele Mundici

     L. Cabrer, D. Mundici:
    "Severi-Bouligand tangents, Frenet frames, Riesz spaces";
    Advances in Applied Mathematics, 64 (2015), S. 1 - 20.
  144. Autor/innen: Marco Cadoli; Thomas Eiter, E192-03; Georg Gottlob, E192

     M. Cadoli, T. Eiter, G. Gottlob:
    "Complexity of Nested Circumscription and Nested Abnormality Theories";
    ACM Transactions on Computational Logic, 6 (2005), 2; S. 232 - 272.
  145. Autor/innen: Andrea Cali; Thomas Lukasiewicz, E192-03; Livia Predoiu; Heiner Stuckenschmidt

     A. Cali, T. Lukasiewicz, L. Predoiu, H. Stuckenschmidt:
    "Tightly Coupled Probabilistic Description Logic Programs for the Semantic Web";
    LNCS Journal on Data Semantics, 12 (2009), S. 95 - 130.
  146. Autor/innen: Francesco Calimeri; Giovambattista Ianni, E192-03; Thomas Krennwallner, E192-03; Francesco Ricca

     F. Calimeri, G. Ianni, T. Krennwallner, F. Ricca:
    "The Answer Set Programming Competition";
    AI Magazine, 33 (2012), 4; S. 114 - 118.

    Zusätzliche Informationen
  147. Autor/innen: Diego Calvanese; Thomas Eiter, E192-03; M.Magdalena Ortiz de la Fuente, E192-03

     D. Calvanese, T. Eiter, M. Ortiz de la Fuente:
    "Answering Regular Path Queries in Expressive Description Logics via Alternating Tree-Automata";
    Information and Computation, 237 (2014), S. 12 - 55.

    Zusätzliche Informationen
  148. Autor/innen: Diego Calvanese; M.Magdalena Ortiz de la Fuente, E192-03; Mantas Simkus, E192-02; Giorgio Stefanoni

     D. Calvanese, M. Ortiz de la Fuente, M. Simkus, G. Stefanoni:
    "Reasoning about Explanations for Negative Query Answers in DL-Lite";
    Journal of Artificial Intelligence Research, 48 (2013), S. 635 - 669.

    Zusätzliche Informationen
  149. Autor/innen: Stefano Calzavara, UNIVE; Marco Squarcina, E192-06; Mauro Tempesta, E192-06; Riccardo Focardi, DAIS

     S. Calzavara, M. Squarcina, M. Tempesta, R. Focardi:
    "Surviving the Web: A Journey into Web Session Security";
    Acm Computing Surveys, Volume 50 Issue 1 (2017), 13; S. 1 - 34.

    Zusätzliche Informationen
  150. Autor/innen: Thom Castermans; Mereke van Garderen; Wouter Meulemans; Martin Nöllenburg, E192-01; Xiaoru Yuan

     T. Castermans, M. van Garderen, W. Meulemans, M. Nöllenburg, X. Yuan:
    "Short Plane Supports for Spatial Hypergraphs";
    Journal of Graph Algorithms and Applications, 23 (2019), 3; S. 463 - 498.

    Zusätzliche Informationen
  151. Autor/innen: Matteo Cavaliere; Rudolf Freund, E192-05; Marion Oswald, E192-05; Dragos Sburlan

     M. Cavaliere, R. Freund, M. Oswald, D. Sburlan:
    "Multiset random context grammars, checkers, and transducers";
    Theoretical Computer Science, 372 (2007), S. 136 - 151.
  152. Autor/innen: David Cerna, E192-05; Alexander Leitsch, E192-05; Anela Lolic, E104-02

     D. Cerna, A. Leitsch, A. Lolic:
    "Schematic Refutations of Formula Schemata";
    ArXiv, 1902.08055 (2019), 52 S.
  153. Autor/innen: David Cerna, E192-05; Alexander Leitsch, E192-05; Anela Lolic, E104-02

     D. Cerna, A. Leitsch, A. Lolic:
    "Schematic Refutations of Formula Schemata";
    Journal of Automated Reasoning, online (2020).
  154. Autor/innen: Sagar Chaki; Christian Schallhart; Helmut Veith, E192-04

     S. Chaki, C. Schallhart, H. Veith:
    "Verification across Intellectual Property Boundaries";
    ACM Transactions on Software Engineering and Methodology, 22 (2013), 2; S. Article 15.
  155. Autor/innen: Bernadette Charron-Bost; Matthias Függer, E191-02; Jennifer Welch, Texas A&M Univer; Josef Widder, E192-04

     B. Charron-Bost, M Függer, L. Welch, J. Widder:
    "Time Complexity of Link Reversal Routing";
    ACM Transactions on Algorithms, 11 (2015), 3; S. 1 - 39.

    Zusätzliche Informationen
  156. Autor/innen: Bernadette Charron-Bost; Antoine Gaillard; Jennifer Welch, Texas A&M Univer; Josef Widder, E192-04

     B. Charron-Bost, A. Gaillard, L. Welch, J. Widder:
    "Link Reversal Routing with Binary Link Labels: Work Complexity";
    SIAM JOURNAL ON COMPUTING, 42 (2013), 2; S. 634 - 661.

    Zusätzliche Informationen
  157. Autor/innen: Günther Charwat, E192; Wolfgang Dvorak; Sarah Alice Gaggl; Johannes Peter Wallner, E192-02; Stefan Woltran, E192-02

     G. Charwat, W. Dvorak, S. Gaggl, J. P. Wallner, S. Woltran:
    "Methods for solving reasoning problems in abstract argumentation - A survey";
    Artificial Intelligence, 220 (2015), S. 28 - 63.

    Zusätzliche Informationen
  158. Autor/innen: Günther Charwat, E192; Stefan Woltran, E192-02

     G. Charwat, S. Woltran:
    "Expansion-based {QBF} Solving on Tree Decompositions";
    Fundamenta Informaticae, 167 (2019), 1-2; S. 59 - 92.

    Zusätzliche Informationen
  159. Autor/innen: Krishnendu Chatterjee, 192-02; Wolfgang Dvorak, E192-02; Monika Henzinger, 192-02; Alexander Svozil, 192-02

     K. Chatterjee, W. Dvorak, M. Henzinger, A. Svozil:
    "Algorithms and conditional lower bounds for planning problems";
    Artificial Intelligence, 297 (2021), 297; S. 1 - 22.

    Zusätzliche Informationen
  160. Autor/innen: Jiehua Chen, E192-01; Sven Grottke

     J. Chen, S. Grottke:
    "Small one‑dimensional Euclidean preference profiles";
    Social Choice and Welfare, 57 (2021), S. 117 - 144.

    Zusätzliche Informationen
  161. Autor/innen: Jiehua Chen, E192-01; Piotr Skowron, 192-02; Manuel Sorge, E192-01

     J. Chen, P. Skowron, M. Sorge:
    "Matchings under Preferences: Strength of Stability and Tradeoffs";
    ACM Transactions on Economics and Computation, 9 (2021), 4; S. 1 - 55.

    Zusätzliche Informationen
  162. Autor/innen: V Chepoi; Nadia Creignou; Miki Hermann; Gernot Salzer, E192-05

     V. Chepoi, N. Creignou, M. Hermann, G. Salzer:
    "The Helly Property and Satisfiability of Boolean Formulas Defined on Set Families";
    European Journal of Combinatorics, 31 (2010), 2; S. 502 - 516.

    Zusätzliche Informationen
  163. Autor/innen: Klaus Chmelina; Heribert Kahmen, E120-05; Thomas Eiter, E192-03; Uwe Egly, E192-03

     K. Chmelina, H. Kahmen, T. Eiter, U. Egly:
    "Heuristische Echtzeit-Fehlererkennung bei Deformationsmessungen während des Tunnelvortriebs";
    Zeitschrift für Geodäsie, Geoinformation und Landmanagement (zfv), 128 (2003), 5; S. 333 - 340.

    Zusätzliche Informationen
  164. Autor/innen: Karel Chvalovský; Petre Cintula, E192-05

     K. Chvalovský, P. Cintula:
    "Note on deduction theorems in contraction-free logics";
    Mathematical Logic Quarterly, 58 (2012), 3; S. 236 - 243.
  165. Autor/innen: Andreas Chwatal; Günther Raidl, E192-01

     A Chwatal, G. Raidl:
    "Solving the minimum label spanning tree problem by mathematical programming techniques";
    Advances in Operations Research, Volume 2011 (2011).

    Zusätzliche Informationen
  166. Autor/innen: Andreas Chwatal; Günther Raidl, E192-01; Karin Oberlechner

     A Chwatal, G. Raidl, K. Oberlechner:
    "Solving a k-node minimum label spanning arborescence problem to compress fingerprint templates.";
    Journal of Mathematical Modelling and Algorithms, Volume 8 (2009), 3; S. 293 - 334.

    Zusätzliche Informationen
  167. Autor/innen: Agata Ciabattoni, E192-05; Matthias Baaz, E104-02

     A. Ciabattoni, M. Baaz:
    "Proof theory of witnessed G{"{o}}del logic: {A} negative result";
    Journal of Logic and Computation, 26 (2016), 1; S. 51 - 64.
  168. Autor/innen: Agata Ciabattoni, E192-05; Matthias Baaz, E104-02; Christian Fermüller, E192-05

     A. Ciabattoni, M. Baaz, C. Fermüller:
    "Theorem proving for prenex Gödel logic with Delta: checkingvalidity and unsatisfiability";
    Logical Methods in Computer Science, 8 (2012), 1; S. 1 - 20.

    Zusätzliche Informationen
  169. Autor/innen: Agata Ciabattoni, E192-05; Matthias Baaz, E104-02; Dov M. Gabbay

     A. Ciabattoni, M. Baaz, D.M. Gabbay et al.:
    "PREFACE OF A SPECIAL ISSUE OF THE J. of LOGIC AND COMPUTATION";
    Journal of Logic and Computation, 27 (2017), 2.
  170. Autor/innen: Agata Ciabattoni, E192-05; Matthias Baaz, E104-02; Dov M. Gabbay; Stefan Hetzl, E104-02; Daniel Weller

     A. Ciabattoni, M. Baaz, D.M. Gabbay, S. Hetzl, D. Weller:
    "Preface";
    Journal of Logic and Computation, 1 (2014).
  171. Autor/innen: Agata Ciabattoni, E192-05; Matthias Baaz, E104-02; Norbert Preining

     A. Ciabattoni, M. Baaz, N Preining:
    "First-order satisfiability in Gödel logics: an NP-complete fragment";
    Theoretical Computer Science, 414 (2011), S. 6612 - 6623.
  172. Autor/innen: Agata Ciabattoni, E192-05; Nikolaos Galatos

     A. Ciabattoni, N. Galatos et al.:
    "Algebraic proof theory: Hypersequents and hypercompletions";
    Annals of Pure and Applied Logic, 168 (2017), 3; S. 693 - 737.

    Zusätzliche Informationen
  173. Autor/innen: Agata Ciabattoni, E192-05; Nikolaos Galatos; Kazushige Terui

     A. Ciabattoni, N. Galatos, K. Terui:
    "Algebraic proof theory for substructural logics: Cut elimination and completions";
    Annals of Pure and Applied Logic, 163 (2012), S. 266 - 290.

    Zusätzliche Informationen
  174. Autor/innen: Agata Ciabattoni, E192-05; Nikolaos Galatos; Kazushige Terui

     A. Ciabattoni, N. Galatos, K. Terui:
    "MacNeille Comletions of FL-algebras";
    Algebra Universalis, 66 (2011), S. 405 - 420.
  175. Autor/innen: Agata Ciabattoni, E192-05; Francesco Genco

     A. Ciabattoni, F. Genco:
    "Hypersequents and Systems of Rules: Embeddings and Applications.";
    ACM Transactions on Computational Logic, 19 (2018), 2; S. 1 - 27.

    Zusätzliche Informationen
  176. Autor/innen: Agata Ciabattoni, E192-05; Francesco Genco; Elisa Freschi

     A. Ciabattoni, F. Genco, E. Freschi:
    "Understanding prescriptive texts: rules and logic elaborated by Mīmāṃsā school";
    Online Journal of World Philosophies, 2 (2017), 1; 19 S.
  177. Autor/innen: Agata Ciabattoni, E192-05; Francesco Genco; Revantha Ramanayake

     A. Ciabattoni, F. Genco, R. Ramanayake:
    "Substructural logics: semantics, proof theory, and applications. Report on the second SYSMICS workshop";
    ACM SIGLOG News, 5 (2018), 2; S. 58 - 60.

    Zusätzliche Informationen
  178. Autor/innen: Agata Ciabattoni, E192-05; Timo Lang, E192-05; Revantha Ramanayake

     A. Ciabattoni, T Lang, R. Ramanayake:
    "Bounded-analytic sequent calculi and embeddings for hypersequent logics.";
    The Journal of Symbolic Logic, 86 (2021), 2; S. 635 - 668.
  179. Autor/innen: Agata Ciabattoni, E104-02; Alexander Leitsch, E192-05

     A. Ciabattoni, A. Leitsch:
    "Towards an algorithmic construction of cut-elimination procedures";
    Mathematical Structures In Computer Science, 18 (2008), 1; S. 81 - 105.
  180. Autor/innen: Agata Ciabattoni, E192-05; Björn Lellmann; Kees van Berkel, E192-05

     A. Ciabattoni, B. Lellmann, K. van Berkel:
    "Deontic Reasoning: From Ancient Texts to Artificial Intelligence. Workshop report";
    ACM SIGLOG News, 5 (2018), 4; S. 48 - 51.
  181. Autor/innen: Agata Ciabattoni, E192-05; Tim Lyon; Revantha Ramanayake

     A. Ciabattoni, T. Lyon, R. Ramanayake et al.:
    "Display to Labeled Proofs and Back Again for Tense Logics";
    ACM Transactions on Computational Logic, 22 (2021), 3; S. 1 - 31.
  182. Autor/innen: Agata Ciabattoni, E192-05; George Metcalfe; Franco Montagna

     A. Ciabattoni, G Metcalfe, F. Montagna:
    "Algebaic and proof-theoretic characterizations of truth stressers for MTL and its extensions";
    Fuzzy Sets and Systems, 161 (3) (2010), S. 369 - 389.
  183. Autor/innen: Agata Ciabattoni, E192-05; Franco Montagna

     A. Ciabattoni, F. Montagna:
    "Proof theory for locally finite many-valued logics: Semi-projective logics";
    Theoretical Computer Science, 480 (2013), S. 26 - 42.
  184. Autor/innen: Agata Ciabattoni, E192-05; Franco Montagna

     A. Ciabattoni, F. Montagna et al.:
    "Proof Search and Co-NP Completeness for Many-Valued Logics";
    Fuzzy Sets and Systems, 5 (2015), 05; S. 1 - 20.
  185. Autor/innen: Agata Ciabattoni, E192-05; Franco Montagna

     A. Ciabattoni, F. Montagna et al.:
    "Proof search and Co-NP completeness for many-valued logics";
    Fuzzy Sets and Systems, 296 (2016), S. 130 - 149.
  186. Autor/innen: Agata Ciabattoni, E192-05; David Picado Muino; Thomas Vetterlein, E192-05; Moataz El Zekey, E104-02

     A. Ciabattoni, D. Picado Muino, T Vetterlein, M. El Zekey:
    "Formal approaches to rule-based systems in medicine: The case of CADIAG-2";
    International Journal of Approximate Reasoning, 54 (2013), 1; S. 132 - 148.
  187. Autor/innen: Agata Ciabattoni, E192-05; Revantha Ramanayake

     A. Ciabattoni, R. Ramanayake:
    "Hypersequent and Display Calculi - a Unified Perspective";
    Studia Logica, 102 (2014), 6; S. 1245 - 1294.
  188. Autor/innen: Agata Ciabattoni, E192-05; Lara Spendier, E192-05

     A. Ciabattoni, L. Spendier et al.:
    "Taming Paraconsistent (and Other) Logics: An Algorithmic Approach";
    Journal of the ACM, 16 (2014), 1.

    Zusätzliche Informationen
  189. Autor/innen: Petre Cintula, E192-05; Erich Peter Klement; Lawrence N. Stout

     P. Cintula, E. Klement, L. Stout:
    "Editorial";
    Fuzzy Sets and Systems, 197 (2012), S. 1 - 2.
  190. Autor/innen: Edmund Clarke; Orna Grumberg; Somesh Jha; Yuan Lu; Helmut Veith, E192-04

     E. Clarke, O. Grumberg, S. Jha, Y. Lu, H. Veith:
    "Counterexample-Guided Abstraction Refinement for Symbolic Model Checking";
    Journal of the ACM, Volume 50 (2003), Issue 5; S. 752 - 794.

    Zusätzliche Informationen
  191. Autor/innen: Kathrin Conrad; Nysret Musliu, E192-02; Reinhard Pichler, E192-02; Hannes Werthner, E194-04

     K. Conrad, N. Musliu, R. Pichler, H. Werthner:
    "Universities and computer science in the European crisis of refugees";
    Communications of the ACM, 59 (2016), 10; S. 31 - 33.

    Zusätzliche Informationen
  192. Autor/innen: Esther Anna Corsi; Christian Fermüller, E192-05

     E Corsi, C. Fermüller:
    "Connecting fuzzy logic and argumentation frames via logical attack principles";
    Soft Computing, (online first) (2018), S. 1 - 16.

    Zusätzliche Informationen
  193. Autor/innen: Esther Anna Corsi; Christian Fermüller, E192-05

     E Corsi, C. Fermüller:
    "Connecting fuzzy logic and argumentation frames via logical attack principles";
    Soft Computing, 23 (2019), 7; S. 2255 - 2270.
  194. Autor/innen: Nadia Creignou; Herve Daude; Uwe Egly, E192-03

     N. Creignou, H. Daude, U. Egly:
    "Phase Transition for Random Quantified XOR-Formulas";
    Journal of Artificial Intelligence Research, 29 (2007), S. 1 - 18.
  195. Autor/innen: Nadia Creignou; Herve Daude; Uwe Egly, E192-03; Raphael Rossignol

     N. Creignou, H. Daude, U. Egly, R. Rossignol:
    "Exact location of the phase transition for random (1,2)-QSAT";
    RAIRO Informatique theorique et Applications / Theoretical Informatics and Applications, 49 (2015), 1; S. 23 - 45.

    Zusätzliche Informationen
  196. Autor/innen: Nadia Creignou; Uwe Egly, E192-03; Johannes Schmidt

     N. Creignou, U. Egly, J. Schmidt:
    "Complexity Classifications for Logic-Based Argumentation";
    ACM Transactions on Computational Logic, 15 (2014), 3.

    Zusätzliche Informationen
  197. Autor/innen: Nadia Creignou; Miki Hermann; Andrei Krokhin; Gernot Salzer, E192-05

     N. Creignou, M. Hermann, A. Krokhin, G. Salzer:
    "Complexity of Clausal Constraints Over Chains";
    Theory of Computing Systems, 42 (2008), 2; S. 239 - 255.
  198. Autor/innen: Nadia Creignou; Markus Kröll, E192-02; Reinhard Pichler, E192-02; Sebastian Skritek, E192-02; Heribert Vollmer

     N. Creignou, M. Kröll, R. Pichler, S. Skritek, H. Vollmer:
    "A complexity theory for hard enumeration problems";
    Discrete Applied Mathematics, 268 (2019), S. 191 - 209.

    Zusätzliche Informationen
  199. Autor/innen: Nadia Creignou; Odile Papini; Reinhard Pichler, E192-02; Stefan Woltran, E192-02

     N. Creignou, O. Papini, R. Pichler, S. Woltran:
    "Belief revision within fragments of propositional logic";
    Journal of Computer and System Sciences, 80 (2014), 2; S. 427 - 449.
  200. Autor/innen: Nadia Creignou; Odile Papini; Stefan Rümmele, E192-02; Stefan Woltran, E192-02

     N. Creignou, O. Papini, St. Rümmele, S. Woltran:
    "Belief Merging within Fragments of Propositional Logic";
    ACM Transactions on Computational Logic, 17 (2016), 3; S. 20:1 - 20:28.

    Zusätzliche Informationen
  201. Autor/innen: Nadia Creignou; Reinhard Pichler, E192-02; Stefan Woltran, E192-02

     N. Creignou, R. Pichler, S. Woltran:
    "Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment?";
    Logical Methods in Computer Science, 14 (2018), 4; S. 1 - 25.

    Zusätzliche Informationen
  202. Autor/innen: Nadia Creignou; Johannes Schmidt; Michael Thomas; Stefan Woltran, E192-02

     N. Creignou, J. Schmidt, M. Thomas, S. Woltran:
    "Complexity of logic-based argumentation in Post's framework";
    Argument & Computation, 2 (2011), 2-3; S. 107 - 129.

    Zusätzliche Informationen
  203. Autor/innen: Bernardo Cuteri; Carmine Dodaro; Francesco Ricca; Peter Schüller, E192-03

     B. Cuteri, C. Dodaro, F. Ricca, P. Schüller:
    "Constraints, lazy constraints, or propagators in ASP solving: An empirical analysis";
    Theory and Practice of Logic Programming, 17 (2017), 5-6; S. 780 - 799.
  204. Autor/innen: Bernardo Cuteri; Carmine Dodaro; Francesco Ricca; Peter Schüller, E192-03

     B. Cuteri, C. Dodaro, F. Ricca, P. Schüller:
    "Partial Compilation of ASP Programs";
    Theory and Practice of Logic Programming, 19 (2019), 5-6; S. 857 - 873.

    Zusätzliche Informationen
  205. Autor/innen: Stefan S. Dantchev; Barnaby Martin, Engineering and ...; Stefan Szeider, E192-03

     S. Dantchev, B. Martin, St. Szeider:
    "Parameterized Proof Complexity";
    Computational complexity, 20 (2011), 1; S. 51 - 85.
  206. Autor/innen: Minh Dao-Tran, E192-03; Thomas Eiter, E192-03; Michael Fink, E192-03; Thomas Krennwallner, E192-03

     M. Dao-Tran, T. Eiter, M. Fink, T. Krennwallner:
    "Distributed Evaluation of Nonmonotonic Multi-Context Systems";
    Journal of Artificial Intelligence Research, 52 (2015), S. 543 - 600.

    Zusätzliche Informationen
  207. Autor/innen: Shantanu Das; Riccardo Focardi, DAIS; Flaminia L. Luccio, DIAS; Euripides Markou, DCSBI; Marco Squarcina, E192-06

     S. Das, R. Focardi, F. Luccio, E. Markou, M. Squarcina:
    "Gathering of robots in a ring with mobile faults";
    Theoretical Computer Science, Volume 764 (2019), Volume 764; 42 S.

    Zusätzliche Informationen
  208. Autor/innen: Anuj Dawar; Helmut Veith, E192-04

     A. Dawar, H. Veith:
    "Selected Papers of the Conference "Computer Science Logic CSL 2010": Preface";
    Logical Methods in Computer Science, (2012).

    Zusätzliche Informationen
  209. Autor/innen: Jos De Bruijn, E192-03; Thomas Eiter, E192-03; Axel Florian Polleres, E192-03; Hans Tompits, E192-03

     J. De Bruijn, T. Eiter, A. Polleres, H. Tompits:
    "Embedding Non-Ground Logic Programs into Autoepistemic Logic for Knowledge Base Combination";
    ACM Transactions on Computational Logic, 12 (2011), 3.

    Zusätzliche Informationen
  210. Autor/innen: Jos De Bruijn, E192-03; Stijn Heymans, E192-03

     J. De Bruijn, S. Heymans:
    "Logical Foundations of RDF(S) with Datatypes";
    Journal of Artificial Intelligence Research, 38 (2010), S. 535 - 568.

    Zusätzliche Informationen
  211. Autor/innen: Arnaud De Coster, E192; Nysret Musliu, E192-02; Andrea Schaerf; Johannes Schoisswohl, E192-04; Kate Smith-Miles

     A. De Coster, N. Musliu, A. Schaerf, J. Schoisswohl, K. Smith-Miles:
    "Algorithm selection and instance space analysis for curriculum-based course timetabling";
    Journal of Scheduling, 26 (2021), 4; S. 1 - 24.

    Zusätzliche Informationen
  212. Autor/innen: Ronald de Haan, E192-01; Iyad Kanj; Stefan Szeider, E192-01

     R. de Haan, I. Kanj, S. Szeider:
    "On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances";
    ACM Transactions on Computational Logic, 18 (2017), S. 1 - 46.

    Zusätzliche Informationen
  213. Autor/innen: Ronald de Haan, E192-01; Iyad Kanj; Stefan Szeider, E192-01

     R. de Haan, I. Kanj, S. Szeider:
    "On the Subexponential-Time Complexity of CSP";
    Journal of Artificial Intelligence Research, 52 (2015), 52; S. 203 - 234.

    Zusätzliche Informationen
  214. Autor/innen: Ronald de Haan; Stefan Szeider, E192-01

     R. de Haan, S. Szeider:
    "A Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy";
    Algorithms, 12 (2019), 9; S. 1 - 28.

    Zusätzliche Informationen
  215. Autor/innen: Ronald de Haan; Stefan Szeider, E192-01

     R. de Haan, S. Szeider:
    "Parameterized complexity classes beyond para-NP";
    Journal of Computer and System Sciences, 87 (2017), S. 16 - 57.

    Zusätzliche Informationen
  216. Autor/innen: James P. Delgrande; Pavlos Peppas; Stefan Woltran, E192-02

     J. Delgrande, P. Peppas, S. Woltran:
    "General Belief Revision";
    Journal of the ACM, 65 (2018), 5; S. 29:1 - 29:34.

    Zusätzliche Informationen
  217. Autor/innen: James P. Delgrande; Torsten Schaub; Hans Tompits, E192-03

     J. Delgrande, T. Schaub, H. Tompits:
    "A Framework for Compiling Preferences in Logic Programs";
    Theory and Practice of Logic Programming, 3 (2003), 2; S. 129 - 187.
  218. Autor/innen: James P. Delgrande; Torsten Schaub; Hans Tompits, E192-03; Kewen Wang

     J. Delgrande, T. Schaub, H. Tompits, K. Wang:
    "A Classification and Survey of Preference Handling Approaches in Nonmonotonic Reasoning";
    Computational Intelligence, 20 (2004), 2; S. 308 - 334.
  219. Autor/innen: James P. Delgrande; Torsten Schaub; Hans Tompits, E192-03; Stefan Woltran, E192-02

     J. Delgrande, T. Schaub, H. Tompits, S. Woltran:
    "A Model-Theoretic Approach to Belief Change in Answer Set Programming";
    ACM Transactions on Computational Logic, 14 (2013), 2.

    Zusätzliche Informationen
  220. Autor/innen: James P. Delgrande; Torsten Schaub; Hans Tompits, E192-03; Stefan Woltran, E192-03

     J. Delgrande, T. Schaub, H. Tompits, S. Woltran:
    "On Computing Solutions to Belief Change Scenarios";
    Journal of Logic and Computation, 14 (2004), 6; S. 801 - 826.
  221. Autor/innen: Daniele Dell´Aglio; Thomas Eiter, E192-03; Fredrik Heintz; Danh Le Phuoc

     D. Dell´Aglio, T. Eiter, F. Heintz, D. Le Phuoc:
    "Special issue on stream reasoning";
    Semantic Web, 10 (2019), 3; S. 453 - 455.

    Zusätzliche Informationen
  222. Autor/innen: Emir Demirovic, E192-02; Nysret Musliu, E192-02

     E. Demirovic, N. Musliu:
    "MaxSAT-based large neighborhood search for high school timetabling";
    Computers & Operations Research, 78 (2017), S. 172 - 180.

    Zusätzliche Informationen
  223. Autor/innen: Emir Demirovic, E192-02; Nysret Musliu, E192-02

     E. Demirovic, N. Musliu:
    "Modeling and solving a real-life multi-skill shift design problem";
    Annals of Operations Research, 252 (2017), 2; S. 365 - 382.

    Zusätzliche Informationen
  224. Autor/innen: Emir Demirovic, E192-02; Nysret Musliu, E192-02

     E. Demirovic, N. Musliu:
    "Modeling high school timetabling with bitvectors";
    Annals of Operations Research, 252 (2017), 2; S. 215 - 238.

    Zusätzliche Informationen
  225. Autor/innen: Yulia Demyanova, E192-04; Thomas Pani, WPI; Helmut Veith, E192-04; Florian Zuleger, E192-04

     Y. Demyanova, T. Pani, H. Veith, F. Zuleger:
    "Empirical software metrics for benchmarking of verification tools";
    Formal Methods in System Design, 50 (2017), 2; S. 289 - 316.
  226. Autor/innen: Monika Di Angelo, E191-03; Gernot Salzer, E192-05

     M. Di Angelo, G. Salzer:
    "Identification of Token Contracts on Ethereum: Standard Compliance and Beyond";
    International Journal of Data Science and Analytics (JDSA), 2021 (2021), online first.

    Zusätzliche Informationen
  227. Autor/innen: Luca Di Gaspero; Johannes Gärtner; Guy Kortsarz; Nysret Musliu, E192-02; Andrea Schaerf; Wolfgang Slany, E192-02

     L. Di Gaspero, J. Gärtner, G. Kortsarz, N. Musliu, A. Schaerf, W. Slany:
    "The Minimum Shift Design Problem";
    Annals of Operations Research, 155 (2007), 1; S. 79 - 105.
  228. Autor/innen: Stefan Diehl; Andreas Kerren, E192-01

     S. Diehl, A. Kerren:
    "Generierung interaktiver Animationen von Berechnungsmodellen";
    Informatik - Forschung und Entwicklung, 17 (2002), 1; S. 12 - 20.
  229. Autor/innen: Martin Diller, E192-02; Atefeh Keshavarzi Zafarghandi; Thomas Linsbichler, E192-02; Stefan Woltran, E192-02

     M. Diller, A. Keshavarzi Zafarghandi, T. Linsbichler, S. Woltran:
    "Investigating subclasses of abstract dialectical frameworks";
    Argument & Computation, 11 (2020), 1-2; S. 191 - 219.

    Zusätzliche Informationen
  230. Autor/innen: Martin Diller, E192-03; Johannes Peter Wallner, E192-02; Stefan Woltran, E192-02

     M. Diller, J. P. Wallner, S. Woltran:
    "Reasoning in Abstract Dialectical Frameworks using Quantified Boolean Formulas";
    Argument & Computation, 6 (2015), 2; S. 149 - 177.

    Zusätzliche Informationen
  231. Autor/innen: Jürgen Dix; Thomas Eiter, E192-03

     J. Dix, T. Eiter:
    "Answer Set Programming and Agents";
    AgentLink News, 19 (2005), S. 14 - 17.
  232. Autor/innen: Jürgen Dix; Thomas Eiter, E192-03; Michael Fink, E192-03; Axel Florian Polleres, E192-03; Yianquing Zhang

     J. Dix, T. Eiter, M. Fink, A. Polleres, Y. Zhang:
    "Monitoring Agents using Declarative Planning";
    Fundamenta Informaticae, 57 (2003), 2-4; S. 345 - 370.
  233. Autor/innen: Marko Djukanovic, E192-01; Christoph Berger; Günther Raidl, E192-01; Christian Blum

     M. Djukanovic, C. Berger, G. Raidl, C. Blum:
    "An A∗Search Algorithm for the Constrained Longest Common Subsequence Problem";
    Information Processing Letters, 166 (2020), S. 1 - 10.

    Zusätzliche Informationen
  234. Autor/innen: Marko Djukanovic, E192-01; Günther Raidl, E192-01; Christian Blum

     M. Djukanovic, G. Raidl, C. Blum:
    "Anytime algorithms for the longest common palindromic subsequence problem";
    Computers & Operations Research, 114 (2020), 20 S.

    Zusätzliche Informationen
  235. Autor/innen: Marko Djukanovic, E192-01; Günther Raidl, E192-01; Christian Blum

     M. Djukanovic, G. Raidl, C. Blum:
    "Finding Longest Common Subsequences: New anytime A search results";
    Applied Soft Computing, 95 (2020), S. 1 - 21.

    Zusätzliche Informationen
  236. Autor/innen: Markus Dod; Tomer Kotek, E192-04; James Preen; Peter Tittmann

     M. Dod, T. Kotek, J. Preen, P. Tittmann:
    "Bipartition polynomials, the Ising model and domination in graphs";
    Discussiones Mathematicae Graph Theory, 35 (2015), 2; S. 335 - 353.
  237. Autor/in: Jürgen Dorn, E192-02

     J. Dorn:
    "Cooperating scheduling systems";
    International Journal of Manufacturing Technology and Management (IJMTM), 3 (2001), 6; S. 570 - 585.
  238. Autor/in: Jürgen Dorn, E192-02

     J. Dorn:
    "Dependable reactive event-oriented planning";
    Data & Knowledge Engineering, 16 (1995), S. 7 - 49.

    Zusätzliche Informationen
  239. Autor/in: Jürgen Dorn, E192-02

     J. Dorn:
    "Expert Systems in the Steel Industry: Introduction to the Special Issue";
    IEEE Expert, (1996), Feb.
  240. Autor/in: Jürgen Dorn, E192-02

     J. Dorn:
    "Expertensysteme für die Forstwirtschaft";
    Forstzeitschrift, (2000).
  241. Autor/in: Jürgen Dorn, E192-02

     J. Dorn:
    "Planning in virtual enterprises";
    International Journal of Electronic Business (IJEB), 2 (2004), 5; S. 557 - 565.

    Zusätzliche Informationen
  242. Autor/in: Jürgen Dorn, E192-02

     J. Dorn:
    "Planung von betrieblichen Abläufen durch Standardsoftware - ein Widerspruch?";
    Wirtschaftsinformatik, 2000 (2000), 2.

    Zusätzliche Informationen
  243. Autor/innen: Jürgen Dorn, E192-02; Mario Girsch; Günter Skele; Wolfgang Slany, E192-02

     J. Dorn, M. Girsch, G. Skele, W. Slany:
    "Comparison of Iterative Improvement Techniques for Schedule Optimization";
    European Journal of Operational Research, (1996), S. 349 - 361.

    Zusätzliche Informationen
  244. Autor/innen: Jürgen Dorn, E192-02; Roger Kerr; Babi Thalhammer

     J. Dorn, R. Kerr, G. Thalhammer:
    "Reactive Scheduling - improving the robustness of schedules and restricting the effects of shop floor disturbances by fuzzy reasoning";
    International Journal of Human-Computer Studies, 42 (1995), S. 687 - 704.

    Zusätzliche Informationen
  245. Autor/innen: Jürgen Dorn, E192-02; Anna Prianichnikova; Reisinger Johannes

     J. Dorn, A. Prianichnikova, J. Johannes:
    "Heuristische Konfiguration und Scheduling für Echtzeitsysteme";
    e&i, 118 Jhrg. (2001), 7/8; S. 354 - 359.
  246. Autor/innen: Jürgen Dorn, E192-02; Reza Shams

     J. Dorn, R. Shams:
    "Scheduling High-grade Steel Making";
    IEEE Expert, (1996).

    Zusätzliche Informationen
  247. Autor/innen: Christian A. Duncan; David Eppstein; Michael T. Goodrich; Stephen G. Kobourov; Maarten Löffler; Martin Nöllenburg, E192-01

     C. Duncan, D. Eppstein, M.T. Goodrich, S.G. Kobourov, M. Löffler, M. Nöllenburg:
    "Planar and poly-arc Lombardi drawings";
    Journal of Computational Geometry, 9 (2018), 1; S. 328 - 355.

    Zusätzliche Informationen
  248. Autor/innen: Paul E. Dunne; Wolfgang Dvorak; Thomas Linsbichler, E192-02; Stefan Woltran, E192-02

     P. Dunne, W. Dvorak, T. Linsbichler, S. Woltran:
    "Characteristics of multiple viewpoints in abstract argumentation";
    Artificial Intelligence, 228 (2015), S. 153 - 178.

    Zusätzliche Informationen
  249. Autor/innen: Paul E. Dunne; Wolfgang Dvorak; Stefan Woltran, E192-02

     P. Dunne, W. Dvorak, S. Woltran:
    "Parametric Properties of Ideal Semantics";
    Artificial Intelligence, 202 (2013), 1; S. 1 - 28.

    Zusätzliche Informationen
  250. Autor/innen: Frederico Dusberger; Michael Abseher, E192-02; Bernhard Bliem, E192; Günther Charwat, E192; Stefan Woltran, E192-02

     F. Dusberger, M. Abseher, B. Bliem, G. Charwat, S. Woltran:
    "Computing Secure Sets in Graphs using Answer Set Programming";
    Journal of Logic and Computation, 2015 special issue (2015), 2015 special issue; S. 1 - 26.

    Zusätzliche Informationen
  251. Autor/innen: Schahram Dustdar, E194-02; Reinhard Pichler, E192-02; Vadim Savenkov, E192-02; Hong-Linh Truong, E194-02

     S. Dustdar, R. Pichler, V. Savenkov, H. Truong:
    "Quality-aware Service-Oriented Data Integration: Requirements, State of the Art and Open Challenges";
    ACM SIGMOD Record, Volume 41 (2012), Number 1; S. 11 - 19.

    Zusätzliche Informationen
  252. Autor/innen: Pavel Dvorak, E193-03 [E193-03]; Eduard Eiben; Robert Ganian, E192-01; Dusan Knop; Sebastian Ordyniak

     P. Dvorak, E. Eiben, R. Ganian, D. Knop, S. Ordyniak:
    "The complexity landscape of decompositional parameters for ILP: Programs with few global variables and constraints";
    Artificial Intelligence, 300 (2021), S. 1 - 21.

    Zusätzliche Informationen
  253. Autor/innen: Wolfgang Dvorak, E192-02; Ringo Baumann; Thomas Linsbichler, E192-02; Stefan Woltran, E192-02

     W. Dvorak, R. Baumann, T. Linsbichler, S. Woltran:
    "A general notion of equivalence for abstract argumentation";
    Artificial Intelligence, 275 (2019), 275; S. 379 - 410.

    Zusätzliche Informationen
  254. Autor/innen: Wolfgang Dvorak, E192-02; Paul E. Dunne

     W. Dvorak, P. Dunne:
    "Computational Problems in Formal Argumentation and their Complexity";
    IfCoLog Journal of Logics and their Applications, 4 (2017), 8; S. 2557 - 2622.
  255. Autor/innen: Wolfgang Dvorak; Matti Järvisalo; Johannes Peter Wallner, E192-02; Stefan Woltran, E192-02

     W. Dvorak, M. Järvisalo, J. P. Wallner, S. Woltran:
    "Complexity-Sensitive Decision Procedures for Abstract Argumentation";
    Artificial Intelligence, 206 (2014), S. 53 - 78.

    Zusätzliche Informationen
  256. Autor/innen: Wolfgang Dvorak, E192-02; Sebastian Ordyniak, E192-03; Stefan Szeider, E192-03

     W. Dvorak, S. Ordyniak, St. Szeider:
    "Augmenting Tractable Fragments of Abstract Argumentation";
    Artificial Intelligence, 186 (2012), 186; S. 157 - 173.

    Zusätzliche Informationen
  257. Autor/innen: Wolfgang Dvorak, E192-02; Reinhard Pichler, E192-02; Stefan Woltran, E192-02

     W. Dvorak, R. Pichler, S. Woltran:
    "Towards fixed-parameter tractable algorithms for abstract argumentation";
    Artificial Intelligence, 186 (2012), 186; S. 1 - 37.

    Zusätzliche Informationen
  258. Autor/innen: Wolfgang Dvorak, E192-02; Anna Rapberger, E192-02; Stefan Woltran, E192-02

     W. Dvorak, A. Rapberger, S. Woltran:
    "On the different types of collective attacks in abstract argumentation: equivalence results for SETAFs";
    Journal of Logic and Computation, 30 (2020), 5; S. 1063 - 1107.

    Zusätzliche Informationen
  259. Autor/innen: Wolfgang Dvorak, E192-02; Christof Spanring, E192-02

     W. Dvorak, C. Spanring:
    "Comparing the expressiveness of argumentation semantics";
    Journal of Logic and Computation, 27 (2017), 5; S. 1489 - 1521.

    Zusätzliche Informationen
  260. Autor/innen: Wolfgang Dvorak, E192-02; Stefan Woltran, E192-02

     W. Dvorak, S. Woltran:
    "Complexity of abstract argumentation under a claim-centric view";
    Artificial Intelligence, 285 (2020), S. 1 - 8.

    Zusätzliche Informationen
  261. Autor/innen: Wolfgang Dvorak, E192-02; Stefan Woltran, E192-02

     W. Dvorak, S. Woltran:
    "Complexity of semi-stable and stage semantics in argumentation frameworks";
    Information Processing Letters, Inf. Process. Lett. 110 (2010), 11; S. 425 - 430.

    Zusätzliche Informationen
  262. Autor/innen: Wolfgang Dvorak, E192-02; Stefan Woltran, E192-02

     W. Dvorak, S. Woltran:
    "On the Intertranslatability of Argumentation Semantics";
    Journal of Artificial Intelligence Research, 41 (2011), S. 445 - 475.

    Zusätzliche Informationen
  263. Autor/innen: Wolfgang Dvorak, E192-02; Stefan Woltran, E192-02; Jorge Fandinno

     W. Dvorak, S. Woltran, J. Fandinno:
    "On the expressive power of collective attacks";
    Argument & Computation, 10 (2019), 2; S. 191 - 230.

    Zusätzliche Informationen
  264. Autor/innen: Gabriel Ebner, E104-02; Stefan Hetzl, E104-02; Alexander Leitsch, E192-05; Giselle Reis, E192-05; Daniel Weller

     G. Ebner, S. Hetzl, A. Leitsch, G. Reis, D. Weller:
    "On the Generation of Quantified Lemmas";
    Journal of Automated Reasoning, 63 (2019), 1; S. 95 - 126.
  265. Autor/innen: Gabriel Ebner, E104-02; Stefan Hetzl, E104-02; Giselle Reis, E192-05; Martin Riener; Simon Peter Wolfsteiner, E104-02; Sebastian Zivota, E104-05

     G. Ebner, S. Hetzl, G. Reis, M. Riener, S. Wolfsteiner, S. Zivota:
    "System Description: GAPT 2.0";
    Lecture Notes in Computer Science, 9706 (2016), S. 293 - 301.

    Zusätzliche Informationen
  266. Autor/innen: Uwe Egly, E192-03; Nadia Creignou; Johannes Schmidt

     U. Egly, N. Creignou, J. Schmidt:
    "Complexity Classifications for logic-based Argumentation";
    CoRR - Computing Research Repository, April (2013).
  267. Autor/innen: Uwe Egly, E192-03; Sarah Gaggl, E192-02; Stefan Woltran, E192-02

     U. Egly, S. Gaggl, S. Woltran:
    "Answer-Set Programming Encodings for Argumentation Frameworks";
    Argument & Computation, 1 (2010), 2; S. 147 - 177.

    Zusätzliche Informationen
  268. Autor/innen: Uwe Egly, E192-03; Leopold Haller

     U. Egly, L. Haller:
    "A SAT Solver for Circuits Based on the Tableau Method";
    KI - Künstliche Intelligenz, 24 (2010), 1; S. 15 - 23.

    Zusätzliche Informationen
  269. Autor/innen: Uwe Egly, E192-03; Martin Kronegger; Florian Lonsing, E192-03; Andreas Pfandler, E192-02

     U. Egly, M. Kronegger, F. Lonsing, A. Pfandler:
    "Conformant Planning as a Case Study of Incremental QBF Solving";
    Annals of Mathematics and Artificial Intelligence, TBA (2016), S. 1 - 25.

    Zusätzliche Informationen
  270. Autor/innen: Uwe Egly, E192-03; Martin Kronegger; Florian Lonsing, E192-03; Andreas Pfandler, E192-02

     U. Egly, M. Kronegger, F. Lonsing, A. Pfandler:
    "Conformant planning as a case study of incremental QBF solving";
    Annals of Mathematics and Artificial Intelligence, 80 (2017), 1; S. 21 - 45.

    Zusätzliche Informationen
  271. Autor/innen: Uwe Egly, E192-03; Reinhard Pichler, E192-02; Stefan Woltran, E192-03

     U. Egly, R. Pichler, S. Woltran:
    "On Deciding Subsumption Problems";
    Annals of Mathematics and Artificial Intelligence, 43 (2005), 1-4; S. 255 - 294.
  272. Autor/innen: Uwe Egly, E192-03; Martina Seidl, E194-03; Stefan Woltran, E192-02

     U. Egly, M. Seidl, S. Woltran:
    "A Solver for QBFs in Negation Normal Form";
    Constraints, 14 (2009), 1; S. 38 - 79.

    Zusätzliche Informationen
  273. Autor/innen: Uwe Egly, E192-03; Hans Tompits, E192-03

     U. Egly, H. Tompits:
    "On Different Proof-Search Strategies for Orthologic";
    Studia Logica, 73 (2003), 1; S. 131 - 152.
  274. Autor/innen: Eduard Eiben; Robert Ganian, E192-01; Thekla Hamm, E192-01; O-Joung Kwon

     E. Eiben, R. Ganian, T. Hamm, O. Kwon:
    "Measuring what matters: Ahybrid approach to dynamic programming with treewidth";
    Journal of Computer and System Sciences, 121 (2021), S. 57 - 75.

    Zusätzliche Informationen
  275. Autor/innen: Eduard Eiben; Robert Ganian, E192-01; O-Joung Kwon

     E. Eiben, R. Ganian, O. Kwon:
    "A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion";
    Journal of Computer and System Sciences, 96 (2018), S. 121 - 146.

    Zusätzliche Informationen
  276. Autor/innen: Eduard Eiben; Robert Ganian, E192-01; Juha Laurila, E389-02

     E. Eiben, R. Ganian, J. Laurila:
    "On the Complexity of Rainbow Coloring Problems";
    Discrete Applied Mathematics, 246 (2018), S. 38 - 48.

    Zusätzliche Informationen
  277. Autor/innen: Eduard Eiben; Robert Ganian, E192-01; Sebastian Ordyniak

     E. Eiben, R. Ganian, S. Ordyniak:
    "Usingdecomposition-parametersforQBF:Mindtheprefix!";
    Journal of Computer and System Sciences, 110 (2020), S. 1 - 21.

    Zusätzliche Informationen
  278. Autor/innen: Eduard Eiben; Robert Ganian, E192-01; Stefan Szeider, E192-01

     E. Eiben, R. Ganian, S. Szeider:
    "Meta-kernelization using well-structured modulators";
    Discrete Applied Mathematics, Volume 280 (2018), S. 153 - 167.

    Zusätzliche Informationen
  279. Autor/innen: Eduard Eiben; Robert Ganian, E192-01; Stefan Szeider, E192-01

     E. Eiben, R. Ganian, S. Szeider:
    "Solving Problems on Graphs of High Rank-Width";
    Algorithmica (online), 80 (2017), 80; 30 S.

    Zusätzliche Informationen
  280. Autor/innen: Markus Eiglsperger; Carsten Gutwenger; Morgan Kaufman; Joachim Kupke; Michael Jünger; Sebastian Leipert; Karsten Klein; Petra Mutzel, E192-01; Martin Siebenhaller

     M. Eiglsperger, C. Gutwenger, M. Kaufman, J. Kupke, M. Jünger, S. Leipert, K. Klein, P. Mutzel, M. Siebenhaller:
    "Automatic layout of UML class diagrams in orthogonal style";
    Information Visualization, 3 (2004), 3; S. 189 - 208.
  281. Autor/innen: Thomas Eiter, E192-03; Loris Bozzato; Luciano Serafini

     T. Eiter, L. Bozzato, L. Serafini:
    "Reasoning onDL-LiteRwith Defeasibility in ASP";
    TPLP - Theory and Practice of Logic Programming, 21 (2021), 21; S. 1 - 51.

    Zusätzliche Informationen
  282. Autor/innen: Thomas Eiter, E192-03; Esra Erdem; Halit Erdogan; Michael Fink, E192-03

     T. Eiter, E. Erdem, H. Erdogan, M. Fink:
    "Finding Similar/Diverse Solutions in Answer Set Programming";
    Theory and Practice of Logic Programming, FirstView (2011), 57 S.
  283. Autor/innen: Thomas Eiter, E192-03; Esra Erdem; Halit Erdogan; Michael Fink, E192-03

     T. Eiter, E. Erdem, H. Erdogan, M. Fink:
    "Finding Similar/Diverse Solutions in Answer Set Programming";
    Theory and Practice of Logic Programming, 13 (2013), 3; S. 303 - 359.

    Zusätzliche Informationen
  284. Autor/innen: Thomas Eiter, E192-03; Esra Erdem, E192-03; Wolfgang Faber, E192-03; Jan Senko, E192-03

     T. Eiter, E. Erdem, W. Faber, J. Senko:
    "A Logic-Based Approach to Finding Explanations for Discrepencies in Optimistic Plan Execution";
    Fundamenta Informaticae, 79 (2007), 1-2; S. 25 - 69.
  285. Autor/innen: Thomas Eiter, E192-03; Esra Erdem, E192-03; Michael Fink, E192-03; Jan Senko, E192-03

     T. Eiter, E. Erdem, M. Fink, J. Senko:
    "Comparing Action Descriptions based on Semantic Preferences";
    Annals of Mathematics and Artificial Intelligence (eingeladen), 50 (2007), 3-4; S. 273 - 304.
  286. Autor/innen: Thomas Eiter, E192-03; Esra Erdem; Michael Fink, E192-03; Jan Senko

     T. Eiter, E. Erdem, M. Fink, J. Senko:
    "Updating action domain descriptions";
    Artificial Intelligence, 174 (2010), 15; S. 1172 - 1221.

    Zusätzliche Informationen
  287. Autor/innen: Thomas Eiter, E192-03; Javier Esparza; Catuscia Palamidessi; Gordon Plotkin; Natarajan Shankar

     T. Eiter, J. Esparza, C. Palamidessi, G. Plotkin, N. Shankar:
    "Alonzo Church Award 2018 - Call for Nominations";
    Bulletin of the EATCS (eingeladen), 124 (2018), 2 S.
  288. Autor/innen: Thomas Eiter, E192-03; Wolfgang Faber; Michael Fink, E192-03; Stefan Woltran, E192-02

     T. Eiter, W. Faber, M. Fink, S. Woltran:
    "Complexity results for answer set programming with bounded predicate arities and implications";
    Annals of Mathematics and Artificial Intelligence (eingeladen), 51 (2007), 2-4; S. 123 - 165.
  289. Autor/innen: Thomas Eiter, E192-03; Wolfgang Faber, E192-03; Nicola Leone; Gerald Pfeifer, E192-02

     T. Eiter, W. Faber, N. Leone, G. Pfeifer:
    "Computing Preferred Answer Sets by Meta-Interpretation in Answer Set Programming";
    Theory and Practice of Logic Programming, 3 (2003), 4+5; S. 463 - 498.

    Zusätzliche Informationen
  290. Autor/innen: Thomas Eiter, E192-03; Wolfgang Faber, E192-03; Nicola Leone; Gerald Pfeifer, E192-02; Axel Florian Polleres, E192-03

     T. Eiter, W. Faber, N. Leone, G. Pfeifer, A. Polleres:
    "A Logic Programming Approach to Knowledge-State Planning, II: The DLVK System";
    Artificial Intelligence, 144 (2003), 1; S. 157 - 211.

    Zusätzliche Informationen
  291. Autor/innen: Thomas Eiter, E192-03; Wolfgang Faber, E192-03; Nicola Leone; Gerald Pfeifer, E192-02; Axel Florian Polleres, E192-03

     T. Eiter, W. Faber, N. Leone, G. Pfeifer, A. Polleres:
    "A Logic Programming Approach to Knowledge-State Planning: Semantics and Complexity";
    ACM Transactions on Computational Logic, 5 (2004), 2; S. 206 - 263.
  292. Autor/innen: Thomas Eiter, E192-03; Wolfgang Faber, E192-03; Nicola Leone; Gerald Pfeifer, E192-02; Axel Florian Polleres, E192-03

     T. Eiter, W. Faber, N. Leone, G. Pfeifer, A. Polleres:
    "Answer Set Planning under Action Costs";
    Journal of Artificial Intelligence Research, 19 (2003), S. 25 - 71.

    Zusätzliche Informationen
  293. Autor/innen: Thomas Eiter, E192-03; Michael Fink, E192-03; Gianluigi Greco; Domenico Lembo

     T. Eiter, M. Fink, G. Greco, D. Lembo:
    "Repair Localization for Query Answering from Inconsistent Databases";
    ACM Transactions on Database Systems, 33 (2008), 2; S. 10:01 - 10:51.
  294. Autor/innen: Thomas Eiter, E192-03; Michael Fink, E192-03; Giovambattista Ianni; Thomas Krennwallner, E192-03; Christoph Redl, E192-03; Peter Schüller, E192-03

     T. Eiter, M. Fink, G. Ianni, T. Krennwallner, C. Redl, P. Schüller:
    "A Model Building Framework for Answer Set Programming with External Computations";
    Theory and Practice of Logic Programming, 16 (2016), 4; S. 418 - 464.

    Zusätzliche Informationen
  295. Autor/innen: Thomas Eiter, E192-03; Michael Fink, E192-03; Thomas Krennwallner, E192-03; Christoph Redl, E192-03

     T. Eiter, M. Fink, T. Krennwallner, C. Redl:
    "Conflict-driven ASP solving with external sources";
    Theory and Practice of Logic Programming, 12 (2012), 4-5; S. 659 - 679.

    Zusätzliche Informationen
  296. Autor/innen: Thomas Eiter, E192-03; Michael Fink, E192-03; Thomas Krennwallner, E192-03; Christoph Redl, E192-03

     T. Eiter, M. Fink, T. Krennwallner, C. Redl:
    "Domain Expansion for ASP-Programs with External Sources";
    Journal of Artificial Intelligence Research, 233 (2016), S. 84 - 121.
  297. Autor/innen: Thomas Eiter, E192-03; Michael Fink, E192-03; Thomas Krennwallner, E192-03; Christoph Redl, E192-03; Peter Schüller, E192-03

     T. Eiter, M. Fink, T. Krennwallner, C. Redl, P. Schüller:
    "Efficient HEX-Program Evaluation based on Unfounded Sets";
    Journal of Artificial Intelligence Research, 49 (2014), S. 269 - 321.

    Zusätzliche Informationen
  298. Autor/innen: Thomas Eiter, E192-03; Michael Fink, E192-03; Joerg Puehrer, E192-03; Hans Tompits, E192-03; Stefan Woltran, E192-02

     T. Eiter, M. Fink, J. Puehrer, H. Tompits, S. Woltran:
    "Model-Based Recasting in Answer-Set Programming";
    Journal of Applied Non-Classical Logics (JANCL), 23 (2013), 1-2; S. 75 - 104.
  299. Autor/innen: Thomas Eiter, E192-03; Michael Fink, E192-03; Giuliana Sabbatini; Hans Tompits, E192-03

     T. Eiter, M. Fink, G. Sabbatini, H. Tompits:
    "On Properties of Update Sequences Based on Causal Rejection";
    Theory and Practice of Logic Programming, 2 (2002), 6; S. 711 - 767.

    Zusätzliche Informationen
  300. Autor/innen: Thomas Eiter, E192-03; Michael Fink, E192-03; Giuliana Sabbatini; Hans Tompits, E192-03

     T. Eiter, M. Fink, G. Sabbatini, H. Tompits:
    "Reasoning about Evolving Nonmonotonic Knowledge Bases";
    ACM Transactions on Computational Logic, 6 (2005), 2; S. 389 - 440.
  301. Autor/innen: Thomas Eiter, E192-03; Michael Fink, E192-03; Giuliana Sabbatini; Hans Tompits, E192-03

     T. Eiter, M. Fink, G. Sabbatini, H. Tompits:
    "Using Methods of Declarative Logic Programming for Intelligent Information Agents";
    Theory and Practice of Logic Programming, 2 (2002), 6; S. 645 - 710.

    Zusätzliche Informationen
  302. Autor/innen: Thomas Eiter, E192-03; Michael Fink, E192-03; Roman Schindlauer, E192-03; Hans Tompits, E192-03

     T. Eiter, M. Fink, R. Schindlauer, H. Tompits:
    "Answer Set Programming for Intelligent Web Services";
    ÖGAI Journal, 22 (2003), 2; S. 17 - 22.
  303. Autor/innen: Thomas Eiter, E192-03; Michael Fink, E192-03; Peter Schüller, E192-03; Antonius Weinzierl, E192-03

     T. Eiter, M. Fink, P. Schüller, A. Weinzierl:
    "Finding Explanations of Inconsistency in Multi-Context Systems";
    Artificial Intelligence, 216 (2014), S. 233 - 274.
  304. Autor/innen: Thomas Eiter, E192-03; Michael Fink, E192-03; Daria Stepanova

     T. Eiter, M. Fink, D. Stepanova:
    "Computing Repairs of Inconsistent DL-Programs over EL Ontologies";
    Journal of Artificial Intelligence Research, 56 (2016), S. 463 - 515.

    Zusätzliche Informationen
  305. Autor/innen: Thomas Eiter, E192-03; Michael Fink, E192-03; Daria Stepanova

     T. Eiter, M. Fink, D. Stepanova:
    "Data repair of inconsistent nonmonotonic description logic programs";
    Artificial Intelligence, 239 (2016), S. 7 - 53.

    Zusätzliche Informationen
  306. Autor/innen: Thomas Eiter, E192-03; Michael Fink, E192-03; Hans Tompits, E192-03

     T. Eiter, M. Fink, H. Tompits:
    "A Knowledge-Based Approach for Selecting Information Sources";
    Theory and Practice of Logic Programming, 7 (2007), 3; S. 249 - 300.
  307. Autor/innen: Thomas Eiter, E192-03; Michael Fink, E192-03; Stefan Woltran, E192-03

     T. Eiter, M. Fink, S. Woltran:
    "Semantical Characterizations and Complexity of Equivalences in Answer Set Programming";
    ACM Transactions on Computational Logic, 8 (2007), 3; S. 1 - 53.
  308. Autor/innen: Thomas Eiter, E192-03; Gerhard Friedrich; Richard Taupe; Antonius Weinzierl, E192-03

     T. Eiter, G. Friedrich, R. Taupe, A. Weinzierl:
    "Lazy Grounding for Dynamic Configuration - Efficient Large-Scale (Re)Configuration of Cyber-Physical Systems with ASP";
    KI - Künstliche Intelligenz, 32 (2018), 2-3; S. 197 - 198.

    Zusätzliche Informationen
  309. Autor/innen: Thomas Eiter, E192-03; Herbert Fuereder, Siemens AG Oeste ...; Josiane Xavier Parreira, DERI; Patrik Schneider, E192-03

     T. Eiter, H. Fuereder, J. Xavier Parreira, P. Schneider:
    "Towards a Semantically Enriched Local Dynamic Map";
    International Journal of Intelligent Transportation Systems Research, 17 (2019), 1; S. 32 - 48.

    Zusätzliche Informationen
  310. Autor/innen: Thomas Eiter, E192-03; Stefano Germano; Giovambattista Ianni; Tobias Kaminski, E192-03; Christoph Redl, E192-03; Peter Schüller, E192-03; Antonius Weinzierl, E192-03

     T. Eiter, S. Germano, G. Ianni, T. Kaminski, C. Redl, P. Schüller, A. Weinzierl:
    "The DLVHEX System";
    KI - Künstliche Intelligenz, 32 (2018), 2-3; S. 187 - 189.
  311. Autor/innen: Thomas Eiter, E192-03; Ianni Giovambattista; Michael Fink, E192-03; Christoph Redl, E192-03; Peter Schüller, Marmara University

     T. Eiter, I. Giovambattista, M. Fink, C. Redl, P. Schüller:
    "A Model Building Framework for {ASP} with External Computations";
    Theory and Practice of Logic Programming, 16 (2015), 4; S. 418 - 464.

    Zusätzliche Informationen
  312. Autor/innen: Thomas Eiter, E192-03; Georg Gottlob, E192

     T. Eiter, G. Gottlob:
    "Marco Cadoli's Work on Nonmonotonic Reasoning";
    Intelligenza Artificiale, 7 (2013), 1; S. 7 - 17.
  313. Autor/innen: Thomas Eiter, E192-03; Georg Gottlob, E192

     T. Eiter, G. Gottlob:
    "Reasoning Under Minimal Upper Bounds in Propositional Logic";
    Theoretical Computer Science, 369 (2006), S. 82 - 115.
  314. Autor/innen: Thomas Eiter, E192-03; Georg Gottlob, E192; Kazuhisa Makino

     T. Eiter, G. Gottlob, K. Makino:
    "New Results on Monotone Dualization and Generating Hypergraph Transversals";
    SIAM JOURNAL ON COMPUTING, 32 (2003), 2; S. 514 - 537.
  315. Autor/innen: Thomas Eiter, E192-03; Giovambattista Ianni, E192-03; Thomas Krennwallner, E192-03; Roman Schindlauer, E192-03

     T. Eiter, G. Ianni, T. Krennwallner, R. Schindlauer:
    "Exploiting conjunctive queries in description logic programs";
    Annals of Mathematics and Artificial Intelligence, 53 (2008), 1-4; S. 115 - 152.

    Zusätzliche Informationen
  316. Autor/innen: Thomas Eiter, E192-03; Giovambattista Ianni; Thomas Lukasiewicz, E192-03; Roman Schindlauer, E192-03

     T. Eiter, G. Ianni, T. Lukasiewicz, R. Schindlauer:
    "Well-founded semantics for description logic programs in the Semantic Web";
    ACM Transactions on Computational Logic, 12 (2011), 2; S. 1 - 41.

    Zusätzliche Informationen
  317. Autor/innen: Thomas Eiter, E192-03; Giovambattista Ianni; Thomas Lukasiewicz, E192-03; Roman Schindlauer, E192-03; Hans Tompits, E192-03

     T. Eiter, G. Ianni, T. Lukasiewicz, R. Schindlauer, H. Tompits:
    "Combining Answer Set Programming with Description Logics for the Semantic Web";
    Artificial Intelligence, 172 (2008), 12-13; S. 1495 - 1593.
  318. Autor/innen: Thomas Eiter, E192-03; Toshihide Ibaraki; Kazuhisa Makino

     T. Eiter, T. Ibaraki, K. Makino:
    "Recognition and Dualization of Disguised Bidual Horn Functions";
    Information Processing Letters, 82 (2002), 6; S. 283 - 291.
  319. Autor/innen: Thomas Eiter, E192-03; Ryutaro Ichise, NII; Josiane Parreira, DERI; Patrik Schneider, E192-03; Lihua Zhao, NII

     T. Eiter, R. Ichise, J. Parreira, P. Schneider, L. Zhao:
    "Deploying Spatial-Stream Query Answering in C-ITS Scenarios";
    Semantic Web, 12 (2021), 1; S. 41 - 77.

    Zusätzliche Informationen
  320. Autor/innen: Thomas Eiter, E192-03; Tobias Kaminski, E192-03

     T. Eiter, T. Kaminski:
    "Pruning external minimality checking for answer set programs using semantic dependencies";
    Artificial Intelligence, 290 (2021).

    Zusätzliche Informationen
  321. Autor/innen: Thomas Eiter, E192-03; Tobias Kaminski, E192-03; Christoph Redl, E192-03; Antonius Weinzierl, E192-03

     T. Eiter, T. Kaminski, C. Redl, A. Weinzierl:
    "Exploiting Partial Assignments for Efficient Evaluation of Answer Set Programs with External Source Access";
    Journal of Artificial Intelligence Research, 62 (2018), S. 665 - 727.

    Zusätzliche Informationen
  322. Autor/innen: Thomas Eiter, E192-03; Gabriele Kern-Isberner

     T. Eiter, G. Kern-Isberner:
    "A Brief Survey on Forgetting from a Knowledge Representation and Reasoning Perspective";
    KI - Künstliche Intelligenz, vol. 33 (2019), 1; S. 9 - 33.

    Zusätzliche Informationen
  323. Autor/innen: Thomas Eiter, E192-03; Rafael Peter David Kiesel, E192-03

     T. Eiter, R. Kiesel:
    "ASP(AC): Answer Set Programming with Algebraic Constraints";
    Theory and Practice of Logic Programming, 20 (2020), 6; S. 895 - 910.

    Zusätzliche Informationen
  324. Autor/innen: Thomas Eiter, E192-03; Thomas Krennwallner, E192-03; Matthias Prandtstetter; Christian Rudloff; Patrik Schneider, E192-03; Markus Straub

     T. Eiter, T. Krennwallner, M. Prandtstetter, C. Rudloff, P. Schneider, M. Straub:
    "Semantically Enriched Multi-Modal Routing";
    International Journal of Intelligent Transportation Systems Research, NN (2014).

    Zusätzliche Informationen
  325. Autor/innen: Thomas Eiter, E192-03; Thomas Krennwallner, E192-03; Matthias Prandtstetter; Christian Rudloff; Patrik Schneider, E192-03; Markus Straub

     T. Eiter, T. Krennwallner, M. Prandtstetter, C. Rudloff, P. Schneider, M. Straub:
    "Semantically Enriched Multi-Modal Routing";
    International Journal of Intelligent Transportation Systems Research, 14 (2016), 1; S. 20 - 35.

    Zusätzliche Informationen
  326. Autor/innen: Thomas Eiter, E192-03; Domenico Lembo

     T. Eiter, D. Lembo:
    "Preface";
    Journal of Applied Logic, 3 (2005), 2; S. 251 - 252.
  327. Autor/innen: Thomas Eiter, E192-03; Thomas Lukasiewicz, E192-03

     T. Eiter, T. Lukasiewicz:
    "Causes and Explanations in the Structural-Model Approach: Tractable Cases";
    Artificial Intelligence, 170 (2006), 6-7; S. 542 - 580.
  328. Autor/innen: Thomas Eiter, E192-03; Thomas Lukasiewicz, E192-03

     T. Eiter, T. Lukasiewicz:
    "Complexity Results for Explanations in the Structural-Model Approach";
    Artificial Intelligence, 154 (2004), 1-2; S. 145 - 198.
  329. Autor/innen: Thomas Eiter, E192-03; Thomas Lukasiewicz, E192-03

     T. Eiter, T. Lukasiewicz:
    "Complexity Results for Structure-Based Causality";
    Artificial Intelligence, 142 (2002), 1; S. 53 - 89.
  330. Autor/innen: Thomas Eiter, E192-03; Kazuhisa Makino

     T. Eiter, K. Makino:
    "On Computing all Abductive Explanations from a Propositional Horn Theory";
    Journal of the ACM, 54 (2007), 4; S. 24:1 - 24:54.
  331. Autor/innen: Thomas Eiter, E192-03; Kazuhisa Makino; Georg Gottlob, E192

     T. Eiter, K. Makino, G. Gottlob:
    "Computational Aspects of Monotone Dualization: A Brief Survey";
    Discrete Applied Mathematics, 156 (2008), 11; S. 2035 - 2049.
  332. Autor/innen: Thomas Eiter, E192-03; Kazuhisa Makino; Toshihide Ibaraki

     T. Eiter, K. Makino, T. Ibaraki:
    "Decision Lists and Related Boolean Functions";
    Theoretical Computer Science, 270 (2002), 1-2; S. 493 - 524.
  333. Autor/innen: Thomas Eiter, E192-03; Viviana Mascardi

     T. Eiter, V. Mascardi:
    "A Comparison of Environments for Developing Software Agents";
    The European Journal on Artificial Intelligence (AI Communications), 15 (2002), 4; S. 169 - 197.
  334. Autor/innen: Thomas Eiter, E192-03; Paul Ogris; Konstantin Schekotihin

     T. Eiter, P. Ogris, K. Schekotihin:
    "A Distributed Approach to LARS Stream Reasoning";
    TPLP - Theory and Practice of Logic Programming, 19 (2019), 5-6; S. 974 - 989.
  335. Autor/innen: Thomas Eiter, E192-03; Paul Ogris; Konstantin Schekotihin

     T. Eiter, P. Ogris, K. Schekotihin:
    "Managing Caching Strategies for Stream Reasoning with Reinforcement Learning";
    TPLP - Theory and Practice of Logic Programming, 20 (2020), 5; S. 625 - 640.

    Zusätzliche Informationen
  336. Autor/innen: Thomas Eiter, E192-03; M.Magdalena Ortiz de la Fuente, E192-03; Mantas Simkus, E192-02

     T. Eiter, M. Ortiz de la Fuente, M. Simkus:
    "Conjunctive query answering in the description logic SH using knots";
    Journal of Computer and System Sciences, 78 (2012), 1; S. 47 - 85.

    Zusätzliche Informationen
  337. Autor/innen: Thomas Eiter, E192-03; Axel Florian Polleres, E192-03

     T. Eiter, A. Polleres:
    "Towards Automated Integration of Guess and Check Programs in Answer Set Programming: A Meta-Interpreter and Applications";
    Theory and Practice of Logic Programming, 6 (2006), 1-2; S. 23 - 60.
  338. Autor/innen: Thomas Eiter, E192-03; Yi-Dong Shen

     T. Eiter, Y. Shen:
    "Evaluating epistemic negation in answer set programming";
    Artificial Intelligence, 237 (2016), S. 115 - 135.

    Zusätzliche Informationen
  339. Autor/innen: Thomas Eiter, E192-03; Mantas Simkus, E192-03

     T. Eiter, M. Simkus:
    "FDNC: Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols";
    ACM Transactions on Computational Logic, 11 (2010), 2; S. 1 - 45.

    Zusätzliche Informationen
  340. Autor/innen: Thomas Eiter, E192-03; Helmut Veith, E192-04

     T. Eiter, H. Veith:
    "On the complexity of Data Disjunctions";
    Theoretical Computer Science, 288 (2002), S. 101 - 128.
  341. Autor/innen: Thomas Eiter, E192-03; Kewen Wang

     T. Eiter, K. Wang:
    "Semantic Forgetting in Answer Set Programming";
    Artificial Intelligence, 172 (2008), 14; S. 1644 - 1672.

    Zusätzliche Informationen
  342. Autor/innen: Thomas Eiter, E192-03; Antonius Weinzierl, E192-03

     T. Eiter, A. Weinzierl:
    "Preference-Based Inconsistency Management in Multi-Context Systems";
    Journal of Artificial Intelligence Research, 60 (2017), S. 347 - 424.

    Zusätzliche Informationen
  343. Autor/innen: Jan Ekstein; Herbert Fleischner, E192-01

     J. Ekstein, H. Fleischner:
    "A best possible result for the square of a 2-block to be hamiltonian";
    Discrete Mathematics, 344 (2021), 1; S. 1 - 6.

    Zusätzliche Informationen
  344. Autor/innen: Viktor Engelmann; Sebastian Ordyniak, E192-01; Stephan Kreutzer

     V. Engelmann, S. Ordyniak, S. Kreutzer:
    "Directed elimination games";
    Discrete Applied Mathematics, 199 (2016), S. 187 - 198.

    Zusätzliche Informationen
  345. Autor/innen: David Eppstein; Danny Holten; Maarten Löffler; Martin Nöllenburg, E192-01; Bettina Speckmann; Kevin Verbeek

     D. Eppstein, D. Holten, M. Löffler, M. Nöllenburg, B. Speckmann, K. Verbeek:
    "Strict Confluent Drawing";
    Journal of Computational Geometry, 7 (2016), 1; S. 22 - 46.

    Zusätzliche Informationen
  346. Autor/innen: Gábor Erdélyi; Martin Lackner, E192; Andreas Pfandler, E192-02

     G. Erdélyi, M. Lackner, A. Pfandler:
    "Computational Aspects of Nearly Single-Peaked Electorates";
    Journal of Artificial Intelligence Research, 58 (2017), S. 1.

    Zusätzliche Informationen
  347. Autor/innen: Esra Erdem, E192-03; Vladimir Lifschitz; Donald Ringe

     E. Erdem, V. Lifschitz, D. Ringe:
    "Temporal phylogenetic networks and logic programming";
    Theory and Practice of Logic Programming, 6 (2006), 5; S. 539 - 558.
  348. Autor/innen: Wolfgang Faber; Michael Morak; Stefan Woltran, E192-02

     W. Faber, M. Morak, S. Woltran:
    "On Uniform Equivalence of Epistemic Logic Programs";
    TPLP - Theory and Practice of Logic Programming, 19 (2019), 5-6; S. 826 - 840.

    Zusätzliche Informationen
  349. Autor/innen: Wolfgang Faber; Miroslaw Truszczynski; Stefan Woltran, E192-02

     W. Faber, M. Truszczynski, S. Woltran:
    "Strong Equivalence of Qualitative Optimization Problems";
    Journal of Artificial Intelligence Research, 47 (2013), S. 351 - 391.
  350. Autor/innen: Wolfgang Faber, E192-03; Stefan Woltran, E192-03

     W. Faber, S. Woltran:
    "KR 2004 - Konferenzbericht";
    ÖGAI Journal, 23 (2004), S. 24 - 27.
  351. Autor/innen: Andreas Falkner, Siemens; Ingo Feinerer, E192-02; Gernot Salzer, E192-05; Gottfried Schenner, Siemens

     A. Falkner, I. Feinerer, G. Salzer, G. Schenner:
    "Computing Product Configurations via UML and Integer Linear Programming";
    International Journal of Mass Customisation (eingeladen), 3 (2010), 4; S. 351 - 367.

    Zusätzliche Informationen
  352. Autor/in: Ruslan Fayzrakhmanov, E192-02

     R. Fayzrakhmanov:
    "A blocks-based geometric model of web pages for automatic processing and information extraction";
    Science and Business:Development Ways, 15 (2012), 9; S. 56 - 64.

    Zusätzliche Informationen
  353. Autor/innen: Mohsen Fazeli-Varzaneh; Ali Ghorbi; Marcel Ausloos; Emanuel Sallinger, E192-02

     M. Fazeli-Varzaneh, A. Ghorbi, M. Ausloos, E. Sallinger:
    "Sleeping Beauties of Coronavirus Research";
    IEEE Access, 9 (2021), S. 21192 - 21205.

    Zusätzliche Informationen
  354. Autor/innen: Bettina Fazzinga; Thomas Lukasiewicz, E192-03

     B. Fazzinga, T. Lukasiewicz:
    "Semantic search on the Web";
    Semantic Web, 1 (2010), 1/2; S. 89 - 96.
  355. Autor/innen: Cristina Feier, E192-03; Stijn Heymans

     C. Feier, S. Heymans:
    "Reasoning with Forest Logic Programs and f-hybrid knowledge bases";
    Theory and Practice of Logic Programming, FirstView (2011), S. 1 - 69.

    Zusätzliche Informationen
  356. Autor/in: Ingo Feinerer, E192-02

     I. Feinerer:
    "Efficient large-scale configuration via integer linear programming";
    Artificial Intelligence for Engineering Design, Analysis and Manufacturing, 27 (2013), 1; S. 37 - 49.

    Zusätzliche Informationen
  357. Autor/innen: Ingo Feinerer, E192-02; Kurt Hornik, WU Wien; David Meyer, WU Wien

     I. Feinerer, K. Hornik, D. Meyer:
    "Text Mining Infrastructure in R";
    Journal of Statistical Software, 25 (2008), 5; 54 S.

    Zusätzliche Informationen
  358. Autor/innen: Ingo Feinerer, E192-02; Reinhard Pichler, E192-02; Emanuel Sallinger; Vadim Savenkov, E192-02

     I. Feinerer, R. Pichler, E. Sallinger, V. Savenkov:
    "On the undecidability of the equivalence of second-order tuple generating dependencies";
    Information Systems, 48 (2015), S. 113 - 129.

    Zusätzliche Informationen
  359. Autor/innen: Ingo Feinerer, E192-02; Gernot Salzer, E192-05

     I. Feinerer, G. Salzer:
    "A Comparison of Tools for Teaching Formal Software Verification";
    Formal Aspects of Computing, 21 (2009), 3; S. 293 - 301.

    Zusätzliche Informationen
  360. Autor/innen: Ingo Feinerer, E192-02; Gernot Salzer, E192-05

     I. Feinerer, G. Salzer:
    "Numeric semantics of class diagrams with multiplicity and uniqueness constraints";
    Software and Systems Modeling, 2012 (2012), 1 S.

    Zusätzliche Informationen
  361. Autor/innen: Andreas Fellner, E192-04; Willibald Krenn, AIT; Rupert Schlick, AIT; Thorsten Tarrach, AIT; Georg Weissenbacher, E192-04

     A. Fellner, W. Krenn, R. Schlick, T. Tarrach, G. Weissenbacher:
    "Model-based, Mutation-driven Test-case Generation Via Heuristic-guided Branching Search";
    ACM Transactions on Embedded Computing Systems, 18 (2019), 1.

    Zusätzliche Informationen
  362. Autor/innen: Andreas Fellner, E192-04; Mitra Tabaei Befrouei, E192-04; Georg Weissenbacher, E192-04

     A. Fellner, M. Tabaei Befrouei, G. Weissenbacher:
    "Mutation testing with hyperproperties";
    Journal of Software and Systems Modeling (online-edition), 20 (2021), 2; S. 405 - 427.

    Zusätzliche Informationen
  363. Autor/innen: Michael R. Fellows; Fedor Fomin; Daniel Lokshtanov; Frances A. Rosamond; Saket Saurabh; Stefan Szeider, E192-03; Carsten Thomassen

     M. R. Fellows, F. Fomin, D. Lokshtanov, F. A. Rosamond, S. Saurabh, St. Szeider, C. Thomassen:
    "On the Complexity of Some Colorful Problems Parameterized by Treewidth";
    Information and Computation, 209 (2011), 2; S. 143 - 153.

    Zusätzliche Informationen
  364. Autor/innen: Michael R. Fellows; Serge Gaspers, E192-03; Frances A. Rosamond

     M. R. Fellows, S. Gaspers, F. A. Rosamond:
    "Parameterizing by the Number of Numbers";
    Theory of Computing Systems, Volume 50 (2012), No. 4; S. 675 - 693.

    Zusätzliche Informationen
  365. Autor/innen: Thomas Fenz; Klaus-Tycho Foerster; Stefan Schmid, Universität Wien; Anais Villedieu, E192-01

     T. Fenz, K. Foerster, S. Schmid, A. Villedieu:
    "Efficient non-segregated routing for reconfigurable demand-aware networks";
    Computer Communications, 164 (2020), S. 138 - 147.

    Zusätzliche Informationen
  366. Autor/in: Christian Fermüller, E192-05

     C. Fermüller:
    "Dialoque Games for Many-Valued Logics - an Overwiew";
    Studia Logica, 90 (2008), S. 43 - 68.

    Zusätzliche Informationen
  367. Autor/in: Christian Fermüller, E192-05

     C. Fermüller:
    "On matrices, Nmatrices and games";
    Journal of Logic and Computation, 1 (2013), S. 1 - 23.
  368. Autor/in: Christian Fermüller, E192-05

     C. Fermüller:
    "On matrices, Nmatrices and games";
    Journal of Logic and Computation, 26 (2016), 1; S. 189 - 211.

    Zusätzliche Informationen
  369. Autor/in: Christian Fermüller, E192-05

     C. Fermüller:
    "Review of "Fuzzy Logic and Mathematics: A Historical Perspective"";
    Notre Dame Philosophical Reviews (eingeladen), (online) (2018).
  370. Autor/in: Christian Fermüller, E192-05

     C. Fermüller:
    "Review: Vagueness and Degrees of Truth";
    Australasian Journal of Logic, 9 (2010), S. 1 - 9.
  371. Autor/in: Christian Fermüller, E192-05

     C. Fermüller:
    "Semantic Games with Backtracking for T-norm Based Fuzzy Logics";
    Journal of Multiple-Valued Logic and Soft Computing, 26 (2016), 1-2; S. 157 - 173.
  372. Autor/in: Christian Fermüller, E192-05

     C. Fermüller:
    "Theories of Vagueness Versus Fuzzy Logic: Can Logicians Learn from Philosophers?";
    Neural Network World (eingeladen), 13 (2003), 5; S. 455 - 466.
  373. Autor/innen: Christian Fermüller, E192-05; George Metcalfe

     C. Fermüller, G Metcalfe:
    "Giles's Game and the Proof Theory of Lukasiewicz Logic";
    Studia Logica, 92 (2009), S. 27 - 81.
  374. Autor/innen: Christian Fermüller, E192-05; Reinhard Pichler, E192-02

     C. Fermüller, R. Pichler:
    "Model Representation over Finite and Infinite Signatures";
    Journal of Logic and Computation, 17 (2007), 3; S. 453 - 477.
  375. Autor/innen: Christian Fermüller, E192-05; Christoph Roschger, E192-05

     C. Fermüller, Ch Roschger:
    "From Games to Truth Functions: A Generalization of Giles's Game";
    Studia Logica, 102 (2014), 2; S. 389 - 410.

    Zusätzliche Informationen
  376. Autor/innen: Christian Fermüller, E192-05; Christoph Roschger, E192-05

     C. Fermüller, Ch Roschger:
    "Randomized game semantics for semi-fuzzy quantifiers";
    Logic Journal of the IGPL, 22 (2014), 3; S. 413 - 439.
  377. Autor/innen: Henning Fernau; Rudolf Freund, E192-05; Markus Holzer

     H. Fernau, R. Freund, M Holzer:
    "Representations of Recursively Enumerable Array Languages by Contextual Array Grammars";
    Fundamenta Informaticae, 64 (2005), 1-4; S. 159 - 170.
  378. Autor/innen: Henning Fernau; Rudolf Freund, E192-05; Marion Oswald, E192-05; Klaus Reinhardt

     H. Fernau, R. Freund, M. Oswald, K. Reinhardt:
    "Refining the Nonterminal Complexity of Graph-controlled, Programmed and Matrix Grammars";
    Journal of Automata, Languages and Combinatorics, 12 (2007), 1/2; S. 117 - 138.
  379. Autor/innen: Henning Fernau; Markus Holzer; Rudolf Freund, E192-05

     H. Fernau, M Holzer, R. Freund:
    "Hybrid Modes in Cooperating Distributed Grammar Systems: Combining the t-mode with the Modes <=k and =k";
    Theoretical Computer Science, 299 (2003), S. 633 - 662.
  380. Autor/innen: Johannes Fichte, E192-02; Markus Hecher, E192-02; Florim Hamiti

     J. Fichte, M. Hecher, F. Hamiti:
    "The Model Counting Competition 2020";
    ACM Journal of Experimental Algorithmics, 26 (2021), 1; S. 1 - 26.

    Zusätzliche Informationen
  381. Autor/innen: Johannes Fichte, E192-02; Markus Hecher, E192-02; Michael Morak; Stefan Woltran, E192-02

     J. Fichte, M. Hecher, M. Morak, S. Woltran:
    "DynASP2.5: Dynamic Programming on Tree Decompositions in Action";
    Algorithms, 14 (2021), 3; S. 1 - 28.

    Zusätzliche Informationen
  382. Autor/innen: Johannes Fichte, E192-02; Markus Hecher, E192-02; Patrick Thier, E192-02; Stefan Woltran, E192-02

     J. Fichte, M. Hecher, P. Thier, S. Woltran:
    "Exploiting Database Management Systems and Treewidth for Counting";
    TPLP - Theory and Practice of Logic Programming, 1 (2021), S. 1 - 30.

    Zusätzliche Informationen
  383. Autor/innen: Johannes Fichte; Martin Kronegger, E191-03; Stefan Woltran, E192-02

     J. Fichte, M. Kronegger, S. Woltran:
    "A Multiparametric View on Answer Set Programming";
    Annals of Mathematics and Artificial Intelligence (eingeladen), 86 (2019), 1-3; S. 121 - 147.

    Zusätzliche Informationen
  384. Autor/innen: Johannes Fichte, E192-02; Stefan Szeider, E192-01

     J. Fichte, S. Szeider:
    "Backdoors to Normality for Disjunctive Logic Programs";
    ACM Transactions on Computational Logic, 17 (2015), 1; S. 7:1 - 7:23.

    Zusätzliche Informationen
  385. Autor/innen: Johannes Fichte, E192-03; Stefan Szeider, E192-01

     J. Fichte, S. Szeider:
    "Backdoors to tractable answer-set programming";
    Artificial Intelligence, 220 (2015), S. 64 - 103.

    Zusätzliche Informationen
  386. Autor/innen: Johannes Fichte, E192-03; Miroslaw Truszczynski; Stefan Woltran, E192-02

     J. Fichte, M. Truszczynski, S. Woltran:
    "Dual-normal logic programs - the forgotten class";
    Theory and Practice of Logic Programming, 15 (2015), S. 495 - 510.

    Zusätzliche Informationen
  387. Autor/innen: Ruth Fingerlos; Johannes Gärtner, Ximes GmbH; Nysret Musliu, E192-02; Wolfgang Slany, E192-02

     R. Fingerlos, J. Gärtner, N. Musliu, W. Slany:
    "Zyklische Schichtplanung";
    KI - Künstliche Intelligenz, 2 (2001), 1; S. 31 - 34.
  388. Autor/in: Michael Fink, E192-03

     M. Fink:
    "A General Framework for Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There";
    Theory and Practice of Logic Programming, 11 (2011), 2-3; S. 171 - 202.

    Zusätzliche Informationen
  389. Autor/innen: Wolfgang Fischl, E192-02; Georg Gottlob, E192-02; Davide Mario Longo, E192-02; Reinhard Pichler, E192-02

     W. Fischl, G. Gottlob, D. Longo, R. Pichler:
    "HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings";
    ACM Journal of Experimental Algorithmics, 26 (2021), 1.6; S. 1 - 40.

    Zusätzliche Informationen
  390. Autor/innen: Herbert Fleischner, E192-02; Egbert Mujuni; Daniel Paulusma; Stefan Szeider

     H. Fleischner, E. Mujuni, D. Paulusma, S. Szeider:
    "Covering graphs with few complete bipartite subgraphs";
    Theoretical Computer Science, 410 (2009), 21-23; S. 2045 - 2053.

    Zusätzliche Informationen
  391. Autor/innen: Henry Förster; Robert Ganian, E192-01; Fabian Klute; Martin Nöllenburg, E192-01

     H. Förster, R. Ganian, F. Klute, M. Nöllenburg:
    "On Strict (Outer-)Confluent Graphs";
    Journal of Graph Algorithms and Applications, 25 (2021), 1; S. 481 - 512.

    Zusätzliche Informationen
  392. Autor/in: Rudolf Freund, E192-05

     R. Freund:
    "How derivation modes and halting conditions may influence the computational power of P systems";
    Journal of Membrane Computing, 2 (2020), 1; 11 S.
  393. Autor/in: Rudolf Freund, E192-05

     R. Freund:
    "P Systems Working in the Sequential Mode on Arrays and Strings";
    International Journal of Foundations of Computer Science, 16 (2005), 4; S. 663 - 682.
  394. Autor/innen: Rudolf Freund, E192-05; Artiom Alhazov

     R. Freund, A. Alhazov:
    "Variants of Small Universal {P} Systems with Catalysts";
    Fundamenta Informaticae, 138 (2015), 1-2; S. 227 - 250.
  395. Autor/innen: Rudolf Freund, E192-05; Artiom Alhazov

     R. Freund, A. Alhazov et al.:
    "Antimatter as a Frontier of Tractability in Membrane Computing";
    Fundamenta Informaticae, 134 (2014), 1-2; S. 83 - 96.
  396. Autor/innen: Rudolf Freund, E192-05; Artiom Alhazov

     R. Freund, A. Alhazov et al.:
    "Computational completeness of complete, star-like, and linear hybrid networks of evolutionary processors with a small number of processors";
    Natural Computing, 15 (2016), 1; S. 51 - 68.

    Zusätzliche Informationen
  397. Autor/innen: Rudolf Freund, E192-05; Artiom Alhazov

     R. Freund, A. Alhazov et al.:
    "Length P Systems";
    Fundamenta Informaticae, 134 (2014), 1-2; S. 17 - 37.

    Zusätzliche Informationen
  398. Autor/innen: Rudolf Freund, E192-05; Artiom Alhazov

     R. Freund, A. Alhazov et al.:
    "P systems with randomized right-hand sides of rules";
    Theoretical Computer Science, 805 (2020), 805; S. 144 - 160.

    Zusätzliche Informationen
  399. Autor/innen: Rudolf Freund, E192-05; Artiom Alhazov

     R. Freund, A. Alhazov et al.:
    "Time-freeness and clock-freeness and related concepts in {P} systems";
    Theoretical Computer Science, 805 (2020), S. 127 - 143.
  400. Autor/innen: Rudolf Freund, E192-05; Artiom Alhazov; Sergui Ivanov

     R. Freund, A. Alhazov, S. Ivanov:
    "Variants of P systems with activation and blocking of rules";
    Natural Computing, 18 (2019), 3; S. 593 - 608.

    Zusätzliche Informationen
  401. Autor/innen: Rudolf Freund, E192-05; Artiom Alhazov; Sergui Ivanov

     R. Freund, A. Alhazov, S. Ivanov et al.:
    "Contextual array grammars with matrix control, regular control languages, and tissue P systems control";
    Theoretical Computer Science, 682 (2017), S. 5 - 21.
  402. Autor/innen: Rudolf Freund, E192-05; Artiom Alhazov; Sergui Ivanov; Marion Oswald, E192-05

     R. Freund, A. Alhazov, S. Ivanov, M. Oswald et al.:
    "Extended spiking neural P systems with white hole rules and their red-green variants";
    Natural Computing, 17 (2018), 2; S. 297 - 310.

    Zusätzliche Informationen
  403. Autor/innen: Rudolf Freund, E192-05; Artiom Alhazov; Kenichi Morita

     R. Freund, A. Alhazov, K. Morita:
    "Sequential and maximally parallel multiset rewriting: reversiblility and determinism";
    Natural Computing, 11 (2012), 1; S. 95 - 106.
  404. Autor/in: Rudolf Freund, E192-05

     R. Freund et al.:
    "Polymorphic P Systems";
    Bulletin of the International Membrane Computing Society, 12 (2016), 2; S. 79 - 101.
  405. Autor/in: Rudolf Freund, E192-05

     R. Freund et al.:
    "Preface";
    Fundamenta Informaticae, 148 (2016), 3-4.
  406. Autor/in: Rudolf Freund, E192-05

     R. Freund et al.:
    "Preface";
    Natural Computing, 20 (2021), 4; S. 637 - 638.
  407. Autor/in: Rudolf Freund, E192-05

     R. Freund et al.:
    "Watson-Crick {T0L} Systems and Red-Green Register Machines";
    Fundamenta Informaticae, 155 (2017), 1-2; S. 111 - 129.
  408. Autor/innen: Rudolf Freund, E192-05; Henning Fernau

     R. Freund, H. Fernau et al.:
    "Contextual array grammars and array {P} systems";
    Annals of Mathematics and Artificial Intelligence, 75 (2015), 1-2; S. 5 - 26.
  409. Autor/innen: Rudolf Freund, E192-05; Henning Fernau

     R. Freund, H. Fernau et al.:
    "Non-Isometric Contextual Array Grammars and the Role of Regular Control and Local Selectors";
    Fundamenta Informaticae, 155 (2017), 1-2; S. 209 - 232.
  410. Autor/innen: Rudolf Freund, E192-05; Henning Fernau

     R. Freund, H. Fernau et al.:
    "The Finite Index Restriction Meets Hybrid Modes in Cooperating Distributed Grammar Systems";
    International Journal of Foundations of Computer Science, 26 (2015), 8; S. 1167 - 1188.
  411. Autor/innen: Rudolf Freund, E192-05; Marian Gheorghe

     R. Freund, M. Gheorghe et al.:
    "Preface";
    International Journal of Foundations of Computer Science, 22 (2011), 1; S. 1 - 6.
  412. Autor/innen: Rudolf Freund, E192-05; Thomas Hava

     R. Freund, T. Hava et al.:
    "Report on UCNC 2014";
    Bulletin of the EATCS, 114 (2014).
  413. Autor/innen: Rudolf Freund, E192-05; Sergui Ivanov; Artiom Alhazov

     R. Freund, S. Ivanov, A. Alhazov:
    "P systems with limited number of objects";
    Journal of Membrane Computing, 3 (2021), 1; S. 1 - 9.
  414. Autor/innen: Rudolf Freund, E192-05; Sergui Ivanov; Artiom Alhazov

     R. Freund, S. Ivanov, A. Alhazov:
    "When catalytic P systems with one catalyst can be computationally complete.";
    Journal of Membrane Computing, 3 (2021), 3; S. 170 - 181.
  415. Autor/innen: Rudolf Freund, E192-05; Lila Kari; Marion Oswald, E192-05; Petr Sosik

     R. Freund, L. Kari, M. Oswald, P. Sosik:
    "Computationally Universal P Systems without Priorities: Two Catalysts are Sufficient";
    Theoretical Computer Science, 330 (2005), S. 251 - 266.
  416. Autor/innen: Rudolf Freund, E192-05; Jozef Kelemen; Gheorghe Paun

     R. Freund, J Kelemen, Gh. Paun:
    "A Note on Emergence in Multi-Agent String Processing Systems";
    Computing and Informatics, 22 (2003), S. 623 - 637.
  417. Autor/innen: Rudolf Freund, E192-05; Marian Kogler, E192-05

     R. Freund, M. Kogler et al.:
    "On the Power of P and DP Automata";
    Analele Univeritatii Bucuresti, LVIII (2009), ISSN: 1224-7170; S. 5 - 22.
  418. Autor/innen: Rudolf Freund, E192-05; Carlos Martin-Vide; Victor Mitrana

     R. Freund, C. Martin-Vide, V. Mitrana et al.:
    "On some operations on strings suggested by gene assembly in ciliates";
    New Generation Computing, 20 (2002), S. 279 - 293.
  419. Autor/innen: Rudolf Freund, E192-05; Carlos Martin-Vide; Gheorghe Paun

     R. Freund, C. Martin-Vide, Gh. Paun:
    "From Regulated Rewriting to Computing with Membranes: collapsing Hierarchies";
    Theoretical Computer Science, 312 (2004), S. 143 - 188.
  420. Autor/innen: Rudolf Freund, E192-05; Marion Oswald, E192-05

     R. Freund, M. Oswald:
    "A Short Note on Analysing P Systems with Antiport Rules";
    EATCS Bulletin, 78 (2002), S. 231 - 236.

    Zusätzliche Informationen
  421. Autor/innen: Rudolf Freund, E192-05; Marion Oswald, E192-05

     R. Freund, M. Oswald:
    "Array Grammars and Automata on Cayley Grids";
    Journal of Automata, Languages and Combinatorics, 19 (2014), 1-4; S. 67 - 80.
  422. Autor/innen: Rudolf Freund, E192-05; Marion Oswald, E192-05

     R. Freund, M. Oswald:
    "CD Grammar Systems with Regular Start Conditions";
    International Journal of Foundations of Computer Science, 19 (2008), 4; S. 767 - 779.
  423. Autor/innen: Rudolf Freund, E192-05; Marion Oswald, E192-05

     R. Freund, M. Oswald:
    "GP Systems with Forbidding Context";
    Fundamenta Informaticae, 49 (2002), 1-3; S. 81 - 102.

    Zusätzliche Informationen
  424. Autor/innen: Rudolf Freund, E192-05; Marion Oswald, E192-05

     R. Freund, M. Oswald:
    "Modelling Grammar Systems by Tissue P Systems Working in the Sequential Mode";
    Fundamenta Informaticae, 76 (2007), 3; S. 305 - 323.
  425. Autor/innen: Rudolf Freund, E192-05; Marion Oswald, E192-05

     R. Freund, M. Oswald:
    "P Automata with Membrane Channels";
    Artificial Life and Robotics, 8 (2004), 2; S. 186 - 189.
  426. Autor/innen: Rudolf Freund, E192-05; Marion Oswald, E192-05

     R. Freund, M. Oswald:
    "P colonies and prescribed teams";
    International Journal of Computer Mathematics, 83 (2006), 7; S. 569 - 592.
  427. Autor/innen: Rudolf Freund, E192-05; Marion Oswald, E192-05

     R. Freund, M. Oswald:
    "P Systems with Antiport Rules for Evolution Rules";
    WSEAS Transactions on Systems, 2 (2004), 3; S. 866 - 873.
  428. Autor/innen: Rudolf Freund, E192-05; Marion Oswald, E192-05

     R. Freund, M. Oswald:
    "P Systems with Conditional Communication Rules Assigned to Membranes";
    Journal of Automata, Languages and Combinatorics, 9 (2004), 4; S. 387 - 397.
  429. Autor/innen: Rudolf Freund, E192-05; Marion Oswald, E192-05

     R. Freund, M. Oswald:
    "P Systems with Local Graph Productions";
    New Generation Computing, 22 (2004), S. 365 - 375.
  430. Autor/innen: Rudolf Freund, E192-05; Marion Oswald, E192-05

     R. Freund, M. Oswald:
    "Partial Halting in P Systems";
    International Journal of Foundations of Computer Science, 18 (2007), 6; S. 1215 - 1225.
  431. Autor/innen: Rudolf Freund, E192-05; Marion Oswald, E192-05

     R. Freund, M. Oswald:
    "Regular ω-Languages defined by Extended Spiking Neural P Systems";
    Fundamenta Informaticae (eingeladen), 83 (2008), 1-2; S. 65 - 73.
  432. Autor/innen: Rudolf Freund, E192-05; Marion Oswald, E192-05

     R. Freund, M. Oswald:
    "Tissue P Systems and (MEM) Brane Systems with Mate and Drip Operations Working on Strings";
    Electronic Notes in Theoretical Computer Science (ENTCS), 171 (2007), S. 105 - 115.
  433. Autor/innen: Rudolf Freund, E192-05; Marion Oswald, E192-05; Artiom Alhazov; Sergui Ivanov

     R. Freund, M. Oswald, A. Alhazov, S. Ivanov:
    "Relations between Control Mechanisms for Sequential Grammars";
    Fundamenta Informaticae, 181 (2021), 2-3; S. 239 - 271.
  434. Autor/innen: Rudolf Freund, E192-05; Marion Oswald, E192-05; Mihai Ionescu

     R. Freund, M. Oswald, M. Ionescu:
    "Extended Spiking Neural P Systems with Decaying Spikes and/or Total Spiking";
    International Journal of Foundations of Computer Science, 19 (2008), 5; S. 1223 - 1234.
  435. Autor/innen: Rudolf Freund, E192-05; Marion Oswald, E192-05; Andrei Paun

     R. Freund, M. Oswald, A. Paun:
    "Optimal Results for the Computational Completeness of Gemmating (Tissue) P Systems";
    International Journal of Foundations of Computer Science, 16 (2005), 5; S. 929 - 942.
  436. Autor/innen: Rudolf Freund, E192-05; Marion Oswald, E192-05; Gheorghe Paun

     R. Freund, M. Oswald, Gh. Paun:
    "Catalytic and Purely Catalytic {P} Systems and {P} Automata: Control Mechanisms for Obtaining Computational Completeness";
    Fundamenta Informaticae, 136 (2015), 1-2; S. 59 - 84.
  437. Autor/innen: Rudolf Freund, E192-05; Andrei Paun

     R. Freund, A. Paun:
    "P systems with active membranes and without polarizations";
    Soft Computing, 9 (2005), 9; S. 657 - 663.
  438. Autor/innen: Rudolf Freund, E192-05; Gheorghe Paun; Mario Pérez-Jiménez

     R. Freund, Gh. Paun, M. Pérez-Jiménez:
    "Tissue P Systems with Channel States";
    Theoretical Computer Science, 330 (2005), S. 101 - 116.
  439. Autor/innen: Rudolf Freund, E192-05; Ludwig Staiger; Sergui Ivanov

     R. Freund, L. Staiger, S. Ivanov:
    "Going Beyond Turing with {P} Automata: Regular Observer {\(\omega\)}-Languages and Partial Adult Halting";
    International Journal of Unconventional Computing, 12 (2016), 1; S. 51 - 69.
  440. Autor/innen: Rudolf Freund, E192-05; Fritz Tafill

     R. Freund, F. Tafill:
    "Cellular Automata and Parallel Array Systems";
    Fundamenta Informaticae, 78 (2007), 3; S. 311 - 327.
  441. Autor/innen: Rudolf Freund, E192-05; Sergey Verlan

     R. Freund, S. Verlan:
    "(Tissue) P systems working in the k - restricted minimally or maximally parallel transition mode";
    Natural Computing, 10 (2011), 2; S. 821 - 833.

    Zusätzliche Informationen
  442. Autor/innen: Rudolf Freund, E192-05; Sergey Verlan

     R. Freund, S. Verlan et al.:
    "A formalization of membrane szstems with dynamically evolving structures";
    International Journal of Computer Mathematics, 90 (2013), 4; S. 801 - 815.
  443. Autor/innen: Rudolf Freund, E192-05; Sergey Verlan

     R. Freund, S. Verlan et al.:
    "Variants of Networks of Evolutionary Processors with Polarizations and a Small Number of Processors";
    International Journal of Foundations of Computer Science, 30 (2019), 6-7; S. 1005 - 1027.
  444. Autor/innen: Johannes Gärtner; Nysret Musliu, E192-02; Wolfgang Slany, E192-02

     J. Gärtner, N. Musliu, W. Slany:
    "Rota: A research project on algorithms for workforce scheduling and shift design optimisation";
    AI Communications, 14 (2001), 2; S. 83 - 92.
  445. Autor/innen: Sarah Alice Gaggl; Thomas Linsbichler, E192-02; Marco Maratea; Stefan Woltran, E192-02

     S. Gaggl, T. Linsbichler, M. Maratea, S. Woltran:
    "Design and results of the Second International Competition on Computational Models of Argumentation";
    Artificial Intelligence, 279 (2020), S. 1 - 60.

    Zusätzliche Informationen
  446. Autor/innen: Sarah Alice Gaggl, E192-02; Thomas Linsbichler, E192-02; Marco Maratea; Stefan Woltran, E192-02

     S. Gaggl, T. Linsbichler, M. Maratea, S. Woltran:
    "Summary Report of the Second International Competition on Computational Models of Argumentation";
    AI Magazine, 39 (2018), 4; S. 77 - 79.

    Zusätzliche Informationen
  447. Autor/innen: Sarah Alice Gaggl, E192-02; Norbert Manthey; Alessandro Ronca; Johannes Peter Wallner, E192-02; Stefan Woltran, E192-02

     S. Gaggl, N. Manthey, A. Ronca, J. P. Wallner, S. Woltran:
    "Improved answer-set programming encodings for abstract argumentation";
    Theory and Practice of Logic Programming, 15 (2015), 4-5; S. 434 - 448.

    Zusätzliche Informationen
  448. Autor/innen: Sarah Gaggl, E192-02; Stefan Woltran, E192-02

     S. Gaggl, S. Woltran:
    "The cf2 argumentation semantics revisited.";
    Journal of Logic and Computation, 23 (2013), 5; S. 925 - 949.

    Zusätzliche Informationen
  449. Autor/innen: Jakub Gajarsky; Petr Hlinený; Tomas Kaiser; Daniel Král; Martin Kupec; Jan Obdrzalek; Sebastian Ordyniak, E192-01; Tuma Vojtech

     J. Gajarsky, P. Hlinený, T. Kaiser, D. Král, M. Kupec, J. Obdrzalek, S. Ordyniak, T. Vojtech:
    "First order limits of sparse graphs: Plane trees and path-width";
    Random Structures and Algorithms, 50 (2017), S. 612 - 635.

    Zusätzliche Informationen
  450. Autor/innen: Jakub Gajarsky; Petr Hlinený; Jan Obdrzalek; Sebastian Ordyniak, E192-01; Felix Reidl; Peter Rossmanith; Fernando Villaamil Sanchez; Somnath Sikdar

     J. Gajarsky, P. Hlinený, J. Obdrzalek, S. Ordyniak, F. Reidl, P. Rossmanith, F. Villaamil Sanchez, S. Sikdar:
    "Kernelization using structural parameters on sparse graph classes";
    Journal of Computer and System Sciences, 84 (2017), S. 219 - 242.

    Zusätzliche Informationen
  451. Autor/innen: Marcelo Galvão; Jakub Krukar; Martin Nöllenburg, E192-01; Angela Schwering

     M. Galvão, J. Krukar, M. Nöllenburg, A. Schwering:
    "Route schematization with landmarks";
    Journal of Spatial Information Science, 21 (2020).

    Zusätzliche Informationen
  452. Autor/in: Robert Ganian, E192-01

     R. Ganian:
    "Improving Vertex Cover as a Graph Parameter";
    Discrete Mathematics & Theoretical Computer Science, 17/2 (2015), S. 77 - 100.

    Zusätzliche Informationen
  453. Autor/innen: Robert Ganian, E192-01; Ronald de Haan; Iyad Kanj; Stefan Szeider, E192-01

     R. Ganian, R. de Haan, I. Kanj, S. Szeider:
    "On Existential MSO and Its Relation to ETH";
    ACM Transactions on Computation Theory, 12 (2020), 4; S. 1 - 32.

    Zusätzliche Informationen
  454. Autor/innen: Robert Ganian, E192-03; Petr Hlinený; Joachim Kneis; Alexander Langer; Jan Obdrzalek; Peter Rossmanith

     R. Ganian, P. Hlinený, J. Kneis, A. Langer, J. Obdrzalek, P. Rossmanith:
    "Digraph Width Measures in Parameterized Algorithmics";
    Discrete Applied Mathematics, 168 (2014), S. 88 - 107.

    Zusätzliche Informationen
  455. Autor/innen: Robert Ganian, E192-01; Petr Hlinený; Daniel Král; Jan Obdrzalek; Jarett Schwartz; Jakub Teska

     R. Ganian, P. Hlinený, D. Král, J. Obdrzalek, J. Schwartz, J. Teska:
    "FO Model Checking of Interval Graphs";
    Logical Methods in Computer Science, 11 (2015), 4; 20 S.

    Zusätzliche Informationen
  456. Autor/innen: Robert Ganian, E192-03; Petr Hlinený; Alexander Langer; Jan Obdrzalek; Peter Rossmanith; Somnath Sikdar

     R. Ganian, P. Hlinený, A. Langer, J. Obdrzalek, P. Rossmanith, S. Sikdar:
    "Lower Bounds on the Complexity of MSO1 Model-Checking";
    Journal of Computer and System Sciences, 80 (2014), 1; S. 180 - 194.

    Zusätzliche Informationen
  457. Autor/innen: Robert Ganian, E192-01; Fabian Klute; Sebastian Ordyniak

     R. Ganian, F. Klute, S. Ordyniak:
    "On Structural Parameterizations of the Bounded‑Degree Vertex Deletion Problem";
    Algorithmica, 82 (2020), S. 1 - 40.

    Zusätzliche Informationen
  458. Autor/innen: Robert Ganian, E192-01; Martin Kronegger, E191-03; Andreas Pfandler, E192-02; Alexandru Popa

     R. Ganian, M. Kronegger, A. Pfandler, A. Popa:
    "Parameterized Complexity of Asynchronous Border Minimization";
    Algorithmica, 81 (2019), 1; S. 201 - 223.

    Zusätzliche Informationen
  459. Autor/innen: Robert Ganian, E192-01; Sebastian Ordyniak, E192-01

     R. Ganian, S. Ordyniak:
    "The Complexity Landscape of Decompositional Parameters for ILP";
    Artificial Intelligence, 257 (2018), S. 61 - 71.

    Zusätzliche Informationen
  460. Autor/innen: Robert Ganian, E192-01; Sebastian Ordyniak

     R. Ganian, S. Ordyniak:
    "The Power of Cut‑Based Parameters for Computing Edge‑Disjoint Paths";
    Algorithmica, 82 (2020), S. 1 - 27.

    Zusätzliche Informationen
  461. Autor/innen: Robert Ganian, E192-01; Sebastian Ordyniak; M.S. Ramanujan

     R. Ganian, S. Ordyniak, M. Ramanujan:
    "On Structural Parameterizations of the Edge Disjoint Paths Problem";
    Algorithmica, 83 (2021), S. 1605 - 1637.

    Zusätzliche Informationen
  462. Autor/innen: Robert Ganian, E192-01; M. Sridharan Ramanujan, E192-01; Stefan Szeider, E192-01

     R. Ganian, M. S. Ramanujan, S. Szeider:
    "Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting";
    ACM Transactions on Algorithms, 13 (2017), S. 1 - 31.

    Zusätzliche Informationen
  463. Autor/innen: Robert Ganian, E192-01; Friedrich Slivovsky, E192-01; Stefan Szeider, E192-01

     R. Ganian, F. Slivovsky, S. Szeider:
    "Meta-kernelization with structural parameters";
    Journal of Computer and System Sciences, 82 (2016), S. 333 - 346.

    Zusätzliche Informationen
  464. Autor/innen: Robert Ganian, E192-01; Stefan Szeider, E192-01

     R. Ganian, S. Szeider:
    "New width parameters for SAT and #SAT";
    Artificial Intelligence, 295 (2021), S. 1 - 18.

    Zusätzliche Informationen
  465. Autor/innen: Serge Gaspers; Mikko Koivisto; Mathieu Liedloff; Sebastian Ordyniak, E192-01; Stefan Szeider, E192-01

     S. Gaspers, M. Koivisto, M. Liedloff, S. Ordyniak, S. Szeider:
    "On finding optimal polytrees";
    Theoretical Computer Science, 592 (2015), S. 49 - 58.

    Zusätzliche Informationen
  466. Autor/innen: Serge Gaspers, E192-03; Dieter Kratsch; Mathieu Liedloff

     S. Gaspers, D. Kratsch, M. Liedloff:
    "On Independent Sets and Bicliques in Graphs";
    Algorithmica, Vol. 62 (2012), No. 3-4; S. 637 - 658.

    Zusätzliche Informationen
  467. Autor/innen: Serge Gaspers, E192-03; Mathieu Liedloff

     S. Gaspers, M. Liedloff:
    "A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set";
    Discrete Mathematics & Theoretical Computer Science, Vol. 14 (2012), No. 1; S. 29 - 42.

    Zusätzliche Informationen
  468. Autor/innen: Serge Gaspers; Neeldhara Misra; Sebastian Ordyniak, E192-01; Stefan Szeider, E192-01; Stanislav Zivný

     S. Gaspers, N. Misra, S. Ordyniak, S. Szeider, S. Zivný:
    "Backdoors into heterogeneous classes of SAT and CSP";
    Journal of Computer and System Sciences, 85 (2017), S. 38 - 56.

    Zusätzliche Informationen
  469. Autor/innen: Serge Gaspers; Sebastian Ordyniak, E192-01; M. Sridharan Ramanujan, E192-01; Saket Saurabh; Stefan Szeider, E192-01

     S. Gaspers, S. Ordyniak, M. S. Ramanujan, S. Saurabh, S. Szeider:
    "Backdoors to q-Horn";
    Algorithmica (online), 74 (2016), S. 540 - 557.

    Zusätzliche Informationen
  470. Autor/innen: Serge Gaspers, E192-03; Gregory B. Sorkin

     S. Gaspers, G. Sorkin:
    "A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between";
    Journal of Computer and System Sciences, Vol. 78 (2012), No. 1; S. 305 - 335.

    Zusätzliche Informationen
  471. Autor/innen: Serge Gaspers, E192-03; Stefan Szeider, E192-03

     S. Gaspers, St. Szeider:
    "Guarantees and limits of preprocessing in constraint satisfaction and reasoning";
    Artificial Intelligence, 216 (2014), S. 1 - 19.

    Zusätzliche Informationen
  472. Autor/innen: Andreas Gemsa; Benjamin Niedermann; Martin Nöllenburg, E192-01

     A. Gemsa, B. Niedermann, M. Nöllenburg:
    "A Unified Model and Algorithms for Temporal Map Labeling";
    Algorithmica (online), 82 (2020), S. 2709 - 2736.

    Zusätzliche Informationen
  473. Autor/innen: Andreas Gemsa; Benjamin Niedermann; Martin Nöllenburg, E192-01

     A. Gemsa, B. Niedermann, M. Nöllenburg:
    "Placing Labels in Road Maps: Algorithms and Complexity";
    Algorithmica (online), 82 (2020), S. 1881 - 1908.

    Zusätzliche Informationen
  474. Autor/innen: Andreas Gemsa; Martin Nöllenburg, E192-01; Ignaz Rutter

     A. Gemsa, M. Nöllenburg, I. Rutter:
    "Consistent Labeling Of Rotating Maps";
    Journal of Computational Geometry, 7 (2016), 1; S. 308 - 331.

    Zusätzliche Informationen
  475. Autor/innen: Andreas Gemsa; Martin Nöllenburg, E192-01; Ignaz Rutter

     A. Gemsa, M. Nöllenburg, I. Rutter:
    "Evaluation of Labeling Strategies for Rotating Maps";
    ACM Journal of Experimental Algorithmics, 21 (2016), 1; S. 1 - 21.

    Zusätzliche Informationen
  476. Autor/innen: A. Gerevini; Jochen Renz, E192-02

     A. Gerevini, J. Renz:
    "Combining Topological and Size Constraints for Spatial Reasoning";
    Artificial Intelligence, 137 (2002), 1-2; S. 1 - 42.
  477. Autor/innen: Tomasz Gogacz, University of Warsaw; Victor Gutierrez-Basulto, Cardiff University; Albert Gutowski; Yazmin Angelica Ibanez Garcia, E192-03; Filip Murlak

     T. Gogacz, V. Gutierrez-Basulto, A. Gutowski, Y.A. Ibanez Garcia, F. Murlak:
    "On Finite Entailment of Non-Local Queries in Description Logics";
    ArXiv, 2006 (2020), 16869; 25 S.
  478. Autor/innen: Tomasz Gogacz, University of Warsaw; Victor Gutierrez-Basulto, Cardiff University; Yazmin Angelica Ibanez Garcia, E192-03; Jean Chistoph Jung, Bremen University; Filip Murlak

     T. Gogacz, V. Gutierrez-Basulto, Y.A. Ibanez Garcia, J. Jung, F. Murlak:
    "On Finite and Unrestricted Query Entailment beyond SQ with Number Restrictions on Transitive Roles";
    ArXiv, 2010 (2020), 11503; 13 S.
  479. Autor/innen: Ricardo Goncalves; Matthias Knorr; Joao Leite; Stefan Woltran, E192-02

     R. Goncalves, M. Knorr, J. Leite, S. Woltran:
    "On the limits of forgetting in Answer Set Programming";
    Artificial Intelligence, 286 (2020), S. 1 - 45.

    Zusätzliche Informationen
  480. Autor/innen: Ricardo Goncalves; Matthias Knorr; Joao Leite; Stefan Woltran, E192-02

     R. Goncalves, M. Knorr, J. Leite, S. Woltran:
    "When you must forget: Beyond strong persistence when forgetting in answer set programming";
    Theory and Practice of Logic Programming, 17 (2017), 5-6; S. 837 - 854.

    Zusätzliche Informationen
  481. Autor/innen: Georg Gottlob, E192; Erich Grädel; Helmut Veith, E192-04

     G. Gottlob, E. Grädel, H. Veith:
    "Datalog LITE: a deductive query language with linear time model checking";
    ACM Transactions on Computational Logic, Volume 3 (2002), 1; S. 42 - 79.

    Zusätzliche Informationen
  482. Autor/innen: Georg Gottlob, E192; Christoph Koch, E192-02

     G. Gottlob, C. Koch:
    "Logic-based Web Information Extraction";
    ACM SIGMOD Record, Vol. 33 (2004), 2; S. 87 - 94.
  483. Autor/innen: Georg Gottlob, E192; Christoph Koch, E192-02

     G. Gottlob, C. Koch:
    "Monadic Datalog and the Expressive Power of Languages Web Information Extraction";
    Journal of the ACM, 51 (2004), 1; S. 74 - 113.

    Zusätzliche Informationen
  484. Autor/innen: Georg Gottlob, E192; Christoph Koch, E192-02; Reinhard Pichler

     G. Gottlob, C. Koch, R. Pichler:
    "XPath Processing in a Nutshell";
    ACM SIGMOD Record, Issue 1 (2003), Volume 32; S. 12 - 19.

    Zusätzliche Informationen
  485. Autor/innen: Georg Gottlob, E192; Christoph Koch, E192-02; Klaus U. Schulz

     G. Gottlob, C. Koch, K. Schulz:
    "Conjunctive Queries over Trees";
    Journal of the ACM, Vol. 53 (2006), 2; S. 238 - 272.

    Zusätzliche Informationen
  486. Autor/innen: Georg Gottlob, E192; Phokion G. Kolaitis; Thomas Schwentick

     G. Gottlob, P. Kolaitis, T. Schwentick:
    "Existential second-order logic over graphs: Charting the tractability frontier";
    Journal of the ACM, 51 (2004), 2; S. 312 - 362.
  487. Autor/innen: Georg Gottlob, E192-02; Nikolaos Konstantinou; Emanuel Sallinger

     G. Gottlob, N. Konstantinou, E. Sallinger et al.:
    "VADA: an architecture for end user informed data preparation";
    Journal of Big Data, 6 (2019), 6; S. 1 - 32.

    Zusätzliche Informationen
  488. Autor/innen: Georg Gottlob, E192-02; Matthias Lanzinger, E192-02; Reinhard Pichler, E192-02; Igor Razgon, E192-02

     G. Gottlob, M. Lanzinger, R. Pichler, I. Razgon:
    "Complexity Analysis of General and Fractional Hypertree Decompositions";
    CoRR - Computing Research Repository, 1 (2020), 1; S. 1 - 54.

    Zusätzliche Informationen
  489. Autor/innen: Georg Gottlob, E192; Nicola Leone; Francesco Scarcello

     G. Gottlob, N. Leone, F. Scarcello:
    "A comparison of structural CSP decomposition methods";
    Artificial Intelligence, 124 (2000), S. 243 - 282.
  490. Autor/innen: Georg Gottlob, E192; Nicola Leone; Francesco Scarcello

     G. Gottlob, N. Leone, F. Scarcello:
    "Computing LOGCFL certificates";
    Theoretical Computer Science, 270 (2002), 1-2; S. 761 - 777.

    Zusätzliche Informationen
  491. Autor/innen: Georg Gottlob, E192; Nicola Leone; Francesco Scarcello

     G. Gottlob, N. Leone, F. Scarcello:
    "Hypertree Decompositions and Tractable Queries";
    Journal of Computer and System Sciences, Vol. 64 (2002), 3; S. 579 - 627.
  492. Autor/innen: Georg Gottlob, E192; Christos Papadimitriou

     G. Gottlob, C. Papadimitriou:
    "On the Complexity of Single-Rule Datalog Queries";
    Information and Computation, 177 (2002).

    Zusätzliche Informationen
  493. Autor/innen: Georg Gottlob, E192; Christos Papadimitriou

     G. Gottlob, C. Papadimitriou:
    "On the Complexity of single-rule datalog Queries";
    Information and Computation, 183 (2003), 1; S. 104 - 122.
  494. Autor/innen: Georg Gottlob, E192; Reinhard Pichler

     G. Gottlob, R. Pichler:
    "Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width";
    SIAM JOURNAL ON COMPUTING, Volume 33 (2004), Number 2; S. 351 - 378.
  495. Autor/innen: Georg Gottlob; Reinhard Pichler, E192-02; Vadim Savenkov, E192-02

     G. Gottlob, R. Pichler, V. Savenkov:
    "Normalization and optimization of schema mappings";
    VLDB Journal, 20 (2011), 2; S. 277 - 302.

    Zusätzliche Informationen
  496. Autor/innen: Georg Gottlob; Reinhard Pichler, E192-02; Fang Wei, Uni Freiburg

     G. Gottlob, R. Pichler, F. Wei:
    "Bounded treewidth as a key to tractability of knowledge representation and reasoning";
    Artificial Intelligence, 174 (2010), 1; S. 105 - 132.

    Zusätzliche Informationen
  497. Autor/innen: Georg Gottlob; Reinhard Pichler, E192-02; Fang Wei, Uni Freiburg

     G. Gottlob, R. Pichler, F. Wei:
    "Monadic datalog over finite structures of bounded treewidth";
    ACM Transactions on Computational Logic, 12 (2010), 1.

    Zusätzliche Informationen
  498. Autor/innen: Georg Gottlob; Reinhard Pichler, E192-02; Fang Wei, Uni Freiburg

     G. Gottlob, R. Pichler, F. Wei:
    "Tractable database design and datalog abduction through bounded treewidth";
    Information Systems, 35 (2010), 3; S. 278 - 298.

    Zusätzliche Informationen
  499. Autor/innen: Georg Gottlob, E192-02; Andreas Pieris; Mantas Simkus, E192-02

     G. Gottlob, A. Pieris, M. Simkus:
    "The Impact of Active Domain Predicates on Guarded Existential Rules";
    Fundamenta Informaticae, 159 (2018), 1-2; S. 123 - 146.

    Zusätzliche Informationen
  500. Autor/innen: Georg Gottlob, E192; Francesco Scarcello; Martha Sideri

     G. Gottlob, F. Scarcello, M. Sideri:
    "Fixed-parameter complexity in AI and nonmonotonic reasoning";
    Artificial Intelligence, Volume 138 (2002), 1-2; S. 55 - 86.

    Zusätzliche Informationen
  501. Autor/in: Bernhard Gramlich, E192-05

     B. Gramlich:
    "Modularity in term rewriting revisited";
    Theoretical Computer Science, 464 (2012), S. 3 - 19.
  502. Autor/in: Bernhard Gramlich, E192-05

     B. Gramlich:
    "Strategic Issues, Problems and Challenges in Inductive Theorem Proving";
    Electronic Notes in Theoretical Computer Science (ENTCS) (eingeladen), 125 (2005), 2; S. 5 - 43.

    Zusätzliche Informationen
  503. Autor/innen: Bernhard Gramlich, E192-05; Salvador Lucas

     B. Gramlich, S. Lucas:
    "Reduction Strategies in Rewriting and Programming (Special Issue, Journal of Symbolic Computation): Editorial";
    Journal of Symbolic Computation, 40 (2005), 1; S. 745 - 747.

    Zusätzliche Informationen
  504. Autor/innen: Bernhard Gramlich, E192-05; Felix Schernhammer, E192-05

     B. Gramlich, F. Schernhammer:
    "Extending Context-Sensitivity in Term Rewriting";
    Electronic Proceedings in Theoretical Computer Science, 15 (2010), S. 56 - 68.

    Zusätzliche Informationen
  505. Autor/innen: Bernhard Gramlich, E192-05; Felix Schernhammer, E192-05

     B. Gramlich, F. Schernhammer:
    "Termination of Rewriting with and Automated Synthesis of Forbidden Patterns";
    Electronic Proceedings in Theoretical Computer Science, 44 (2010), S. 35 - 50.

    Zusätzliche Informationen
  506. Autor/innen: Christopher Green; Ingo Feinerer, E192-02; Jeremy Burman

     C. Green, I. Feinerer, J. Burman:
    "Beyond the schools of psychology 1: A digital analysis of Psychological Review, 1894-1903";
    Journal of the History of the Behavioral Sciences, 49 (2013), 2; S. 167 - 189.

    Zusätzliche Informationen
  507. Autor/innen: Sushmita Gupta; Sanjukta Roy, E192-01; Saket Saurabh; Meirav Zehavi

     S. Gupta, S. Roy, S. Saurabh, M. Zehavi:
    "Balanced stable marriage: How close is close enough?";
    Theoretical Computer Science, 883 (2021), S. 19 - 43.

    Zusätzliche Informationen
  508. Autor/innen: Victor Gutierrez-Basulto, Cardiff University; Yazmin Angelica Ibanez Garcia, E192-03; Jean Chistoph Jung, Bremen University

     V. Gutierrez-Basulto, Y.A. Ibanez Garcia, J. Jung:
    "Answering Regular Path Queries Over SQ Ontologies";
    ArXiv, 2011 (2020), 08816; 20 S.
  509. Autor/innen: Gregory Gutin; Eun Jun Kim; Stefan Szeider, E192-03; Anders Yeo

     G. Gutin, E. Kim, St. Szeider, A. Yeo:
    "A Probabilistic Approach to Problems Parameterized Above or Below Tight Bounds";
    Journal of Computer and System Sciences, 77 (2011), 2; S. 422 - 429.

    Zusätzliche Informationen
  510. Autor/innen: Gregory Gutin; Eun Jung Kim; Arezou Soleimanfallah; Stefan Szeider, E192-03; Anders Yeo

     G. Gutin, Ej Kim, A. Soleimanfallah, St. Szeider, A. Yeo:
    "Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming";
    Algorithmica, Vol. 64 (2012), No. 1; S. 112 - 125.

    Zusätzliche Informationen
  511. Autor/innen: Mark Guttenbrunner, E194-01; Mihai Ghete; Annu John, E192; Chrisanth Lederer; Andreas Rauber, E194-01

     M. Guttenbrunner, M. Ghete, A. John, C. Lederer, A. Rauber:
    "Migrating Home Computer Audio Waveforms to Digital Objects: A Case Study on Digital Archaeology";
    International Journal of Digital Curation, 1 (2011), 6; S. 79 - 98.

    Zusätzliche Informationen
  512. Autor/innen: Jonas Hägglund; Arthur Hoffmann-Ostenhof, E192-02

     J. Hägglund, A. Hoffmann-Ostenhof:
    "Construction of permutation snarks";
    Journal of Combinatorial Theory Series B, 122 (2017), S. 55 - 67.
  513. Autor/innen: Adrian Haret, E192-02; Stefan Rümmele, 192-02; Stefan Woltran, E192-02

     A. Haret, St. Rümmele, S. Woltran:
    "Merging in the Horn Fragment";
    ACM Transactions on Computational Logic, 18 (2017), 1; S. 1 - 32.

    Zusätzliche Informationen
  514. Autor/innen: Adrian Haret, E192-02; Stefan Woltran, E192-02; Thomas Linsbichler, E192-02; Stefan Rümmele, 192-02; Martin Diller, E192-03

     A. Haret, S. Woltran, T. Linsbichler, St. Rümmele, M. Diller:
    "An extension-based approach to belief revision in abstract argumentation";
    International Journal of Approximate Reasoning, 93 (2018), S. 395 - 423.

    Zusätzliche Informationen
  515. Autor/innen: Paul Harrenstein; Marie-Louise Lackner, E192-02; Martin Lackner, E192-02

     P. Harrenstein, M. Lackner, M. Lackner:
    "A Mathematical Analysis of an Election System Proposed by Gottlob Frege";
    Erkenntnis, 1 (2020), S. 1 - 36.

    Zusätzliche Informationen
  516. Autor/innen: Miki Hermann; Reinhard Pichler, E192-02

     M. Hermann, R. Pichler:
    "Complexity of Counting the Optimal Solution";
    Theoretical Computer Science, 410 (2009), 38-40; S. 3814 - 3825.
  517. Autor/innen: Miki Hermann; Reinhard Pichler, E192-02

     M. Hermann, R. Pichler:
    "Counting complexity of propositional abduction";
    Journal of Computer and System Sciences, 76 (2010), 7; S. 634 - 649.

    Zusätzliche Informationen
  518. Autor/innen: Jennifer Hetzl; Andrea M. Foerster; Günther Raidl, E192-01; Ortrun Mittelsten Scheid

     J. Hetzl, A.M. Foerster, G. Raidl, O. Mittelsten Scheid:
    "CyMATE: A new tool for methylation analysis of plant genomic DNA after bisulfite sequencing";
    Plant Journal, 51 (2007), 3; S. 526 - 536.
  519. Autor/innen: Stefan Hetzl, E104-02; Alexander Leitsch, E192-05; Giselle Reis, E192-05; Daniel Weller

     S. Hetzl, A. Leitsch, G. Reis, D. Weller:
    "Algorithmic introduction of quantified cuts";
    Theoretical Computer Science, 549 (2014), S. 1 - 16.

    Zusätzliche Informationen
  520. Autor/innen: Stefan Hetzl, E192-05; Alexander Leitsch, E192-05; Daniel Weller

     S. Hetzl, A. Leitsch, D. Weller:
    "Ceres in higher-order logic";
    Annals of Pure and Applied Logic, 162 (2011), 12; S. 1001 - 1034.

    Zusätzliche Informationen
  521. Autor/innen: Stefan Hetzl, E104-02; Giselle Reis, E192-05; Daniel Weller

     S. Hetzl, G. Reis, D. Weller:
    "Algorithmic Introduction of Quantified Cuts";
    CoRR - Computing Research Repository, abs/1401.4330 (2014), 38 S.
  522. Autor/innen: Stefan Hetzl, E192-05; Lutz Strassburger

     S. Hetzl, L. Strassburger:
    "Herbrand-Confluence";
    Logical Methods in Computer Science, 9 (2013), 4; S. 1 - 25.
  523. Autor/innen: Marijn Heule; Matti Järvisalo; Florian Lonsing, E192-03; Martina Seidl, E194-03; Armin Biere

     M. Heule, M. Järvisalo, F. Lonsing, M. Seidl, A. Biere:
    "Clause Elimination for SAT and QSAT";
    Journal of Artificial Intelligence Research, 53 (2015), S. 127 - 168.

    Zusätzliche Informationen
  524. Autor/innen: Marijn Heule; Stefan Szeider, E192-01

     M. Heule, S. Szeider:
    "A SAT Approach to Clique-Width";
    ACM Transactions on Computational Logic, 16/3 (2015), S. 1 - 27.

    Zusätzliche Informationen
  525. Autor/innen: Gerhard Hiermann; Matthias Prandtstetter; Andrea Rendl; Jakob Puchinger; Günther Raidl, E192-01

     G. Hiermann, M. Prandtstetter, A. Rendl, J. Puchinger, G. Raidl:
    "Metaheuristics for solving a multimodal home-healthcare scheduling problem";
    Central European Journal of Operations Research, May 2013 (2013).

    Zusätzliche Informationen
  526. Autor/innen: Petr Hlinený; O-Joung Kwon; Jan Obdrzalek; Sebastian Ordyniak, E192-01

     P. Hlinený, O. Kwon, J. Obdrzalek, S. Ordyniak:
    "Tree-depth and vertex-minors";
    European Journal of Combinatorics, 56 (2016), S. 46 - 56.

    Zusätzliche Informationen
  527. Autor/innen: Pim van´T Hof; Marcin Kaminski; Daniel Paulusma; Stefan Szeider, E192-03; Dimitrios M. Thilikos

     P. Hof, M. Kaminski, D. Paulusma, St. Szeider, D. Thilikos:
    "On Graph Contractions and Induced Minors";
    Discrete Applied Mathematics, Vol. 160 (2012), No. 6; S. 799 - 809.

    Zusätzliche Informationen
  528. Autor/in: Arthur Hoffmann-Ostenhof, E192-02

     A. Hoffmann-Ostenhof:
    "A counterexample to the bipartizing matching conjecture";
    Discrete Mathematics, 307 (2007), 22; S. 2723 - 2733.

    Zusätzliche Informationen
  529. Autor/innen: Arthur Hoffmann-Ostenhof, E192-02; Herbert Fleischner, E192-01; Roland Häggkvist

     A. Hoffmann-Ostenhof, H. Fleischner, R. Häggkvist:
    "Cycle Double Covers via Kotzig Graphs";
    Journal of Combinatorial Theory Series B, 1 (2018), S. 1 - 12.

    Zusätzliche Informationen
  530. Autor/innen: Arthur Hoffmann-Ostenhof, E192-02; Thomas Jatschka, E192-01

     A. Hoffmann-Ostenhof, T. Jatschka:
    "Snarks with Special Spanning Trees";
    Graphs and Combinatorics, 1 (2018), S. 1 - 13.

    Zusätzliche Informationen
  531. Autor/innen: Arthur Hoffmann-Ostenhof, E192-02; Kenta Noguchi; Kenta Ozeki

     A. Hoffmann-Ostenhof, K. Noguchi, K. Ozeki:
    "On homeomorphically irreducible spanning trees in cubic graphs";
    Journal of Graph Theory, 89 (2018), 2; S. 93 - 100.

    Zusätzliche Informationen
  532. Autor/innen: Andreas Holzer, E192-04; Christian Schallhart; Michael Tautschnig, Uni Oxford; Helmut Veith, E192-04

     A. Holzer, C. Schallhart, M. Tautschnig, H. Veith:
    "Closure properties and complexity of rational sets of regular languages";
    Theoretical Computer Science, 605 (2015), S. 62 - 79.
  533. Autor/innen: Matthias Horn, E192-01; Johannes Maschler, E192-01; Günther Raidl, E192-01; Elina Rönnberg

     M. Horn, J. Maschler, G. Raidl, E. Rönnberg:
    "A*-based construction of decision diagrams for a prize-collecting scheduling problem";
    Computers & Operations Research, 126 (2020), S. 1 - 21.

    Zusätzliche Informationen
  534. Autor/innen: Matthias Horn, E192-01; Günther Raidl, E192-01; Christian Blum

     M. Horn, G. Raidl, C. Blum:
    "Job sequencing with one common and multiple secondary resources: An A∗/Beam Search based anytime algorithm";
    Artificial Intelligence, 277 (2019), S. 1 - 26.

    Zusätzliche Informationen
  535. Autor/innen: Matthias Horn, E192-01; Günther Raidl, E192-01; Elina Rönnberg

     M. Horn, G. Raidl, E. Rönnberg:
    "A* Search for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources";
    Annals of Operations Research, 82 (2020), S. 1 - 29.

    Zusätzliche Informationen
  536. Autor/innen: Kurt Hornik, WU Wien; Ingo Feinerer, E192-02; Martin Kober; Christian Buchta

     K. Hornik, I. Feinerer, M. Kober, Ch. Buchta:
    "Spherical k-Means Clustering";
    Journal of Statistical Software, 50 (2012), 10; S. 1 - 22.

    Zusätzliche Informationen
  537. Autor/innen: Kurt Hornik, WU Wien; Patrick Mair; Johannes Rauch; Wilhelm Geiger; Christian Buchta; Ingo Feinerer, E192-02

     K. Hornik, P. Mair, J. Rauch, W. Geiger, Ch. Buchta, I. Feinerer:
    "The textcat package for n-gram based text categorization in R";
    Journal of Statistical Software, 52 (2013), 6; S. 1 - 17.

    Zusätzliche Informationen
  538. Autor/innen: Bin Hu; Markus Leitner; Günther Raidl, E192-01

     B. Hu, M. Leitner, G. Raidl:
    "Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem";
    Journal of Heuristics, 14 (2008), 5; S. 473 - 499.
  539. Autor/innen: Bin Hu; Markus Leitner; Günther Raidl, E192-01

     B. Hu, M. Leitner, G. Raidl:
    "The generalized minimum edge biconnected network problem: Efficient neighborhood structures for variable neighborhood search";
    Networks, 55 (2010), 3; S. 257 - 275.
  540. Autor/innen: Giovambattista Ianni; Francesco Calimeri; Stefano Germano; Andreas Humenberger, E192-04; Christoph Redl, E192-03; Daria Stepanova; Andrea Tucci; Anton Wimmer, E192-03

     G. Ianni, F. Calimeri, S. Germano, A. Humenberger, C. Redl, D. Stepanova, A. Tucci, A. Wimmer:
    "Angry-HEX: an Artificial Player for Angry Birds Based on Declarative Knowledge Bases";
    IEEE Transactions on Computational Intelligence and AI in Games, 8 (2016), S. 128 - 139.

    Zusätzliche Informationen
  541. Autor/innen: Yazmin Angelica Ibanez Garcia, E192-03; Victor Gutierrez-Basulto, Cardiff University; Steven Schockaert

     Y.A. Ibanez Garcia, V. Gutierrez-Basulto, S. Schockaert:
    "Plausible Reasoning about EL-Ontologies using Concept Interpolation";
    ArXiv, 2006 (2020), 14437; 16 S.
  542. Autor/innen: Thorben Iggena; Eushay Bin Ilyas; Marten Fischer; Ralf Tönjes; Tarek Elsaleh; Roonak Rezvani; Narges Pourshahrokhi; Stefan Bischof; Andreas Fernbach, E191-03; Josiane Parreira, DERI; Patrik Schneider, E192-03

     T. Iggena, E. Ilyas, M. Fischer, R. Tönjes, T. Elsaleh, R. Rezvani, N. Pourshahrokhi, S. Bischof, A. Fernbach, J. Parreira, P. Schneider et al.:
    "IoTCrawler: Challenges and Solutions for Searching the Internet of Things";
    Sensors, 21(5) (2021), 1559; S. 1 - 32.

    Zusätzliche Informationen
  543. Autor/innen: Johannes Inführ, E192-01; Günther Raidl, E192-01

     J. Inführ, G. Raidl:
    "A Memetic Algorithm for the Virtual Network Mapping Problem.";
    Journal of Heuristics (eingeladen), Dezember 2014 (2014), S. 1 - 31.

    Zusätzliche Informationen
  544. Autor/innen: Luca Iocchi; Thomas Lukasiewicz, E192-03; Daniele Nardi; Riccardo Rosati

     L. Iocchi, T. Lukasiewicz, D. Nardi, R. Rosati:
    "Reasoning about Actions with Sensing under Qualitative and Probabilistic Uncertainty";
    ACM Transactions on Computational Logic, 10 (2009), 1.
  545. Autor/innen: Ben Jacobsen; Markus Wallinger, E192-01; Stephen G. Kobourov; Martin Nöllenburg, E192-01

     B. Jacobsen, M. Wallinger, S.G. Kobourov, M. Nöllenburg:
    "MetroSets: Visualizing Sets as Metro Maps";
    IEEE Transactions on Visualization and Computer Graphics, 27 (2021), 2; S. 1257 - 1267.

    Zusätzliche Informationen
  546. Autor/innen: Tomi Janhunen; Emilia Oikarinen; Hans Tompits, E192-03; Stefan Woltran, E192-02

     T. Janhunen, E. Oikarinen, H. Tompits, S. Woltran:
    "Modularity Aspects of Disjunctive Stable Models";
    Journal of Artificial Intelligence Research, 35 (2009), S. 813 - 857.

    Zusätzliche Informationen
  547. Autor/innen: Mikolás Janota; Charles Jordan; Will Klieber; Florian Lonsing, E192-03; Martina Seidl; Allen Van Gelder

     M. Janota, C. Jordan, W. Klieber, F. Lonsing, M. Seidl, A. Van Gelder:
    "The QBF Gallery 2014: The QBF Competition at the FLoC Olympic Games";
    Journal on Satisfiability, Boolean Modeling and Computation, 9 (2016), S. 187 - 206.

    Zusätzliche Informationen
  548. Autor/innen: Maximilian Jaroschek, E192-04; Moulay Barkatou; Suzy Maddah

     M. Jaroschek, M. Barkatou, S. Maddah:
    "Formal solutions of completely integrable Pfaffian systems with normal crossings";
    Journal of Symbolic Computation, 81 (2017), S. 41 - 68.

    Zusätzliche Informationen
  549. Autor/innen: Thomas Jatschka, E192-01; Günther Raidl, E192-01; Tobias Rodemann

     T. Jatschka, G. Raidl, T. Rodemann:
    "A General Cooperative Optimization Approach for Distributing Service Points in Mobility Applications";
    Algorithms, 14 (2021), 8; S. 1 - 24.

    Zusätzliche Informationen
  550. Autor/innen: Ray Jennings; Yue Chen, E192-03; Julian Sahasrabudhe

     R. Jennings, Y. Chen, J. Sahasrabudhe:
    "On a new Idiom in the study of Entailment";
    Logica Universalis, 5 (2011), 1; S. 101 - 113.

    Zusätzliche Informationen
  551. Autor/innen: Somesh Jha; Stefan Katzenbeisser; Christian Schallhart; Helmut Veith, E192-04; Stephen Chenney

     S. Jha, S. Katzenbeisser, C. Schallhart, H. Veith, St. Chenney:
    "Semantic Integrity in Large-Scale Online Simulations";
    ACM Transactions on Internet Technology, 10 (2010), 1.

    Zusätzliche Informationen
  552. Autor/in: Eugen Jiresch, E192-05

     E. Jiresch:
    "Realizing Impure Functions in Interaction Nets";
    Electronic Communications of the EASST, 38 (2010), S. 1 - 17.

    Zusätzliche Informationen
  553. Autor/innen: Peter Jonsson; Sebastian Ordyniak, E192-01; Stefan Szeider, E192-01

     P. Jonsson, S. Ordyniak, S. Szeider:
    "A Complete Parameterized Complexity Analysis of Bounded Planning";
    Journal of Computer and System Sciences, 81/7 (2015), S. 1311 - 1332.

    Zusätzliche Informationen
  554. Autor/innen: Tobias Kaminski, E192-03; Thomas Eiter, E192-03; Katsumi Inoue

     T. Kaminski, T. Eiter, K. Inoue:
    "Exploiting Answer Set Programming with External Sources for Meta-Interpretive Learning";
    Theory and Practice of Logic Programming, 18 (2018), 3-4; S. 571 - 588.

    Zusätzliche Informationen
  555. Autor/innen: Iyad Kanj; Stefan Szeider, E192-01

     I. Kanj, S. Szeider:
    "Parameterized and subexponential-time complexity ofsatisfiability problems and applications";
    Theoretical Computer Science, 607 (2015), S. 282 - 295.

    Zusätzliche Informationen
  556. Autor/innen: Alexandros Karatzoglou, INSA de Rouen; Ingo Feinerer, E192-02

     A. Karatzoglou, I. Feinerer:
    "Kernel-based machine learning for fast text mining in R";
    Computational Statistics and Data Analysis, 54 (2010), 2; S. 290 - 297.

    Zusätzliche Informationen
  557. Autor/innen: Petra Kaufmann, E194-03; Martin Kronegger, E192-02; Andreas Pfandler, E192-02; Martina Seidl, E194-03; Magdalena Widl, E192-03

     P. Kaufmann, M. Kronegger, A. Pfandler, M. Seidl, M. Widl:
    "Intra- and interdiagram consistency checking of behavioral multiview models";
    Computer Languages, Systems and Structures, 44 (2015), Part A; S. 72 - 88.

    Zusätzliche Informationen
  558. Autor/in: Andreas Kerren, E192-01

     A. Kerren:
    "Learning by Generation in Computer Science Education. ";
    Journal of Computer Science & Technology, 4 (2004), 2; S. 84 - 90.
  559. Autor/innen: Benjamin Kiesl, E192-03; Martina Seidl; Hans Tompits, E192-03; Armin Biere, JKU Linz

     B. Kiesl, M. Seidl, H. Tompits, A. Biere:
    "Local Redundancy in SAT: Generalizations of Blocked Clauses";
    Logical Methods in Computer Science, 14 (2018), 4.

    Zusätzliche Informationen
  560. Autor/innen: Eun Jun Kim; Sebastian Ordyniak, E192-03; Stefan Szeider, E192-03

     E. Kim, S. Ordyniak, St. Szeider:
    "Algorithms and Complexity Results for Persuasive Argumentation";
    Artificial Intelligence, 175 (2011), 9-10; S. 1722 - 1736.

    Zusätzliche Informationen
  561. Autor/innen: Johannes Kinder; Stefan Katzenbeisser; Christian Schallhart; Helmut Veith, E192-04

     J. Kinder, S. Katzenbeisser, C. Schallhart, H. Veith:
    "Proactive Detection of Computer Worms Using Model Checking";
    IEEE Transactions on Dependable and Secure Computing, 7 (2010), 4; S. 424 - 438.

    Zusätzliche Informationen
  562. Autor/innen: Philipp Kindermann; Stephen G. Kobourov; Maarten Löffler; Martin Nöllenburg, E192-01; André Schulz; Birgit Vogtenhuber, TU Graz

     P. Kindermann, S.G. Kobourov, M. Löffler, M. Nöllenburg, A. Schulz, B. Vogtenhuber:
    "Lombardi Drawings Of Knots And Links";
    Journal of Computational Geometry, 10 (2019), 1; S. 444 - 476.

    Zusätzliche Informationen
  563. Autor/innen: Gunnar Werner Klau, E192-01; Petra Mutzel, E192-01

     G.W. Klau, P. Mutzel:
    "Optimal labelling of point features in rectangular labelling models";
    Mathematical Programming, 94 (2003), 2-3; S. 435 - 458.
  564. Autor/innen: Lucas Kletzander, E192-02; Nysret Musliu, E192-02

     L. Kletzander, N. Musliu:
    "Solving the general employee scheduling problem";
    Computers & Operations Research, 113 (2020), S. 1 - 13.

    Zusätzliche Informationen
  565. Autor/innen: Lucas Kletzander, E192-02; Nysret Musliu, E192-02; Martin Josef Geiger

     L. Kletzander, N. Musliu, M. Geiger:
    "Solving the Torpedo Scheduling Problem";
    Journal of Artificial Intelligence Research, 66 (2019), S. 1 - 32.

    Zusätzliche Informationen
  566. Autor/innen: Lucas Kletzander, E192-02; Nysret Musliu, E192-02; Kate Smith-Miles

     L. Kletzander, N. Musliu, K. Smith-Miles:
    "Instance space analysis for a personnel scheduling problem";
    Annals of Mathematics and Artificial Intelligence, 1 (2020), S. 1 - 21.

    Zusätzliche Informationen
  567. Autor/innen: Lucas Kletzander, E192-02; Nysret Musliu, E192-02; Kate Smith-Miles

     L. Kletzander, N. Musliu, K. Smith-Miles:
    "Instance space analysis for a personnel scheduling problem";
    Annals of Mathematics and Artificial Intelligence, 89 (2021), 7; S. 617 - 637.

    Zusätzliche Informationen
  568. Autor/innen: Benedikt Klocker, E192-01; Herbert Fleischner, E192-01; Günther Raidl, E192-01

     B. Klocker, H. Fleischner, G. Raidl:
    "A lower bound for the smallest uniquely hamiltonian planar graph with minimum degree three";
    Applied Mathematics and Computation, 380 (2020), S. 1 - 19.

    Zusätzliche Informationen
  569. Autor/innen: Benedikt Klocker, E192-01; Herbert Fleischner, E192-01; Günther Raidl, E192-01

     B. Klocker, H. Fleischner, G. Raidl:
    "A model for finding transition-minors";
    Discrete Applied Mathematics, 283 (2020), S. 242 - 264.

    Zusätzliche Informationen
  570. Autor/innen: Christian Kloimüllner; Günther Raidl, E192-01

     C. Kloimüllner, G. Raidl:
    "Full-Load Route Planning for Balancing Bike Sharing Systems by Logic-Based Benders Decomposition";
    Networks, 69 (2017), 3; S. 270 - 289.

    Zusätzliche Informationen
  571. Autor/innen: Fabian Klute; Maarten Löffler; Martin Nöllenburg, E192-01

     F. Klute, M. Löffler, M. Nöllenburg:
    "Labeling nonograms: Boundary labeling for curve arrangements";
    Computational Geometry - Theory and Applications, 98 (2021), S. 1 - 17.

    Zusätzliche Informationen
  572. Autor/innen: Fabian Klute, E192-01; Martin Nöllenburg, E192-01

     F. Klute, M. Nöllenburg:
    "Minimizing Crossings In Constrained Two-Sided Circular Graph Layouts";
    Journal of Computational Geometry, 10 (2019), 2; S. 45 - 69.

    Zusätzliche Informationen
  573. Autor/innen: Jens Knoop, E194-05; Laura Kovacs, E192-04; Jakob Zwirchmayr

     J. Knoop, L. Kovacs, J. Zwirchmayr:
    "Replacing conjectures by positive knowledge: Inferring proven precise worst-case execution time bounds using symbolic execution";
    Journal of Symbolic Computation, 80 (2017), S. 101 - 124.
  574. Autor/in: Christoph Koch, E192-02

     C. Koch:
    "Query Rewriting with Symmetric Constraints";
    AI Communications, 17 (2004), 2; S. 41 - 100.
  575. Autor/innen: Christoph Koch, E192-02; Nicola Leone; Gerald Pfeifer, E192-02

     C. Koch, N. Leone, G. Pfeifer:
    "Enhancing disjunctive logic programming systems by SAT checkers";
    Artificial Intelligence, Volume 151 (2003), Issues 1-2; S. 177 - 212.
  576. Autor/innen: Phokion G. Kolaitis; Reinhard Pichler, E192-02; Emanuel Sallinger, E192-02; Vadim Savenkov, E192-02

     P. Kolaitis, R. Pichler, E. Sallinger, V. Savenkov:
    "Limits of Schema Mappings";
    Theory of Computing Systems, 62 (2018), 4; S. 899 - 940.

    Zusätzliche Informationen
  577. Autor/innen: Phokion G. Kolaitis; Reinhard Pichler, E192-02; Emanuel Sallinger, E192-02; Vadim Savenkov

     P. Kolaitis, R. Pichler, E. Sallinger, V. Savenkov:
    "On the Language of Nested Tuple Generating Dependencies";
    ACM Transactions on Database Systems, 45 (2020), 2; S. 1 - 59.

    Zusätzliche Informationen
  578. Autor/innen: Michael Kompatscher, E192-05; Michael Pinsker, E192-05

     M. Kompatscher, M. Pinsker et al.:
    "A counterexample to the reconstruction of omega-categorical structures from their endomorphism monoids";
    Israel Journal of Mathematics, 224 (2018), S. 57 - 82.
  579. Autor/innen: Igor Konnov, E192; Marijana Lazić, E192-04; Helmut Veith, E192-04; Josef Widder, E191-02

     I. Konnov, M. Lazić, H. Veith, J. Widder:
    "Para^2: Parameterized Path Reduction, Acceleration, and SMT for Reachability in Threshold-Guarded Distributed Algorithms";
    Formal Methods in System Design (eingeladen), 51 (2017), 2; S. 270 - 307.

    Zusätzliche Informationen
  580. Autor/innen: Igor Konnov, E192; Vladislav V. Podymov; Dmitry Yu. Volkanov; Vladimir A. Zakharov; Daniil A. Zorin

     I. Konnov, V. Podymov, D. Volkanov, V.A. Zakharov, D. Zorin:
    "A Combined Toolset for the Verification of Real-Time Distributed Systems";
    Programming and Computer Software, 41 (2015), 6; S. 325 - 335.
  581. Autor/innen: Igor Konnov, E192; Helmut Veith, E192-04; Josef Widder, E191-02

     I. Konnov, H. Veith, J. Widder:
    "On the completeness of bounded model checking for threshold-based distributed algorithms: Reachability";
    Information and Computation, 252 (2017), S. 95 - 109.

    Zusätzliche Informationen
  582. Autor/innen: Tomer Kotek, E192-04; Johann A. Makowsky

     T. Kotek, J. A. Makowsky:
    "A representation theorem for (q-)holonomic sequences";
    Journal of Computer and System Sciences, 80 (2014), 2; S. 363 - 374.
  583. Autor/innen: Tomer Kotek, E192-04; Johann A. Makowsky

     T. Kotek, J. A. Makowsky:
    "Connection Matrices and the Definability of Graph Parameters";
    Logical Methods in Computer Science, 10 (2014), 4; S. 1 - 33.
  584. Autor/innen: Tomer Kotek, E192-04; Johann A. Makowsky

     T. Kotek, J. A. Makowsky:
    "Efficient computation of generalized Ising polynomials on graphs with fixed clique-width";
    Topics in Theoretical Computer Science (TTCS), 9541 (2015), S. 135 - 146.
  585. Autor/innen: Tomer Kotek, E192-04; Johann A. Makowsky

     T. Kotek, J. A. Makowsky:
    "Recurrence relations for graph polynomials on bi-iterative families of graphs";
    European Journal of Combinatorics, 41 (2014), S. 47 - 67.
  586. Autor/innen: Worarat Krathu, E194-04; Christian Pichler, E194-04; Guohui Xiao, E192-03; Hannes Werthner, E194-04; Julia Neidhardt, E194-04; Marco Zapletal, E194-04; Christian Huemer, E194-03

     W. Krathu, C. Pichler, G. Xiao, H. Werthner, J. Neidhardt, M. Zapletal, C. Huemer:
    "Inter-organizational success factors: a cause and effect model";
    Information Systems and E-Business Management, 15 (2015), 3; S. 553 - 593.

    Zusätzliche Informationen
  587. Autor/innen: Thorsten Krenek, E315; Christopher Bacher, E192-01; Günther Raidl, E192-01; Thomas Lauer, E315

     T. Krenek, C. Bacher, G. Raidl, T. Lauer:
    "Numerical Optimization of Electro Hybrid Powertrains";
    MTZ worldwide, 76 (2015), 3; S. 46 - 52.

    Zusätzliche Informationen
  588. Autor/innen: Thorsten Krenek, E315; Christopher Bacher, E192-01; Günther Raidl, E192-01; Thomas Lauer, E315

     T. Krenek, C. Bacher, G. Raidl, T. Lauer:
    "Numerische Optimierung elektrifizierter Antriebsstränge";
    MTZ - Motortechnische Zeitschrift, 76 (2015), 3; S. 66 - 74.

    Zusätzliche Informationen
  589. Autor/innen: Stephan Kreutzer; Sebastian Ordyniak, E192-01

     S. Kreutzer, S. Ordyniak:
    "Complexity and monotonicity results for domination games";
    Theoretical Computer Science, 628 (2016), S. 1 - 29.

    Zusätzliche Informationen
  590. Autor/innen: Stephan Kreutzer; Sebastian Ordyniak, E192-03

     S. Kreutzer, S. Ordyniak:
    "Digraph decompositions and monotonicity in digraph searching";
    Theoretical Computer Science, 412 (2011), 35; S. 4688 - 4703.

    Zusätzliche Informationen
  591. Autor/innen: Markus Kröll, E192-02; Pablo Barcelo, 192-02; Reinhard Pichler, E192-02; Sebastian Skritek, E192-02

     M. Kröll, P. Barcelo, R. Pichler, S. Skritek:
    "Efficient Evaluation and Static Analysis for Well-Designed Pattern Trees with Projection";
    ACM Transactions on Database Systems, 43 (2018), 2; S. 1 - 44.

    Zusätzliche Informationen
  592. Autor/innen: Martin Kronegger, E191-03; Sebastian Ordyniak; Andreas Pfandler, E192-02

     M. Kronegger, S. Ordyniak, A. Pfandler:
    "Backdoors to planning";
    Artificial Intelligence, 269 (2019), S. 49 - 75.

    Zusätzliche Informationen
  593. Autor/innen: Burcu Kulahcioglu Ozkan, MPI-SWS, Germany; Rupak Majumdar, MPI-SWS, Germany; Filip Niksic, MPI-SWS, Germany; Mitra Tabaei Befrouei, E192-04; Georg Weissenbacher, E192-04

     B. Kulahcioglu Ozkan, R. Majumdar, F. Niksic, M. Tabaei Befrouei, G. Weissenbacher:
    "Randomized testing of distributed systems with probabilistic guarantees";
    Proceedings of the ACM on Programming Languages, 2 (2018), OOPSLA.

    Zusätzliche Informationen
  594. Autor/in: Roman Kuznets, E192-05

     R. Kuznets:
    "Multicomponent Proof-theoretic Method for Proving Interpolation Property";
    Annals of Pure and Applied Logic, 169 (2018), 12; S. 1369 - 1418.

    Zusätzliche Informationen
  595. Autor/innen: Roman Kuznets, E192-05; Melvin Fitting

     R. Kuznets, M. Fitting:
    "Modal Interpolation via Nested Sequents";
    Annals of Pure and Applied Logic, 166 (2015), 3; S. 274 - 305.

    Zusätzliche Informationen
  596. Autor/innen: Roman Kuznets, E192-05; Björn Lellmann

     R. Kuznets, B. Lellmann:
    "Grafting Hypersequents onto Nested Sequents";
    Logic Journal of the IGPL, 24 (2016), 3; S. 375 - 423.

    Zusätzliche Informationen
  597. Autor/innen: Roman Kuznets, E192-05; Thomas Studer

     R. Kuznets, T. Studer:
    "Weak Arithmetical Interpretations for the Logic of Proofs";
    Logic Journal of the IGPL, 24 (2016), 3; S. 424 - 440.

    Zusätzliche Informationen
  598. Autor/innen: Martin Lackner, E192-02; Zack Fitzsimmons

     M. Lackner, Z. Fitzsimmons:
    "Incomplete Preferences in Single-Peaked Electorates";
    Artificial Intelligence, 67 (2020), S. 797 - 833.

    Zusätzliche Informationen
  599. Autor/innen: Marie-Louise Lackner, E192-02; Alois Panholzer, E104-05

     M. Lackner, A. Panholzer:
    "Runs in labelled trees and mappings";
    Discrete Mathematics, 343 (2020), 9; S. 1 - 22.

    Zusätzliche Informationen
  600. Autor/innen: Martin Lackner, E192-02; Dominik Peters, 192-02

     M. Lackner, D. Peters:
    "Preferences Single-Peaked on a Circle";
    Artificial Intelligence, 68 (2020), S. 463 - 502.

    Zusätzliche Informationen
  601. Autor/innen: Martin Lackner, E192-02; Piotr Skowron, 192-02

     M. Lackner, P. Skowron:
    "Consistent approval-based multi-winner rules";
    Journal of Economic Theory, 192 (2021), 105173; S. 1 - 38.

    Zusätzliche Informationen
  602. Autor/innen: Martin Lackner, E192-02; Piotr Skowron, 192-02

     M. Lackner, P. Skowron:
    "Utilitarian welfare and representation guarantees of approval-based multiwinner rules";
    Artificial Intelligence, 288 (2020), S. 1 - 47.

    Zusätzliche Informationen
  603. Autor/innen: Hoong Chuin Lau; Günther Raidl, E192-01; Pascal Van Hentenryck

     H. C. Lau, G. Raidl, P. Van Hentenryck:
    "New developments in metaheuristics and their applications";
    Journal of Heuristics, 22 (2016), 4; S. 359 - 363.
  604. Autor/innen: Joao Leite; Cao Son Tran, New Mexico State U; Paolo Torroni; Stefan Woltran, E192-02

     J. Leite, C. Tran, P. Torroni, S. Woltran:
    "Applications of logical approaches to argumentation";
    Argument & Computation, 6 (2015), 1; S. 1 - 2.

    Zusätzliche Informationen
  605. Autor/innen: Markus Leitner; Ivana Ljubic; Martin Riedler, E192-01; Mario Ruthmair

     M. Leitner, I. Ljubic, M. Riedler, M. Ruthmair:
    "Exact Approaches for Network Design Problems with Relays";
    Informs Journal on Computing, 31 (2019), 1; 23 S.

    Zusätzliche Informationen
  606. Autor/innen: Markus Leitner; Ivana Ljubic; Martin Riedler, E192-01; Mario Ruthmair

     M. Leitner, I. Ljubic, M. Riedler, M. Ruthmair:
    "Solving a selective dial-a-ride problem with logic-based Benders decomposition";
    Computers & Operations Research, volume 96 (2018), S. 30 - 54.

    Zusätzliche Informationen
  607. Autor/innen: Markus Leitner; Günther Raidl, E192-01

     M. Leitner, G. Raidl:
    "Branch-and-cut-and-price for capacitated connected facility location";
    Journal of Mathematical Modelling and Algorithms, Volume 10 (2011), Number 3; S. 245 - 267.

    Zusätzliche Informationen
  608. Autor/innen: Markus Leitner; Mario Ruthmair; Günther Raidl, E192-01

     M. Leitner, M. Ruthmair, G. Raidl:
    "Stabilizing branch-and-price for constrained tree problems";
    Networks, Volume 61 (2013), 2; S. 150 - 170.

    Zusätzliche Informationen
  609. Autor/innen: Alexander Leitsch, E192-05; David Cerna, E192-05

     A. Leitsch, D. Cerna:
    "Analysis of Clause set Schema Aided by Automated Theorem Proving: {A} Case Study [Extended Paper]";
    Computing Research Repository (CoRR), abs/1503.08551 (2015), 15 S.
  610. Autor/innen: Alexander Leitsch, E192-05; David Cerna

     A. Leitsch, D. Cerna:
    "Schematic Cut elimination and the Ordered Pigeonhole Principle";
    CoRR - Computing Research Repository, abs/1601.06548 (2016), abs/1601.06548.
  611. Autor/innen: Alexander Leitsch, E192-05; David Cerna; Anela Lolic, E192-02

     A. Leitsch, D. Cerna, A. Lolic:
    "Schematic Refutations of Formula Schemata";
    Journal of Automated Reasoning, 65 (2021), 5; S. 599 - 645.
  612. Autor/innen: Alexander Leitsch, E192-05; David Cerna; Giselle Reis, E192-05

     A. Leitsch, D. Cerna, G. Reis et al.:
    "Ceres in intuitionistic logic";
    Annals of Pure and Applied Logic, 168 (2017), 10; S. 1783 - 1836.
  613. Autor/innen: Alexander Leitsch, E192-05; Tsvetan Dunchev, E192-05; Daniel Weller; Mikheil Rukhaia, E192-05

     A. Leitsch, T. Dunchev, D. Weller, M. Rukhaia:
    "Ceres for First-Order Schemata";
    CoRR - Computing Research Repository, arXiv:1303.4257 (2013), S. 1 - 40.
  614. Autor/innen: Alexander Leitsch, E192-05; Stefan Hetzl, E104-02; Giselle Reis, E192-05; Daniel Weller

     A. Leitsch, S. Hetzl, G. Reis, D. Weller et al.:
    "Introducing Quantified Cuts in Logic with Equality";
    CoRR - Computing Research Repository, abs/1402.2474 (2014), abs/1402.2474; 16 S.
  615. Autor/innen: Alexander Leitsch, E192-05; Michael Lettmann, E192-05

     A. Leitsch, M. Lettmann:
    "The problem of Pi_2-cut-introduction";
    Theoretical Computer Science, 706 (2017), S. 83 - 116.
  616. Autor/innen: Alexander Leitsch, E192-05; Günter Schachner; Karl Svozil, E136

     A. Leitsch, G. Schachner, K. Svozil:
    "How to Acknowledge Hypercomputation";
    Complex Systems, 18 (2008), S. 131 - 143.
  617. Autor/innen: Alexander Leitsch, E192-05; Daniel Weller

     A. Leitsch, D. Weller et al.:
    "{CERES} for first-order schemata";
    Journal of Logic and Computation, 27 (2017), 7; S. 1897 - 1954.
  618. Autor/innen: Björn Lellmann; Agata Ciabattoni, E192-05

     B. Lellmann, A. Ciabattoni et al.:
    "From Cut-free Calculi to Automated Deduction: The Case of Bounded Contraction";
    Electronic Notes in Theoretical Computer Science (ENTCS), 332 (2017), 18 S.
  619. Autor/innen: Björn Lellmann; Francesca Gulisano; Agata Ciabattoni, E192-05

     B. Lellmann, F. Gulisano, A. Ciabattoni:
    "Mīmāṃsā deontic reasoning using specificity: a proof theoretic approach";
    Artificial Intelligence and Law, 29 (2021), 3; S. 351 - 394.
  620. Autor/innen: Björn Lellmann; Elaine Pimentel; Tiziano Dalmonte, E192-05

     B. Lellmann, E. Pimentel, T. Dalmonte et al.:
    "Hypersequent calculi for non-normal modal and deontic logics: countermodels and optimal complexity.";
    Journal of Logic and Computation, 31 (2021), 1; S. 67 - 111.
  621. Autor/innen: Nicola Leone; Gerald Pfeifer, E192-02; Wolfgang Faber, E192-03; Thomas Eiter, E192-03; Georg Gottlob, E192; Simona Perri; Francesco Scarcello

     N. Leone, G. Pfeifer, W. Faber, T. Eiter, G. Gottlob, S. Perri, F. Scarcello:
    "The DLV System for knowledge representation and reasoning";
    ACM Transactions on Computational Logic, Vol. 7 (2006), 3; S. 499 - 562.

    Zusätzliche Informationen
  622. Autor/innen: Andres Letelier; Jorge Perez; Reinhard Pichler, E192-02; Sebastian Skritek, E192-02

     A. Letelier, J. Perez, R. Pichler, S. Skritek:
    "Static Analysis and Optimization of Semantic Web Queries";
    ACM Transactions on Database Systems (eingeladen), 38 (2013), 4; S. 25:1 - 25:45.

    Zusätzliche Informationen
  623. Autor/innen: Matt Lewis; Daniel Kroening, Uni Oxford; Georg Weissenbacher, E192-04

     M. Lewis, D. Kroening, G. Weissenbacher:
    "Under-approximating loops in C programs for fast counterexample detection";
    Formal Methods in System Design, 47 (2015), 1; S. 75 - 92.

    Zusätzliche Informationen
  624. Autor/innen: Ping Li; Hao Li; Ye Chen; Herbert Fleischner, E192-01; Hong-Jian Lai

     P. Li, H. Li, Y. Chen, H. Fleischner, H. Lai:
    "Supereulerian graphs with width s and s-collapsible graphs";
    Discrete Applied Mathematics, 200 (2016), S. 79 - 94.

    Zusätzliche Informationen
  625. Autor/innen: Evelia Lizarraga; Maria José Blesa; Christian Blum; Günther Raidl, E192-01

     E. Lizarraga, M. Blesa, C. Blum, G. Raidl:
    "Large Neighborhood Search for the Most Strings with Few Bad Columns Problem";
    Journal of Heuristics, 21 (2016), S. 1 - 15.

    Zusätzliche Informationen
  626. Autor/innen: Ivana Ljubic; Günther Raidl, E192-01

     I. Ljubic, G. Raidl:
    "A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs";
    Journal of Heuristics, 9 (2003), S. 401 - 427.
  627. Autor/innen: Ivana Ljubic; René Weiskircher, E192-01; Ulrich Pferschy, E192-01; Gunnar Werner Klau, E192-01; Petra Mutzel; Matteo Fischetti

     I. Ljubic, R. Weiskircher, U. Pferschy, G.W. Klau, P. Mutzel, M. Fischetti:
    "An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem.";
    Mathematical Programming, Volume 105 (2005), 2-3; S. 427 - 449.
  628. Autor/innen: Neha Lodha, E192-01; Sebastian Ordyniak, E192-01; Stefan Szeider, E192-01

     N. Lodha, S. Ordyniak, S. Szeider:
    "A SAT Approach to Branchwidth";
    ACM Transactions on Computational Logic, 20 (2019), 3; S. 1 - 24.

    Zusätzliche Informationen
  629. Autor/innen: Maarten Löffler; Martin Nöllenburg, E192-01; Frank Staals

     M. Löffler, M. Nöllenburg, F. Staals:
    "Mixed map labeling";
    Journal of Spatial Information Science, 13 (2016), S. 1 - 30.

    Zusätzliche Informationen
  630. Autor/innen: Anela Lolic, E104-02; Alexander Leitsch, E192-05

     A. Lolic, A. Leitsch:
    "Extraction of Expansion Trees";
    Journal of Automated Reasoning, 61 (2018), 1; S. 1 - 38.

    Zusätzliche Informationen
  631. Autor/innen: Anela Lolic, E104-02; Alexander Leitsch, E192-05

     A. Lolic, A. Leitsch:
    "Extraction of Expansion Trees";
    Journal of Automated Reasoning, 62 (2019), 3; S. 393 - 430.
  632. Autor/innen: Florian Lonsing, E192-03; Martina Seidl; Allen Van Gelder

     F. Lonsing, M. Seidl, A. Van Gelder:
    "The QBF Gallery: Behind the Scenes";
    Artificial Intelligence, 237 (2016), S. 92 - 114.

    Zusätzliche Informationen
  633. Autor/in: Thomas Lukasiewicz, E192-03

     T. Lukasiewicz:
    "A novel combination of answer set programming with description logics for the Semantic Web";
    IEEE Transactions on Knowledge and Data Engineering, 22 (2010), 11; S. 1577 - 1592.

    Zusätzliche Informationen
  634. Autor/in: Thomas Lukasiewicz, E192-03

     T. Lukasiewicz:
    "Expressive Probabilistic Description Logics";
    Artificial Intelligence, 172 (2008), 6-7; S. 852 - 883.
  635. Autor/in: Thomas Lukasiewicz, E192-03

     T. Lukasiewicz:
    "Fuzzy Description Logic Programs under the Answer Set Semantics for the Semantic Web";
    Fundamenta Informaticae, 82 (2008), 3; S. 289 - 310.
  636. Autor/in: Thomas Lukasiewicz, E192-03

     T. Lukasiewicz:
    "Nonmonotonic Probabilistic Logics under Variable-Strength Inheritance with Overriding: Complexity, Algorithms, and Implementation.";
    International Journal of Approximate Reasoning, 44 (2007), 3; S. 301 - 321.
  637. Autor/in: Thomas Lukasiewicz, E192-03

     T. Lukasiewicz:
    "Nonmonotonic Probabilistic Reasoning under Variable-Strength Inheritance with Overriding";
    Synthese, 146 (2005), 1-2; S. 153 - 169.
  638. Autor/in: Thomas Lukasiewicz, E192-03

     T. Lukasiewicz:
    "Probabilistic Description Logic Programs";
    International Journal of Approximate Reasoning, 45 (2007), 2; S. 288 - 307.
  639. Autor/in: Thomas Lukasiewicz, E192-03

     T. Lukasiewicz:
    "Probabilistic Description Logic Programs under Inheritance with Overriding for the Semantic Web";
    International Journal of Approximate Reasoning, 49(1), 18-34 (2008), 1; S. 18 - 34.
  640. Autor/in: Thomas Lukasiewicz, E192-03

     T. Lukasiewicz:
    "Weak Nonmonotonic Probabilistic Logics";
    Artificial Intelligence, 168 (2005), 1-2; S. 119 - 161.
  641. Autor/innen: Thomas Lukasiewicz, E192-03; Joerg Schellhase

     T. Lukasiewicz, J. Schellhase:
    "Variable-Strength Conditional Preferences for Ranking Objects in Ontologies";
    Journal of Web Semantics, 5 (2007), 3; S. 180 - 194.
  642. Autor/innen: Thomas Lukasiewicz, E192-03; Umberto Straccia

     T. Lukasiewicz, U. Straccia:
    "Description Logic Programs under Probabilistic Uncertainty and Fuzzy Vagueness";
    International Journal of Approximate Reasoning, 50 (2009), 6; S. 837 - 853.
  643. Autor/innen: Thomas Lukasiewicz, E192-03; Umberto Straccia

     T. Lukasiewicz, U. Straccia:
    "Managing Uncertainty and Vagueness in Description Logics for the Semantic Web";
    Journal of Web Semantics, 6 (2008), 4; S. 291 - 308.
  644. Autor/innen: Thomas Lukasiewicz, E192-03; Umberto Straccia

     T. Lukasiewicz, U. Straccia:
    "Tightly Coupled Fuzzy Description Logic Programs under the Answer Set Semantics for the Semantic Web";
    International Journal on Semantic Web and Information Systems, 4 (2008), 3; S. 68 - 89.
  645. Autor/innen: Yue Ma; Guilin Qi; Guohui Xiao, E192-03; Pascal Hitzler; Zuoquan Lin

     Y. Ma, G. Qi, G. Xiao, P. Hitzler, Z. Lin:
    "Computational Complexity and Anytime Algorithm for Inconsistency Measurement";
    Int. J. Software and Informatics, 1 (2010), S. 3 - 21.

    Zusätzliche Informationen
  646. Autor/innen: Matteo Maffei, E192-06; Giulio Malavolta, FAU; Manuel Reinert; Dominique Schröder, FAU

     M. Maffei, G. Malavolta, M. Reinert, D. Schröder:
    "Group ORAM for Privacy and AccessControl in Outsourced Personal Records";
    Journal of Computer Security, vol. 27 (2019), no. 1; S. 1 - 47.

    Zusätzliche Informationen
  647. Autor/innen: Paolo Maffezioli, E192-05; Alberto Naibo; Sara Negri

     P. Maffezioli, A. Naibo, S. Negri:
    "The Church-Fitch knowability paradox in the light of structural proof theory";
    Synthese, xx (2012), S. 1 - 40.
  648. Autor/innen: Jan Maly, E192-02; Miroslaw Truszczynski; Stefan Woltran, E192-02

     J. Maly, M. Truszczynski, S. Woltran:
    "Preference Orders on Families of Sets - When Can Impossibility Results Be Avoided?";
    Journal of Artificial Intelligence Research, 66 (2019), S. 1147 - 1197.

    Zusätzliche Informationen
  649. Autor/innen: Jan Maly, E192-02; Stefan Woltran, E192-02

     J. Maly, S. Woltran:
    "Ranking Specific Sets of Objects";
    Datenbank Spektrum - Zeitschrift für Datenbanktechnologie und Information Retrieval, 17 (2017), 3; S. 255 - 265.

    Zusätzliche Informationen
  650. Autor/innen: Masoumeh Mansouri; Federico Pecora; Peter Schüller, E192-03

     M. Mansouri, F. Pecora, P. Schüller:
    "Combining Task and Motion Planning: Challenges and Guidelines";
    Frontiers in Robotics and AI, 8 (2021), S. 133.

    Zusätzliche Informationen
  651. Autor/innen: Johannes Maschler, E192-01; Günther Raidl, E192-01

     J. Maschler, G. Raidl:
    "Multivalued decision diagrams for prize-collecting job sequencing with one common and multiple secondary resources";
    Annals of Operations Research, 302 (2021), S. 507 - 531.

    Zusätzliche Informationen
  652. Autor/innen: Johannes Maschler, E192-01; Günther Raidl, E192-01

     J. Maschler, G. Raidl:
    "Particle Therapy Patient Scheduling with Limited Starting Time Variations of Daily Treatments";
    Journal of Graph Theory, 96 (2018).

    Zusätzliche Informationen
  653. Autor/innen: Alexandru Mateescu; Rudolf Freund, E192-05

     A. Mateescu, R. Freund:
    "Routes and Products of Monoids";
    Fundamenta Informaticae, 73 (2006), 1-2; S. 205 - 211.
  654. Autor/innen: Luke Mathieson; Stefan Szeider, E192-03

     L. Mathieson, St. Szeider:
    "Editing Graphs to Satisfy Degree Constraints: A Parameterized Approach";
    Journal of Computer and System Sciences, Vol. 78 (2012), No. 1; S. 179 - 191.

    Zusätzliche Informationen
  655. Autor/innen: Tamara Mchedlidze; Martin Nöllenburg, E192-01; Ignaz Rutter

     T. Mchedlidze, M. Nöllenburg, I. Rutter:
    "Extending Convex Partial Drawings of Graphs";
    Algorithmica, 76 (2016), S. 47 - 67.

    Zusätzliche Informationen
  656. Autor/innen: Patrick Metzler, TU Darmstadt; Neeraj Suri; Georg Weissenbacher, E192-04

     P. Metzler, N. Suri, G. Weissenbacher:
    "Extracting safe thread schedules from incomplete model checking results";
    International Journal on Software Tools for Technology Transfer, 22 (2020), 5; S. 565 - 581.

    Zusätzliche Informationen
  657. Autor/innen: Milos Miljanovic; Uwe Egly, E192-03; Thomas Eiter, E192-03

     M. Miljanovic, U. Egly, T. Eiter:
    "Detection of Windows in Facades Using Image Processing Algorithms";
    Indian Journal of Computer Science and Engineering, 3 (2012), 4; S. 539 - 547.
  658. Autor/innen: Florian Mischek, E192-02; Nysret Musliu, E192-02

     F. Mischek, N. Musliu:
    "A local search framework for industrial test laboratory scheduling";
    Annals of Operations Research, 302 (2021), 5; S. 533 - 562.

    Zusätzliche Informationen
  659. Autor/innen: Florian Mischek, E192-02; Nysret Musliu, E192-02

     F. Mischek, N. Musliu:
    "Integer programming model extensions for a multi-stage nurse rostering problem";
    Annals of Operations Research, 275 (2019), 1; S. 123 - 143.

    Zusätzliche Informationen
  660. Autor/innen: Florian Mischek, E192-02; Nysret Musliu, E192-02; Andrea Schaerf

     F. Mischek, N. Musliu, A. Schaerf:
    "Local search approaches for the test laboratory scheduling problem with variable task grouping";
    Journal of Scheduling, 24 (2021), 6; S. 1 - 21.

    Zusätzliche Informationen
  661. Autor/innen: Pedro Moreno-Sanchez, E192-06; Uzair Mahmood, IMPR-CS; Aniket Kate, Purdue University

     P. Moreno-Sanchez, U. Mahmood, A. Kate:
    "ClearChart: Ensuring integrity of consumer ratings in online marketplaces";
    Computers & Security, Computers & Security 78 (2018), Volume 78; S. 90 - 102.

    Zusätzliche Informationen
  662. Autor/innen: Maximilian Moser, E192-02; Nysret Musliu, E192-02; Andrea Schaerf; Felix Winter, E192-02

     M. Moser, N. Musliu, A. Schaerf, F. Winter:
    "Exact and metaheuristic approaches for unrelated parallel machine scheduling";
    Journal of Scheduling, 24 (2021), 6; S. 1 - 28.

    Zusätzliche Informationen
  663. Autor/innen: Moritz Müller; Stefan Szeider, E192-01

     M. Müller, S. Szeider:
    "The Treewidth of Proofs";
    Information and Computation, 255 (2017), S. 147 - 164.

    Zusätzliche Informationen
  664. Autor/innen: Nedim Mujezinovic, E192-01; Günther Raidl, E192-01; J.R.A. Hutchins; J.M. Peters; K. Mechtler; F. Eisenhaber

     N. Mujezinovic, G. Raidl, J. Hutchins, J. Peters, K. Mechtler, F. Eisenhaber:
    "Cleaning of raw peptide ms/ms spectra: Improved protein identification following deconvolution of multiply charged peaks, isotope clusters, and removal of background noise.";
    Proteomics, Vol 6 (2006), 19; S. 5117 - 5131.

    Zusätzliche Informationen
  665. Autor/in: Nysret Musliu, E192-02

     N. Musliu:
    "Heuristic Methods for Automatic Rotating Workforce Scheduling";
    International Journal of Computational Intelligence Research, Volume 2 (2006), Number 4; S. 309 - 326.
  666. Autor/innen: Nysret Musliu, E192-02; Johannes Gärtner, E193-04; Wolfgang Slany, E192-02

     N. Musliu, J. Gärtner, W. Slany:
    "Efficient generation of rotating workforce schedules";
    Discrete Applied Mathematics, 118 (2002), 1-2; S. 85 - 98.

    Zusätzliche Informationen
  667. Autor/innen: Nysret Musliu, E192-02; Andrea Schaerf; Wolfgang Slany, E192-02

     N. Musliu, A. Schaerf, W. Slany:
    "Local search for shift design";
    European Journal of Operational Research, 153 (2004), 1; S. 51 - 64.
  668. Autor/innen: Nysret Musliu, E192-02; Werner Schafhauser, E192-02

     N. Musliu, W. Schafhauser:
    "Genetic algorithms for generalized hypertree decompositions";
    European Journal of Industrial Engineering, 1 (2007), 3; S. 317 - 340.

    Zusätzliche Informationen
  669. Autor/innen: Nysret Musliu, E192-02; Felix Winter, E192-02

     N. Musliu, F. Winter:
    "A Hybrid Approach for the Sudoku Problem: Using Constraint Programming in Iterated Local Search";
    IEEE Intelligent Systems, 32 (2017), 2; S. 52 - 62.

    Zusätzliche Informationen
  670. Autor/innen: Aleksandar Nesic; Matthias Blaicher; Tobias Hoose; Andreas Hofmann; Matthias Lauermann; Yasar Kutuvantavida; Martin Nöllenburg, E192-01; Sebastian Randel; Wolfgang Freude; Christian Koos

     A. Nesic, M. Blaicher, T. Hoose, A. Hofmann, M. Lauermann, Y. Kutuvantavida, M. Nöllenburg, S. Randel, W. Freude, C. Koos:
    "Photonic-integrated circuits with non-planar topologies realized by 3D-printed waveguide overpasses";
    Optics Express, 27 (2019), 12; S. 17402 - 17425.

    Zusätzliche Informationen
  671. Autor/innen: Bojan Nikolic; Aleksandar Kartelj; Marko Djukanovic, E192-01; Milana Grbic; Christian Blum; Günther Raidl, E192-01

     B. Nikolic, A. Kartelj, M. Djukanovic, M. Grbic, C. Blum, G. Raidl:
    "Solving the Longest Common Subsequence Problem Concerning Non-Uniform Distributions of Letters in Input Strings";
    Mathematics, 9 (2021), S. 1 - 25.

    Zusätzliche Informationen
  672. Autor/innen: Andreas Niskanen; Johannes Peter Wallner, E192-02; Matti Järvisalo

     A. Niskanen, J. P. Wallner, M. Järvisalo:
    "Synthesizing Argumentation Frameworks from Examples";
    Journal of Artificial Intelligence Research, 66 (2019), 66; S. 503 - 554.

    Zusätzliche Informationen
  673. Autor/innen: Martin Nöllenburg, E192-01; Roman Prutkin; Ignaz Rutter

     M. Nöllenburg, R. Prutkin, I. Rutter:
    "On Self-Approaching And Increasing-Chord Drawings Of 3-Connected Planar Graphs";
    Journal of Computational Geometry, 7 (2016), 1; S. 47 - 69.

    Zusätzliche Informationen
  674. Autor/innen: Martin Nöllenburg, E192-01; Roman Prutkin; Ignaz Rutter

     M. Nöllenburg, R. Prutkin, I. Rutter:
    "Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions";
    International Journal of Computational Geometry & Applications, 27 (2017), 1+2; S. 121 - 158.

    Zusätzliche Informationen
  675. Autor/innen: Clemens Nothegger, E120-07; Alfred Mayer; Andreas Chwatal; Günther Raidl, E192-01

     C. Nothegger, A. Mayer, A Chwatal, G. Raidl:
    "Solving the post enrolment course timetabling problem by ant colony optimization";
    Annals of Operations Research, Volume 194 (2012), 1; S. 325 - 339.

    Zusätzliche Informationen
  676. Autor/innen: Johannes Oetsch, E192-03; Hans Tompits, E192-03; Martina Seidl; Stefan Woltran, E192-02

     J. Oetsch, H. Tompits, M. Seidl, S. Woltran:
    "Beyond Uniform Equivalence between Answer-set Programs";
    ACM Transactions on Computational Logic, 22 (2021), 1; S. 1 - 46.

    Zusätzliche Informationen
  677. Autor/innen: Emilia Oikarinen; Stefan Woltran, E192-02

     E. Oikarinen, S. Woltran:
    "Characterizing strong equivalence for argumentation frameworks";
    Artificial Intelligence, 175 (2011), 14-15; S. 1985 - 2009.

    Zusätzliche Informationen
  678. Autor/innen: Sebastian Ordyniak; Daniel Paulusma; Stefan Szeider, E192-03

     S. Ordyniak, D. Paulusma, St. Szeider:
    "Satisfiability of acyclic and almost acyclic CNF formulas";
    Theoretical Computer Science, 481 (2013), S. 85 - 99.

    Zusätzliche Informationen
  679. Autor/innen: Sebastian Ordyniak, E192-01; Alexandru Popa

     S. Ordyniak, A. Popa:
    "A Parameterized Study of Maximum Generalized Pattern Matching Problems";
    Algorithmica, 75 (2016), S. 1 - 26.

    Zusätzliche Informationen
  680. Autor/innen: Sebastian Ordyniak; Stefan Szeider, E192-03

     S. Ordyniak, St. Szeider:
    "Parameterized Complexity Results for Exact Bayesian Network Structure Learning";
    Journal of Artificial Intelligence Research, 46 (2013), S. 263 - 302.

    Zusätzliche Informationen
  681. Autor/innen: M.Magdalena Ortiz de la Fuente, E192-03; Diego Calvanese; Thomas Eiter, E192-03

     M. Ortiz de la Fuente, D. Calvanese, T. Eiter:
    "Data complexity of query answering in expressive Description Logics via tableaux";
    Journal of Automated Reasoning, 41 (2008), 1; S. 61 - 98.

    Zusätzliche Informationen
  682. Autor/innen: M.Magdalena Ortiz de la Fuente, E192-03; Mauricio Osorio, UDLA-P

     M. Ortiz de la Fuente, M. Osorio:
    "Strong Negation and Equivalence in the Safe Belief Semantics";
    Journal of Logic and Computation, 17 (2007), 3; S. 499 - 515.

    Zusätzliche Informationen
  683. Autor/in: Marion Oswald, E192-05

     M. Oswald:
    "Computations with 1-deterministic P Systems Using Antiport/Symport Rules for Evolution Rules";
    WSEAS Transactions on Biology and Biomedicine, 2 (2004), 1; S. 280 - 286.
  684. Autor/in: Marion Oswald, E192-05

     M. Oswald:
    "Independent agents in a globalized world modelled by tissue P systems";
    Artificial Life and Robotics, 11 (2007), 2; S. 171 - 174.
  685. Autor/in: Marion Oswald, E192-05

     M. Oswald:
    "Membrane computing and brain modelling.";
    Artificial Life and Robotics (eingeladen), 13 (2009), 2; S. 390 - 393.
  686. Autor/innen: Thomas Pani, WPI; Helmut Veith, E192-04; Florian Zuleger, E192-04

     T. Pani, H. Veith, F. Zuleger:
    "Loop Patterns in C Programs";
    ECEASST, 72 (2015).
  687. Autor/innen: Thomas Pani, E192-04; Georg Weissenbacher, E192-04; Florian Zuleger, E192-04

     T. Pani, G. Weissenbacher, F. Zuleger:
    "Rely-guarantee bound analysis of parameterized concurrent shared-memory programs";
    Formal Methods in System Design, 57 (2021), 2; S. 270 - 302.

    Zusätzliche Informationen
  688. Autor/in: Xavier Parent, E192-05

     X. Parent et al.:
    "Introduction to the Special Issue on Logic Rules and Reasoning: Selected Papers from the 2nd International Joint Conference on Rules and Reasoning ({R}uleML+{RR} 2018)}";
    TPLP - Theory and Practice of Logic Programming, 21 (2021), 1; S. 1 - 3.
  689. Autor/in: Matteo Pascucci, E192-05

     M. Pascucci:
    "A note on the issue of cohesiveness in canonical models";
    Journal of Logic, Language and Information, 28 (2019), 28; 18 S.

    Zusätzliche Informationen
  690. Autor/in: Matteo Pascucci, E192-05

     M. Pascucci:
    "Anderson's restriction of deontic modalities to contingent propositions";
    Theoria. Swedish Journal of Philosophy, 83 (2017), 4; S. 440 - 470.
  691. Autor/in: Matteo Pascucci, E192-05

     M. Pascucci:
    "Propositional quantifiers in labelled natural deduction for normal modal logic";
    Logic Journal of the IGPL, jzz008 (2019), 31 S.
  692. Autor/in: Matteo Pascucci, E192-05

     M. Pascucci et al.:
    "Preface";
    Organon F., 26 (2019), 26; S. 318 - 322.

    Zusätzliche Informationen
  693. Autor/innen: Matteo Pascucci, E192-05; Elisa Freschi

     M. Pascucci, E. Freschi et al.:
    "Duty and sacrifice. A logical analysis of the Mīmāṃsā theory of Vedic injunctions";
    History and Philosophy of Logic, 40 (2019), 4; S. 323 - 354.

    Zusätzliche Informationen
  694. Autor/innen: Matteo Pascucci, E192-05; Daniela Glavanicova

     M. Pascucci, D. Glavanicova:
    "A realistic view on normative conflicts";
    Logic and Logical Philosophy, 29 (2020), S. 36 - 51.

    Zusätzliche Informationen
  695. Autor/innen: Matteo Pascucci, E192-05; Tomer Libal

     M. Pascucci, T. Libal:
    "Automated Reasoning in Normative Detachment Structures with Ideal Conditions";
    CoRR - Computing Research Repository, abs/1810.09993 (2018), abs/1810.09993.
  696. Autor/innen: Daniel Paulusma; Friedrich Slivovsky, E192-01; Stefan Szeider, E192-01

     D. Paulusma, F. Slivovsky, S. Szeider:
    "Model Counting for CNF Formulas of Bounded Modular Treewidth";
    Algorithmica, First online: 17 July 2015 (2015), S. 1 - 27.

    Zusätzliche Informationen
  697. Autor/innen: Daniel Paulusma; Stefan Szeider, E192-01

     D. Paulusma, S. Szeider:
    "On the parameterized complexity of (k, s)-SAT";
    Information Processing Letters, 134 (2019), 134; S. 34 - 36.

    Zusätzliche Informationen
  698. Autor/in: Alexandra Pavlova, E192-05

     A Pavlova:
    "Dialogue Games for Minimal Logic";
    Logic and Logical Philosophy, 30 (2021), 2; S. 281 - 309.
  699. Autor/innen: Alexandra Pavlova, E192-05; Timo Lang, E192-05; Robert Freiman, E192-05

     A Pavlova, T Lang, R. Freiman:
    "From Semantic Games to Provability: The Case of Gödel Logic";
    Studia Logica, 110 (2021), S. 429 - 456.

    Zusätzliche Informationen
  700. Autor/innen: David Pearce; Hans Tompits, E192-03; Stefan Woltran, E192-02

     D. Pearce, H. Tompits, S. Woltran:
    "Characterising Equilibrium Logic and Nested Logic Programs: Reductions and Complexity";
    Theory and Practice of Logic Programming, 9 (2009), 5; S. 565 - 616.

    Zusätzliche Informationen
  701. Autor/innen: Tomas Peitl, E192-01; Friedrich Slivovsky, E192-01; Stefan Szeider, E192-01

     T. Peitl, F. Slivovsky, S. Szeider:
    "Dependency Learning for QBF";
    Journal of Artificial Intelligence Research, 65 (2019), 65; S. 181 - 208.

    Zusätzliche Informationen
  702. Autor/innen: Tomas Peitl, E192-01; Friedrich Slivovsky, E192-01; Stefan Szeider, E192-01

     T. Peitl, F. Slivovsky, S. Szeider:
    "Long-Distance Q-Resolution with Dependency Schemes";
    Journal of Automated Reasoning, 80 (2018), 2; S. 1 - 29.

    Zusätzliche Informationen
  703. Autor/innen: Andreas Pfandler, E192-02; Reinhard Pichler, E192-02; Stefan Woltran, E192-02

     A. Pfandler, R. Pichler, S. Woltran:
    "The complexity of handling minimal solutions in logic-based abduction";
    Journal of Logic and Computation, 25 (2015), 3; S. 805 - 825.

    Zusätzliche Informationen
  704. Autor/in: Gerald Pfeifer, E192-02

     G. Pfeifer:
    "Improving the Model Generation/Checking Interplay to Enhance the Evaluation of Disjunctive Programs";
    Lecture Notes in Computer Science, 2923 (2004), 2923; S. 220 - 233.

    Zusätzliche Informationen
  705. Autor/in: Reinhard Pichler, E192-02

     R. Pichler:
    "Technical Perspective: Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation";
    ACM SIGMOD Record, 49 (2020), 1; S. 51.

    Zusätzliche Informationen
  706. Autor/innen: Reinhard Pichler, E192-02; Jesus Medina

     R. Pichler, J. Medina:
    "Fuzzy data exchange";
    Fuzzy Sets and Systems, 301 (2016), S. 129 - 145.

    Zusätzliche Informationen
  707. Autor/innen: Reinhard Pichler, E192-02; Axel Polleres; Sebastian Skritek, E192-02; Stefan Woltran, E192-02

     R. Pichler, A. Polleres, S. Skritek, S. Woltran:
    "Complexity of redundancy detection on RDF graphs in the presence of rules, constraints, and queries";
    Semantic Web (eingeladen), 4 (2013), 4; S. 351 - 393.

    Zusätzliche Informationen
  708. Autor/innen: Reinhard Pichler, E192-02; Stefan Rümmele, E192-02; Stefan Szeider, E192-03; Stefan Woltran, E192-02

     R. Pichler, St. Rümmele, St. Szeider, S. Woltran:
    "Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough";
    CoRR - Computing Research Repository, 1204.3040 (2012), abs/1204.3040; 20 S.

    Zusätzliche Informationen
  709. Autor/innen: Reinhard Pichler, E192-02; Stefan Rümmele, E192-02; Stefan Szeider, E192-03; Stefan Woltran, E192-02

     R. Pichler, St. Rümmele, St. Szeider, S. Woltran:
    "Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough";
    Theory and Practice of Logic Programming, FirstView Article (2012), July; S. 1 - 24.

    Zusätzliche Informationen
  710. Autor/innen: Reinhard Pichler, E192-02; Stefan Rümmele, E192-02; Stefan Szeider, E192-03; Stefan Woltran, E192-02

     R. Pichler, St. Rümmele, St. Szeider, S. Woltran:
    "Tractable answer-set programming with weight constraints: bounded treewidth is not enough";
    Theory and Practice of Logic Programming, 14 (2014), 2; S. 141 - 164.

    Zusätzliche Informationen
  711. Autor/innen: Reinhard Pichler, E192-02; Emanuel Sallinger; Vadim Savenkov, E192-02

     R. Pichler, E. Sallinger, V. Savenkov:
    "Relaxed Notions of Schema Mapping Equivalence Revisited";
    Theory of Computing Systems (eingeladen), 52 (2013), 3; S. 483 - 541.

    Zusätzliche Informationen
  712. Autor/innen: Reinhard Pichler, E192-02; Vadim Savenkov, E192-02

     R. Pichler, V. Savenkov:
    "Towards practical feasibility of core computation in data exchange";
    Theoretical Computer Science, 411 (2010), 7-9; S. 935 - 957.

    Zusätzliche Informationen
  713. Autor/innen: Reinhard Pichler, E192-02; Sebastian Skritek, E192-02

     R. Pichler, S. Skritek:
    "Tractable counting of the answers to conjunctive queries";
    Journal of Computer and System Sciences (eingeladen), 79 (2013), 6; S. 984 - 1001.

    Zusätzliche Informationen
  714. Autor/innen: Markus Pichlmair, E192-02; Wolfgang Seiringer

     M. Pichlmair, W. Seiringer:
    "Kompetenzmanagement für Studierende - Ein Erfahrungsbericht";
    Wirtschaftsinformatik, 1 (2007), 1; S. 63 - 66.
  715. Autor/in: Michael Pinsker, E192-05

     M. Pinsker et al.:
    "A new operation on partially ordered sets";
    Journal of Combinatorial Theory Series A, 120 (2013), 7; S. 1450 - 1462.
  716. Autor/in: Michael Pinsker, E192-05

     M. Pinsker et al.:
    "Canonical Functions: a proof via topological dynamics";
    CoRR - Computing Research Repository, abs/1610.09660 (2016).
  717. Autor/in: Michael Pinsker, E192-05

     M. Pinsker et al.:
    "Constraint satisfaction problems for reducts of homogeneous graphs";
    CoRR - Computing Research Repository, abs/1602.05819 (2016), 41 S.
  718. Autor/in: Michael Pinsker, E192-05

     M. Pinsker et al.:
    "Distance constraint satisfaction problems";
    Information and Computation, 247 (2016), S. 87 - 105.
  719. Autor/in: Michael Pinsker, E192-05

     M. Pinsker et al.:
    "Permutations on the Random Permutation";
    Electronic Journal of Combinatorics, 22 (2015), 2; 2 S.
  720. Autor/in: Michael Pinsker, E192-05

     M. Pinsker et al.:
    "Permutations on the Random Permutation";
    Electronic Journal of Combinatorics, 22 (2015), 2.

    Zusätzliche Informationen
  721. Autor/in: Michael Pinsker, E192-05

     M. Pinsker et al.:
    "Projective clone homomorphisms";
    CoRR - Computing Research Repository, arXiv:1409.4601 (2014), 12 S.
  722. Autor/in: Michael Pinsker, E192-05

     M. Pinsker et al.:
    "Reconstructing the topology of clones";
    CoRR - Computing Research Repository, abs/1312.7699 (2013), abs/1312.7699; S. 1 - 29.
  723. Autor/in: Michael Pinsker, E192-05

     M. Pinsker et al.:
    "Reconstructing the topology of clones";
    Transactions of the American Mathematical Society, 369 (2017), S. 3707 - 3740.
  724. Autor/in: Michael Pinsker, E192-05

     M. Pinsker et al.:
    "Reducts of the random partial order.";
    Advances in Mathematics, 267 (2014), S. 94 - 120.
  725. Autor/in: Michael Pinsker, E192-05

     M. Pinsker et al.:
    "Schaefer's Theorem for Graphs";
    Journal of the ACM, 62 (2015), 3; S. 1 - 52.
  726. Autor/in: Michael Pinsker, E192-05

     M. Pinsker et al.:
    "The 42 reducts of the random ordered graph";
    LMS J. Comput.Math., 111 (2015), 3; S. 591 - 632.
  727. Autor/in: Michael Pinsker, E192-05

     M. Pinsker et al.:
    "The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems";
    CoRR - Computing Research Repository, abs/1602.04353 (2016).
  728. Autor/in: Michael Pinsker, E192-05

     M. Pinsker et al.:
    "The universal homogeneous binary tree";
    CoRR - Computing Research Repository, abs/1409.2170 (2014), 25 S.

    Zusätzliche Informationen
  729. Autor/in: Michael Pinsker, E192-05

     M. Pinsker et al.:
    "Topological Birkhoff";
    Transactions of the American Mathematical Society, 367 (2015), S. 2527 - 2549.
  730. Autor/in: Michael Pinsker, E192-05

     M. Pinsker et al.:
    "Universality of the lattice of transformation monoids.";
    Proceedings of the American Mathematical Society, 141 (2013), 9; S. 3005 - 3011.
  731. Autor/innen: Michael Pinsker, E192-05; Martin Goldstern, E104-01

     M. Pinsker, M. Goldstern:
    "A Closed Algebra with a Non-Borel Clone and an Ideal with a Borel Clone";
    International Journal of Algebra and Computation, 23 (2013), 5; S. 1115 - 1126.
  732. Autor/innen: Michael Pinsker, E192-05; Michael Kompatscher, E192-05

     M. Pinsker, M. Kompatscher et al.:
    "Equations in oligomorphic clones and the Constraint Satisfaction Problem for $ω$-categorical structures";
    CoRR - Computing Research Repository, abs/1612.07551 (2016).
  733. Autor/innen: Sopo Pkhakadze; Hans Tompits, E192-03

     S. Pkhakadze, H. Tompits:
    "Sequent-Type Calculi for Three-Valued and Disjunctive Default Logic";
    Axioms, 9 (2020), 3.

    Zusätzliche Informationen
  734. Autor/in: Axel Florian Polleres, E192-03

     A. Polleres:
    "JELIA 2002";
    ÖGAI Journal, 4 (2002), S. 23 - 25.

    Zusätzliche Informationen
  735. Autor/in: Axel Florian Polleres, E192-03

     A. Polleres:
    "JELIA 2002";
    Computer kommunikativ, 5 (2002), S. 28 - 29.
  736. Autor/in: Axel Florian Polleres, E192-03

     A. Polleres:
    "Planen in der AI";
    Computer kommunikativ, 5 (2002), S. 30 - 31.
  737. Autor/in: Axel Florian Polleres, E192-03

     A. Polleres:
    "PLANET International summer School on AI Planning 2002, Chalkidiki, Griechenland";
    ÖGAI Journal, 4 (2002), S. 26 - 28.

    Zusätzliche Informationen
  738. Autor/in: Axel Florian Polleres, E192-03

     A. Polleres:
    "The DLVK System for Planning with Incomplete Knowledge";
    ÖGAI Journal, 22 (2003), 1; S. 25 - 29.
  739. Autor/innen: Axel Polleres; Johannes Peter Wallner, E192-02

     A. Polleres, J. P. Wallner:
    "On the relation between SPARQL1.1 and Answer Set Programming";
    Journal of Applied Non-Classical Logics (JANCL), 23 (2013), 1-2; S. 159 - 212.

    Zusätzliche Informationen
  740. Autor/innen: Petrica Pop; Sabo Cosmin; Benjamin Biesinger, E192-01; Bin Hu; Günther Raidl, E192-01

     P. Pop, S. Cosmin, B. Biesinger, B. Hu, G. Raidl:
    "Solving the Two-State Fixed-Charge Transportation Problem with a Hybrid Genetic Algorithm";
    Carpathian Journal of Mathematics, 33 (2017), 3; S. 365 - 371.

    Zusätzliche Informationen
  741. Autor/innen: Gerhard Post; Jeffrey Kingston; Samad Ahmadi; Sophia Daskalaki; Christos Gogos; Jari Kyngas; Cimmo Nurmi; Nysret Musliu, E192-02; Nelishia Pillay; Haroldo Santos; Andrea Schaerf

     G Post, J Kingston, S. Ahmadi, S. Daskalaki, C. Gogos, J. Kyngas, C. Nurmi, N. Musliu, N. Pillay, H. Santos, A. Schaerf:
    "XHSTT: an XML archive for high school timetabling problems in different countries";
    Annals of Operations Research, (*) (2011).

    Zusätzliche Informationen
  742. Autor/innen: Matthias Prandtstetter; Günther Raidl, E192-01

     M. Prandtstetter, G. Raidl:
    "An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem";
    European Journal of Operational Research (eingeladen), 191 (2008), 3; S. 1004 - 1022.
  743. Autor/innen: Cornelis Pronk; Martin Schönhacker, E192-01

     C. Pronk, M. Schönhacker:
    "Formal Definition of Programming Language Standards ";
    ACM SIGPLAN Notices, 38 (2003), 8; S. 20 - 21.
  744. Autor/innen: Roman Prutkin; Martin Nöllenburg, E192-01

     R. Prutkin, M. Nöllenburg:
    "Euclidean Greedy Drawings of Trees";
    Discrete & Computational Geometry, 58 (2017), 3; S. 543 - 579.

    Zusätzliche Informationen
  745. Autor/innen: Jakob Puchinger; Günther Raidl, E192-01

     J. Puchinger, G. Raidl:
    "Bringing order into the neighborhoods: Relaxation guided variable neighborhood search";
    Journal of Heuristics (eingeladen), 14 (2008), 5; S. 457 - 472.
  746. Autor/innen: Jakob Puchinger; Günther Raidl, E192-01

     J. Puchinger, G. Raidl:
    "Models and algorithms for three-stage two-dimensional bin packing";
    European Journal of Operational Research, 183 (2007), 3; S. 1304 - 1327.

    Zusätzliche Informationen
  747. Autor/innen: Jakob Puchinger; Günther Raidl, E192-01; Ulrich Pferschy, E192-01

     J. Puchinger, G. Raidl, U. Pferschy:
    "The multidimensional knapsack problem: Structure and algorithms";
    Informs Journal on Computing, 22 (2010), 2; S. 250 - 265.

    Zusätzliche Informationen
  748. Autor/in: Jörg Pührer, E192-02

     J. Pührer:
    "ArgueApply: Abstract Argumentation at Your Fingertips";
    KI - Künstliche Intelligenz, 32 (2018), 2-3; S. 209 - 212.

    Zusätzliche Informationen
  749. Autor/innen: Jörg Pührer, E192-02; Gerhard Brewka, Uni Leipzig; Stefan Ellmauthaler; Ricardo Goncalves; Matthias Knorr; Joao Leite

     J. Pührer, G. Brewka, St. Ellmauthaler, R. Goncalves, M. Knorr, J. Leite:
    "Reactive multi-context systems: Heterogeneous reasoning in dynamic environments";
    Artificial Intelligence, 256 (2018), S. 68 - 104.

    Zusätzliche Informationen
  750. Autor/innen: Jörg Pührer, E192-02; Johannes Oetsch, E192-03; Hans Tompits, E192-03

     J. Pührer, J. Oetsch, H. Tompits:
    "Stepwise debugging of answer-set programs";
    Theory and Practice of Logic Programming, 18 (2018), 1; S. 30 - 80.

    Zusätzliche Informationen
  751. Autor/in: Günther Raidl, E192-01

     G. Raidl:
    "Decomposition based hybrid metaheuristics";
    European Journal of Operational Research (eingeladen), 244 (2015), 1; S. 66 - 76.

    Zusätzliche Informationen
  752. Autor/innen: Günther Raidl, E192-01; Jens Gottlieb

     G. Raidl, J. Gottlieb:
    "Empirical analysis of locality, heritability and heuristic bias in evolutionary algorithms: A case study for the multidimensional knapsack problem.";
    Evolutionary Computation, volume 13 (2005), number 4; S. 441 - 475.

    Zusätzliche Informationen
  753. Autor/innen: Günther Raidl, E192-01; Bryant Julstrom

     G. Raidl, B. Julstrom:
    "Edge-Sets: An Effective Evolutionary Coding of Spanning Trees";
    IEEE Transactions on Evolutionary Computation, 7 (2003), 3; S. 225 - 239.
  754. Autor/innen: Günther Raidl, E192-01; Gabriele Koller, E192-01; Bryant Julstrom

     G. Raidl, G. Koller, B. Julstrom:
    "Biased Mutation Operators for Subgraph-Selection Problems";
    IEEE Transactions on Evolutionary Computation, Volume 10 (2006), 2; S. 145 - 156.
  755. Autor/innen: Günther Raidl, E192-01; Ivana Ljubic

     G. Raidl, I. Ljubic:
    "Evolutionary Local Search for the Edge-Biconnectivity Augmentation Problem";
    Information Processing Letters, 82 (2002), S. 39 - 45.
  756. Autor/innen: Marian Rainer-Harbach, E192-01; Petrina Papazek, E192-01; Günther Raidl, E192-01; Bin Hu; Christian Kloimüllner

     M. Rainer-Harbach, P. Papazek, G. Raidl, B. Hu, C. Kloimüllner:
    "PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems.";
    Journal of Global Optimization (eingeladen), April (2014), S. 1 - 33.

    Zusätzliche Informationen
  757. Autor/innen: Revantha Ramanayake; Agata Ciabattoni, E192-05

     R. Ramanayake, A. Ciabattoni:
    "Power and Limits of Structural Display Rules";
    ACM Transactions on Computational Logic, 3 (2016), 17.

    Zusätzliche Informationen
  758. Autor/innen: Heidelinde Rameder, E191-03; Monika Di Angelo, E191-03; Gernot Salzer, E192-05

     H. Rameder, M. Di Angelo, G. Salzer:
    "Review of Automated Vulnerability Analysis of Smart Contracts on Ethereum";
    Frontiers in Blockchain, 5 (2022), S. 1 - 20.

    Zusätzliche Informationen
  759. Autor/in: Christoph Redl, E192-03

     C. Redl:
    "Inlining External Sources in Answer Set Programs";
    Theory and Practice of Logic Programming, 19 (2019), 3; S. 360 - 411.

    Zusätzliche Informationen
  760. Autor/in: Christoph Redl, E192-03

     C. Redl:
    "The DLVHEX System for Knowledge Representatin: Recent Advances (System Description)";
    Theory and Practice of Logic Programming, 16 (2016), 5-6; S. 866 - 883.

    Zusätzliche Informationen
  761. Autor/innen: Giselle Reis, E192-05; Vivek Nigam

     G. Reis, V. Nigam et al.:
    "Checking Proof Transformations with ASP";
    Theory and Practice of Logic Programming, 13 (2013), 4-5; S. 1 - 12.
  762. Autor/innen: Alexander Reiterer, E120-05; Uwe Egly, E192-03; Thomas Eiter, E192-03; Heribert Kahmen, E120-05

     A. Reiterer, U. Egly, T. Eiter, H. Kahmen:
    "A knowledge-based videotheodolite measurement system for object representation /monitoring";
    Advances in Engineering Software, 39 (2008), 10; S. 821 - 827.

    Zusätzliche Informationen
  763. Autor/innen: Alexander Reiterer, E120-05; Uwe Egly, E192-03; Tanja Vicovac, E120-05; Enrico Mai; Shahram Moafipoor; Dorota A. Grejner-Brzezinska; Charles K. Toth

     A. Reiterer, U. Egly, T. Vicovac, E. Mai, S. Moafipoor, D. Grejner-Brzezinska, C. Toth:
    "Application of artificial intelligence in Geodesy - A review of theoretical foundations and practical examples";
    Journal of Applied Geodesy, 4 (2010), 4; S. 201 - 217.

    Zusätzliche Informationen
  764. Autor/innen: Alexander Reiterer, E120-05; Heribert Kahmen, E120-05; Uwe Egly, E192-03; Thomas Eiter, E192-03

     A. Reiterer, H. Kahmen, U. Egly, T. Eiter:
    "3D- Messverfahren mit Videotheodoliten und automatisierte Zielpunkterfassung mit Hilfe von Interest Operatoren";
    Allgemeine Vermessungs-Nachrichten (AVN), 110 (2003), 04; S. 150 - 156.

    Zusätzliche Informationen
  765. Autor/innen: Alexander Reiterer, E120-05; Heribert Kahmen, E120-05; Uwe Egly, E192-03; Thomas Eiter, E192-03

     A. Reiterer, H. Kahmen, U. Egly, T. Eiter:
    "Wissensbasierte Bildaufbereitung für ein videotheodolit-basiertes Multisensorsystem";
    Allgemeine Vermessungs-Nachrichten (AVN), 111 (2004), 06; S. 202 - 208.

    Zusätzliche Informationen
  766. Autor/innen: Alexander Reiterer, E120-05; Martin Lehmann, E120-05; Milosh Miljanovic, E120-05; Haider Ali, E120-05; Gerhard Paar; Uwe Egly, E192-03; Thomas Eiter, E192-03; Heribert Kahmen, E120-05

     A. Reiterer, M. Lehmann, M. Miljanovic, H. Ali, G. Paar, U. Egly, T. Eiter, H. Kahmen:
    "A 3D optical deformation measurement system supported by knowledge-based and learning techniques";
    Journal of Applied Geodesy, 3 (2009), 1; S. 1 - 13.

    Zusätzliche Informationen
  767. Autor/in: Jochen Renz, E192-02

     J. Renz:
    "A Canonical Model of the Region Connection Calculus";
    Journal of Applied Non-Classical Logics (JANCL), 12 (2003), 3-4.
  768. Autor/innen: William Richter; Adam Grabowski; Jesse Alama, E192-05

     Bill Richter, A. Grabowski, J. Alama:
    "Tarski geometry axioms";
    Formalized Mathematics, 22 (2014), 2; S. 167 - 176.

    Zusätzliche Informationen
  769. Autor/innen: Martin Riedler, E192-01; Thomas Jatschka, E192-01; Johannes Maschler, E192-01; Günther Raidl, E192-01

     M. Riedler, T. Jatschka, J. Maschler, G. Raidl:
    "An iterative time-bucket refinement algorithm for a high-resolution resource-constrained project scheduling problem";
    International Transactions in Operational Research, 8 (2017).

    Zusätzliche Informationen
  770. Autor/innen: Gernot Salzer, E192-05; Mike Behrisch, E104-01; Miki Hermann

     G. Salzer, M. Behrisch, M. Hermann et al.:
    "Minimal Distance of Propositional Models";
    CoRR - Computing Research Repository, 1502.06761 (2015), abs/1502.06761; 28 S.
  771. Autor/innen: Gernot Salzer, E192-05; Ingo Feinerer, E192-02

     G. Salzer, I. Feinerer:
    "Numeric semantics of class diagrams with multiplicity and uniqueness constraints";
    Software and Systems Modeling, 13 (2014), 3; S. 1167 - 1187.

    Zusätzliche Informationen
  772. Autor/innen: Gernot Salzer, E192-05; Miki Hermann; Angel Gil; Bruno Zanuttini

     G. Salzer, M. Hermann, A Gil, B Zanuttini:
    "Efficient Algorithms For Description Problems Over Finite Totally Ordered Domains";
    SIAM JOURNAL ON COMPUTING, 38 (2008), 3; S. 922 - 945.

    Zusätzliche Informationen
  773. Autor/innen: Gernot Salzer, E192-05; Sebastian Limet

     G. Salzer, S Limet:
    "Basic Rewriting via Logic Programming, with an Application to the Reachability Problem";
    Journal of Automata, Languages and Combinatorics, 11 (2006), 1; S. 107 - 142.
  774. Autor/innen: Gernot Salzer, E192-05; Sebastian Limet

     G. Salzer, S Limet:
    "Tree Tuple Languages from the Logic Programming Point of View";
    Journal of Automated Reasoning, 37 (2006), 4; S. 323 - 349.
  775. Autor/innen: Marko Samer, E192-02; Stefan Szeider, E192-03

     M. Samer, St. Szeider:
    "Algorithms for Propositional Model Counting";
    Journal of Discrete Algorithms, 8 (2010), 1; S. 50 - 64.

    Zusätzliche Informationen
  776. Autor/innen: Marko Samer; Stefan Szeider, E192-03

     M. Samer, St. Szeider:
    "Constraint Satisfaction with Bounded Treewidth Revisited";
    Journal of Computer and System Sciences, 76 (2010), 2; S. 103 - 114.
  777. Autor/innen: Marko Samer, E192-02; Stefan Szeider, E192-03

     M. Samer, St. Szeider:
    "Tractable Cases of the Extended Global Cardinality Constraint";
    Constraints, 16 (2011), 1; S. 1 - 24.

    Zusätzliche Informationen
  778. Autor/innen: Marko Samer, E192-02; Helmut Veith, E192-04

     M. Samer, H. Veith:
    "On the distributivity of LTL specifications";
    ACM Transactions on Computational Logic, 11 (2010), 3.

    Zusätzliche Informationen
  779. Autor/innen: Zeynep Gözen Saribatur, E192-03; Thomas Eiter, E192-03

     Z. G. Saribatur, T. Eiter:
    "Omission-based Abstraction for Answer Set Programs";
    TPLP - Theory and Practice of Logic Programming, - (2020), S. 1 - 51.

    Zusätzliche Informationen
  780. Autor/innen: Zeynep Gözen Saribatur, E192-03; Thomas Eiter, E192-03

     Z. G. Saribatur, T. Eiter:
    "Omission-based Abstraction for Answer Set Programs";
    ArXiv, 2004 (2020), 01410; 52 S.
  781. Autor/innen: Zeynep Gözen Saribatur, E192-03; Thomas Eiter, E192-03

     Z. G. Saribatur, T. Eiter:
    "Omission-Based Abstraction for Answer Set Programs - ERRATUM";
    TPLP - Theory and Practice of Logic Programming, 21 (2021), 2; S. 292.

    Zusätzliche Informationen
  782. Autor/innen: Zeynep Gözen Saribatur, E192-02; Thomas Eiter, E192-03; Peter Schüller, E192-03

     Z. G. Saribatur, T. Eiter, P. Schüller:
    "Abstraction for non-ground answer set programs";
    Artificial Intelligence, 300 (2021), S. 103563.

    Zusätzliche Informationen
  783. Autor/innen: Zeynep Gözen Saribatur, E192-03; Volkan Patoglu; Esra Erdem

     Z. G. Saribatur, V. Patoglu, E. Erdem:
    "Finding optimal feasible global plans for multiple teams of heterogeneous robots using hybrid reasoning: an application to cognitive factories";
    Autonomous Robots, 43 (2019), 1; S. 213 - 238.

    Zusätzliche Informationen
  784. Autor/innen: Benjamin Schaden; Thomas Jatschka, E192-01; Steffen Limmer; Günther Raidl, E192-01

     B. Schaden, T. Jatschka, S. Limmer, G. Raidl:
    "Smart Charging of Electric Vehicles Considering SOC-Dependent Maximum Charging Powers";
    ENERGIES, 14 (2021), 22; S. 1 - 32.

    Zusätzliche Informationen
  785. Autor/innen: Joerg Schellhase; Thomas Lukasiewicz, E192-03

     J. Schellhase, T. Lukasiewicz:
    "Using Search Strategies and a Description Logic Paradigm with Conditional Preferences for Literature Search";
    International Journal of Metadata, Semantics and Ontologies, 3 (2008), 1; S. 68 - 83.
  786. Autor/innen: Felix Schernhammer, E192-05; Bernhard Gramlich, E192-05

     F. Schernhammer, B. Gramlich:
    "Characterizing and Proving Operational Termination of Deterministic Conditional Term Rewriting Systems";
    Journal of Logic and Algebraic Programming, 79 (2010), 7; S. 659 - 688.

    Zusätzliche Informationen
  787. Autor/innen: Felix Schernhammer, E192-05; Bernhard Gramlich, E192-05

     F. Schernhammer, B. Gramlich:
    "Termination of Lazy Rewriting Revisited";
    Electronic Notes in Theoretical Computer Science (ENTCS), 204 (2008), S. 35 - 51.

    Zusätzliche Informationen
  788. Autor/innen: Matthias Schlaipfer, E192-04; Georg Weissenbacher, E192-04

     M. Schlaipfer, G. Weissenbacher:
    "Labelled Interpolation Systems for Hyper-Resolution, Clausal, and Local Proofs";
    Journal of Automated Reasoning, 57 (2016), 1; S. 3 - 36.

    Zusätzliche Informationen
  789. Autor/innen: Thomas Schneider; Mantas Simkus, E192-02

     T. Schneider, M. Simkus:
    "Ontologies and Data Management: A Brief Survey";
    KI - Künstliche Intelligenz, 34 (2020), 3; S. 329 - 353.

    Zusätzliche Informationen
  790. Autor/in: Peter Schüller, E192-03

     P. Schüller:
    "Adjudication of Coreference Annotations via Answer Set Optimization";
    Journal of Experimental & Theoretical Artificial Intelligence, 30 (2018), 4; S. 525 - 546.
  791. Autor/in: Peter Schüller, E192-03

     P. Schüller:
    "Answer Set Programming Applied to Coreference Resolution and Semantic Similarity";
    KI - Künstliche Intelligenz, 32 (2018), 2-3; S. 207 - 208.
  792. Autor/in: Peter Schüller, E192-03

     P. Schüller:
    "Answer Set Programming in Linguistics";
    KI - Künstliche Intelligenz (eingeladen), 32 (2018), 2-3; S. 151 - 155.
  793. Autor/innen: Peter Schüller, E192-03; Mishal Benz

     P. Schüller, M. Benz:
    "Best-Effort Inductive Logic Programming via Fine-grained Cost-based Hypothesis Generation";
    Machine Learning, 107 (2018), 7; S. 1141 - 1169.

    Zusätzliche Informationen
  794. Autor/innen: Christian Schulz; Martin Nöllenburg, E192-01; Henning Meyerhenke

     C. Schulz, M. Nöllenburg, H. Meyerhenke:
    "Drawing Large Graphs by Multilevel Maxent-Stress Optimization";
    IEEE Transactions on Visualization and Computer Graphics, 24 (2018), 5; S. 1814 - 1827.

    Zusätzliche Informationen
  795. Autor/innen: Yi-Dong Shen; Thomas Eiter, E192-03

     Y. Shen, T. Eiter:
    "Determining Inference Semantics for Disjunctive Logic Programs";
    Artificial Intelligence, 277 (2019), S. 115 - 135.

    Zusätzliche Informationen
  796. Autor/innen: Yi-Dong Shen; Kewen Wang; Thomas Eiter, E192-03; Michael Fink, E192-03; Christoph Redl, E192-03; Thomas Krennwallner, E192-03; Jun Deng

     Y. Shen, K. Wang, T. Eiter, M. Fink, C. Redl, T. Krennwallner, J. Deng:
    "FLP answer set semantics without circular justifications for general logic programs";
    Artificial Intelligence, 213 (2014), S. 1 - 41.

    Zusätzliche Informationen
  797. Autor/innen: Moritz Sinn, E192-04; Helmut Veith, E192-04; Florian Zuleger, E192-04

     M. Sinn, H. Veith, F. Zuleger:
    "Complexity and Resource Bound Analysis of Imperative Programs Using Difference Constraints";
    Journal of Automated Reasoning, 59 (2017), 1; S. 3 - 45.
  798. Autor/innen: Sebastian Skritek, E192-02; Stefan Mengel

     S. Skritek, S. Mengel:
    "Characterizing Tractability of Simple Well-Designed Pattern Trees with Projection.";
    Theory of Computing Systems, 1 (2020), S. 1 - 39.

    Zusätzliche Informationen
  799. Autor/in: Wolfgang Slany, E192-02

     W. Slany:
    "Endgame Problems of Sim-like graph Ramsey avoidance games are PSPACE-complete";
    Theoretical Computer Science, Vol. 289 (2002), 1; S. 829 - 843.
  800. Autor/innen: Friedrich Slivovsky, E192-01; Stefan Szeider, E192-01

     F. Slivovsky, S. Szeider:
    "Quantifier Reordering for QBF";
    Journal of Automated Reasoning, Volume 55 (2015), S. 1 - 19.

    Zusätzliche Informationen
  801. Autor/innen: Friedrich Slivovsky, E192-01; Stefan Szeider, E192-01

     F. Slivovsky, S. Szeider:
    "Soundness of Q-resolution with dependency schemes";
    Theoretical Computer Science, 612 (2016), S. 83 - 101.

    Zusätzliche Informationen
  802. Autor/innen: Miroslav Stankovic, E192-04; Ezio Bartocci, E191-01; Laura Kovacs, E192-04

     S. Stankovic, E. Bartocci, L. Kovacs:
    "Moment-based analysis of Bayesian network properties";
    Theoretical Computer Science, 903 (2022), S. 113 - 133.

    Zusätzliche Informationen
  803. Autor/innen: Hannes Strass; Johannes Peter Wallner, E192-02

     H. Strass, J. P. Wallner:
    "Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory";
    Artificial Intelligence, 226 (2015), S. 34 - 74.

    Zusätzliche Informationen
  804. Autor/innen: Kadri Sylejmani, E-Commerce; Jürgen Dorn, E194-04; Nysret Musliu, E192-02

     K. Sylejmani, J. Dorn, N. Musliu:
    "Planning the trip itinerary for tourist groups";
    Journal of Information Technology and Tourism (eingeladen), 17 (2017), 1; S. 1 - 40.

    Zusätzliche Informationen
  805. Autor/in: Stefan Szeider, E192-03

     St. Szeider:
    "Monadic Second Order Logic on Graphs with Local Cardinality Constraints";
    ACM Transactions on Computational Logic, 12 (2011), 2; S. 12:1 - 12:21.

    Zusätzliche Informationen
  806. Autor/in: Stefan Szeider, E192-03

     St. Szeider:
    "The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT";
    Discrete Optimization, 8 (2011), 1; S. 139 - 145.

    Zusätzliche Informationen
  807. Autor/innen: Mitra Tabaei Befrouei, E192-04; Chao Wang; Georg Weissenbacher, E192-04

     M. Tabaei Befrouei, C. Wang, G. Weissenbacher:
    "Abstraction and mining of traces to explain concurrency bugs";
    Formal Methods in System Design, 49 (2016), 1; S. 1 - 32.

    Zusätzliche Informationen
  808. Autor/innen: Richard Taupe; Antonius Weinzierl, E192-03; Gerhard Friedrich

     R. Taupe, A. Weinzierl, G. Friedrich:
    "Conflict Generalisation in ASP: Learning Correct and Effective Non-Ground Constraints";
    TPLP - Theory and Practice of Logic Programming, 20 (2020), 5; S. 799 - 814.

    Zusätzliche Informationen
  809. Autor/innen: Richard Taupe; Antonius Weinzierl, E192-03; Gerhard Friedrich

     R. Taupe, A. Weinzierl, G. Friedrich:
    "Conflict Generalisation in ASP: Learning Correct and Effective Non-Ground Constraints";
    ArXiv, 2008 (2020), 03100; 16 S.

    Zusätzliche Informationen
  810. Autor/innen: Stefan Theußl; Ingo Feinerer, E192-02; Kurt Hornik, WU Wien

     S. Theußl, I. Feinerer, K. Hornik:
    "A tm Plug-In for Distributed Text Mining in R";
    Journal of Statistical Software, 51 (2012), 5; S. 1 - 31.

    Zusätzliche Informationen
  811. Autor/innen: Matthias Thimm; Johannes Peter Wallner, E192-02

     M. Thimm, J. P. Wallner:
    "On the complexity of inconsistency measurement";
    Artificial Intelligence, 275 (2019), S. 411 - 456.

    Zusätzliche Informationen
  812. Autor/innen: Markus Triska; Nysret Musliu, E192-02

     M. Triska, N. Musliu:
    "An Effective Greedy Heuristic for the Social Golfer Problem";
    Annals of Operations Research, 194 (2012), 1; S. 413 - 425.

    Zusätzliche Informationen
  813. Autor/innen: Markus Triska, E192-02; Nysret Musliu, E192-02

     M. Triska, N. Musliu:
    "An improved SAT formulation for the social golfer problem";
    Annals of Operations Research, 194 (2012), 1; S. 427 - 438.
  814. Autor/innen: Miroslaw Truszczynski; Stefan Woltran, E192-02

     M. Truszczynski, S. Woltran:
    "Hyperequivalence of logic programs with respect to supported models";
    Annals of Mathematics and Artificial Intelligence, 53 (2009), 1-4; S. 331 - 365.

    Zusätzliche Informationen
  815. Autor/innen: Miroslaw Truszczynski; Stefan Woltran, E192-02

     M. Truszczynski, S. Woltran:
    "Relativized hyperequivalence of logic programs for modular programming";
    Theory and Practice of Logic Programming, Vol. 9 (2009), 6; S. 781 - 819.

    Zusätzliche Informationen
  816. Autor/innen: Sara Uckelman; Jesse Alama, E192-05; Aleks Knoks

     S. Uckelman, J. Alama, A. Knoks:
    "A curious dialogical logic and its composition problem";
    Journal of Philosophical Logic, 43 (2014), 6; S. 1065 - 1100.

    Zusätzliche Informationen
  817. Autor/innen: Ivor van der Hoog; Marc van Kreveld; Wouter Meulemans; Kevin Verbeek; Jules Wulms, E192-01

     I. van der Hoog, M. van Kreveld, W. Meulemans, K. Verbeek, J. Wulms:
    "Topological stability of kinetic k-centers";
    Theoretical Computer Science, 866 (2021), S. 145 - 159.

    Zusätzliche Informationen
  818. Autor/in: Trung Van Pham, E192-05

     T. Van Pham et al.:
    "Chip-firing game and a partial Tutte polynomial for Eulerian digraphs";
    Electronic Journal of Combinatorics, 23 (2016), 1.
  819. Autor/in: Trung Van Pham, E192-05

     T. Van Pham et al.:
    "The Reducts of the Homogeneous Binary Branching C-relation";
    Journal of Symbolic Logic, 81 (2016), 4; S. 1255 - 1297.
  820. Autor/in: Helmut Veith, E192-04

     H. Veith:
    "Special Issue: Games in Verification (foreword)";
    Journal of Computer and System Sciences, 78 (2012), 2; S. 393.

    Zusätzliche Informationen
  821. Autor/in: Thomas Vetterlein, E192-05

     T Vetterlein:
    "A way to interpret Lukasiewicz Logic and Basic Logic";
    Studia Logica, 90 (2008), S. 407 - 423.

    Zusätzliche Informationen
  822. Autor/in: Thomas Vetterlein, E192-05

     T Vetterlein:
    "Analytic calculi for logics of ordinal multiples of standard t-norms";
    Journal of Logic and Computation, 18 (2008), S. 35 - 57.

    Zusätzliche Informationen
  823. Autor/in: Thomas Vetterlein, E192-05

     T Vetterlein:
    "Boolean algebras with an automorphism group: a framework for Łukasiewicz logic";
    Journal of Multiple-Valued Logic and Soft Computing, 14 (2008), S. 51 - 67.

    Zusätzliche Informationen
  824. Autor/in: Thomas Vetterlein, E192-05

     T Vetterlein:
    "Fuzzy logic as a logic of the expressive strength of information";
    Soft Computing, 12 (2008), S. 479 - 485.

    Zusätzliche Informationen
  825. Autor/in: Thomas Vetterlein, E192-05

     T Vetterlein:
    "Regular left-continuous t-norms";
    Semigroup Forum, 77 (2008), S. 339 - 379.

    Zusätzliche Informationen
  826. Autor/in: Thomas Vetterlein, E192-05

     T Vetterlein:
    "Residuated lattices arising from equivalence relations on Boolean and Brouwerian algebras";
    Mathematical Logic Quarterly, 54 (2008), S. 325 - 342.

    Zusätzliche Informationen
  827. Autor/in: Thomas Vetterlein, E192-05

     T Vetterlein:
    "Weak effect algebras";
    Algebra Universalis, 58 (2008), S. 129 - 143.

    Zusätzliche Informationen
  828. Autor/innen: Yakir Vizel, Princeton; Georg Weissenbacher, E192-04; Sharad Malik, Princeton

     Y. Vizel, G. Weissenbacher, S. Malik:
    "Boolean Satisfiability Solvers and Their Applications in Model Checking";
    Proceedings of the IEEE (eingeladen), 103 (2015), 11; S. 2021 - 2035.

    Zusätzliche Informationen
  829. Autor/in: Sergei Vorobyov, E192-02

     S. Vorobyov:
    "Cyclic Games and Linear Programming";
    Discrete Applied Mathematics (eingeladen), Special Volume Dedicated to the Work of Leonid Khachiyan (2008), 11; S. 2195 - 2231.
  830. Autor/innen: Markus Wallinger, E192-01; Daniel Archambault, Swansea Universi ...; David Auber; Martin Nöllenburg, E192-01; Jaakko Peltonen

     M. Wallinger, D. Archambault, D. Auber, M. Nöllenburg, J. Peltonen:
    "Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach";
    IEEE Transactions on Visualization and Computer Graphics, 28 (2022), 1; S. 313 - 323.

    Zusätzliche Informationen
  831. Autor/innen: Markus Wallinger, E192-01; Ben Jacobsen; Stephen G. Kobourov; Martin Nöllenburg, E192-01

     M. Wallinger, B. Jacobsen, S.G. Kobourov, M. Nöllenburg:
    "On the Readability of Abstract Set Visualizations";
    IEEE Transactions on Visualization and Computer Graphics, 27 (2021), 6; S. 2821 - 2832.

    Zusätzliche Informationen
  832. Autor/in: Johannes Peter Wallner, E192-02

     J. P. Wallner:
    "Structural Constraints for Dynamic Operators in Abstract Argumentation";
    Argument & Computation, 11 (2020), 1-2; S. 151 - 190.

    Zusätzliche Informationen
  833. Autor/innen: Johannes Peter Wallner, E192-02; Andreas Niskanen; Matti Järvisalo

     J. P. Wallner, A. Niskanen, M. Järvisalo:
    "Complexity Results and Algorithms for Extension Enforcement in Abstract Argumentation";
    Journal of Artificial Intelligence Research, 60 (2017), S. 1 - 40.

    Zusätzliche Informationen
  834. Autor/innen: Antonius Weinzierl, E192-03; Bart Bogaerts; Jori Bomanson; Thomas Eiter, E192-03; Gerhard Friedrich; Tomi Janhunen; Tobias Kaminski, E192-03; Michael Langowski, E192-03; Lorenz Leutgeb; Gottfried Schenner, Siemens; Richard Taupe

     A. Weinzierl, B. Bogaerts, J. Bomanson, T. Eiter, G. Friedrich, T. Janhunen, T. Kaminski, M. Langowski, L. Leutgeb, G. Schenner, R. Taupe:
    "The Alpha Solver for Lazy-GroundingAnswer-Set Programming";
    ALP Newsletter (eingeladen), -- (2019), 12 S.
  835. Autor/innen: Antonius Weinzierl, E192-03; Richard Taupe; Gerhard Friedrich

     A. Weinzierl, R. Taupe, G. Friedrich:
    "Advancing Lazy-Grounding ASP Solving Techniques - Restarts, Phase Saving, Heuristics, and More";
    TPLP - Theory and Practice of Logic Programming, 20 (2020), 5; S. 609 - 624.

    Zusätzliche Informationen
  836. Autor/innen: Antonius Weinzierl, E192-03; Richard Taupe; Gerhard Friedrich

     A. Weinzierl, R. Taupe, G. Friedrich:
    "Advancing Lazy-Grounding ASP Solving Techniques - Restarts, Phase Saving, Heuristics, and More";
    ArXiv, 2008 (2020), 03526; 16 S.

    Zusätzliche Informationen
  837. Autor/innen: Daniel Weller; Stefan Hetzl, E192-05

     D. Weller, S. Hetzl:
    "Expansion Trees with Cut";
    CoRR - Computing Research Repository, abs/1308.0428 (2013), abs/1308.0428; S. 1 - 25.
  838. Autor/innen: Josef Widder, E192-04; Martin Biely, EPFL; Günther Gridling, E191-03; Bettina Weiss, E191-02; Jean-Paul Blanquart, Astrium Satellites

     J. Widder, M. Biely, G. Gridling, B. Weiss, J. Blanquart:
    "Consensus in the presence of mortal Byzantine faulty processes";
    Distributed Computing, 24 (2012), 6; S. 299 - 321.

    Zusätzliche Informationen
  839. Autor/innen: Magdalena Widl, E192-03; Nysret Musliu, E192-02

     M. Widl, N. Musliu:
    "The break scheduling problem: complexity results and practical algorithms";
    Memetic Computing, 6 (2014), 2; S. 97 - 112.

    Zusätzliche Informationen
  840. Autor/in: Franziskus Wiesnet, E192-05

     F. Wiesnet et al.:
    "A universal algorithm for Krull´s theorem";
    Information and Computation, 21 (2021).
  841. Autor/innen: Franziskus Wiesnet, E192-05; Thomas Powell

     F. Wiesnet, T. Powell:
    "Rates of convergence for asymptotically weakly contractive mappings in normed spaces";
    Numerical Functional Analysis and Optimization, 43 (2021).
  842. Autor/innen: Franziskus Wiesnet, E192-05; Helmut Schwichtenberg

     F. Wiesnet, H. Schwichtenberg:
    "Logic for exact real arithmetic";
    Logical Methods in Computer Science, 17 (2021), 2.
  843. Autor/innen: Felix Winter, E192-02; Marie-Louise Lackner, E192-02; Johannes Vass, E192-02; Nysret Musliu, E192-02

     F. Winter, M. Lackner, J. Vass, N. Musliu:
    "Exact and meta-heuristic approaches for the production leveling problem";
    Journal of Scheduling, 1 (2022), 1; S. 1 - 32.

    Zusätzliche Informationen
  844. Autor/innen: Felix Winter, E192-02; Nysret Musliu, E192-02

     F. Winter, N. Musliu:
    "A large neighborhood search approach for the paint shop scheduling problem";
    Journal of Scheduling, 24 (2021), 6; S. 1 - 23.

    Zusätzliche Informationen
  845. Autor/innen: Felix Winter, E192-02; Nysret Musliu, E192-02

     F. Winter, N. Musliu:
    "