TU Wien Informatics

20 Years
Overview
Services
Office of the Dean Infrastructure Communications eduLAB
Institutes
Computer Engineering Information Systems Engineering Logic and Computation Visual Computing and Human-Centered Technology
Research Units
Algorithms and Complexity Artifact-based Computing and User Research Artificial Intelligence Techniques Automation Systems Business Informatics Compilers and Languages Computer Graphics Computer Vision Cyber-Physical Systems Data Science Databases and Artificial Intelligence Distributed Systems Embedded Computing Systems Formal Methods in Systems Engineering Human Computer Interaction Knowledge-Based Systems Machine Learning Parallel Computing Privacy Enhancing Technologies Security and Privacy Software Engineering Theory and Logic Virtual and Augmented Reality Visual Analytics

Databases and Artificial Intelligence E192-02

  • A Research Unit of The Institute of Logic and Computation

Our research is located at the interface between methods from Theoretical Computer Science (such as logic, algorithmics, approximation, and complexity theory) and their application to various areas of Computer Science such as Database Theory, Artificial Intelligence, Knowledge Representation & Reasoning, Scheduling and Planning, as well as Graph Theory.

Research Unit Databases and Artificial Intelligence

Contact

On This Page

About People Activities

About

Our research is located at the interface between methods from Theoretical Computer Science (such as logic, algorithmics, approximation, and complexity theory) and their application to various areas of Computer Science such as Database Theory, Artificial Intelligence, Knowledge Representation & Reasoning, Scheduling and Planning, as well as Graph Theory.

The overall research goal of our work is to understand the inherent computational complexity of problems in those areas, and then use these insights to define novel concepts and algorithms towards efficient practical solutions.

More specifically, topics covered by our research include Database Query Languages, Information Integration, the Semantic Web, Description Logics, Ontology-based Data Access, Formal Argumentation, Belief Change, Computational Social Choice, Answer-set Programming, Automated Timetabling and Scheduling.

The research Unit Databases and Artificial Intelligence is part of the Institute of Logic and Computation.

Georg Gottlob
Georg Gottlob G. Gottlob

Full Professor / On Leave
O.Univ.Prof. DI Dr.

Katja Hose
Katja Hose K. Hose

Full Professor
Univ.Prof. Dr. Dipl.-Inf.

Matthias Paul Lanzinger
Matthias Paul Lanzinger M. Lanzinger

Assistant Professor
Asst.Prof. DI Dr. / BSc

Nysret Musliu
Nysret Musliu N. Musliu

Associate Professor
Assoc.Prof. DI Dr.

Reinhard Pichler
Reinhard Pichler R. Pichler

Full Professor
Univ.Prof. Mag. Dr.

Emanuel Sallinger
Emanuel Sallinger E. Sallinger

Associate Professor
Assoc.Prof. DI Mag. Dr. Dr.

Mantas Simkus
Mantas Simkus M. Simkus

Assistant Professor
Asst.Prof. Dr. / MSc

Stefan Woltran
Stefan Woltran S. Woltran

Head of Research Unit
Univ.Prof. DI Dr.

Mohammad Mahdi Azarbeik
Mohammad Mahdi Azarbeik M. Azarbeik

PreDoc Researcher
MA

Michael Bernreiter
Michael Bernreiter M. Bernreiter

PreDoc Researcher
DI / BSc

Giovanni Buraglio
Giovanni Buraglio G. Buraglio

PreDoc Researcher
Mag.

Eda Cicek
Eda Cicek E. Cicek

PreDoc Researcher
MSc

Philipp Danzinger
Philipp Danzinger P. Danzinger

PreDoc Researcher
DI / BSc

Federica Di Stefano
Federica Di Stefano F. Di Stefano

PreDoc Researcher
Mag.

Wolfgang Dvorak
Wolfgang Dvorak W. Dvorak

Senior Lecturer
DI DI Dr.

Nikolaus Frohner
Nikolaus Frohner N. Frohner

PostDoc Researcher
DI Dr. / BSc

Ida Gjergji
Ida Gjergji I. Gjergji

PreDoc Researcher
MSc

Lukas Grasmann
Lukas Grasmann L. Grasmann

PreDoc Researcher
DI / BSc

Jonas Philipp Haldimann
Jonas Philipp Haldimann J. Haldimann

PreDoc Researcher

Matthias Horn
Matthias Horn M. Horn

PostDoc Researcher
DI Dr. / BSc

Eszter Iklodi
Eszter Iklodi E. Iklodi

PreDoc Researcher / On Leave
MSc

Fabian Jogl
Fabian Jogl F. Jogl

PreDoc Researcher
DI / BSc

Lucas Kletzander
Lucas Kletzander L. Kletzander

PostDoc Researcher
DI Dr. / BSc

Matthias König
Matthias König M. König

PreDoc Researcher
DI / BSc

Marie-Louise Lackner
Marie-Louise Lackner M. Lackner

PostDoc Researcher
DI Dr.

Martin Lackner
Martin Lackner M. Lackner

PostDoc Researcher / On Leave
DI Dr.

Ilya Lasy
Ilya Lasy I. Lasy

PreDoc Researcher
MSc

Patrick Malik
Patrick Malik P. Malik

PreDoc Researcher
DI / BSc

Jan Maly
Jan Maly J. Maly

PostDoc Researcher
Dr. / MSc

Tommaso Mannelli Mazzoli
Tommaso Mannelli Mazzoli T. Mannelli Mazzoli

PreDoc Researcher
Mag.

Timo Merkl
Timo Merkl T. Merkl

PreDoc Researcher
DI / BSc

Florian Mischek
Florian Mischek F. Mischek

PostDoc Researcher
DI Dr. / BSc

Oliviero Nardi
Oliviero Nardi O. Nardi

PreDoc Researcher
MSc

Walter Palmetshofer
Walter Palmetshofer W. Palmetshofer

PreDoc Researcher
Mag.

Aleksandar Pavlovic
Aleksandar Pavlovic A. Pavlovic

PreDoc Researcher
DI / BSc

Zeynep Gözen Saribatur Yaman
Zeynep Gözen Saribatur Yaman Z. Saribatur Yaman

PostDoc Researcher / On Leave
Dr. / MSc

Alexander Selzer
Alexander Selzer A. Selzer

PreDoc Researcher
DI / BSc

Sebastian Skritek
Sebastian Skritek S. Skritek

Senior Lecturer
DI Dr.

Dominik Tomaszuk
Dominik Tomaszuk D. Tomaszuk

PostDoc Researcher
PhD

Daniel Unterberger
Daniel Unterberger D. Unterberger

PreDoc Researcher
DI / BSc

Felix Winter
Felix Winter F. Winter

PostDoc Researcher
DI Dr. / BSc

Anders Björkelund
Anders Björkelund A. Björkelund

Visiting Scientist

Maia Campanale
Maia Campanale M. Campanale

Visiting Scientist

Eva Giralt Steinhauer
Eva Giralt Steinhauer E. Giralt Steinhauer

Visiting Scientist

Dominic Hillerkuss
Dominic Hillerkuss D. Hillerkuss

Visiting Scientist

Lucian-Mihai Itu
Lucian-Mihai Itu L. Itu

Visiting Scientist

Adam Knowles
Adam Knowles A. Knowles

Visiting Scientist

Sokratis Komaris
Sokratis Komaris S. Komaris

Visiting Scientist

George Vasile Marica
George Vasile Marica G. Marica

Visiting Scientist

Dharmesh Mistry
Dharmesh Mistry D. Mistry

Visiting Scientist

Ivan Olier-Caparroso
Ivan Olier-Caparroso I. Olier-Caparroso

Visiting Scientist

Sandra Ortega Martorell
Sandra Ortega Martorell S. Ortega Martorell

Visiting Scientist

Domenec Puig
Domenec Puig D. Puig

Visiting Scientist

Hatem A. Rashwan
Hatem A. Rashwan H. Rashwan

Visiting Scientist

Konstantinos Risvas
Konstantinos Risvas K. Risvas

Visiting Scientist

Tomer Sagi
Tomer Sagi T. Sagi

Visiting Scientist
PhD

Manuela Daniela Voinea
Manuela Daniela Voinea M. Voinea

Visiting Scientist

Gaurav Yadav
Gaurav Yadav G. Yadav

Visiting Scientist

Juliane Auerböck
Juliane Auerböck J. Auerböck

Office Services

Markus Bartel
Markus Bartel M. Bartel

IT Services
MSc

Matthias Nitzschke
Matthias Nitzschke M. Nitzschke

IT Services

Daniela Böhm
Daniela Böhm D. Böhm

Student Staff
BSc

Anoki Max Eischer
Anoki Max Eischer A. Eischer

Student Staff
BSc

Lukas Frühwirth
Lukas Frühwirth L. Frühwirth

Student Staff
BA

Hannes Mayrhofer
Hannes Mayrhofer H. Mayrhofer

Student Staff
BSc

Matthias Moik
Matthias Moik M. Moik

Student Staff
BSc

Esther Shifra Mugdan
Esther Shifra Mugdan E. Mugdan

Student Staff
BSc

Andrea Ortner
Andrea Ortner A. Ortner

Student Staff
BSc

Kaan Unalan
Kaan Unalan K. Unalan

Student Staff
BSc

Rudolf Mayer
Rudolf Mayer R. Mayer

Lecturer
Mag. DI

Marion Oswald
Marion Oswald M. Oswald

Lecturer
DI Dr.

2024W

2025S

 

2024

2023

  • How does knowledge evolve in open knowledge graphs? / Polleres, A., Pernisch, R., Bonifati, A., Dell’Aglio, D., Dobriy, D., Dumbrava, S., Etcheverry, L., Ferranti, N., Hose, K., Jiménez-Ruiz, E., Lissandrini, M., Scherp, A., Tommasini, R., & Wachs, J. (2023). How does knowledge evolve in open knowledge graphs? Transactions on Graph Data and Knowledge, 1(1), 11:1-11:59. https://doi.org/10.4230/TGDK.1.1.11
    Download: PDF (4.16 MB)
  • Optimizing SPARQL queries over decentralized knowledge graphs / Aebeloe, C., Montoya, G., & Hose, K. (2023). Optimizing SPARQL queries over decentralized knowledge graphs. Semantic Web, 14(6), 1121–1165. https://doi.org/10.3233/SW-233438
    Download: PDF (2.07 MB)
  • Tunable Query Optimizer for Web APIs and User Preferences / Zeimetz, T., Hose, K., & Schenkel, R. (2023). Tunable Query Optimizer for Web APIs and User Preferences. In B. Venable, D. Garijoa, & B. Jalaian (Eds.), Proceedings of the 12th Knowledge Capture Conference 2023 (pp. 92–100). Association for Computing Machinery (ACM). https://doi.org/10.1145/3587259.3627542
  • StarBench: Benchmarking RDF-star Triplestores / Abouda, G., Aebeloe, C., Dell’Aglio, D., Keen, A., & Hose, K. (2023). StarBench: Benchmarking RDF-star Triplestores. In M. U. Saleem, A.-C. Ngonga Ngomo, D. Graux, F. Orlandi, E. Niazmand, G. Ydler, & M.-E. Vidal (Eds.), Joint Proceedings of the QuWeDa and MEPDaW 2023: 7th Workshop on Storing, Querying and Benchmarking Knowledge Graphs and 9th Workshop on Managing the Evolution and Preservation of the Data Web (QuWeDa-MEPDaW 2023) (pp. 34–49). CEUR-WS.org. https://doi.org/10.34726/5399
    Download: PDF (1.05 MB)
  • EA ModelSet – A FAIR Dataset for Machine Learning in Enterprise Modeling / Glaser, P.-L., Sallinger, E., & Bork, D. (2023). EA ModelSet – A FAIR Dataset for Machine Learning in Enterprise Modeling. In J. P. A. Almeida, M. Kaczmarek-Heß, A. Koschmider, & H. Proper (Eds.), The Practice of Enterprise Modeling : 16th IFIP Working Conference, PoEM 2023, Vienna, Austria, November 28 – December 1, 2023, Proceedings (pp. 19–36). Springer. https://doi.org/10.1007/978-3-031-48583-1_2
    Project: DEMO (2022–2024)
  • GInRec: A Gated Architecture for Inductive Recommendation using Knowledge Graphs / Jendal, T., Lissandrini, M., Dolog, P., & Hose, K. (2023). GInRec: A Gated Architecture for Inductive Recommendation using Knowledge Graphs. In V. W. Anelli, P. Basile, G. De Melo, F. Donini, A. Ferrara, C. Musto, F. Narducci, A. Ragone, & M. Zanker (Eds.), Proceedings of the Fifth Knowledge-aware and Conversational Recommender Systems Workshop co-located with 17th ACM Conference on Recommender Systems (RecSys 2023) (pp. 80–89). CEUR-WS.org. https://doi.org/10.34726/5395
    Download: PDF (557 KB)
  • Constrained Derivation in Assumption-Based Argumentation / Buraglio, G., Dvořák, W., Rapberger, A., & Woltran, S. (2023). Constrained Derivation in Assumption-Based Argumentation. In G. Alfano & S. Ferilli (Eds.), Proceedings of the 7th Workshop on Advances in Argumentation in Artificial Intelligence (AI^3 2023). CEUR-WS.org. https://doi.org/10.34726/5385
    Download: PDF (1.16 MB)
    Project: REVEAL-AI (2020–2024)
  • Fractional covers of hypergraphs with bounded multi-intersection / Gottlob, G., Lanzinger, M., Pichler, R., & Razgon, I. (2023). Fractional covers of hypergraphs with bounded multi-intersection. Theoretical Computer Science, 979, Article 114204. https://doi.org/10.1016/j.tcs.2023.114204
    Download: Paper (460 KB)
    Projects: DeConquer (2023–2027) / HyperTrac (2018–2022)
  • A claim-centric perspective on abstract argumentation semantics: Claim-defeat, principles, and expressiveness / Dvořák, W., Rapberger, A., & Woltran, S. (2023). A claim-centric perspective on abstract argumentation semantics: Claim-defeat, principles, and expressiveness. Artificial Intelligence, 324, Article 104011. https://doi.org/10.1016/j.artint.2023.104011
    Download: PDF (1.17 MB)
    Project: REVEAL-AI (2020–2024)
  • SparqLog: A System for Efficient Evaluation of SPARQL 1.1 Queries via Datalog / Angles, R., Gottlob, G., Pavlović, A., Pichler, R., & Sallinger, E. (2023). SparqLog: A System for Efficient Evaluation of SPARQL 1.1 Queries via Datalog. Proceedings of the VLDB Endowment, 16(13), 4240–4253. https://doi.org/10.14778/3625054.3625061
    Download: PDF (837 KB)
    Projects: KnowledgeGraph (2020–2028) / SustainGraph (2023–2025)
  • Circumscription in DL-Lite: Progress Report / Bonatti, P., Di Stefano, F., Ortiz, M., & Šimkus, M. (2023). Circumscription in DL-Lite: Progress Report. In O. Kutz, C. Lutz, & A. Ozaki (Eds.), Proceedings of the 36th International Workshop on Description Logics (DL 2023) co-located with the 20th International Conference on Principles of Knowledge Representation and Reasoning  (KR 2023). CEUR-WS.org. https://doi.org/10.34726/5328
    Download: PDF (1.28 MB)
    Projects: KtoAPP (2018–2025) / OMEGA (2017–2022)
  • Reconciling SHACL and Ontologies: Semantics and Validation via Rewriting (Extended Abstract) / Ahmetaj, S., Ortiz de la Fuente, M. M., Oudshoorn, A. M., & Simkus, M. (2023). Reconciling SHACL and Ontologies: Semantics and Validation via Rewriting (Extended Abstract). In Proceedings of the 36th International Workshop on Description Logics (DL 2023), co-located with the 20th International Conference on Principles of Knowledge Representation and Reasoning and the 21st International Workshop on Non-Monotonic Reasoning (KR 2023 and NMR 2023). 36th International Workshop on Description Logics (DL 2023), Rhodos, Greece. CEUR-WS.org. https://doi.org/10.34726/5397
    Download: PDF (988 KB)
    Projects: FRESH (2021–2025) / KtoAPP (2018–2025)
  • GLENDA: Querying RDF Archives with Full SPARQL / Pelgrin, O., Taelman, R., Galárraga, L., & Hose, K. (2023). GLENDA: Querying RDF Archives with Full SPARQL. In The Semantic Web: ESWC 2023 Satellite Events (pp. 75–80). Springer. https://doi.org/10.34726/5411
  • Truth and Preferences - A Game Approach for Qualitative Choice Logic / Freiman, R., & Bernreiter, M. (2023). Truth and Preferences - A Game Approach for Qualitative Choice Logic. In S. A. Gaggl, M. V. Martinez, & M. Ortiz (Eds.), Logics in Artificial Intelligence - 18th European Conference, JELIA 2023, Dresden, Germany, September 20-22, 2023, Proceedings (pp. 547–560). https://doi.org/10.1007/978-3-031-43619-2\_37
  • From Qualitative Choice Logic to Abstract Argumentation / Bernreiter, M., & König, M. (2023). From Qualitative Choice Logic to Abstract Argumentation. In Proceedings of the Twentieth International Conference on Principles of Knowledge Representation and Reasoning (pp. 737–741). International Joint Conferences on Artificial Intelligence Organization. https://doi.org/10.24963/kr.2023/73
    Project: HYPAR (2019–2024)
  • Worbel: aggregating point labels into word clouds / Bhore, S., Ganian, R., Li, G., Nöllenburg, M., & Wulms, J. (2023). Worbel: aggregating point labels into word clouds. ACM Transactions on Spatial Algorithms and Systems, 9(3), Article 19. https://doi.org/10.1145/3603376
    Download: PDF (6.17 MB)
    Projects: HumAlgo (2018–2023) / Parameterisierte Analyse in der Künstlichen Intelligenz (2021–2026)
  • Sets Attacking Sets in Abstract Argumentation / Dimopoulos, Y., Dvořák, W., König, M., Rapberger, A., Ulbricht, M., & Woltran, S. (2023). Sets Attacking Sets in Abstract Argumentation. In K. Sauterwald & M. Thimm (Eds.), Proceedings of the 21st International Workshop on Non-Monotonic Reasoning, co-located with the 20th International Conference on Principles of Knowledge Representation and Reasoning (KR 2023) and co-located with the 36th International Workshop on Description Logics (DL 2023) (pp. 22–31). CEUR-WS.org. https://doi.org/10.34726/5386
    Download: PDF (1.39 MB)
    Projects: HYPAR (2019–2024) / REVEAL-AI (2020–2024)
  • Multi-Objective Policy Evolution for a Same-Day Delivery Problem with Soft Deadlines / Frohner, N., Raidl, G., & Chicano, F. (2023). Multi-Objective Policy Evolution for a Same-Day Delivery Problem with Soft Deadlines. In GECCO ’23 Companion: Proceedings of the Companion Conference on Genetic and Evolutionary Computation (pp. 1941–1949). Association for Computing Machinery. https://doi.org/10.1145/3583133.3596381
  • Leveraging problem-independent hyper-heuristics for real-world test laboratory scheduling / Mischek, F., & Musliu, N. (2023). Leveraging problem-independent hyper-heuristics for real-world test laboratory scheduling. In GECCO ’23: Proceedings of the Genetic and Evolutionary Computation Conference (pp. 321–329). Association for Computing Machinery (ACM). https://doi.org/10.1145/3583131.3590354
    Download: PDF (599 KB)
    Project: ARTIS (2017–2024)
  • Metagenomic Binning using Connectivity-constrained Variational Autoencoders / Lamurias, A., Tibo, A., Hose, K., Albertsen, M., & Nielsen, T. D. (2023). Metagenomic Binning using Connectivity-constrained Variational Autoencoders. In Proceedings of the 40th International Conference on Machine Learning. 40th International Conference on Machine Learning (ICML 2023), Honolulu, United States of America (the).
  • Grounding Planning Tasks Using Tree Decompositions and Iterated Solving / Corrêa, A., Hecher, M., Helmert, M., Longo, D. M., Pommerening, F., & Woltran, S. (2023). Grounding Planning Tasks Using Tree Decompositions and Iterated Solving. In Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling (pp. 100–108). Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/icaps.v33i1.27184
    Download: All rights reserved (174 KB)
    Projects: DK - Logic (2014–2023) / HYPAR (2019–2024) / HyperTrac (2018–2022) / REVEAL-AI (2020–2024)
  • Dynamic Weight Setting for Personnel Scheduling with Many Objectives / Kletzander, L., & Musliu, N. (2023). Dynamic Weight Setting for Personnel Scheduling with Many Objectives. In S. Koenig, R. Stern, & M. Vallati (Eds.), Proceedings of the Thirty-Third International Conference on Automated  Planning and Scheduling (pp. 509–517). AAAI Press. https://doi.org/10.1609/icaps.v33i1.27231
    Download: All rights reserved (152 KB)
    Project: ARTIS (2017–2024)
  • Validity in Choice Logics - A Game-Theoretic Investigation / Freiman, R., & Bernreiter, M. (2023). Validity in Choice Logics - A Game-Theoretic Investigation. In H. H. Hansen, A. Scedrov, & R. J. G. B. de Queiroz (Eds.), Logic, Language, Information, and Computation - 29th InternationalWorkshop, WoLLIC 2023, Halifax, NS, Canada, July 11-14, 2023, Proceedings (pp. 211–226). Springer. https://doi.org/10.1007/978-3-031-39784-4_13
    Project: SEGACAB (2019–2023)
  • The Effect of Preferences in Abstract Argumentation under a Claim-Centric View / Bernreiter, M., Dvořák, W., Rapberger, A., & Woltran, S. (2023). The Effect of Preferences in Abstract Argumentation under a Claim-Centric View. In Proceedings of the 37th AAAI Conference on Artificial Intelligence (AAAI-23) (pp. 6253–6261). AAAI Press. https://doi.org/10.1609/AAAI.V37I5.25770
    Download: All rights reserved (141 KB)
    Projects: DK - Logic (2014–2023) / REVEAL-AI (2020–2024) / START (2014–2022)
  • Proportionality in Approval-Based Participatory Budgeting / Brill, M., Forster, S., Lackner, M., Maly, J., & Peters, J. (2023). Proportionality in Approval-Based Participatory Budgeting. In Proceedings of the 37th AAAI Conference on Artificial Intelligence (pp. 5524–5531). AAAI Press. https://doi.org/10.1609/aaai.v37i5.25686
    Download: All rights reserved (149 KB)
    Projects: HolisticPB (2021–2024) / SuDeMa (2019–2025)
  • Large-State Reinforcement Learning for Hyper-Heuristics / Kletzander, L., & Musliu, N. (2023). Large-State Reinforcement Learning for Hyper-Heuristics. In Proceedings of the 37th AAAI Conference on Artificial Intelligence (pp. 12444–12452). AAAI Press. https://doi.org/10.1609/aaai.v37i10.26466
    Download: All rights reserved (134 KB)
    Project: ARTIS (2017–2024)
  • Proportional Decisions in Perpetual Voting / Lackner, M., & Maly, J. (2023). Proportional Decisions in Perpetual Voting. In Proceedings of the 37th AAAI Conference on Artificial Intelligence (pp. 5722–5729). AAAI Press. https://doi.org/10.1609/aaai.v37i5.25710
    Download: All rights reserved (160 KB)
    Projects: HolisticPB (2021–2024) / SuDeMa (2019–2025)
  • Generalizing Bulk-Synchronous Parallel Processing for Data Science: From Data to Threads and Agent-Based Simulations / Tian, Z., Lindner, P., Nissl, M., Koch, C., & Tannen, V. (2023). Generalizing Bulk-Synchronous Parallel Processing for Data Science: From Data to Threads and Agent-Based Simulations. Proceedings of the ACM on Management of Data (PACMMOD), 1(2), 1–28. https://doi.org/10.34726/5391
    Download: Paper (844 KB)
    Project: KnowledgeGraph (2020–2028)
  • Patient Event Sequences for Predicting Hospitalization Length of Stay / Hansen, E. R., Nielsen, T. D., Mulvad, T., Strausholm, M. N., Sagi, T., & Hose, K. (2023). Patient Event Sequences for Predicting Hospitalization Length of Stay. In J. M. Juarez, M. Marcos, G. Stiglic, & A. Tucker (Eds.), Artificial Intelligence in Medicine : 21st International Conference on Artificial Intelligence in Medicine, AIME 2023, Portorož, Slovenia, June 12–15, 2023, Proceedings (pp. 51–56). Springer. https://doi.org/10.1007/978-3-031-34344-5_7
  • SHACTOR: Improving the Quality of Large-Scale Knowledge Graphs with Validating Shapes / Rabbani, K., Lissandrini, M., & Hose, K. (2023). SHACTOR: Improving the Quality of Large-Scale Knowledge Graphs with Validating Shapes. In Companion of the 2023 International Conference on Management of Data (pp. 151–154). https://doi.org/10.1145/3555041.3589723
  • Towards Efficient Annotation Databases / Heinzl, R., Nissl, M., & Sallinger, E. (2023). Towards Efficient Annotation Databases. In B. Kimelfeld, M. V. Martinez, & R. Angles (Eds.), Proceedings of the 15th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW 2023). CEUR-WS.org. https://doi.org/10.34726/5427
    Download: PDF (2.12 MB)
    Projects: DeConquer (2023–2027) / KnowledgeGraph (2020–2028) / SustainGraph (2023–2025)
  • Model-Independent Design of Knowledge Graphs / Bellomarini, L., Gentili, A., Laurenza, E., & Sallinger, E. (2023). Model-Independent Design of Knowledge Graphs. In Proceedings of the 15th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW 2023). AMW 2023 - 15th Alberto Mendelzon International Workshop on Foundations of Data Management, Santiago de Chile, Chile. CEUR-WS.org. https://doi.org/10.34726/5426
    Download: PDF (1.84 MB)
    Projects: DeConquer (2023–2027) / KnowledgeGraph (2020–2028) / SustainGraph (2023–2025)
  • Exact methods for the Oven Scheduling Problem / Lackner, M.-L., Mrkvicka, C., Musliu, N., Walkiewicz, D., & Winter, F. (2023). Exact methods for the Oven Scheduling Problem. Constraints, 28(2), 320–361. https://doi.org/10.1007/s10601-023-09347-2
    Download: PDF (731 KB)
    Project: ARTIS (2017–2024)
  • Recommending tasks based on search queries and missions / Garigliotti, D., Balog, K., Hose, K., & Bjerva, J. (2023). Recommending tasks based on search queries and missions. Natural Language Engineering, 1–25. https://doi.org/10.1017/S1351324923000219
  • Visualizing How-Provenance Explanations for SPARQL Queries / Galárraga, L., Hernández, D., Katim, A., & Hose, K. (2023). Visualizing How-Provenance Explanations for SPARQL Queries. In WWW ’23 Companion: Companion Proceedings of the ACM Web Conference 2023 (pp. 212–216). Association for Computing Machinery. https://doi.org/10.1145/3543873.3587350
  • The biggest business process management problems to solve before we die / Beerepoot, I., Di Ciccio, C., Reijers, H. A., Rinderle-Ma, S., Bandara, W., Burattin, A., Calvanese, D., Chen, T., Cohen, I., Depaire, B., Di Federico, G., Dumas, M., van Dun, C., Fehrer, T., Fischer, D. A., Gal, A., Indulska, M., Isahagian, V., Klinkmüller, C., … Zerbato, F. (2023). The biggest business process management problems to solve before we die. Computers in Industry, 146, Article 103837. https://doi.org/10.1016/j.compind.2022.103837
    Download: PDF (3.65 MB)
    Projects: KtoAPP (2018–2025) / OMEGA (2017–2022)
  • OntoEval: an Automated Ontology Evaluation System / Antonio Zaitoun, Tomer Sagi, & Katja Hose. (2023). OntoEval: an Automated Ontology Evaluation System. In Y. Ding, J. Tang, & J. Sequeda (Eds.), WWW ’23 Companion: Companion Proceedings of the ACM Web Conference 2023 (pp. 82–85). Association for Computing Machinery. https://doi.org/10.1145/3543873.3587318
  • Scientific Data Extraction from Oceanographic Papers / Veyhe, B. E., Sagi, T., & Hose, K. (2023). Scientific Data Extraction from Oceanographic Papers. In Y. Ding, J. Tang, J. Sequeda, C. Castillo, & G.-J. Houben (Eds.), WWW ’23 Companion: Companion Proceedings of the ACM Web Conference 2023 (pp. 800–804). Association for Computing Machinery. https://doi.org/10.1145/3543873.3587595
  • Do bridges dream of water pollutants? Towards DreamsKG, a knowledge graph to make digital access for sustainable environmental assessment come true / Garigliotti, D., Bjerva, J., Nielsen, F., Butzbach, A., Lyhne, I., Kørnøv, L., & Hose, K. (2023). Do bridges dream of water pollutants? Towards DreamsKG, a knowledge graph to make digital access for sustainable environmental assessment come true. In Y. Ding, J. Tang, & J. Sequeda (Eds.), WWW ’23 Companion: Companion Proceedings of the ACM Web Conference 2023 (pp. 724–730). ACM. https://doi.org/10.1145/3543873.3587590
  • Automated Ontology Evaluation: Evaluating Coverage and Correctness using a Domain Corpus / Zaitoun, A., Sagi, T., & Hose, K. (2023). Automated Ontology Evaluation: Evaluating Coverage and Correctness using a Domain Corpus. In Y. Ding, J. Tang, & J. Sequeda (Eds.), WWW ’23 Companion: Companion Proceedings of the ACM Web Conference 2023 (pp. 1127–1137). Association for Computing Machinery. https://doi.org/10.1145/3543873.3587617
    Download: PDF (948 KB)
  • The complexity landscape of claim-augmented argumentation frameworks / Dvořák, W., Greßler, A., Rapberger, A., & Woltran, S. (2023). The complexity landscape of claim-augmented argumentation frameworks. Artificial Intelligence, 317, Article 103873. https://doi.org/10.1016/j.artint.2023.103873
    Download: Paper (1.12 MB)
    Projects: HYPAR (2019–2024) / REVEAL-AI (2020–2024)
  • Convergence of datalog over (pre-)semirings / Khamis, M. A., Ngo, H. Q., Pichler, R., Suciu, D., & Wang, Y. R. (2023). Convergence of datalog over (pre-)semirings. SIGMOD RECORD, 52(1), 75–82. https://doi.org/10.1145/3604437.3604454
    Project: DeConquer (2023–2027)
  • Answer-Set Programming for Lexicographical Makespan Optimisation in Parallel Machine Scheduling / EITER, T., GEIBINGER, T., MUSLIU, N., OETSCH, J., SKOČOVSKÝ, P., & STEPANOVA, D. (2023). Answer-Set Programming for Lexicographical Makespan Optimisation in Parallel Machine Scheduling. Theory and Practice of Logic Programming, 23(6), 1281–1306. https://doi.org/10.1017/S1471068423000017
  • Multi-Winner Voting with Approval Preferences / Lackner, M., & Skowron, P. (2023). Multi-Winner Voting with Approval Preferences. Springer. https://doi.org/10.1007/978-3-031-09016-5
    Project: SuDeMa (2019–2025)
  • The Need for Better RDF Archiving Benchmarks / Pelgrin, O., Taelman, R., Galárraga, L., & Hose, K. (2023). The Need for Better RDF Archiving Benchmarks. In M. Saleem, A.-C. Ngonga Ngomo, D. Graux, F. Orlandi, E. Niazmand, G. Ydler, & M.-E. Vidal (Eds.), Joint Proceedings of the QuWeDa and MEPDaW 2023: 7th Workshop on Storing, Querying and Benchmarking Knowledge Graphs and 9th Workshop on Managing the Evolution and Preservation of the Data Web (QuWeDa-MEPDaW 2023) (pp. 50–54). https://doi.org/10.34726/5398
    Download: Paper (1010 KB)
  • Graph Neural Networks for Metagenomic Binning / Lamurias, A., Tibo, A., Hose, K., Albertsen, M., & Nielsen, T. D. (2023). Graph Neural Networks for Metagenomic Binning. In The 2023 ICML Workshop on Computational Biology. Accepted Submissions. 40th International Conference on Machine Learning (ICML 2023), Honolulu, United States of America (the). ICML compbio workshop. https://doi.org/10.34726/5406
    Download: PDF (441 KB)
  • Environmental impact assessment reports in Wikidata and a Wikibase / Nielsen, F. Å., Lyhne, I., Garigliotti, D., Butzbach, A., Ravn Boess, E., Hose, K., & Kørnøv, L. (2023). Environmental impact assessment reports in Wikidata and a Wikibase. In Joint Proceedings of the ESWC 2023 Workshops and Tutorials co-located with 20th European Semantic Web Conference (ESWC 2023) (pp. 1–8). CEUR-WS.org. https://doi.org/10.34726/5421
    Download: PDF (1.53 MB)
  • Extraction of validating shapes from very large knowledge graphs / Rabbani, K., Lissandrini, M., & Hose, K. (2023). Extraction of validating shapes from very large knowledge graphs. Proceedings of the VLDB Endowment, 16(5), 1023–1032. https://doi.org/10.14778/3579075.3579078
    Download: Paper (1.84 MB)
  • On the Structural Complexity of Grounding - Tackling the ASP Grounding Bottleneck via Epistemic Programs and Treewidth / Besin, V., Hecher, M., & Woltran, S. (2023). On the Structural Complexity of Grounding - Tackling the ASP Grounding Bottleneck via Epistemic Programs and Treewidth. In K. Gal, A. Nowé, G. J. Nalepa, R. Fairstein, & R. Raduelscu (Eds.), ECAI 2023 : 26th European Conference on Artificial Intelligence, September 30–October 4, 2023, Kraków, Poland. Including 12th Conference on Prestigious Applications of Intelligent Systems (PAIS 2023). Proceedings (pp. 247–254). IOS Press. https://doi.org/10.3233/FAIA230277
    Download: PDF (385 KB)
    Projects: HYPAR (2019–2024) / REVEAL-AI (2020–2024)
  • Expressiveness of SETAFs and support-free ADFs under 3-valued semantics / Dvořák, W., Keshavarzi Zafarghandi, A., & Woltran, S. (2023). Expressiveness of SETAFs and support-free ADFs under 3-valued semantics. Journal of Applied Non-Classical Logics, 33(3–4), 298–327. https://doi.org/10.1080/11663081.2023.2244361
  • On the Expressive Power of Ontology-Mediated Queries: Capturing coNP / Lukumbuzya, S., Ortiz de la Fuente, M. M., & Simkus, M. (2023). On the Expressive Power of Ontology-Mediated Queries: Capturing coNP. In O. Kutz, C. Lutz, & A. Ozaki (Eds.), Proceedings of the 36th International Workshop on Description Logics (DL 2023) co-located with the 20th International Conference on Principles of Knowledge Representation and Reasoning  (KR 2023). CEUR-WS.org. https://doi.org/10.34726/5333
    Download: PDF (1.88 MB)
    Project: KtoAPP (2018–2025)
  • Integration of Skyline Queries into Spark SQL / Grasmann, L., Pichler, R., & Selzer, A. (2023). Integration of Skyline Queries into Spark SQL. In F. Geerts & B. Vandevoort (Eds.), Proceedings 26th International Conference on Extending Database Technology (EDBT 2023) (pp. 337–350). OpenProceedings.org. https://doi.org/10.48786/edbt.2023.27
    Download: PDF (1.98 MB)
    Projects: HyperTrac (2018–2022) / KnowledgeGraph (2020–2028)
  • Abstract argumentation with conditional preferences / Bernreiter, M., Dvořák, W., & Woltran, S. (2023). Abstract argumentation with conditional preferences. Argument & Computation, 1–29. https://doi.org/10.34726/5479
    Download: PDF (633 KB)
    Projects: HYPAR (2019–2024) / REVEAL-AI (2020–2024)
  • Reasoning over Financial Scenarios with the Vadalog System / Baldazzi, T., Bellomarini, L., & Sallinger, E. (2023). Reasoning over Financial Scenarios with the Vadalog System. In Proceedings 26th International Conference on Extending Database Technology (EDBT 2023) (pp. 782–791). OpenProceedings.org. https://doi.org/10.48786/edbt.2023.66
    Download: PDF (1.46 MB)
    Project: KnowledgeGraph (2020–2028)
  • ExpressivE: A Spatio-Functional Embedding For Knowledge Graph Completion / Pavlović, A., & Sallinger, E. (2023). ExpressivE: A Spatio-Functional Embedding For Knowledge Graph Completion. In The Eleventh International Conference on Learning Representations (ICLR 2023) (pp. 1–45). OpenReview.net. https://doi.org/10.34726/5422
    Download: PDF (1.2 MB)
    Project: KnowledgeGraph (2020–2028)
  • Diversity of Answers to Conjunctive Queries / Merkl, T. C., Pichler, R., & Skritek, S. (2023). Diversity of Answers to Conjunctive Queries. In F. Geerts & B. Vandevoort (Eds.), 26th International Conference on Database Theory (pp. 10:1-10:19). Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPICS.ICDT.2023.10
    Download: Paper (771 KB)
    Project: HyperTrac (2018–2022)
  • Diversity of Answers to Conjunctive Queries (extended Abstract) / Merkl, T. C., Pichler, R., & Skritek, S. (2023). Diversity of Answers to Conjunctive Queries (extended Abstract). In B. Kimelfeld, M. V. Martinez, & R. Angles (Eds.), Proceedings of the 15th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW 2023). https://doi.org/10.34726/5393
    Download: Paper (228 KB)
    Projects: DeConquer (2023–2027) / KnowledgeGraph (2020–2028) / SustainGraph (2023–2025)
  • Description Logics with Pointwise Circumscription / Di Stefano, F., Ortiz, M., & Šimkus, M. (2023). Description Logics with Pointwise Circumscription. In E. Elking (Ed.), Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence (IJCAI-23) (pp. 3167–3175). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2023/353
    Download: PDF (193 KB)
    Projects: KtoAPP (2018–2025) / OMEGA (2017–2022)
  • Free-Riding in Multi-Issue Decisions / Lackner, M., Maly, J., & Nardi, O. (2023). Free-Riding in Multi-Issue Decisions. In Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems (pp. 2040–2048).
    Project: SuDeMa (2019–2025)
  • Fairness in Participatory Budgeting via Equality of Resources / Maly, J., Rey, S., Endriss, U., & Lackner, M. (2023). Fairness in Participatory Budgeting via Equality of Resources. In Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems (pp. 2031–2039).
    Project: SuDeMa (2019–2025)
  • Temporal Datalog with Existential Quantification / Lanzinger, M., Nissl, M., Sallinger, E., & Wałęga, P. (2023). Temporal Datalog with Existential Quantification. In E. Elkind (Ed.), Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence (IJCAI 2023) (pp. 3277–3285). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2023/365
  • Knowledge Graphs in Action: from Theory to Systems and Real-world Applications (Abstract) / Sallinger, E. (2023). Knowledge Graphs in Action: from Theory to Systems and Real-world Applications (Abstract). In Proceedings of the 15th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW 2023). AMW 2023 - Alberto Mendelzon International Workshop on Foundations of Data Management, Santiago de Chile, Chile. http://hdl.handle.net/20.500.12708/192767
    Project: KnowledgeGraph (2020–2028)
  • Building Bridges: Knowledge Graph Embeddings Respecting Logical Rules (short paper) / Pavlovic, A., & Sallinger, E. (2023). Building Bridges: Knowledge Graph Embeddings Respecting Logical Rules (short paper). In B. Kimelfeld, M. V. Martinez, & R. Angles (Eds.), Proceedings of the 15th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW 2023).
    Download: Paper (1.16 MB)
    Project: KnowledgeGraph (2020–2028)
  • Model-Based Construction of Enterprise Architecture Knowledge Graphs (extended abstract) / Glaser, P.-L., Ali, S. J., Sallinger, E., & Bork, D. (2023). Model-Based Construction of Enterprise Architecture Knowledge Graphs (extended abstract). In S. Hacks & J. Jung (Eds.), Proceedings of the 13th International Workshop on Enterprise Modelingand Information Systems Architectures {(EMISA} 2023). CEUR. http://hdl.handle.net/20.500.12708/191774
    Project: MFP 4.2 (2022–2023)
  • Solving Projected Model Counting by Utilizing Treewidth and its Limits / Fichte, J. K., Hecher, M., Morak, M., Thier, C.-P., & Woltran, S. (2023). Solving Projected Model Counting by Utilizing Treewidth and its Limits. Artificial Intelligence, 314, Article 103810. https://doi.org/10.1016/j.artint.2022.103810
    Project: HYPAR (2019–2024)
  • Foundations for Projecting Away the Irrelevant in ASP Programs / Saribatur, Z. G., & Woltran, S. (2023). Foundations for Projecting Away the Irrelevant in ASP Programs. In P. Marquis, T. C. Son, & G. Kern-Isberner (Eds.), Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning (pp. 614–624). IJCAI Organization. https://doi.org/10.24963/kr.2023/60
  • Exploring Enterprise Architecture Knowledge Graphs in Archi: The EAKG Toolkit / Glaser, P.-L., Ali, S. J., Sallinger, E., & Bork, D. (2023). Exploring Enterprise Architecture Knowledge Graphs in Archi: The EAKG Toolkit. In Conference Proceedings: Enterprise Design, Operations, and Computing. EDOC 2022 Workshops (pp. 332–338). Springer. https://doi.org/10.1007/978-3-031-26886-1_21
    Project: MFP 4.2 (2022–2023)

2022

  • ALASPO: An Adaptive Large-Neighbourhood ASP Optimiser (Extended Abstract) / Eiter, T., Geibinger, T., Higuera, N., Musliu, N., Oetsch, J., & Stepanova, D. (2022). ALASPO: An Adaptive Large-Neighbourhood ASP Optimiser (Extended Abstract). In Proceedings of the 5th Workshop on Trends and Applications of Answer Set Programming. 5th Workshop on Trends and Applications of Answer Set Programming, Vienna, Austria.
  • Abstract Argumentation with Conditional Preferences / Bernreiter, M., Dvořák, W., & Woltran, S. (2022). Abstract Argumentation with Conditional Preferences. In Computational Models of Argument. Proceedings of COMMA 2022 (pp. 92–103). IOS Press. https://doi.org/10.3233/FAIA220144
    Download: PDF (254 KB)
    Project: REVEAL-AI (2020–2024)
  • Repairing SHACL Constraint Violations Using Answer Set Programming / Ahmetaj, S., David, R., Polleres, A., & Simkus, M. (2022). Repairing SHACL Constraint Violations Using Answer Set Programming. In The Semantic Web – ISWC 2022 (pp. 375–391). Springer. https://doi.org/10.1007/978-3-031-19433-7\_22
    Projects: FRESH (2021–2025) / KtoAPP (2018–2025) / OMEGA (2017–2022)
  • Deletion-Backdoors for Argumentation Frameworks with Collective Attacks / Dvořák, W., König, M., & Woltran, S. (2022). Deletion-Backdoors for Argumentation Frameworks with Collective Attacks. In Proceedings of the Fourth International Workshop on Systems and Algorithms for Formal Argumentation (SAFA 2022) (pp. 98–110). CEUR-WS. https://doi.org/10.34726/3826
    Download: PDF (919 KB)
    Projects: HYPAR (2019–2024) / REVEAL-AI (2020–2024)
  • Model-Based Construction of Enterprise Architecture Knowledge Graphs / Glaser, P.-L., Ali, S. J., Sallinger, E., & Bork, D. (2022). Model-Based Construction of Enterprise Architecture Knowledge Graphs. In Enterprise Design, Operations, and Computing. 26th International Conference, {EDOC} 2022, Bozen-Bolzano, Italy, October 3-7, 2022, Proceedings (pp. 57–73). Springer. https://doi.org/10.34726/3068
    Download: Camera ready author version (3.51 MB)
    Project: DEMO (2022–2024)
  • Relational local electroencephalography representations for sleep scoring / Brandmayr, G., Hartmann, M., Fürbass, F., Matz, G., Samwald, M., Kluge, T., & Dorffner, G. (2022). Relational local electroencephalography representations for sleep scoring. Neural Networks, 154, 310–322. https://doi.org/10.1016/j.neunet.2022.07.020
  • Magic Shapes for SHACL Validation / Ahmetaj, S., Löhnert, B., Ortiz de la Fuente, M. M., & Simkus, M. (2022). Magic Shapes for SHACL Validation. Proceedings of the VLDB Endowment, 15(10), 2284--2296. https://doi.org/10.14778/3547305.3547329
    Projects: FRESH (2021–2025) / KtoAPP (2018–2025) / OMEGA (2017–2022)
  • How complex is the strong admissibility semantics for abstract dialectical frameworks? / Keshavarzi Zafarghandi, A., Dvorak, W., Verbrugge, R., & Verheij, B. (2022). How complex is the strong admissibility semantics for abstract dialectical frameworks? In F. Toni, S. Polberg, R. Booth, Caminada Martin, & H. Kido (Eds.), Computational Models of Argument - Proceedings of COMMA 2022 (pp. 200–211). IOS Press. https://doi.org/10.3233/FAIA220153
  • IASCAR: Incremental Answer Set Counting by Anytime Refinement / Fichte, J. K., Gaggl, S. A., Hecher, M., & Rusovac, D. (2022). IASCAR: Incremental Answer Set Counting by Anytime Refinement. In Logic Programming and Nonmonotonic Reasoning (pp. 217–230). Springer. http://hdl.handle.net/20.500.12708/142530
    Projects: HYPAR (2019–2024) / REVEAL-AI (2020–2024)
  • Large-Neighbourhood Search for Optimisation in Answer-Set Solving (Extended Abstract) / Eiter, T., Geibinger, T., Higuera Ruiz, N., Musliu, N., Oetsch, J., & Stepanova, D. (2022). Large-Neighbourhood Search for Optimisation in Answer-Set Solving (Extended Abstract). In Proceedings of the 38th International Conference on Logic Programming. 38th International Conference on Logic Programming, Haifa, Israel. Open Publishing Association. http://hdl.handle.net/20.500.12708/139851
  • Sequent Calculi for Choice Logics / Bernreiter, M., Lolic, A., Maly, J., & Woltran, S. (2022). Sequent Calculi for Choice Logics. In Automated Reasoning (pp. 331–349). Springer International Publishing. https://doi.org/10.1007/978-3-031-10769-6_20
    Download: PDF (375 KB)
    Project: HYPAR (2019–2024)
  • Rediscovering Argumentation Principles Utilizing Collective Attacks / Dvorak, W., König, M., Ulbricht, M., & Woltran, S. (2022). Rediscovering Argumentation Principles Utilizing Collective Attacks. In Proceedings of the 19th International Conference on Principles of Knowledge Representation and Reasoning, {KR} (pp. 122–131). International Joint Conferences on Artificial Intelligence Organization. https://doi.org/10.24963/kr.2022/13
    Projects: HYPAR (2019–2024) / REVEAL-AI (2020–2024)
  • On Dynamics in Structured Argumentation Formalisms / Rapberger, A., & Ulbricht, M. (2022). On Dynamics in Structured Argumentation Formalisms. In Proceedings of the 19th International Conference on Principles of Knowledge Representation and Reasoning (pp. 288–298). IJCAI Organization. http://hdl.handle.net/20.500.12708/142535
    Project: REVEAL-AI (2020–2024)
  • A System for Automated Industrial Test Laboratory Scheduling / Danzinger, P., Geibinger, T., Janneau, D., Mischek, F., Musliu, N., & Poschalko, C. (2022). A System for Automated Industrial Test Laboratory Scheduling. ACM Transactions on Intelligent Systems and Technology. https://doi.org/10.1145/3546871
  • Proofs for Propositional Model Counting / Fichte, J. K., Hecher, M., & Roland, V. (2022). Proofs for Propositional Model Counting. In 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022) (pp. 1–24). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SAT.2022.30
    Download: PDF (942 KB)
    Projects: HYPAR (2019–2024) / REVEAL-AI (2020–2024)
  • MV-Datalog+-: Effective Rule-based Reasoning with Uncertain Observations / Lanzinger, M., Sferrazza, S., & Gottlob, G. (2022). MV-Datalog+-: Effective Rule-based Reasoning with Uncertain Observations. Theory and Practice of Logic Programming, 22(5), 678–692. https://doi.org/10.1017/S1471068422000199
    Project: HyperTrac (2018–2022)
  • Modeling and Solving Parallel Machine Scheduling with Contamination Constraints in the Agricultural Industry / Winter, F., Meiswinkel, S., Musliu, N., & Walkiewicz, D. (2022). Modeling and Solving Parallel Machine Scheduling with Contamination Constraints in the Agricultural Industry. In 28th International Conference on Principles and Practice of Constraint Programming, CP 2022, July 31 to August 8, 2022, Haifa, Israel (pp. 1–18). https://doi.org/10.4230/LIPIcs.CP.2022.41
    Download: PDF (859 KB)
    Project: ARTIS (2017–2024)
  • Metaheuristic algorithms for the bus driver scheduling problem with complex break constraints / Kletzander, L., Mazzoli, T. M., & Musliu, N. (2022). Metaheuristic algorithms for the bus driver scheduling problem with complex break constraints. In GECCO ’22: Proceedings of the Genetic and Evolutionary Computation Conference (pp. 232–240). https://doi.org/10.1145/3512290.3528876
    Project: Computational Optimization (DK) (2016–2025)
  • Plausibility Reasoning via Projected Answer Set Counting - A Hybrid Approach / Fichte, J. K., Hecher, M., & Nadeem, M. A. (2022). Plausibility Reasoning via Projected Answer Set Counting - A Hybrid Approach. In L. De Raedt (Ed.), Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence (IJCAI-22) (pp. 2620–2626). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2022/363
    Projects: HYPAR (2019–2024) / REVEAL-AI (2020–2024)
  • Investigating Hyper-heuristics for Real-World Test Laboratory Scheduling / Mischek, F., & Musliu, N. (2022, July 0). Investigating Hyper-heuristics for Real-World Test Laboratory Scheduling [Conference Presentation]. EURO 2022, Espoo, Finland.
  • Reinforcement Learning for Cross-Domain Hyper-Heuristics / Mischek, F., & Musliu, N. (2022). Reinforcement Learning for Cross-Domain Hyper-Heuristics. In L. De Raedt (Ed.), Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence (IJCAI-22) (pp. 4793–4799). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2022/664
  • Tractable Abstract Argumentation via Backdoor-Treewidth / Dvořák, W., Hecher, M., König, M., Schidler, A., Szeider, S., & Woltran, S. (2022). Tractable Abstract Argumentation via Backdoor-Treewidth. In Proceedings of the 36th AAAI Conference on Artificial Intelligence (pp. 5608–5615). AAAI Press. https://doi.org/10.1609/aaai.v36i5.20501
    Download: PDF (1.52 MB)
    Projects: HYPAR (2019–2024) / REVEAL-AI (2020–2024) / SLIM (2019–2024)
  • Large-Neighbourhood Search for Optimisation in Answer-Set Solving / Eiter, T., Geibinger, T., Higuera Ruiz, N., Musliu, N., Oetsch, J., & Stepanova, D. (2022). Large-Neighbourhood Search for Optimisation in Answer-Set Solving. In Proceedings of the 36th AAAI Conference on Artificial Intelligence (pp. 5616–5625). AAAI Press. https://doi.org/10.1609/aaai.v36i5.20502
  • Participatory Budgeting with Donations and Diversity Constraints / Chen, J., Lackner, M., & Maly, J. (2022). Participatory Budgeting with Donations and Diversity Constraints. In Proceedings of the AAAI Conference on Artificial Intelligence (pp. 9323–9330). AAAI Press. https://doi.org/10.1609/aaai.v36i9.21163
    Project: SuDeMa (2019–2025)
  • Liquid Democracy with Ranked Delegations / Brill, M., Delemazure, T., George, A.-M., Lackner, M., & Schmidt-Kraepelin, U. (2022). Liquid Democracy with Ranked Delegations. In Proceedings of the 36th AAAI Conference on Artificial Intelligence (pp. 4884–4891). AAAI Press. https://doi.org/10.1609/aaai.v36i5.20417
    Project: SuDeMa (2019–2025)
  • Equivalence in Argumentation Frameworks with a Claim-Centric View – Classical Results with Novel Ingredients / Baumann, R., Rapberger, A., & Ulbricht, M. (2022). Equivalence in Argumentation Frameworks with a Claim-Centric View – Classical Results with Novel Ingredients. In Proceedings of the 36th AAAI Conference on Artificial Intelligence (pp. 5479–5486). AAAI Press. https://doi.org/10.1609/aaai.v36i5.20486
    Project: HYPAR (2019–2024)
  • Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares / Akitaya, H., Demaine, E., Korman, M., Kostitsyna, I., Parada, I., Sonke, W., Speckmann, B., Uehara, R., & Wulms, J. (2022). Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares. In A. Czumaj & Q. Xin (Eds.), 18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022) (pp. 1–19). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SWAT.2022.4
    Download: PDF (1.35 MB)
    Project: HumAlgo (2018–2023)
  • Hyper-Heuristics for Personnel Scheduling Domains / Kletzander, L., & Musliu, N. (2022). Hyper-Heuristics for Personnel Scheduling Domains. In Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling (pp. 462–470). AAAI Press. https://doi.org/10.1609/icaps.v32i1.19832
    Project: ARTIS (2017–2024)
  • Optimizing Recursive Queries with Progam Synthesis / Wang, Y. R., Khamis, M. A., Ngo, H. Q., Pichler, R., & Suciu, D. (2022). Optimizing Recursive Queries with Progam Synthesis. In SIGMOD ’22: Proceedings of the 2022 International Conference on Management of Data (pp. 79–93). Association for Computing Machinery (ACM). https://doi.org/10.1145/3514221.3517827
    Download: PDF (1.53 MB)
    Project: HyperTrac (2018–2022)
  • An Interactive Framework for Reconfiguration in the Sliding Square Model (Media Exposition) / Sonke, W., & Wulms, J. (2022). An Interactive Framework for Reconfiguration in the Sliding Square Model (Media Exposition). In X. Goaoc & M. Kerber (Eds.), 38th International Symposium on Computational Geometry (SoCG 2022) (pp. 1–4). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2022.70
    Download: PDF (672 KB)
  • Exact and meta-heuristic approaches for the production leveling problem / Vass, J., Lackner, M.-L., Mrkvicka, C., Musliu, N., & Winter, F. (2022). Exact and meta-heuristic approaches for the production leveling problem. Journal of Scheduling, 25(3), 339–370. https://doi.org/10.1007/s10951-022-00721-1
    Download: PDF (1.5 MB)
    Project: ARTIS (2017–2024)
  • Convergence of Datalog over (Pre-) Semirings / Khamis, M. A., Ngo, H. Q., Pichler, R., Suciu, D., & Wang, Y. R. (2022). Convergence of Datalog over (Pre-) Semirings. In PODS ’22: Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (p. 105). Association for Computing Machinery. https://doi.org/10.1145/3517804.3524140
    Project: HyperTrac (2018–2022)
  • How to Sample Approval Elections? / Szufa, S., Faliszewski, P., Janeczko, L., Lackner, M., Slinko, A., Sornat, K., & Talmon, N. (2022). How to Sample Approval Elections? In Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence (IJCAI-22) (pp. 496–502). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2022/71
    Project: SuDeMa (2019–2025)
  • Just a Matter of Perspective / König, M., Rapberger, A., & Ulbricht, M. (2022). Just a Matter of Perspective. In Computational Models of Argument (pp. 212–223). IOS Press. https://doi.org/10.3233/FAIA220154
    Download: PDF (267 KB)
    Projects: HYPAR (2019–2024) / REVEAL-AI (2020–2024)
  • Body-Decoupled Grounding via Solving: A Novel Approach on the ASP Bottleneck / Besin, V., Hecher, M., & Woltran, S. (2022). Body-Decoupled Grounding via Solving: A Novel Approach on the ASP Bottleneck. In Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence (IJCAI-22) (pp. 2546–2552). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2022/353
    Download: PDF (849 KB)
    Projects: HYPAR (2019–2024) / REVEAL-AI (2020–2024)
  • Treewidth for Argumentation Frameworks with Collective Attacks / Dvořák, W., König, M., & Woltran, S. (2022). Treewidth for Argumentation Frameworks with Collective Attacks. In Computational Models of Argument. Proceedings of COMMA 2022 (pp. 140–151). IOS Press. https://doi.org/10.34726/3422
    Download: PDF (277 KB)
    Projects: HYPAR (2019–2024) / REVEAL-AI (2020–2024)
  • Argumentation Frameworks Induced by Assumption-Based Argumentation: Relating Size and Complexity / Rapberger, A., Ulbricht, M., & Wallner, J. (2022). Argumentation Frameworks Induced by Assumption-Based Argumentation: Relating Size and Complexity. In Proceedings of the 20th International Workshop on Non-Monotonic Reasoning (NMR 2022) (pp. 92–103). CEUR-WS. https://doi.org/10.34726/3549
    Download: PDF (579 KB)
    Project: REVEAL-AI (2020–2024)
  • Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares / Akitaya, H., Demaine, E., Korman, M., Kostitsyna, I., Parada, I., Sonke, W., Speckmann, B., Uehara, R., & Wulms, J. (2022). Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares [Conference Presentation]. 38th European Workshop on Computational Geometry, Italy. https://doi.org/10.34726/3466
    Download: PDF (2.33 MB)
    Project: HumAlgo (2018–2023)
  • Democratizing Financial Knowledge Graph Construction by Mining Massive Brokerage Research Reports / Cheng, Z., Wu, L., Thomas Lukasiewicz, Emanuel Sallinger, & Georg Gottlob. (2022). Democratizing Financial Knowledge Graph Construction by Mining Massive Brokerage Research Reports. In M. Ramanath & T. Palpanas (Eds.), Proceedings of the Workshops of the EDBT/ICDT 2022 Joint Conference.
  • It Is Simple, It Is Complicated. Perspectives on Digital Humanism. / Neidhardt, J., Werthner, H., & Woltran, S. (2022). It Is Simple, It Is Complicated. Perspectives on Digital Humanism. In H. Werthner, E. Prem, E. A. Lee, & C. Ghezzi (Eds.), Perspectives on Digital Humanism (pp. 335–342). Springer. http://hdl.handle.net/20.500.12708/30705
  • Historian: A Large-Scale Historical Film Dataset with Cinematographic Annotation / Helm, D., Jogl, F., & Kampel, M. (2022). Historian: A Large-Scale Historical Film Dataset with Cinematographic Annotation. In 2022 IEEE International Conference on Image Processing (ICIP) (pp. 2087–2091). https://doi.org/10.1109/ICIP46576.2022.9897300
    Project: VHH (2019–2023)
  • Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth / Gottlob, G., Lanzinger, M., Okulmus, C., & Pichler, R. (2022). Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth. In Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (pp. 325–336). Association for Computing Machinery. https://doi.org/10.1145/3517804.3524153
    Project: HyperTrac (2018–2022)
  • Non-Admissibility in Abstract Argumentation / Dvořák, W., Rienstra, T., van der Torre, L., & Woltran, S. (2022). Non-Admissibility in Abstract Argumentation. In F. Toni, S. Polberg, M. Caminada, R. Booth, & H. Kido (Eds.), Computational Models of Argument - Proceedings of COMMA 2022 (pp. 128–139). IOS Press. https://doi.org/10.3233/FAIA220147
  • New Perspectives for Fuzzy Datalog (Extended Abstract) / Lanzinger, M., Sferrazza, S., & Gottlob, G. (2022). New Perspectives for Fuzzy Datalog (Extended Abstract). In Proceedings of the 4th International Workshop on the Resurgence of Datalog in Academia and Industry (Datalog-2.0 2022) co-located with the 16th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR} 2022) (pp. 42–47). http://hdl.handle.net/20.500.12708/175762
    Download: PDF (1.17 MB)
    Project: HyperTrac (2018–2022)
  • An Investigation of Hyper-Heuristic Approaches for Teeth Scheduling / Winter, F., & Musliu, N. (2022). An Investigation of Hyper-Heuristic Approaches for Teeth Scheduling. In MIC 2022: 14th Metaheuristics International Conference. 14th Metaheuristics International Conference (MIC 2022), Ortigia-Syracuse, Italy. Springer.
    Project: ARTIS (2017–2024)
  • Abstraction for Non-Ground Answer Set Programs (Extended Abstract) / Saribatur, Z. G., Eiter, T., & Schüller, P. (2022). Abstraction for Non-Ground Answer Set Programs (Extended Abstract). In Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence (pp. 5767–5771). https://doi.org/10.24963/ijcai.2022/807
  • A Practical Account into Counting Dung's Extensions by Dynamic Programming / Dewoprabowo, R., Fichte, J. K., Gorczyca, P. J., & Hecher, M. (2022). A Practical Account into Counting Dung’s Extensions by Dynamic Programming. In Logic Programming and Nonmonotonic Reasoning (pp. 387–400). Springer. https://doi.org/10.1007/978-3-031-15707-3_30
    Projects: HYPAR (2019–2024) / REVEAL-AI (2020–2024)
  • Modeling and Solving the K-track Assignment Problem / Preininger, J., Winter, F., & Musliu, N. (2022). Modeling and Solving the K-track Assignment Problem. In 14th Metaheuristics International Conference. MIC 2022 - 14th Metaheuristics International Conference, Ortigia-Syracuse, Italy. Springer. http://hdl.handle.net/20.500.12708/142199
    Project: ARTIS (2017–2024)
  • A Hybrid Approach for Paint Shop Scheduling in the Automotive Supply Industry / Winter, F., & Musliu, N. (2022). A Hybrid Approach for Paint Shop Scheduling in the Automotive Supply Industry. In Proceedings of the 13th International Conference on the Practice and Theory of Automated Timetabling (pp. 317–320). http://hdl.handle.net/20.500.12708/142193
    Project: ARTIS (2017–2024)
  • Solving the Production Leveling Problem with Order-Splitting and Resource Constraints / Vass, J., Musliu, N., & Winter, F. (2022). Solving the Production Leveling Problem with Order-Splitting and Resource Constraints. In Proceedings of the 13th International Conference on the Practice and Theory of Automated Timetabling (pp. 261–284). http://hdl.handle.net/20.500.12708/142211
    Project: ARTIS (2017–2024)
  • Solving an Industrial Oven Scheduling Problem with a Simulated Annealing Approach / Lackner, M.-L., Musliu, N., & Winter, F. (2022). Solving an Industrial Oven Scheduling Problem with a Simulated Annealing Approach. In Proceedings of the 13th International Conference on the Practice and Theory of Automated Timetabling (pp. 115–120). http://hdl.handle.net/20.500.12708/142210
    Project: ARTIS (2017–2024)
  • Datalog in Wonderland / Khamis, M. A., Ngo, H. Q., Pichler, R., Suciu, D., & Wang, Y. R. (2022). Datalog in Wonderland. SIGMOD RECORD, 51(2), 6–17. https://doi.org/10.1145/3552490.3552492
    Project: HyperTrac (2018–2022)
  • The Effect of Preferences in Abstract Argumentation Under a Claim-Centric View / Bernreiter, M., Dvorak, W., Rapberger, A., & Woltran, S. (2022). The Effect of Preferences in Abstract Argumentation Under a Claim-Centric View. In Proceedings of the 20th International Workshop on Non-Monotonic Reasoning (pp. 27–38).
  • Truth and Preferences - A Game Approach for Qualitative Choice Logic / Bernreiter, M., & Freiman, R. (2022). Truth and Preferences - A Game Approach for Qualitative Choice Logic [Conference Presentation]. M-PREF 2022 - 13th Multidisciplinary Workshop on Advances in Preference Handling, Wien, Austria. https://doi.org/10.48550/arXiv.2209.12777
    Projects: HYPAR (2019–2024) / REVEAL-AI (2020–2024)

2021

  • Instance space analysis for a personnel scheduling problem / Kletzander, L., Musliu, N., & Smith-Miles, K. (2021). Instance space analysis for a personnel scheduling problem. Annals of Mathematics and Artificial Intelligence, 89(7), 617–637. https://doi.org/10.1007/s10472-020-09695-2
    Download: PDF (4.52 MB)
    Project: ARTIS (2017–2024)
  • Tractability Beyond ß-Acyclicity for Conjunctive Queries with Negation / Lanzinger, M. (2021). Tractability Beyond ß-Acyclicity for Conjunctive Queries with Negation. In L. Libkin (Ed.), Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (pp. 355–369). https://doi.org/10.1145/3452021.3458308
    Project: HyperTrac (2018–2022)
  • Minimizing Cumulative Batch Processing Time for an Industrial Oven Scheduling Problem / Lackner, M.-L., Mrkvicka, C., Musliu, N., Walkiewicz, D., & Winter, F. (2021). Minimizing Cumulative Batch Processing Time for an Industrial Oven Scheduling Problem. In 27th International Conference on Principles and Practice of Constraint Programming, {CP} 2021, Montpellier, France (Virtual Conference), October 25-29, 2021} (pp. 37:1-37:18). https://doi.org/10.4230/LIPIcs.CP.2021.37
    Project: ARTIS (2017–2024)
  • Process Mining with Common Sense / Calvanese, D., Lukumbuzya, S., Montali, M., & Simkus, M. (2021). Process Mining with Common Sense. In Proceedings of the International Workshop on BPM Problems to Solve Before We Die (PROBLEMS 2021) (pp. 45–50). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/55664
  • Symbolic Time and Space Tradeoffs for Probabilistic Verification / Chatterjee, K., Dvorak, W., Henzinger, M., & Svozil, A. (2021). Symbolic Time and Space Tradeoffs for Probabilistic Verification. In 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). LICS 2021 - Symposium on Logic in Computer Science, Rom, Italy. https://doi.org/10.1109/lics52264.2021.9470739
  • Parallel Model Counting with CUDA: Algorithm Engineering for Efficient Hardware Utilization / Fichte, J., Hecher, M., & Roland, V. (2021). Parallel Model Counting with CUDA: Algorithm Engineering for Efficient Hardware Utilization. In 27th International Conference on Principles and Practice of Constraint Programming, {CP} 2021, Montpellier, France (Virtual Conference), October 25-29, 2021 (pp. 24:1-24:20). https://doi.org/10.4230/LIPIcs.CP.2021.24
    Project: START (2014–2022)
  • Complications for Computational Experiments from Modern Processors / Fichte, J., Hecher, M., McCreesh, C., & Shahab, A. (2021). Complications for Computational Experiments from Modern Processors. In 27th International Conference on Principles and Practice of Constraint Programming, {CP} 2021, Montpellier, France (Virtual Conference), October 25-29, 2021 (pp. 25:1-25:21). https://doi.org/10.4230/LIPIcs.CP.2021.25
    Project: START (2014–2022)
  • Computing Kemeny Rankings from d-Euclidean Preferences / Hamm, T., Lackner, M., & Rapberger, A. (2021). Computing Kemeny Rankings from d-Euclidean Preferences. In Algorithmic Decision Theory (pp. 147–161). https://doi.org/10.1007/978-3-030-87756-9_10
  • Automated configuration of parallel machine dispatching rules by machine learning / Faustmann, G., Mrkvicka, C., Musliu, N., & Winter, F. (2021). Automated configuration of parallel machine dispatching rules by machine learning. In Proceedings of the Genetic and Evolutionary Computation Conference Companion. GECCO 2021 - Genetic and Evolutionary Computation Conference, Companion Volume, Lille, France. https://doi.org/10.1145/3449726.3459541
    Project: ARTIS (2017–2024)
  • Solving the paintshop scheduling problem with memetic algorithms / Musliu, N., Weintritt, W., & Winter, F. (2021). Solving the paintshop scheduling problem with memetic algorithms. In Proceedings of the Genetic and Evolutionary Computation Conference. GECCO 2021 - Genetic and Evolutionary Computation Conference, Companion Volume, Lille, France. https://doi.org/10.1145/3449639.3459375
    Project: ARTIS (2017–2024)
  • Financial Data Exchange with Statistical Confidentiality: A Reasoning-based Approach / Bellomarini, L., Blasi, L., Laurendi, R., & Sallinger, E. (2021). Financial Data Exchange with Statistical Confidentiality: A Reasoning-based Approach. In Y. Velegrakis, D. Zeinalipour-Yazti, P. Chrysanthis, & F. Guerra (Eds.), Proceedings of the 24th International Conference on Extending Database Technology, EDBT 2021, Nicosia, Cyprus, March 23 - 26, 2021 (pp. 558–569). OpenProceedings.org. https://doi.org/10.5441/002/edbt.2021.66
    Project: KnowledgeGraph (2020–2028)
  • Distributed Company Control in Company Shareholding Graphs / Gulino, A., Ceri, S., Gottlob, G., Sallinger, E., & Bellomarini, L. (2021). Distributed Company Control in Company Shareholding Graphs. In 2021 IEEE 37th International Conference on Data Engineering (ICDE). ICDE 2021 - 37th {IEEE} International Conference on Data Engineering, Chania, Greece. https://doi.org/10.1109/icde51399.2021.00294
    Project: KnowledgeGraph (2020–2028)
  • ASPARTIX-V - A Solver for Argumentation Tasks Using ASP / Dvorak, W., König, M., Rapberger, A., Wallner, J. P., & Woltran, S. (2021). ASPARTIX-V - A Solver for Argumentation Tasks Using ASP. ASPOCP 2021 - 14th Workshop on Answer Set Programming and Other Computing Paradigms, Porto, Portugal. http://hdl.handle.net/20.500.12708/87227
  • Computational Complexity of Strong Admissibility for Abstract Dialectical Frameworks / Keshavarzi Zafarghandi, A., Dvorak, W., Verbrugge, R., & Verheij, B. (2021). Computational Complexity of Strong Admissibility for Abstract Dialectical Frameworks. NMR 2021 - 19th International Workshop on Non-Monotonic Reasoning, Hanoi, Vietnam, Viet Nam. http://hdl.handle.net/20.500.12708/87226
  • Automated Production Scheduling for Artificial Teeth Manufacturing / Mrkvicka, C., Musliu, N., Preininger, J., & Winter, F. (2021). Automated Production Scheduling for Artificial Teeth Manufacturing. In Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, {ICAPS} 2021, Guangzhou, China (virtual), August 2-13, 2021}, (pp. 500–508). http://hdl.handle.net/20.500.12708/58583
    Project: ARTIS (2017–2024)
  • Algorithms and conditional lower bounds for planning problems / Chatterjee, K., Dvořák, W., Henzinger, M., & Svozil, A. (2021). Algorithms and conditional lower bounds for planning problems. Artificial Intelligence, 297(103499), 103499. https://doi.org/10.1016/j.artint.2021.103499
  • Fast and Parallel Decomposition of Constraint Satisfaction Problems / Gottlob, G., Okulmus, C., & Pichler, R. (2021). Fast and Parallel Decomposition of Constraint Satisfaction Problems. In Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence. IJCAI 2020, Yokohama, Japan. https://doi.org/10.24963/ijcai.2020/161
    Project: HyperTrac (2018–2022)
  • Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems / Chen, H., Gottlob, G., Lanzinger, M., & Pichler, R. (2021). Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems. In Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence. IJCAI 2020, Yokohama, Japan. https://doi.org/10.24963/ijcai.2020/239
    Project: HyperTrac (2018–2022)
  • Sleeping Beauties of Coronavirus Research / Fazeli-Varzaneh, M., Ghorbi, A., Ausloos, M., Sallinger, E., & Vahdati, S. (2021). Sleeping Beauties of Coronavirus Research. IEEE Access, 9, 21192–21205. https://doi.org/10.1109/access.2021.3052918
    Project: KnowledgeGraph (2020–2028)
  • Treewidth-Aware Cycle Breaking for Algebraic Answer Set Counting / Eiter, T., Hecher, M., & Kiesel, R. (2021). Treewidth-Aware Cycle Breaking for Algebraic Answer Set Counting. In Proceedings of the 37th International Conference on Logic Programming (ICLP 2021). 37th International Conference on Logic Programming (ICLP 2021), Unknown. http://hdl.handle.net/20.500.12708/58728
    Projects: DK - Logic (2014–2023) / HYPAR (2019–2024) / START (2014–2022)
  • Reasoning about Explanations for Non-validation in SHACL (Extended abstract) / Ahmetaj, S., David, R., Ortiz de la Fuente, M. M., Polleres, A., Shehu, B., & Simkus, M. (2021). Reasoning about Explanations for Non-validation in SHACL (Extended abstract). In Proceedings of the 34th International Workshop on Description Logics (DL 2021). 34th International Workshop on Description Logics (DL 2021), Bratislava, Slovakia. CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/55685
  • Treewidth-Aware Cycle Breaking for Algebraic Answer Set Counting / Eiter, T., Hecher, M., & Kiesel, R. (2021). Treewidth-Aware Cycle Breaking for Algebraic Answer Set Counting. In Proceedings of the Eighteenth International Conference on Principles of Knowledge Representation and Reasoning. KR 2021 - 18th International Conference on Principles of Knowledge Representation and Reasoning, virtual event, Unknown. https://doi.org/10.24963/kr.2021/26
    Projects: DK - Logic (2014–2023) / HYPAR (2019–2024) / START (2014–2022)
  • Reasoning about Explanations for Non-validation in SHACL / Ahmetaj, S., David, R., Ortiz, M., Polleres, A., Shehu, B., & Šimkus, M. (2021). Reasoning about Explanations for Non-validation in SHACL. In Proceedings of the Eighteenth International Conference on Principles of Knowledge Representation and Reasoning. KR 2021 - 18th International Conference on Principles of Knowledge Representation and Reasoning, virtual event, Unknown. https://doi.org/10.24963/kr.2021/2
  • On the Complexity of Preferred Semantics in Argumentation Frameworks with Bounded Cycle Length / Dvořák, W., König, M., & Woltran, S. (2021). On the Complexity of Preferred Semantics in Argumentation Frameworks with Bounded Cycle Length. In Proceedings of the Eighteenth International Conference on Principles of Knowledge Representation and Reasoning. KR 2021 - 18th International Conference on Principles of Knowledge Representation and Reasoning, virtual event, Unknown. https://doi.org/10.24963/kr.2021/67
    Projects: HYPAR (2019–2024) / START (2014–2022)
  • Answer-Set Programming for Lexicographical Makespan Optimisation in Parallel Machine Scheduling / Eiter, T., Geibinger, T., Musliu, N., Oetsch, J., Skočovský, P., & Stepanova, D. (2021). Answer-Set Programming for Lexicographical Makespan Optimisation in Parallel Machine Scheduling. In Proceedings of the Eighteenth International Conference on Principles of Knowledge Representation and Reasoning. KR 2021 - 18th International Conference on Principles of Knowledge Representation and Reasoning, virtual event, Unknown. https://doi.org/10.24963/kr.2021/27
    Project: KIRAS-PrEMI (2019–2022)
  • Magic Shapes for Validation in SHACL / Ahmetaj, S., Loehnert, B., Ortiz de la Fuente, M. M., & Simkus, M. (2021). Magic Shapes for Validation in SHACL. In Proceedings of the ISWC 2021 Posters, Demos and Industry Tracks: From Novel Ideas to Industrial Practice co-located with 20th International Semantic Web Conference (ISWC 2021). ISWC 2021 - The 20th International Semantic Web Conference, online event, Unknown. CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/55686
  • Knowledge Graphs: Detection of Outdated News / Ferranti, N., Krickl, A., & Nissl, M. (2021). Knowledge Graphs: Detection of Outdated News. In Proceedings of the {ISWC} 2021 Posters, Demos and Industry Tracks: From Novel Ideas to Industrial Practice co-located with 20th International Semantic Web Conference {(ISWC} 2021), Virtual Conference, October 24-28, 2021}, (pp. 1–5). http://hdl.handle.net/20.500.12708/55638
    Project: KnowledgeGraph (2020–2028)
  • Knowledge Graph Modularization for Cyber-Physical Production Systems / Bachhofner, S., Kiesling, E., Kurniawan, K., Sallinger, E., & Waibel, P. (2021). Knowledge Graph Modularization for Cyber-Physical Production Systems. In Proceedings of the {ISWC} 2021 Posters, Demos and Industry Tracks: From Novel Ideas to Industrial Practice co-located with 20th International Semantic Web Conference {(ISWC} 2021), Virtual Conference, October 24-28, 2021 (pp. 1–5). http://hdl.handle.net/20.500.12708/55676
    Project: KnowledgeGraph (2020–2028)
  • Pattern-Aware and Noise-Resilient Embedding Models / Nayyeri, M., Vahdati, S., Sallinger, E., & Mohtashim Alam, M. (2021). Pattern-Aware and Noise-Resilient Embedding Models. In Lecture Notes in Computer Science (pp. 483–496). https://doi.org/10.1007/978-3-030-72113-8_32
    Project: KnowledgeGraph (2020–2028)
  • Towards Cross-Blockchain Smart Contracts / Nissl, M., Sallinger, E., Schulte, S., & Borkowski, M. (2021). Towards Cross-Blockchain Smart Contracts. In 2021 IEEE International Conference on Decentralized Applications and Infrastructures (DAPPS). DAPPS 2021 - International Conference on Decentralized Applications and Infrastructures, online event, Unknown. https://doi.org/10.1109/dapps52256.2021.00015
    Project: KnowledgeGraph (2020–2028)
  • Ontology-Enriched Query Answering on Relational Databases / Ahmetaj, S., Efthymiou, V., Fagin, R., Kolaitis, P. G., Lei, C., Özcan, F., & Popa, L. (2021). Ontology-Enriched Query Answering on Relational Databases. In AAAI 2021 Proceedings (pp. 15247–15254). AAAI Press. http://hdl.handle.net/20.500.12708/55688
  • Treewidth-Aware Complexity in {ASP:} Not all Positive Cycles are Equally Hard / Fandinno, J., & Hecher, M. (2021). Treewidth-Aware Complexity in {ASP:} Not all Positive Cycles are Equally Hard. In Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Thirty-Third Conference on Innovative Applications of Artificial Intelligence, IAAI 2021, The Eleventh Symposium on Educational Advances in Artificial Intelligence, EAAI 2021, Virtual Event, February 2-9, 2021 (pp. 6312–6320). http://hdl.handle.net/20.500.12708/58549
    Project: START (2014–2022)
  • The Complexity Landscape of Claim-Augmented Argumentation Frameworks / Dvorak, W., Greßler, A., Rapberger, A., & Woltran, S. (2021). The Complexity Landscape of Claim-Augmented Argumentation Frameworks. In Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Thirty-Third Conference on Innovative Applications of Artificial Intelligence, IAAI 2021, The Eleventh Symposium on Educational Advances in Artificial Intelligence, EAAI 2021 (pp. 6296–6303). http://hdl.handle.net/20.500.12708/58525
  • Recursion in Abstract Argumentation is Hard --- On the Complexity of Semantics Based on Weak Admissibility / Dvořák, W., Ulbricht, M., & Woltran, S. (2021). Recursion in Abstract Argumentation is Hard  ---  On the Complexity of Semantics Based on Weak Admissibility. In 35th AAAI Conference on Artificial Intelligence (pp. 6288–6295). http://hdl.handle.net/20.500.12708/58530
    Project: START (2014–2022)
  • Ranking Sets of Defeasible Elements in Preferential Approaches to Structured Argumentation: Postulates, Relations, and Characterizations / Maly, J., & Wallner, J. P. (2021). Ranking Sets of Defeasible Elements in Preferential Approaches to Structured Argumentation: Postulates, Relations, and Characterizations. In Thirty-Fifth {AAAI} Conference on Artificial Intelligence, {AAAI} 2021, Thirty-Third Conference on Innovative Applications of Artificial Intelligence, {IAAI} 2021, The Eleventh Symposium on Educational Advances in Artificial Intelligence, {EAAI} 2021, Virtual Event, February 2-9, 2021 (pp. 6435–6443). http://hdl.handle.net/20.500.12708/55629
  • Knowledge-Base Degrees of Inconsistency: Complexity and Counting / Fichte, J., Hecher, M., & Meier, A. (2021). Knowledge-Base Degrees of Inconsistency: Complexity and Counting. In Thirty-Fifth {AAAI} Conference on Artificial Intelligence, {AAAI} 2021, Thirty-Third Conference on Innovative Applications of Artificial Intelligence, {IAAI} 2021, The Eleventh Symposium on Educational Advances in Artificial Intelligence, {EAAI} 2021, Virtual Event, February 2-9, 2021} (pp. 6349–6357). http://hdl.handle.net/20.500.12708/58550
    Project: START (2014–2022)
  • Constraint Logic Programming for Real-World Test Laboratory Scheduling / Geibinger, T., Mischek, F., & Musliu, N. (2021). Constraint Logic Programming for Real-World Test Laboratory Scheduling. In 35th AAAI Conference on Artificial Intelligence (pp. 6358–6366). http://hdl.handle.net/20.500.12708/58591
    Project: ARTIS (2017–2024)
  • Branch and Price for Bus Driver Scheduling with Complex Break Constraints / Kletzander, L., Musliu, N., & Van Hentenryck, P. (2021). Branch and Price for Bus Driver Scheduling with Complex Break Constraints. In Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Thirty-Third Conference on Innovative Applications of Artificial Intelligence, {IAAI} 2021, The Eleventh Symposium on Educational Advances in Artificial Intelligence, {EAAI} 2021, Virtual Event, February 2-9, 2021 (pp. 11853–11861). http://hdl.handle.net/20.500.12708/58590
    Project: ARTIS (2017–2024)
  • A Reduct-Driven Study of Argumentation Frameworks With Collective Attacks / Dvorak, W., König, M., Ulbricht, M., & Woltran, S. (2021). A Reduct-Driven Study of Argumentation Frameworks With Collective Attacks. NMR 2021 - 19th International Workshop on Non-Monotonic Reasoning, Hanoi, Vietnam, Viet Nam. http://hdl.handle.net/20.500.12708/87225
    Projects: HYPAR (2019–2024) / START (2014–2022)
  • Existential Abstraction on Argumentation Frameworks via Clustering / Saribatur, Z. G., & Wallner, J. P. (2021). Existential Abstraction on Argumentation Frameworks via Clustering. In Proceedings of the Eighteenth International Conference on Principles of Knowledge Representation and Reasoning (pp. 549–559). https://doi.org/10.24963/kr.2021/52
  • Bounded Predicates in Description Logics with Counting / Lukumbuzya, S., & Simkus, M. (2021). Bounded Predicates in Description Logics with Counting. In Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence. IJCAI 2021 - 30th International Joint Conference on Artificial Intelligence, Montreal, Canada, Canada. International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2021/271
  • Eliminating Harmful Joins in Warded Datalog+/− / Baldazzi, T., Bellomarini, L., Sallinger, E., & Atzeni, P. (2021). Eliminating Harmful Joins in Warded Datalog+/−. In Rules and Reasoning (pp. 267–275). https://doi.org/10.1007/978-3-030-91167-6_18
    Project: KnowledgeGraph (2020–2028)
  • A Big Data Learning Platform for the West Balkans and Beyond / Graux, D., Janev, V., Jabeen, H., & Sallinger, E. (2021). A Big Data Learning Platform for the West Balkans and Beyond. In Proceedings of the 26th ACM Conference on Innovation and Technology in Computer Science Education V. 2. ITiCSE 2021 - 26th {ACM} Conference on Innovation and Technology in Computer Science Education, Paderborn, Deutschland, Germany. https://doi.org/10.1145/3456565.3460026
    Project: KnowledgeGraph (2020–2028)
  • Deploying a Strategy to Unlock Big Data Research and Teaching Activities in the West Balkan Region / Graux, D., Janev, V., Jabeen, H., & Sallinger, E. (2021). Deploying a Strategy to Unlock Big Data Research and Teaching Activities in the West Balkan Region. In Proceedings of the 26th ACM Conference on Innovation and Technology in Computer Science Education V. 1. ITiCSE 2021 - 26th {ACM} Conference on Innovation and Technology in Computer Science Education, Paderborn, Deutschland, Germany. https://doi.org/10.1145/3430665.3456325
    Project: KnowledgeGraph (2020–2028)
  • Monotonic Aggregation for Temporal Datalog / Bellomarini, L., Nissl, M., & Sallinger, E. (2021). Monotonic Aggregation for Temporal Datalog. In Proceedings of the 15th International Rule Challenge, 7th Industry Track, and 5th Doctoral Consortium @ RuleML+RR 2021 co-located with 17th Reasoning Web Summer School {(RW} 2021) and 13th DecisionCAMP 2021 as part of Declarative {AI} 2021, Leuven, Belgium (virtual due to Covid-19 pandemic), 8 - 15 September, 2021} (pp. 1–23). http://hdl.handle.net/20.500.12708/58594
    Project: KnowledgeGraph (2020–2028)
  • Equivalence in Argumentation Frameworks with a Claim-Centric View – Classical Results with Novel Ingredients / Baumann, R., Rapberger, A., & Ulbricht, M. (2021). Equivalence in Argumentation Frameworks with a Claim-Centric View – Classical Results with Novel Ingredients. In Proceedings of the 19th International Workshop on Non-Monotonic Reasoning (pp. 71–80). http://hdl.handle.net/20.500.12708/58561
  • Fairness in Long-Term Participatory Budgeting / Lackner, M., Maly, J., & Rey, S. (2021). Fairness in Long-Term Participatory Budgeting. In AAMAS ’21: 20th International Conference on Autonomous Agents and Multiagent Systems (pp. 1566–1568). http://hdl.handle.net/20.500.12708/58559
    Project: SuDeMa (2019–2025)
  • Fairness in Long-Term Participatory Budgeting / Lackner, M., Maly, J., & Rey, S. (2021). Fairness in Long-Term Participatory Budgeting. In Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence. IJCAI 2021 - 30th International Joint Conference on Artificial Intelligence, Montreal, Canada, Canada. https://doi.org/10.24963/ijcai.2021/42
    Project: SuDeMa (2019–2025)
  • Approval-Based Shortlisting / Lackner, M., & Maly, J. (2021). Approval-Based Shortlisting. In AAMAS ’21: 20th International Conference on Autonomous Agents and Multiagent Systems, Virtual Event, United Kingdom, May 3-7, 2021 (pp. 737–745). http://hdl.handle.net/20.500.12708/58557
  • Decomposition-Guided Reductions for Argumentation and Treewidth / Fichte, J., Hecher, M., Mahmood, Y., & Meier, A. (2021). Decomposition-Guided Reductions for Argumentation and Treewidth. In Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence. IJCAI 2021 - 30th International Joint Conference on Artificial Intelligence, Montreal, Canada, Canada. https://doi.org/10.24963/ijcai.2021/259
    Project: START (2014–2022)
  • Choice Logics and Their Computational Properties / Bernreiter, M., Maly, J., & Woltran, S. (2021). Choice Logics and Their Computational Properties. In Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence. IJCAI 2021 - 30th International Joint Conference on Artificial Intelligence, Montreal, Canada, Canada. https://doi.org/10.24963/ijcai.2021/247
    Project: START (2014–2022)
  • Rule-based Blockchain Knowledge Graphs: Declarative {AI} for Solving Industrial Blockchain Challenges / Bellomarini, L., Galano, G., Nissl, M., & Sallinger, E. (2021). Rule-based Blockchain Knowledge Graphs: Declarative {AI} for Solving Industrial Blockchain Challenges. In Proceedings of the 15th International Rule Challenge, 7th Industry Track, and 5th Doctoral Consortium @ RuleML+RR 2021 co-located with 17th Reasoning Web Summer School {(RW} 2021) and 13th DecisionCAMP 2021 as part of Declarative {AI} 2021, Leuven, Belgium (virtual due to Covid-19 pandemic), 8 - 15 September, 2021} (pp. 1–16). http://hdl.handle.net/20.500.12708/55637
    Project: KnowledgeGraph (2020–2028)
  • Chapter 17. Fixed-Parameter Tractability / Samer, M., & Szeider, S. (2021). Chapter 17. Fixed-Parameter Tractability. In A. Biere, M. Heule, H. van Maaren, & T. Walsh (Eds.), Frontiers in Artificial Intelligence and Applications. IOS Press. https://doi.org/10.3233/faia201000
  • Beyond Uniform Equivalence between Answer-set Programs / Oetsch, J., Seidl, M., Tompits, H., & Woltran, S. (2021). Beyond Uniform Equivalence between Answer-set Programs. ACM Transactions on Computational Logic, 22(1), 1–46. https://doi.org/10.1145/3422361
  • Towards a proof theory for Henkin quantifiers / Baaz, M., & Lolic, A. (2021). Towards a proof theory for Henkin quantifiers. Journal of Logic and Computation, 31(1), 40–66. https://doi.org/10.1093/logcom/exaa071
  • Exploiting Database Management Systems and Treewidth for Counting / FICHTE, J. K., HECHER, M., THIER, P., & WOLTRAN, S. (2021). Exploiting Database Management Systems and Treewidth for Counting. Theory and Practice of Logic Programming, 22(1), 128–157. https://doi.org/10.1017/s147106842100003x
    Project: START (2014–2022)
  • HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings / Fischl, W., Gottlob, G., Longo, D. M., & Pichler, R. (2021). HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings. ACM Journal on Experimental Algorithmics, 26, 1–40. https://doi.org/10.1145/3440015
    Project: HyperTrac (2018–2022)
  • Joint Attacks and Accrual in Argumentation Frameworks / Bikakis, A., Cohen, A., Dvorak, W., Flouris, G., & Parsons, S. (2021). Joint Attacks and Accrual in Argumentation Frameworks. Journal of Applied Logics, 8(6), 1437–1502. http://hdl.handle.net/20.500.12708/138043
  • Preface: The practice and theory of automated timetabling (2018) / Özcan, E., Burke, E., Di Gaspero, L., MCCollum, B., & Musliu, N. (2021). Preface: The practice and theory of automated timetabling (2018). Annals of Operations Research, 302(2), 339–340. https://doi.org/10.1007/s10479-021-04117-w
  • DynASP2.5: Dynamic Programming on Tree Decompositions in Action / Fichte, J. K., Hecher, M., Morak, M., & Woltran, S. (2021). DynASP2.5: Dynamic Programming on Tree Decompositions in Action. Algorithms, 14(3), 81. https://doi.org/10.3390/a14030081
    Projects: HYPAR (2019–2024) / START (2014–2022)
  • Preface / BALDUCCINI, M., LIERLER, Y., & WOLTRAN, S. (2021). Preface. Theory and Practice of Logic Programming, 21(3), 293–295. https://doi.org/10.1017/s1471068420000484
  • Exact and metaheuristic approaches for unrelated parallel machine scheduling / Moser, M., Musliu, N., Schaerf, A., & Winter, F. (2021). Exact and metaheuristic approaches for unrelated parallel machine scheduling. Journal of Scheduling, 25(5), 507–534. https://doi.org/10.1007/s10951-021-00714-6
    Project: ARTIS (2017–2024)
  • A large neighborhood search approach for the paint shop scheduling problem / Winter, F., & Musliu, N. (2021). A large neighborhood search approach for the paint shop scheduling problem. Journal of Scheduling, 25(4), 453–475. https://doi.org/10.1007/s10951-021-00713-7
    Project: ARTIS (2017–2024)
  • Local search approaches for the test laboratory scheduling problem with variable task grouping / Mischek, F., Musliu, N., & Schaerf, A. (2021). Local search approaches for the test laboratory scheduling problem with variable task grouping. Journal of Scheduling. https://doi.org/10.1007/s10951-021-00699-2
  • Algorithm selection and instance space analysis for curriculum-based course timetabling / De Coster, A., Musliu, N., Schaerf, A., Schoisswohl, J., & Smith-Miles, K. (2021). Algorithm selection and instance space analysis for curriculum-based course timetabling. Journal of Scheduling, 25(1), 35–58. https://doi.org/10.1007/s10951-021-00701-x
  • An abstract form of the first epsilon theorem / Baaz, M., Leitsch, A., & Lolic, A. (2021). An abstract form of the first epsilon theorem. Journal of Logic and Computation, 30(8), 1447–1468. https://doi.org/10.1093/logcom/exaa044
  • Consistent approval-based multi-winner rules / Lackner, M., & Skowron, P. (2021). Consistent approval-based multi-winner rules. Journal of Economic Theory, 192(105173), 105173. https://doi.org/10.1016/j.jet.2020.105173
  • Abstraction for non-ground answer set programs / Saribatur, Z. G., Eiter, T., & Schüller, P. (2021). Abstraction for non-ground answer set programs. Artificial Intelligence, 300(103563), 103563. https://doi.org/10.1016/j.artint.2021.103563
    Projects: AI4EU (2019–2021) / DK - Logic (2014–2023) / HumanE-AI-Net (2020–2024)
  • A local search framework for industrial test laboratory scheduling / Mischek, F., & Musliu, N. (2021). A local search framework for industrial test laboratory scheduling. Annals of Operations Research, 302(2), 533–562. https://doi.org/10.1007/s10479-021-04007-1
    Project: ARTIS (2017–2024)
  • Constraint-based Scheduling for Paint Shops in the Automotive Supply Industry / Winter, F., & Musliu, N. (2021). Constraint-based Scheduling for Paint Shops in the Automotive Supply Industry. ACM Transactions on Intelligent Systems and Technology, 12(2), 1–25. https://doi.org/10.1145/3430710
    Project: ARTIS (2017–2024)
  • The Model Counting Competition 2020 / Fichte, J. K., Hecher, M., & Hamiti, F. (2021). The Model Counting Competition 2020. ACM Journal on Experimental Algorithmics, 26, 1–26. https://doi.org/10.1145/3459080
  • Physician Scheduling During a Pandemic / Geibinger, T., Kletzander, L., Krainz, M., Mischek, F., Musliu, N., & Winter, F. (2021). Physician Scheduling During a Pandemic. In Integration of Constraint Programming, Artificial Intelligence, and Operations Research (pp. 456–465). https://doi.org/10.1007/978-3-030-78230-6_29
    Project: ARTIS (2017–2024)
  • Graph-Classes of Argumentation Frameworks with Collective Attacks / Dvořák, W., König, M., & Woltran, S. (2021). Graph-Classes of Argumentation Frameworks with Collective Attacks. In Logics in Artificial Intelligence (pp. 3–17). https://doi.org/10.1007/978-3-030-75775-5_1
    Projects: HYPAR (2019–2024) / START (2014–2022)

2020

  • Rewriting Approaches for Ontology-Mediated Query Answering / Ahmetaj, S. (2020). Rewriting Approaches for Ontology-Mediated Query Answering. Kuenstliche Intelligenz, 34(4), 523–526. https://doi.org/10.1007/s13218-020-00671-w
  • Characterizing Tractability of Simple Well-Designed Pattern Trees with Projection. / Mengel, S., & Skritek, S. (2020). Characterizing Tractability of Simple Well-Designed Pattern Trees with Projection. Theory of Computing Systems, 65, 3–41. https://doi.org/10.1007/s00224-020-10002-z
  • Preferences Single-Peaked on a Circle / Peters, D., & Lackner, M. (2020). Preferences Single-Peaked on a Circle. Artificial Intelligence, 68, 463–502. https://doi.org/10.1613/jair.1.11732
  • Computing Secure Sets in Graphs using Answer Set Programming / Abseher, M., Bliem, B., Charwat, G., Dusberger, F., & Woltran, S. (2020). Computing Secure Sets in Graphs using Answer Set Programming. Journal of Logic and Computation, 30(4), 837–862. https://doi.org/10.1093/logcom/exv060
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • Catching the Ouroboros: On debugging non-ground answer-set programs / Oetsch, J., Pührer, J., & Tompits, H. (2020). Catching the Ouroboros: On debugging non-ground answer-set programs. 36th International Conference on Logic Programming (ICLP 2020), Rende, Italy. http://hdl.handle.net/20.500.12708/87161
  • Computational Argumentation - Formal Models and Complexity Results / Woltran, S. (2020). Computational Argumentation - Formal Models and Complexity Results. Research-Seminar, Bergen, Norway. http://hdl.handle.net/20.500.12708/87106
  • Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology / Hecher, M., Thier, P., & Woltran, S. (2020). Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology. DPSW 2020 - Declarative Problem Solving Workshop, Santiago de Compostela, online, Spain. http://hdl.handle.net/20.500.12708/87109
    Projects: HYPAR (2019–2024) / START (2014–2022)
  • Treewidth-aware Reductions of Normal ASP to SAT - Is Normal ASP Harder than SAT after All? / Hecher, M. (2020). Treewidth-aware Reductions of Normal ASP to SAT - Is Normal ASP Harder than SAT after All? In Proceedings of the Seventeenth International Conference on Principles of Knowledge Representation and Reasoning. KR 2020 - 17th International Conference on Principles of Knowledge Representation and Reasoning, Rhodos, online, Greece. https://doi.org/10.24963/kr.2020/49
    Projects: HYPAR (2019–2024) / START (2014–2022)
  • Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology / Hecher, M., Thier, P., & Woltran, S. (2020). Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology. In Theory and Applications of Satisfiability Testing – SAT 2020 (pp. 343–360). https://doi.org/10.1007/978-3-030-51825-7_25
    Project: START (2014–2022)
  • Structural Decompositions of Epistemic Logic Programs / Hecher, M., Morak, M., & Woltran, S. (2020). Structural Decompositions of Epistemic Logic Programs. In International Conference on Logic Programming 2020 Workshop Proceedings. ICLP 2020, Rende, Italy. CEUR-WS.org. http://hdl.handle.net/20.500.12708/58264
    Project: START (2014–2022)
  • Ontology Focusing: Knowledge-Enriched Databases on Demand / Gogacz, T., Gutierrez-Basulto, V., Ibanez Garcia, Y. A., Murlak, F., Ortiz de la Fuente, M. M., & Simkus, M. (2020). Ontology Focusing: Knowledge-Enriched Databases on Demand. In ECAI 2020 - 24th European Conference on Artificial Intelligence (pp. 745–752). Frontiers in Artificial Intelligence and Applications. http://hdl.handle.net/20.500.12708/55576
  • Treewidth-Aware Complexity in ASP:Not all Positive Cycles are Equally Hard / Fandinno, J., & Hecher, M. (2020). Treewidth-Aware Complexity in ASP:Not all Positive Cycles are Equally Hard. In 18th INTERNATIONAL WORKSHOP ONNON-MONOTONIC REASONING (pp. 48–57). http://hdl.handle.net/20.500.12708/55559
    Project: START (2014–2022)
  • Computational Argumentation - Formal Models and Complexity Results / Woltran, S. (2020). Computational Argumentation - Formal Models and Complexity Results. In Proceedings of the 35th Italian Conference on Computational Logic - {CILC} 2020, Rende, Italy, October 13-15, 2020 (pp. 1–2). http://hdl.handle.net/20.500.12708/55556
    Projects: HYPAR (2019–2024) / START (2014–2022)
  • Österreichische AI Strategie aus Sicht der Wissenschaft / Moser, B., Dorffner, G., Eiter, T., Faber, W., Klambauer, G., Legenstein, R., Nessler, B., Polleres, A., & Woltran, S. (2020). Österreichische AI Strategie aus Sicht der Wissenschaft. OCG Journal, 01–02, 14–17. http://hdl.handle.net/20.500.12708/141528
  • Reasoning Under Uncertainty in Knowledge Graphs / Bellomarini, L., Laurenza, E., Sallinger, E., & Sherkhonov, E. (2020). Reasoning Under Uncertainty in Knowledge Graphs. In Rules and Reasoning (pp. 131–139). https://doi.org/10.1007/978-3-030-57977-7_9
  • Rule-based Anti-Money Laundering in Financial Intelligence Units: Experience and Vision / Bellomarini, L., Laurenza, E., & Sallinger, E. (2020). Rule-based Anti-Money Laundering in Financial Intelligence Units: Experience and Vision. In Proceedings of the 14th International Rule Challenge, 4th Doctoral Consortium, and 6th Industry Track @ RuleML+RR 2020 co-located with 16th Reasoning Web Summer School {(RW} 2020) 12th DecisionCAMP 2020 as part of Declarative {AI} 2020, Oslo, Norway (virtual due to Covid-19 pandemic), 29 June - 1 July, 2020 (pp. 133–144). http://hdl.handle.net/20.500.12708/58323
    Project: KnowledgeGraph (2020–2028)
  • Perpetual Voting: Fairness in Long-Term Decision Making / Lackner, M. (2020). Perpetual Voting: Fairness in Long-Term Decision Making. In Proceedings of the AAAI Conference on Artificial Intelligence (pp. 2103–2110). https://doi.org/10.1609/aaai.v34i02.5584
  • Explaining Propagators for String Edit Distance Constraints / Musliu, N., Winter, F., & Stuckey, P. J. (2020). Explaining Propagators for String Edit Distance Constraints. In Proceedings of the AAAI Conference on Artificial Intelligence (pp. 1676–1683). https://doi.org/10.1609/aaai.v34i02.5530
    Project: ARTIS (2017–2024)
  • Lifting Preferences over Alternatives to Preferences over Sets of Alternatives: The Complexity of Recognizing Desirable Families of Sets / Maly, J. (2020). Lifting Preferences over Alternatives to Preferences over Sets of Alternatives: The Complexity of Recognizing Desirable Families of Sets. In Proceedings of the AAAI Conference on Artificial Intelligence (pp. 2152–2159). https://doi.org/10.1609/aaai.v34i02.5590
    Projects: START (2014–2022) / SuDeMa (2019–2025)
  • Structural Decompositions of Epistemic Logic Programs / Hecher, M., Morak, M., & Woltran, S. (2020). Structural Decompositions of Epistemic Logic Programs. In Proceedings of the AAAI Conference on Artificial Intelligence (pp. 2830–2837). https://doi.org/10.1609/aaai.v34i03.5672
    Projects: HYPAR (2019–2024) / START (2014–2022)
  • Query Rewriting for Ontology-Mediated Conditional Answers / Andresel, M., Ortiz, M., & Simkus, M. (2020). Query Rewriting for Ontology-Mediated Conditional Answers. In V. Conitzer & F. Sha (Eds.), Proceedings of the AAAI Conference on Artificial Intelligence (pp. 2734–2741). AAAI-20 Technical Tracks. https://doi.org/10.1609/aaai.v34i03.5660
    Projects: KtoAPP (2018–2025) / OMEGA (2017–2022)
  • Enumerating the Repairs of Inconsistent Databases / Kimmelfeld, B., Pichler, R., Kolaitis, P. G., & Skritek, S. (2020). Enumerating the Repairs of Inconsistent Databases. WEPA 2020 - 4th International Workshop on Enumeration Problems and Applications, online, Haifa, Israel. http://hdl.handle.net/20.500.12708/87117
  • Extending XORRO with Approximate Model Counting / Everardo, F., Hecher, M., & Shukla, A. (2020). Extending XORRO with Approximate Model Counting. Workshop ASPOCP 2020, University of Calabria, Rende, Italy. http://hdl.handle.net/20.500.12708/87108
    Projects: HYPAR (2019–2024) / START (2014–2022)
  • Project Scheduling in Industrial Test Laboratories / Mischek, F. (2020). Project Scheduling in Industrial Test Laboratories. ICAPS 2020 - International Conference on Automated Planning and Scheduling, Nancy, France. http://hdl.handle.net/20.500.12708/87083
    Project: ARTIS (2017–2024)
  • Stable Model Semantics for Recursive SHACL / Andresel, M., Corman, J., Ortiz, M., Reutter, J. L., Savkovic, O., & Simkus, M. (2020). Stable Model Semantics for Recursive SHACL. In Proceedings of The Web Conference 2020. International World Wide Web Conference (WWW), UK, Unknown. ACM. https://doi.org/10.1145/3366423.3380229
  • Sequent-Type Calculi for Systems of Nonmonotonic Paraconsistent Logics / Geibinger, T., & Tompits, H. (2020). Sequent-Type Calculi for Systems of Nonmonotonic Paraconsistent Logics. In Electronic Proceedings in Theoretical Computer Science (pp. 178–191). Electronic Proceedings in Theoretical Computer Science (EPTCS). https://doi.org/10.4204/eptcs.325.23
  • Fantastic Knowledge Graph Embeddings and How to Find the Right Space for Them / Nayyeri, M., Xu, C., Vahdati, S., Vassilyeva, N., Sallinger, E., Yazdi, H. S., & Lehmann, J. (2020). Fantastic Knowledge Graph Embeddings and How to Find the Right Space for Them. In Lecture Notes in Computer Science (pp. 438–455). https://doi.org/10.1007/978-3-030-62419-4_25
  • Solving the Test Laboratory Scheduling Problem with Variable Task Grouping / Danzinger, P., Geibinger, T., Mischek, F., & Musliu, N. (2020). Solving the Test Laboratory Scheduling Problem with Variable Task Grouping. In Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling (pp. 357–365). http://hdl.handle.net/20.500.12708/58340
    Project: ARTIS (2017–2024)
  • Solving the Steiner Tree Problem with few Terminals / Fichte, J. K., Hecher, M., & Schidler, A. (2020). Solving the Steiner Tree Problem with few Terminals. In 2020 IEEE 32nd International Conference on Tools with Artificial Intelligence (ICTAI). ICTAI 2020 - 32th International Conference on Tools with Artificial Intelligence, online conference, Unknown. https://doi.org/10.1109/ictai50040.2020.00054
    Projects: HYPAR (2019–2024) / START (2014–2022)
  • Breaking Symmetries with RootClique and LexTopSort / Fichte, J. K., Hecher, M., & Szeider, S. (2020). Breaking Symmetries with RootClique and LexTopSort. In Lecture Notes in Computer Science (pp. 286–303). https://doi.org/10.1007/978-3-030-58475-7_17
    Projects: HYPAR (2019–2024) / START (2014–2022)
  • A Time Leap Challenge for SAT-Solving / Fichte, J. K., Hecher, M., & Szeider, S. (2020). A Time Leap Challenge for SAT-Solving. In Lecture Notes in Computer Science (pp. 267–285). https://doi.org/10.1007/978-3-030-58475-7_16
    Projects: HYPAR (2019–2024) / START (2014–2022)
  • Treewidth-Aware Quantifier Elimination and Expansion for QCSP / Fichte, J. K., Hecher, M., & Kieler, M. F. I. (2020). Treewidth-Aware Quantifier Elimination and Expansion for QCSP. In Lecture Notes in Computer Science (pp. 248–266). https://doi.org/10.1007/978-3-030-58475-7_15
    Projects: HYPAR (2019–2024) / START (2014–2022)
  • Lower Bounds for QBFs of Bounded Treewidth / Fichte, J. K., Hecher, M., & Pfandler, A. (2020). Lower Bounds for QBFs of Bounded Treewidth. In Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS 2020, Saarbrücken, Germany. https://doi.org/10.1145/3373718.3394756
    Project: START (2014–2022)
  • Defining Argumentation Semantics under a Claim-centric View / Rapberger, A. (2020). Defining Argumentation Semantics under a Claim-centric View. In Proceedings of the 9th European Starting {AI} Researchers’ Symposium 2020 co-located with 24th European Conference on Artificial Intelligenc {(ECAI} 2020), Santiago Compostela, Spain, August, 2020 (pp. 1–8). http://hdl.handle.net/20.500.12708/58328
  • Encoding Choice Logics in ASP / Bernreiter, M., Maly, J., & Woltran, S. (2020). Encoding Choice Logics in ASP. In International Conference on Logic Programming 2020 Workshop Proceedings co-located with 36th International Conference on Logic Programming (ICLP 2020), Rende, Italy, September 18-19, 2020 (pp. 1–14). http://hdl.handle.net/20.500.12708/58290
    Project: START (2014–2022)
  • Weak Admissibility is PSPACE-complete / Dvorak, W., Ulbricht, M., & Woltran, S. (2020). Weak Admissibility is PSPACE-complete. In 18th INTERNATIONAL WORKSHOP ON NON-MONOTONIC REASONING (pp. 100–109). http://hdl.handle.net/20.500.12708/58277
  • Argumentation Semantics under a Claim-centric View: Properties, Expressiveness and Relation to SETAFs / Dvořák, W., Rapberger, A., & Woltran, S. (2020). Argumentation Semantics under a Claim-centric View: Properties, Expressiveness and Relation to SETAFs. In Proceedings of the Seventeenth International Conference on Principles of Knowledge Representation and Reasoning. KR 2020 - 17th International Conference on Principles of Knowledge Representation and Reasoning, Rhodos, Greece. https://doi.org/10.24963/kr.2020/35
    Project: DK - Logic (2014–2023)
  • Ranking-Based Semantics from the Perspective of Claims / Bistarelli, S., Dvorak, W., Taticchi, C., & Woltran, S. (2020). Ranking-Based Semantics from the Perspective of Claims. In Computational Models of Argument - Proceedings of {COMMA} 2020, Perugia, Italy, September 4-11, 2020 (pp. 111–122). http://hdl.handle.net/20.500.12708/58261
  • Labelling-based Algorithms for SETAFs / Dvorak, W., Rapberger, A., & Wallner, J. P. (2020). Labelling-based Algorithms for SETAFs. In S. A. Gaggl, M. Thimm, & M. Vallati (Eds.), Proceedings SAFA 2020 (pp. 34–46). CEUR-WS.org. http://hdl.handle.net/20.500.12708/58209
  • Computing Strongly Admissible Sets / Dvorak, W., & Wallner, J. P. (2020). Computing Strongly Admissible Sets. In H. Prakken, S. Bistarelli, F. Santini, & C. Taticchi (Eds.), Proceedings COMMA (pp. 179–190). IOs Press. http://hdl.handle.net/20.500.12708/58171
  • An Answer Set Programming Approach to Argumentative Reasoning in the ASPIC+ Framework / Lehtonen, T., Wallner, J. P., & Järvisalo, M. (2020). An Answer Set Programming Approach to Argumentative Reasoning in the ASPIC+ Framework. In D. Calvanese, E. Erdem, & M. Thielscher (Eds.), Proceedings of the Seventeenth International Conference on Principles of Knowledge Representation and Reasoning. IJCAI Organization. https://doi.org/10.24963/kr.2020/63
  • Explaining Non-Acceptability in Abstract Argumentation / Saribatur, Z. G., Wallner, J. P., & Woltran, S. (2020). Explaining Non-Acceptability in Abstract Argumentation. In G. De Giacomo (Ed.), Proceedings ECAI (pp. 881–888). IOS Press. http://hdl.handle.net/20.500.12708/58147
    Projects: DK - Logic (2014–2023) / START (2014–2022)
  • Weaving Enterprise Knowledge Graphs: The Case of Company Ownership Graphs / Atzeni, P., Bellomarini, L., Iezzi, M., Sallinger, E., & Vlad, A. (2020). Weaving Enterprise Knowledge Graphs: The Case of Company Ownership Graphs. In Proceedings of the 23rd International Conference on Extending Database Technology, {EDBT} 2020, Copenhagen, Denmark, March 30 - April 02, 2020 (pp. 555–566). http://hdl.handle.net/20.500.12708/55580
    Project: KnowledgeGraph (2020–2028)
  • Fractional Covers of Hypergraphs with BoundedMulti-Intersection / Gottlob, G., Lanzinger, M., Pichler, R., & Razgon, I. (2020). Fractional Covers of Hypergraphs with BoundedMulti-Intersection. In 45th International Symposium on Mathematical Foundations of Computer Science August 24-28, 2020, Prague (Czech Republic) (pp. 1–14). https://doi.org/10.4230/LIPIcs.MFCS.2020.41
  • Solving Large Real-Life Bus Driver Scheduling Problems with Complex Break Constraints / Kletzander, L., & Musliu, N. (2020). Solving Large Real-Life Bus Driver Scheduling Problems with Complex Break Constraints. In Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, Nancy, France, October 26-30, 2020 (pp. 421–430). http://hdl.handle.net/20.500.12708/55565
    Project: ARTIS (2017–2024)
  • Reasoning on Company Takeovers during the COVID-19 Crisis with Knowledge Graphs / Bellomarini, L., Benedetti, M., Ceri, S., Laurendi, R., Magnanimi, D., Nissl, M., & Sallinger, E. (2020). Reasoning on Company Takeovers during the COVID-19 Crisis with Knowledge Graphs. In roceedings of the 14th International Rule Challenge, 4th Doctoral Consortium, and 6th Industry Track @ RuleML+RR 2020 co-located with 16th Reasoning Web Summer School {(RW} 2020) 12th DecisionCAMP 2020 as part of Declarative {AI} 2020, Oslo, Norway (virtual due to Covid-19 pandemic), 29 June - 1 July, 2020 (pp. 145–156). http://hdl.handle.net/20.500.12708/55579
    Project: KnowledgeGraph (2020–2028)
  • An Approximate Model Counter for ASP / Everardo, F., Hecher, M., & Shukla, A. (2020). An Approximate Model Counter for ASP. In 18th INTERNATIONAL WORKSHOP ON NON-MONOTONIC REASONING (pp. 208–216). http://hdl.handle.net/20.500.12708/55561
    Project: START (2014–2022)
  • Counting with Bounded Treewidth: Meta Algorithm and Runtime Guarantees / Fichte, J., & Hecher, M. (2020). Counting with Bounded Treewidth: Meta Algorithm and Runtime Guarantees. In 18th INTERNATIONAL WORKSHOP ON NON-MONOTONIC REASONING (pp. 9–18). http://hdl.handle.net/20.500.12708/55560
    Project: START (2014–2022)
  • An ExpTime Upper Bound for ALC with Integers / Labai, N., Simkus, M., & Ortiz de la Fuente, M. M. (2020). An ExpTime Upper Bound for ALC with Integers. In D. Calvanese, E. Erdem, & M. Thielscher (Eds.), Proceedings of the Seventeenth International Conference on Principles of Knowledge Representation and Reasoning. AAAI Press. https://doi.org/10.24963/kr.2020/61
  • Expressiveness of SETAFs and Support-Free ADFs Under 3-Valued Semantics / Dvorak, W., Keshavarzi Zafarghandi, A., & Woltran, S. (2020). Expressiveness of SETAFs and Support-Free ADFs Under 3-Valued Semantics. In Computational Models of Argument - Proceedings of {COMMA} 2020, Perugia, Italy, September 4-11, 2020 (pp. 191–202). http://hdl.handle.net/20.500.12708/55557
    Project: GRAPPA (2016–2019)
  • Datalog Rewritability and Data Complexity of ALCHOIF with Closed Predicates / Gogacz, T., Lukumbuzya, S., Simkus, M., & Ortiz de la Fuente, M. M. (2020). Datalog Rewritability and Data Complexity of ALCHOIF with Closed Predicates. In D. Calvanese, E. Erdem, & M. Thielscher (Eds.), Proceedings of the Seventeenth International Conference on Principles of Knowledge Representation and Reasoning. AAAI Press. https://doi.org/10.24963/kr.2020/44
  • The ASPARTIX system suite / Dvorak, W., Gaggl, S. A., Rapberger, A., Wallner, J. P., & Woltran, S. (2020). The ASPARTIX system suite. In H. Prakken, S. Bistarelli, F. Santini, & C. Taticchi (Eds.), Proceedings COMMA (pp. 461–462). IOS Press. http://hdl.handle.net/20.500.12708/55544
    Project: DK - Logic (2014–2023)
  • Investigating subclasses of abstract dialectical frameworks / Diller, M., Keshavarzi Zafarghandi, A., Linsbichler, T., & Woltran, S. (2020). Investigating subclasses of abstract dialectical frameworks. Argument & Computation, 11(1–2), 191–219. https://doi.org/10.3233/aac-190481
    Projects: DK - Logic (2014–2023) / GRAPPA (2016–2019)
  • Design and results of the Second International Competition on Computational Models of Argumentation / Gaggl, S. A., Linsbichler, T., Maratea, M., & Woltran, S. (2020). Design and results of the Second International Competition on Computational Models of Argumentation. Artificial Intelligence, 279(103193), 103193. https://doi.org/10.1016/j.artint.2019.103193
    Projects: GRAPPA (2016–2019) / START (2014–2022)
  • Complexity Analysis of General and Fractional Hypertree Decompositions / Gottlob, G., Lanzinger, M., Pichler, R., & Razgon, I. (2020). Complexity Analysis of General and Fractional Hypertree Decompositions (p. 54). arXiv. https://doi.org/10.48550/arXiv.2002.05239
  • Towards Cross-Blockchain Smart Contracts / Nissl, M., Sallinger, E., Schulte, S., & Borkowski, M. (2020). Towards Cross-Blockchain Smart Contracts. arXiv. https://doi.org/10.48550/arXiv.2010.07352
    Project: KnowledgeGraph (2020–2028)
  • Ontologies and Data Management: A Brief Survey / Schneider, T., & Šimkus, M. (2020). Ontologies and Data Management: A Brief Survey. Kuenstliche Intelligenz, 34(3), 329–353. https://doi.org/10.1007/s13218-020-00686-3
  • An Evolutionary Algorithm for Rule Learning over Knowledge Graphs / Wu, L., Sallinger, E., Sherkhonov, E., Vahdati, S., & Gottlob, G. (2020). An Evolutionary Algorithm for Rule Learning over Knowledge Graphs. In Proceedings of the International Workshop on Knowledge Representation and Representation Learning co-located with the 24th European Conference on Artificial Intelligence {(ECAI} 2020), Virtual Event, September, 2020 (pp. 52–59). http://hdl.handle.net/20.500.12708/58744
    Project: KnowledgeGraph (2020–2028)
  • Blockchains as Knowledge Graphs - Blockchains for Knowledge Graphs (Vision Paper) / Bellomarini, L., Nissl, M., & Sallinger, E. (2020). Blockchains as Knowledge Graphs - Blockchains for Knowledge Graphs (Vision Paper). In Proceedings of the International Workshop on Knowledge Representation and Representation Learning co-located with the 24th European Conference on Artificial Intelligence {(ECAI} 2020), Virtual Event, September, 2020 (pp. 43–51). http://hdl.handle.net/20.500.12708/58743
    Project: KnowledgeGraph (2020–2028)
  • Traversing Knowledge Graphs with Good Old (and New) Joins / Atzeni, P., Bellomarini, L., Benedetto, D., & Sallinger, E. (2020). Traversing Knowledge Graphs with Good Old (and New) Joins. In Proceedings of the International Workshop on Knowledge Representation and Representation Learning co-located with the 24th European Conference on Artificial Intelligence {(ECAI} 2020), Virtual Event, September, 2020}, (pp. 3–9). http://hdl.handle.net/20.500.12708/58742
    Project: KnowledgeGraph (2020–2028)
  • Knowledge Graphs: Meeting Point of Knowledge Representation and Representation Learning / Sallinger, E. (2020). Knowledge Graphs: Meeting Point of Knowledge Representation and Representation Learning. In Proceedings of the International Workshop on Knowledge Representation and Representation Learning co-located with the 24th European Conference on Artificial Intelligence {(ECAI} 2020), Virtual Event, September, 2020 (pp. 1–2). http://hdl.handle.net/20.500.12708/55678
    Project: KnowledgeGraph (2020–2028)
  • Augmenting Logic-based Knowledge Graphs: The Case of Company Graphs / Atzeni, P., Bellomarini, L., Iezzi, M., Sallinger, E., & Vlad, A. (2020). Augmenting Logic-based Knowledge Graphs: The Case of Company Graphs. In Proceedings of the International Workshop on Knowledge Representation and Representation Learning co-located with the 24th European Conference on Artificial Intelligence {(ECAI} 2020), Virtual Event, September, 2020 (pp. 22–27). http://hdl.handle.net/20.500.12708/55677
    Project: KnowledgeGraph (2020–2028)
  • Chapter 2 Knowledge Graphs: The Layered Perspective / Bellomarini, L., Sallinger, E., & Vahdati, S. (2020). Chapter 2 Knowledge Graphs: The Layered Perspective. In Knowledge Graphs and Big Data Processing (pp. 20–34). Springer. https://doi.org/10.1007/978-3-030-53199-7_2
  • Chapter 6 Reasoning in Knowledge Graphs: An Embeddings Spotlight / Bellomarini, L., Sallinger, E., & Vahdati, S. (2020). Chapter 6 Reasoning in Knowledge Graphs: An Embeddings Spotlight. In Knowledge Graphs and Big Data Processing (pp. 87–101). Springer. https://doi.org/10.1007/978-3-030-53199-7_6
  • lpopt: A Rule Optimization Tool for Answer Set Programming / Bichler, M., Morak, M., & Woltran, S. (2020). lpopt: A Rule Optimization Tool for Answer Set Programming. Fundamenta Informaticae, 177(3–4). https://doi.org/10.3233/fi-2020-1990
  • The Impact of Treewidth on Grounding and Solving of Answer Set Programs / Bliem, B., Morak, M., Moldovan, M., & Woltran, S. (2020). The Impact of Treewidth on Grounding and Solving of Answer Set Programs. Artificial Intelligence, 67, 35–80. https://doi.org/10.1613/jair.1.11515
    Projects: HYPAR (2019–2024) / HyperTrac (2018–2022) / START (2014–2022)
  • Exploiting Database Management Systems and Treewidth for Counting / FICHTE, J. K., HECHER, M., THIER, P., & WOLTRAN, S. (2020). Exploiting Database Management Systems and Treewidth for Counting. In Theory and Practice of Logic Programming (pp. 128–157). https://doi.org/10.1017/s147106842100003x
    Projects: HYPAR (2019–2024) / START (2014–2022)
  • Forgetting in Modular Answer Set Programming / Gonçalves, R., Janhunen, T., Knorr, M., Leite, J., & Woltran, S. (2020). Forgetting in Modular Answer Set Programming. In Proceedings of the 18th INTERNATIONAL WORKSHOP ON NON-MONOTONIC REASONING (pp. 189–197). http://hdl.handle.net/20.500.12708/58278
    Project: START (2014–2022)
  • Strong Equivalence for Argumentation Frameworks with Collective Attacks / Dvořák, W., Rapberger, A., & Woltran, S. (2020). Strong Equivalence for Argumentation Frameworks with Collective Attacks. In ECAI 2020 - 24th European Conference on Artificial Intelligence (pp. 721–728). IOS Press. https://doi.org/10.3233/FAIA200159
  • The HyperTrac Project: Recent Progress and Future Research Directions on Hypergraph Decompositions / Gottlob, G., Lanzinger, M., Longo, D. M., Okulmus, C., & Pichler, R. (2020). The HyperTrac Project: Recent Progress and Future Research Directions on Hypergraph Decompositions. In Integration of Constraint Programming, Artificial Intelligence, and Operations Research (pp. 3–21). Springer. https://doi.org/10.1007/978-3-030-58942-4_1
    Project: HyperTrac (2018–2022)
  • Proportional Belief Merging / Haret, A., Lackner, M., Pfandler, A., & Wallner, J. P. (2020). Proportional Belief Merging. In V. Conitzer & F. Sha (Eds.), Proceedings of the AAAI Conference on Artificial Intelligence (pp. 2822–2829). AAAI Press. https://doi.org/10.1609/aaai.v34i03.5671
    Projects: DK - Logic (2014–2023) / HyperTrac (2018–2022) / SuDeMa (2019–2025)
  • Resilient Logic Programs: Answer Set Programs Challenged by Ontologies / Ortiz de la Fuente, M. M., Simkus, M., & Lukumbuzya, S. (2020). Resilient Logic Programs: Answer Set Programs Challenged by Ontologies. In V. Conitzer & F. Sha (Eds.), Proceedings of the AAAI Conference on Artificial Intelligence (pp. 2917–2924). AAAI-20 Technical Tracks. https://doi.org/10.1609/aaai.v34i03.5683
  • On the different types of collective attacks in abstract argumentation: equivalence results for SETAFs / Dvořák, W., Rapberger, A., & Woltran, S. (2020). On the different types of collective attacks in abstract argumentation: equivalence results for SETAFs. Journal of Logic and Computation, 30(5), 1063–1107. https://doi.org/10.1093/logcom/exaa033
  • Introduction to the CPAIOR 2020 fast track issue / Hebrard, E., & Musliu, N. (2020). Introduction to the CPAIOR 2020 fast track issue. Constraints, 25(3–4), 298–299. https://doi.org/10.1007/s10601-020-09319-w
  • Special Issue on Ontologies and Data Management: Part I / Schneider, T., & Šimkus, M. (2020). Special Issue on Ontologies and Data Management: Part I. Kuenstliche Intelligenz, 34(3), 287–289. https://doi.org/10.1007/s13218-020-00682-7
  • Structural Constraints for Dynamic Operators in Abstract Argumentation / Wallner, J. P. (2020). Structural Constraints for Dynamic Operators in Abstract Argumentation. Argument & Computation, 11(1–2), 151–190. https://doi.org/10.3233/aac-190471
    Project: GRAPPA (2016–2019)
  • Solving Advanced Argumentation Problems with Answer Set Programming / BREWKA, G., DILLER, M., HEISSENBERGER, G., LINSBICHLER, T., & WOLTRAN, S. (2020). Solving Advanced Argumentation Problems with Answer Set Programming. Theory and Practice of Logic Programming, 20(3), 391–431. https://doi.org/10.1017/s1471068419000474
  • selp: A Single-Shot Epistemic Logic Program Solver / BICHLER, M., MORAK, M., & WOLTRAN, S. (2020). selp: A Single-Shot Epistemic Logic Program Solver. Theory and Practice of Logic Programming, 20(4), 435–455. https://doi.org/10.1017/s1471068420000022
  • A Mathematical Analysis of an Election System Proposed by Gottlob Frege / Harrenstein, P., Lackner, M.-L., & Lackner, M. (2020). A Mathematical Analysis of an Election System Proposed by Gottlob Frege. Erkenntnis, 87(6), 2609–2644. https://doi.org/10.1007/s10670-020-00318-0
  • Runs in labelled trees and mappings / Lackner, M.-L., & Panholzer, A. (2020). Runs in labelled trees and mappings. Discrete Mathematics, 343(111990), 111990. https://doi.org/10.1016/j.disc.2020.111990
  • Solving the general employee scheduling problem / Kletzander, L., & Musliu, N. (2020). Solving the general employee scheduling problem. Computers and Operations Research, 113(104794), 104794. https://doi.org/10.1016/j.cor.2019.104794
    Project: ARTIS (2017–2024)
  • Incomplete Preferences in Single-Peaked Electorates / Lackner, M., & Fitzsimmons, Z. (2020). Incomplete Preferences in Single-Peaked Electorates. Artificial Intelligence, 67, 797–833. https://doi.org/10.1613/jair.1.11577
  • Utilitarian welfare and representation guarantees of approval-based multiwinner rules / Lackner, M., & Skowron, P. (2020). Utilitarian welfare and representation guarantees of approval-based multiwinner rules. Artificial Intelligence, 288(103366), 103366. https://doi.org/10.1016/j.artint.2020.103366
  • On the limits of forgetting in Answer Set Programming / Gonçalves, R., Knorr, M., Leite, J., & Woltran, S. (2020). On the limits of forgetting in Answer Set Programming. Artificial Intelligence, 286(103307), 103307. https://doi.org/10.1016/j.artint.2020.103307
  • Complexity of abstract argumentation under a claim-centric view / Dvořák, W., & Woltran, S. (2020). Complexity of abstract argumentation under a claim-centric view. Artificial Intelligence, 285(103290), 103290. https://doi.org/10.1016/j.artint.2020.103290
    Projects: GRAPPA (2016–2019) / START (2014–2022)
  • Polynomial rewritings from expressive Description Logics with closed predicates to variants of Datalog / Ahmetaj, S., Ortiz, M., & Šimkus, M. (2020). Polynomial rewritings from expressive Description Logics with closed predicates to variants of Datalog. Artificial Intelligence, 280(103220), 103220. https://doi.org/10.1016/j.artint.2019.103220
    Projects: KtoAPP (2018–2025) / OMEGA (2017–2022)
  • Instance space analysis for a personnel scheduling problem / Kletzander, L., Musliu, N., & Smith-Miles, K. (2020). Instance space analysis for a personnel scheduling problem. Annals of Mathematics and Artificial Intelligence, 89(7), 617–637. https://doi.org/10.1007/s10472-020-09695-2
    Project: ARTIS (2017–2024)
  • On the Language of Nested Tuple Generating Dependencies / Kolaitis, P. G., Pichler, R., Sallinger, E., & Savenkov, V. (2020). On the Language of Nested Tuple Generating Dependencies. ACM Transactions on Database Systems, 45(2), 1–59. https://doi.org/10.1145/3369554
    Projects: HINT (2012–2017) / KnowledgeGraph (2020–2028) / START (2014–2022)
  • Technical Perspective: Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation / Pichler, R. (2020). Technical Perspective: Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation. ACM SIGMOD Record, 49(1), 51–51. https://doi.org/10.1145/3422648.3422660
  • Interview with Diego Calvanese / Calvanese, D., & Šimkus, M. (2020). Interview with Diego Calvanese. KI - Künstliche Intelligenz, 34(4), 551–555. https://doi.org/10.1007/s13218-020-00691-6
  • Special Issue on Ontologies and Data Management: Part II / Schneider, T., & Šimkus, M. (2020). Special Issue on Ontologies and Data Management: Part II. KI - Künstliche Intelligenz, 34(4), 439–441. https://doi.org/10.1007/s13218-020-00693-4
  • Treewidth-Aware Reductions of normal ASP to SAT - Is normal ASP harder than SAT after all? / Hecher, M. (2020). Treewidth-Aware Reductions of normal ASP to SAT - Is normal ASP harder than SAT after all? 4th Workshop on Trends and Applications of Answer Set Programming (TAASP 2020), Klagenfurt, Austria. http://hdl.handle.net/20.500.12708/87107
    Projects: HYPAR (2019–2024) / START (2014–2022)
  • Integration of Constraint Programming, Artificial Intelligence, and Operations Research / Hebrard, E., & Musliu, N. (Eds.). (2020). Integration of Constraint Programming, Artificial Intelligence, and Operations Research. Springer. https://doi.org/10.1007/978-3-030-58942-4
    Project: ARTIS (2017–2024)
  • An ExpTime Upper Bound for ALC with Integers (Extended Version) / Labai, N., Simkus, M., & Ortiz de la Fuente, M. M. (2020). An ExpTime Upper Bound for ALC with Integers (Extended Version) (2006.02078). http://hdl.handle.net/20.500.12708/40248

2019

  • Preface / Ferrarotti, F., & Woltran, S. (2019). Preface. Annals of Mathematics and Artificial Intelligence, 87(1–2), 1–4. https://doi.org/10.1007/s10472-019-09667-1
  • Solving the Torpedo Scheduling Problem / Geiger, M. J., Kletzander, L., & Musliu, N. (2019). Solving the Torpedo Scheduling Problem. Journal of Artificial Intelligence Research, 66, 1–32. https://doi.org/10.1613/jair.1.11303
    Project: ARTIS (2017–2024)
  • Inconsistency Proofs for ASP: The ASP - DRUPE Format / ALVIANO, M., DODARO, C., FICHTE, J. K., HECHER, M., PHILIPP, T., & RATH, J. (2019). Inconsistency Proofs for ASP: The ASP - DRUPE Format. In Theory and Practice of Logic Programming (pp. 891–907). TPLP. https://doi.org/10.1017/s1471068419000255
    Project: START (2014–2022)
  • Solution Approaches for an Automotive Paint Shop Scheduling Problem / Winter, F., Musliu, N., Mrkvicka, C., & Demirovic, E. (2019). Solution Approaches for an Automotive Paint Shop Scheduling Problem. In Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, {ICAPS} 2019 (pp. 573–581). AAAI Press. http://hdl.handle.net/20.500.12708/57874
    Project: ARTIS (2017–2024)
  • Exact Methods for a Paint Shop Scheduling Problem from the Automotive Supply Industry / Winter, F., & Musliu, N. (2019). Exact Methods for a Paint Shop Scheduling Problem from the Automotive Supply Industry. CPAIOR 2019 - 16th International Conference on the Integration of Constraint Programming, Artificial Intelligence and Operations Research, Thessaloniki, Greece. http://hdl.handle.net/20.500.12708/86907
    Project: ARTIS (2017–2024)
  • Vadalog: Recent Advances and Applications / Gottlob, G., Sallinger, E., & Pieris, A. (2019). Vadalog: Recent Advances and Applications. In Lecture Notes in Computer Science. JELIA 2019 - 16th Edition of the European Conference on Logics in Artificial Intelligence, Rende, Kalbrien, Italy. Springer. https://doi.org/10.1007/978-3-030-19570-0
  • The Space-Efficient Core of Vadalog / Berger, G., Gottlob, G., Pieris, A., & Sallinger, E. (2019). The Space-Efficient Core of Vadalog. In Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems  - PODS ’19. SIGMOD/PODS 2019 - 38th Symposium on Principles of Database Systems 2019, Amsterdam, Netherlands (the). https://doi.org/10.1145/3294052.3319688
  • gpusat2 - An Improved GPU Model Counter / Fichte, J., Hecher, M., & Zisser, M. (2019). gpusat2 - An Improved GPU Model Counter. In Pragmatics of SAT 2019 @ SAT 2019 (pp. 1–17). http://hdl.handle.net/20.500.12708/58011
    Project: START (2014–2022)
  • Aggregating Expert Opinions in Support of Medical Diagnostic Decision-Making / Gangl, C., Lackner, M., Maly, J., & Woltran, S. (2019). Aggregating Expert Opinions in Support of Medical Diagnostic Decision-Making. In Knowledge Representation for Health Care/ProHealth, KR4HC 2019 (pp. 56–62). http://hdl.handle.net/20.500.12708/57907
    Projects: START (2014–2022) / SuDeMa (2019–2025)
  • Multi-valued GRAPPA / Brewka, G., Pührer, J., & Woltran, S. (2019). Multi-valued GRAPPA. In Lecture Notes in Computer Science. JELIA 2019 - 16th Edition of the European Conference on Logics in Artificial Intelligence, Rende, Kalbrien, Italy. Springer. https://doi.org/10.1007/978-3-030-19570-0
    Project: GRAPPA (2016–2019)
  • Datalog: Bag Semantics via Set Semantics / Bertossi, L., Gottlob, G., & Pichler, R. (2019). Datalog: Bag Semantics via Set Semantics. In P. Barcelo & M. Calutti (Eds.), 22nd International Conference on Database Theory, {ICDT} 2019 (pp. 16:1-16:19). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.ICDT.2019.16
  • Characterizing Tractability of Simple Well-Designed Pattern Trees with Projection / Mengel, S., & Skritek, S. (2019). Characterizing Tractability of Simple Well-Designed Pattern Trees with Projection. In P. Barcelo & M. Calautti (Eds.), 22nd International Conference on Database Theory, {ICDT} 2019 (pp. 20:1-20:18). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.ICDT.2019.20
    Project: HyperTrac (2018–2022)
  • Investigating Constraint Programming for Real World Industrial Test Laboratory Scheduling / Geibinger, T., Mischek, F., & Musliu, N. (2019). Investigating Constraint Programming for Real World Industrial Test Laboratory Scheduling. In Integration of Constraint Programming, Artificial Intelligence, and Operations Research (pp. 304–319). Springer. https://doi.org/10.1007/978-3-030-19212-9_20
    Project: ARTIS (2017–2024)
  • Characterising Relativised Strong Equivalence with Projection for Non-ground Answer-Set Programs / Geibinger, T., & Tompits, H. (2019). Characterising Relativised Strong Equivalence with Projection for Non-ground Answer-Set Programs. In F. Calimeri, N. Leone, & M. Manna (Eds.), Logics in Artificial Intelligence: 16th European Conference, JELIA 2019 (pp. 542–558). Springer. https://doi.org/10.1007/978-3-030-19570-0_36
    Project: ARTIS (2017–2024)
  • Modelling and Solving the Minimum Shift Design Problem / Kletzander, L., & Musliu, N. (2019). Modelling and Solving the Minimum Shift Design Problem. In Lecture Notes in Computer Science. CPAIOR 2019 - 16th International Conference on the Integration of Constraint Programming, Artificial Intelligence and Operations Research, Thessaloniki, Greece. Springer. https://doi.org/10.1007/978-3-030-19212-9
    Project: ARTIS (2017–2024)
  • Preprocessing Argumentation Frameworks via Replacement Patterns / Dvořák, W., Järvisalo, M., Linsbichler, T., Niskanen, A., & Woltran, S. (2019). Preprocessing Argumentation Frameworks via Replacement Patterns. In Logics in Artificial Intelligence (pp. 116–132). Springer. https://doi.org/10.1007/978-3-030-19570-0_8
    Project: GRAPPA (2016–2019)
  • Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs / Chatterjee, K., Dvorak, W., Henzinger, M., & Svozil, A. (2019). Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs. In W. Fokkink & R. van Glabbeek (Eds.), 30th International Conference on Concurrency Theory, {CONCUR} 2019 (pp. 7:1-7:16). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2019.7
  • HyperBench / Fischl, W., Longo, D. M., Gottlob, G., & Pichler, R. (2019). HyperBench. In Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems - PODS ’19. SIGMOD/PODS 2019 - 38th Symposium on Principles of Database Systems 2019, Amsterdam, Netherlands (the). ACM. https://doi.org/10.1145/3294052.3319683
    Project: HyperTrac (2018–2022)
  • On the Enumeration Complexity of Unions of Conjunctive Queries / Kröll, M., & Carmeli, N. (2019). On the Enumeration Complexity of Unions of Conjunctive Queries. In Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems  - PODS ’19. SIGMOD/PODS 2019 - 38th Symposium on Principles of Database Systems 2019, Amsterdam, Netherlands (the). ACM. https://doi.org/10.1145/3294052.3319700
    Project: HyperTrac (2018–2022)
  • Manipulating Skeptical and Credulous Consequences When Merging Beliefs / Haret, A., & Wallner, J. P. (2019). Manipulating Skeptical and Credulous Consequences When Merging Beliefs. In F. Calimeri, N. Leone, & M. Manna (Eds.), Logics in Artificial Intelligence (pp. 133–150). Springer. https://doi.org/10.1007/978-3-030-19570-0_9
  • Ontology-Enriched Data Management with Partially Complete Data / Lukumbuzya, S. (2019). Ontology-Enriched Data Management with Partially Complete Data. In A. Soylu, S. Moschoyiannis, G. Governatori, M. Simkus, P. Stefaneas, A. Steen, & A. Giurca (Eds.), Proceedings of the 13th RuleML+RR 2019 Doctoral Consortium and Rule Challenge, September 16-19, 2019 - Bolzano, Italy. CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/55537
  • Strong Equivalence for Argumentation Frameworks with Collective Attacks / Dvorak, W., Rapberger, A., & Woltran, S. (2019). Strong Equivalence for Argumentation Frameworks with Collective Attacks. In Lecture Notes in Computer Science. KI 2019 - 42nd German Conference on AI, Kassel, Germany. https://doi.org/10.1007/978-3-030-30179-8
    Project: GRAPPA (2016–2019)
  • Complexity Bounds for Relational Algebra over Document Spanners / Kröll, M., Peterfreund, L., Freydenberger, D., & Kimmelfeld, B. (2019). Complexity Bounds for Relational Algebra over Document Spanners. In Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems  - PODS ’19. SIGMOD/PODS 2019 - 38th Symposium on Principles of Database Systems 2019, Amsterdam, Netherlands (the). https://doi.org/10.1145/3294052.3319699
    Project: HyperTrac (2018–2022)
  • Optimizing Horn-SHIQ Reasoning for OBDA / Bajraktari, L., Ortiz de la Fuente, M. M., & Xiao, G. (2019). Optimizing Horn-SHIQ Reasoning for OBDA. In Lecture Notes in Computer Science. ISWC 2019 - International Semantic Web Conference, Auckland, New Zealand, Non-EU. Springer. https://doi.org/10.1007/978-3-030-30793-6
    Project: KtoAPP (2018–2025)
  • Expansion-based QBF Solving on Tree Decompositions / Charwat, G., & Woltran, S. (2019). Expansion-based QBF Solving on Tree Decompositions. Fundamenta Informaticae, 167(1–2), 59–92. https://doi.org/10.3233/fi-2019-1810
    Project: START (2014–2022)
  • VADA: an architecture for end user informed data preparation / Konstantinou, N., Abel, E., Bellomarini, L., Bogatu, A. T., Civili, C., Irfanie, E., Köhler, M., Lacramioara, M., Sallinger, E., Fernandes, A. A. A., Gottlob, G., Keane, J. A., & Paton, N. W. (2019). VADA: an architecture for end user informed data preparation. Journal Of Big Data, 6(74). https://doi.org/10.1186/s40537-019-0237-9
  • Inconsistency Proofs for ASP: The ASP-DRUPE Format / Fichte, J., Hecher, M., & Philipp, T. (2019). Inconsistency Proofs for ASP: The ASP-DRUPE Format. In Aspocp 2019 @ Lpnmr 2019 (pp. 1–15). http://hdl.handle.net/20.500.12708/57764
    Project: START (2014–2022)
  • Backdoors to planning / Kronegger, M., Ordyniak, S., & Pfandler, A. (2019). Backdoors to planning. Artificial Intelligence, 269, 49–75. https://doi.org/10.1016/j.artint.2018.10.002
    Projects: FAIR (2013–2018) / START (2014–2022)
  • Counting Complexity for Reasoning in Abstract Argumentation / Fichte, J. K., Hecher, M., & Meier, A. (2019). Counting Complexity for Reasoning in Abstract Argumentation. In Proceedings of the AAAI Conference on Artificial Intelligence (pp. 2827–2834). https://doi.org/10.1609/aaai.v33i01.33012827
    Project: START (2014–2022)
  • Treewidth and Counting Projected Answer Sets / Fichte, J., & Hecher, M. (2019). Treewidth and Counting Projected Answer Sets. In M. Balduccini, Y. Lierler, & S. Woltran (Eds.), Logic Programming and Nonmonotonic Reasoning: 15th International Conference, LPNMR 2019 (pp. 105–119). Springer. https://doi.org/10.1007/978-3-030-20528-7_9
    Project: START (2014–2022)
  • A Multiparametric View on Answer Set Programming / Fichte, J. K., Kronegger, M., & Woltran, S. (2019). A Multiparametric View on Answer Set Programming. Annals of Mathematics and Artificial Intelligence, 86(1–3), 121–147. https://doi.org/10.1007/s10472-019-09633-x
  • An Improved GPU-Based SAT Model Counter / Fichte, J., Hecher, M., & Zisser, M. (2019). An Improved GPU-Based SAT Model Counter. In T. Schiex & S. de Givry (Eds.), Principles and Practice of Constraint Programming: 25th International Conference, CP 2019 (pp. 491–509). Springer. https://doi.org/10.1007/978-3-030-30048-7_29
    Project: START (2014–2022)
  • Strong Equivalence for Epistemic Logic Programs Made Easy / Faber, W., Morak, M., & Woltran, S. (2019). Strong Equivalence for Epistemic Logic Programs Made Easy. In Proceedings of the AAAI Conference on Artificial Intelligence (pp. 2809–2816). AAAI Press. https://doi.org/10.1609/aaai.v33i01.33012809
    Project: START (2014–2022)
  • On Uniform Equivalence of Epistemic Logic Programs / FABER, W., MORAK, M., & WOLTRAN, S. (2019). On Uniform Equivalence of Epistemic Logic Programs. Theory and Practice of Logic Programming, 19(5–6), 826–840. https://doi.org/10.1017/s1471068419000218
  • A general notion of equivalence for abstract argumentation / Baumann, R., Dvorak, W., Linsbichler, T., & Woltran, S. (2019). A general notion of equivalence for abstract argumentation. Artificial Intelligence, 275, 379–410. https://doi.org/10.1016/j.artint.2019.06.006
    Projects: GRAPPA (2016–2019) / START (2014–2022)
  • Modeling and solving staff scheduling with partial weighted maxSAT / Demirovic, E., Musliu, N., & Winter, F. (2019). Modeling and solving staff scheduling with partial weighted maxSAT. Annals of Operations Research, 275(1), 79–99. https://doi.org/10.1007/s10479-017-2693-y
  • HyperBench: {A} Benchmark and Tool for Hypergraphs and Empirical Findings / Fischl, W., Gottlob, G., Longo, D. M., & Pichler, R. (2019). HyperBench: {A} Benchmark and Tool for Hypergraphs and Empirical Findings. In Proceedings of the 13th Alberto Mendelzon International Workshop on Foundations of Data Management, Asunci{’{o}}n, Paraguay, June 3-7, 2019.}, (pp. 1–5). CEUR-WS.org. http://hdl.handle.net/20.500.12708/55517
    Project: HyperTrac (2018–2022)
  • Semantic Width Revisited (Extended Abstract) / Gottlob, G., Lanzinger, M., & Pichler, R. (2019). Semantic Width Revisited (Extended Abstract). In Proceedings of the 13th Alberto Mendelzon International Workshop on Foundations of Data Management, Asunci{’{o}}n, Paraguay, June 3-7, 2019 (pp. 1–5). CEUR-WS.org. http://hdl.handle.net/20.500.12708/55515
    Project: HyperTrac (2018–2022)
  • Parallel Computation of Generalized Hypertree Decompositions / Gottlob, G., Pichler, R., & Okulmus, C. (2019). Parallel Computation of Generalized Hypertree Decompositions. In Proceedings of the 13th Alberto Mendelzon International Workshop on Foundations of Data Management, Asunci{’{o}}n, Paraguay, June 3-7, 2019 (pp. 1–5). CEUR-WS.org. http://hdl.handle.net/20.500.12708/57860
    Project: HyperTrac (2018–2022)
  • Fixed-Parameter Tractable Fragments Of Conjunctive Queries And Constraint Satisfaction Problems / Lanzinger, M., Gottlob, G., & Pichler, R. (2019). Fixed-Parameter Tractable Fragments Of Conjunctive Queries And Constraint Satisfaction Problems. In noch nicht bekannt (pp. 1–2). http://hdl.handle.net/20.500.12708/57793
  • Preference Orders on Families of Sets - When Can Impossibility Results Be Avoided? / Maly, J., Truszczyński, M., & Woltran, S. (2019). Preference Orders on Families of Sets - When Can Impossibility Results Be Avoided? Journal of Artificial Intelligence Research, 66, 1147–1197. https://doi.org/10.1613/jair.1.11879
  • Parameterized Complexity of Asynchronous Border Minimization / Ganian, R., Kronegger, M., Pfandler, A., & Popa, A. (2019). Parameterized Complexity of Asynchronous Border Minimization. Algorithmica, 81(1), 201–223. https://doi.org/10.1007/s00453-018-0442-5
    Projects: FAIR (2013–2018) / START (2014–2022) / X-TRACT (2014–2018)
  • Integer programming model extensions for a multi-stage nurse rostering problem / Mischek, F., & Musliu, N. (2019). Integer programming model extensions for a multi-stage nurse rostering problem. Annals of Operations Research. https://doi.org/10.1007/s10479-017-2623-z
    Project: ARTIS (2017–2024)
  • A complexity theory for hard enumeration problems / Creignou, N., Kröll, M., Pichler, R., Skritek, S., & Vollmer, H. (2019). A complexity theory for hard enumeration problems. Discrete Applied Mathematics, 268, 191–209. https://doi.org/10.1016/j.dam.2019.02.025
    Project: HyperTrac (2018–2022)
  • Synthesizing Argumentation Frameworks from Examples / Niskanen, A., Wallner, J., & Järvisalo, M. (2019). Synthesizing Argumentation Frameworks from Examples. Journal of Artificial Intelligence Research, 66, 503–554. https://doi.org/10.1613/jair.1.11758
  • Belief Revision Operators with Varying Attitudes Towards Initial Beliefs / Haret, A., & Woltran, S. (2019). Belief Revision Operators with Varying Attitudes Towards Initial Beliefs. In S. Kraus (Ed.), Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, {IJCAI} 2019 (pp. 1726–1733). ijcai.org. https://doi.org/10.24963/ijcai.2019/239
    Project: START (2014–2022)
  • On the expressive power of collective attacks / Dvorak, W., Woltran, S., & Fandinno, J. (2019). On the expressive power of collective attacks. Argument & Computation, 10(2), 191–230. https://doi.org/10.3233/aac-190457
    Project: GRAPPA (2016–2019)
  • Enumeration in Data Management (Dagstuhl Seminar 19211) / Boros, E., Kimelfeld, B., Pichler, R., & Schweikardt, N. (2019). Enumeration in Data Management (Dagstuhl Seminar 19211). Dagstuhl Reports, 9(5), 89–109. https://doi.org/10.4230/DagRep.9.5.89
  • Symbolische KI - Good Old Fashioned oder Haute Couture / Woltran, S. (2019). Symbolische KI - Good Old Fashioned oder Haute Couture. OCG Jahresopening 2019, Wien, Austria. http://hdl.handle.net/20.500.12708/86940
  • Preference Orders on Families of Sets -- Complexity and Characterization Results / Woltran, S. (2019). Preference Orders on Families of Sets -- Complexity and Characterization Results. IPASC - Workshop Individual Preferences and Social Choice, Graz, Austria. http://hdl.handle.net/20.500.12708/86939
  • Symbolische KI - Good Old Fashioned oder Haute Couture / Woltran, S. (2019). Symbolische KI - Good Old Fashioned oder Haute Couture. Ai / Imagine19, Wien, Austria. http://hdl.handle.net/20.500.12708/86932
  • Degrees of Laziness in Grounding / Taupe, R., Weinzierl, A., & Friedrich, G. (2019). Degrees of Laziness in Grounding. In M. Balduccini, Y. Lierler, & S. Woltran (Eds.), Logic Programming and Nonmonotonic Reasoning (pp. 298–311). https://doi.org/10.1007/978-3-030-20528-7_22
    Project: DynaCon (2017–2020)
  • Answer Set Solving exploiting Treewidth and its Limits / Hecher, M. (2019). Answer Set Solving exploiting Treewidth and its Limits. In CP 2019 (pp. 1–7). http://hdl.handle.net/20.500.12708/58010
    Project: START (2014–2022)
  • Structural Decompositions of Epistemic Logic Programs / Hecher, M., Morak, M., & Woltran, S. (2019). Structural Decompositions of Epistemic Logic Programs. In TAASP 2019 (pp. 1–15). http://hdl.handle.net/20.500.12708/58008
  • Forgetting in Modular Answer Set Programming / Gonçalves, R., Janhunen, T., Knorr, M., Leite, J., & Woltran, S. (2019). Forgetting in Modular Answer Set Programming. In Proceedings of the AAAI Conference on Artificial Intelligence (pp. 2843–2850). AAAI Press. https://doi.org/10.1609/aaai.v33i01.33012843
    Project: START (2014–2022)
  • Instance Space Analysis for a Personnel Scheduling Problem / Kletzander, L., Musliu, N., & Smith-Miles, K. (2019). Instance Space Analysis for a Personnel Scheduling Problem. In Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, {IJCAI} 2019 (pp. 1–8). http://hdl.handle.net/20.500.12708/57880
    Project: ARTIS (2017–2024)
  • Exact Methods for Extended Rotating Workforce Scheduling Problems / Kletzander, L., Musliu, N., Gärtner, J., Krennwallner, J., & Schafhauser, W. (2019). Exact Methods for Extended Rotating Workforce Scheduling Problems. In Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, {ICAPS} 2018, Berkeley, CA, USA, July 11-15, 2019 (pp. 519–527). AAAI Press. http://hdl.handle.net/20.500.12708/57873
    Project: ARTIS (2017–2024)
  • Complexity of Abstract Argumentation under a Claim-Centric View / Dvořák, W., & Woltran, S. (2019). Complexity of Abstract Argumentation under a Claim-Centric View. In Proceedings of the AAAI Conference on Artificial Intelligence (pp. 2801–2808). AAAI Press. https://doi.org/10.1609/aaai.v33i01.33012801
    Projects: GRAPPA (2016–2019) / START (2014–2022)
  • A Quantitative Analysis of Multi-Winner Rules / Lackner, M., & Skowron, P. (2019). A Quantitative Analysis of Multi-Winner Rules. In Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, {IJCAI} 2019, Macao, China, August 10-16, 2019. IJCAI 2019 - 28th International Joint Conference on Artificial Intelligence, Macao, China, Non-EU. ijcai.org. https://doi.org/10.24963/ijcai.2019
    Project: SuDeMa (2019–2025)
  • On Rational Delegations in Liquid Democracy / Bloembergen, D., Grossi, D., & Lackner, M. (2019). On Rational Delegations in Liquid Democracy. In Proceedings of the AAAI Conference on Artificial Intelligence (pp. 1796–1803). AAAI Press. https://doi.org/10.1609/aaai.v33i01.33011796
    Project: SuDeMa (2019–2025)
  • Towards Reconciling Certain Answers and {SPARQL:} Bag Semantics to the Rescue? / Skritek, S. (2019). Towards Reconciling Certain Answers and {SPARQL:} Bag Semantics to the Rescue? In Proceedings of the 13th Alberto Mendelzon International Workshop on Foundations of Data Management, Asunci{’{o}}n, Paraguay, June 3-7, 2019 (pp. 1–5). CEUR-WS.org. http://hdl.handle.net/20.500.12708/57864
    Project: HyperTrac (2018–2022)
  • Answer Set Programs Challenged by Ontologies / Ortiz de la Fuente, M. M., Simkus, M., & Lukumbuzya, S. (2019). Answer Set Programs Challenged by Ontologies. In M. Simkus & G. Weddell (Eds.), 32nd International Workshop on Description Logics. CEUR Workshop proceedings. http://hdl.handle.net/20.500.12708/55531
  • Reasoning over Assumption-Based Argumentation Frameworks via Direct Answer Set Programming Encodings / Lehtonen, T., Wallner, J. P., & Järvisalo, M. (2019). Reasoning over Assumption-Based Argumentation Frameworks via Direct Answer Set Programming Encodings. In P. Van Hentenryck & Z.-H. Zhou (Eds.), Proceedings of the AAAI Conference on Artificial Intelligence (pp. 2938–2945). AAAI Press. https://doi.org/10.1609/aaai.v33i01.33012938
    Project: GRAPPA (2016–2019)
  • Relaxing and Restraining Queries for OBDA / Andresel, M.-P., Ibanez Garcia, Y. A., Ortiz de la Fuente, M. M., & Simkus, M. (2019). Relaxing and Restraining Queries for OBDA. In Proceedings of the AAAI Conference on Artificial Intelligence (pp. 2654–2661). https://doi.org/10.1609/aaai.v33i01.33012654
    Projects: KtoAPP (2018–2025) / OMEGA (2017–2022)
  • Ontology Focusing: Knowledge-enriched Databases on Demand / Gogacz, T., Gutierrez-Basulto, V., Ibanez Garcia, Y. A., Murlak, F., Ortiz de la Fuente, M. M., & Simkus, M. (2019). Ontology Focusing: Knowledge-enriched Databases on Demand (1904.00195). http://hdl.handle.net/20.500.12708/39865
    Projects: KtoAPP (2018–2025) / OMEGA (2017–2022)
  • Proceedings of the 13th RuleML+RR 2019 Doctoral Consortium and Rule Challenge, September 16-19, 2019 - Bolzano, Italy / Proceedings of the 13th RuleML+RR 2019 Doctoral Consortium and Rule Challenge, September 16-19, 2019 - Bolzano, Italy. (2019). In A. Soylu, S. Moschoyiannis, G. Governatori, M. Simkus, P. Stefaneas, A. Steen, & A. Giurca (Eds.), CEUR Workshop Proceedings. CEUR. http://hdl.handle.net/20.500.12708/24687
  • Proceedings of the 32nd International Workshop on Description Logics, Oslo, Norway, June 18-21, 2019 / Proceedings of the 32nd International Workshop on Description Logics, Oslo, Norway, June 18-21, 2019. (2019). In M. Simkus & G. Weddell (Eds.), CEUR Workshop Proceedings. CEUR. http://hdl.handle.net/20.500.12708/24686
  • Logic Programming and Nonmonotonic Reasoning / Logic Programming and Nonmonotonic Reasoning. (2019). In M. Balduccini, Y. Lierler, & S. Woltran (Eds.), Lecture Notes in Computer Science. Springer LNCS. https://doi.org/10.1007/978-3-030-20528-7

2018

  • Defensive alliances in graphs of bounded treewidth / Bliem, B., & Woltran, S. (2018). Defensive alliances in graphs of bounded treewidth. Discrete Applied Mathematics, 251, 334–339. https://doi.org/10.1016/j.dam.2018.04.001
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • On homeomorphically irreducible spanning trees in cubic graphs / Hoffmann-Ostenhof, A., Noguchi, K., & Ozeki, K. (2018). On homeomorphically irreducible spanning trees in cubic graphs. Journal of Graph Theory, 89(2), 93–100. https://doi.org/10.1002/jgt.22242
  • An SMT Approach to Fractional Hypertree Width / Fichte, J., Hecher, M., Lodha, N., & Szeider, S. (2018). An SMT Approach to Fractional Hypertree Width. In J. Hooker (Ed.), Principles and Practice of Constraint Programming, 24th International Conference, CP 2018 (pp. 109–127). Springer-Verlag. https://doi.org/10.1007/978-3-319-98334-9_8
    Project: START (2014–2022)
  • Efficient Evaluation and Static Analysis for Well-Designed Pattern Trees with Projection / Barceló, P., Kröll, M., Pichler, R., & Skritek, S. (2018). Efficient Evaluation and Static Analysis for Well-Designed Pattern Trees with Projection. ACM Transactions on Database Systems, 43(2), 1–44. https://doi.org/10.1145/3233983
  • An extension-based approach to belief revision in abstract argumentation / Diller, M., Haret, A., Linsbichler, T., Rümmele, S., & Woltran, S. (2018). An extension-based approach to belief revision in abstract argumentation. International Journal of Approximate Reasoning, 93, 395–423. https://doi.org/10.1016/j.ijar.2017.11.013
    Projects: FAIR (2013–2018) / GRAPPA (2016–2019) / START (2014–2022)
  • Advances in Database Technology — EDBT 2018 / Böhlen, M., Pichler, R., May, N., Rahm, E., Wu, S.-H., & Hose, K. (Eds.). (2018). Advances in Database Technology — EDBT 2018. EDBT 2018. https://doi.org/10.5441/002/edbt.2018.01
  • Investigating Subclasses of Abstract Dialectical Frameworks / Keshavarzi Zafarghandi, A., Linsbichler, T., Woltran, S., & Diller, M. (2018). Investigating Subclasses of Abstract Dialectical Frameworks. In Computational Models of Argument - Proceedings of {COMMA} 2018 (pp. 61–72). IOS Press. http://hdl.handle.net/20.500.12708/57561
    Project: GRAPPA (2016–2019)
  • Modeling and Solving an Automotive Paint Shop Scheduling Problem / Winter, F., Musliu, N., Demirovic, E., & Mrkvicka, C. (2018). Modeling and Solving an Automotive Paint Shop Scheduling Problem. In 12th International Conference on the Practice and Theory of Automated Timetabling (pp. 477–480). http://hdl.handle.net/20.500.12708/57476
    Project: ARTIS (2017–2024)
  • Paint Shop Scheduling in the Automotive Supply Industry / Winter, F., Musliu, N., Demirovic, E., & Mrkvicka, C. (2018). Paint Shop Scheduling in the Automotive Supply Industry. In 29th European Conference on Operational Research (p. 161). http://hdl.handle.net/20.500.12708/57470
    Project: ARTIS (2017–2024)
  • Abstract Solvers for Dung's Argumentation Frameworks / Brochenin, R., Linsbichler, T., Maratea, M., Wallner, J. P., & Woltran, S. (2018). Abstract Solvers for Dung’s Argumentation Frameworks. Argument & Computation, 9(1), 41–72. https://doi.org/10.3233/aac-170031
    Project: GRAPPA (2016–2019)
  • Summary Report of the Second International Competition on Computational Models of Argumentation / Gaggl, S. A., Linsbichler, T., Maratea, M., & Woltran, S. (2018). Summary Report of the Second International Competition on Computational Models of Argumentation. AI Magazine, 39(4), 77–79. https://doi.org/10.1609/aimag.v39i4.2781
    Project: GRAPPA (2016–2019)
  • The Impact of Active Domain Predicates on Guarded Existential Rules / Gottlob, G., Pieris, A., & Šimkus, M. (2018). The Impact of Active Domain Predicates on Guarded Existential Rules. Fundamenta Informaticae, 159(1–2), 123–146. https://doi.org/10.3233/fi-2018-1660
  • Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter / Dvorak, W., Chatterjee, K., Henzinger, M., & Loitzenbauer, V. (2018). Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter. In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 2341–2356). https://doi.org/10.1137/1.9781611975031.151
  • Expressive Power of Collective Attacks / Dvorak, W., Chatterjee, K., Henzinger, M., & Loitzenbauer, V. (2018). Expressive Power of Collective Attacks. Highlights of Algorithms 2018, HALG 2018, Amsterdam, EU. http://hdl.handle.net/20.500.12708/86748
  • Quasipolynomial Set-Based Symbolic Algorithms for Parity Games / Svozil, A., Dvorak, W., Chatterjee, K., & Henzinger, M. (2018). Quasipolynomial Set-Based Symbolic Algorithms for Parity Games. In LPAR 2018 : International Conference on Logic for Programming, Artificial Intelligence and Reasoning (pp. 233–253). EasyChair Publications, in the EPiC Series in Computing. http://hdl.handle.net/20.500.12708/57576
  • Algorithms and Conditional Lower bounds for Planning Problems / Dvorak, W., Chatterjee, K., Henzinger, M., & Svozil, A. (2018). Algorithms and Conditional Lower bounds for Planning Problems. In International Conference on Automated Planning and Scheduling (ICAPS 2018) (pp. 1–14). CoRR. http://hdl.handle.net/20.500.12708/57486
  • ArgueApply: Abstract Argumentation at Your Fingertips / Pührer, J. (2018). ArgueApply: Abstract Argumentation at Your Fingertips. Kuenstliche Intelligenz, 32(2–3), 209–212. https://doi.org/10.1007/s13218-018-0532-1
    Project: GRAPPA (2016–2019)
  • Answer set programming unleashed! / Woltran, S., & Schaub, T. (2018). Answer set programming unleashed! Kuenstliche Intelligenz, 32(2–3), 105–108. https://doi.org/10.1007/s13218-018-0550-z
    Project: START (2014–2022)
  • Dynamic Programming on Tree Decompositions with {D-FLAT} / Abseher, M., Hecher, M., Moldovan, M., Woltran, S., & Bliem, B. (2018). Dynamic Programming on Tree Decompositions with {D-FLAT}. Kuenstliche Intelligenz, 32(2–3), 191–192. https://doi.org/10.1007/s13218-018-0531-2
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • Foundations of Implementations for Formal Argumentation / Cerutti, F., Gaggl, S. A., Thimm, M., & Wallner, J. P. (2018). Foundations of Implementations for Formal Argumentation. In P. Baroni, D. M. Gabbay, M. Giacomin, & L. van der Torre (Eds.), Handbook of Formal Argumentation (pp. 688–767). College Publications. http://hdl.handle.net/20.500.12708/29407
    Projects: Belief Change (2013–2017) / GRAPPA (2016–2019)
  • Computational Problems in Formal Argumentation and their Complexity / Dvorak, W., & Dunne, P. E. (2018). Computational Problems in Formal Argumentation and their Complexity. In Handbook of Formal Argumentation (pp. 631–687). College Publications. http://hdl.handle.net/20.500.12708/29850
  • Abstract Dialectical Frameworks / Brewka, G., Ellmauthaler, S., Strass, H., Wallner, J. P., & Woltran, S. (2018). Abstract Dialectical Frameworks. In P. Baroni, D. M. Gabbay, M. Giacomin, & L. van der Torre (Eds.), Handbook of Formal Argumentation (pp. 237–285). College Publications. http://hdl.handle.net/20.500.12708/29406
    Projects: Belief Change (2013–2017) / GRAPPA (2016–2019)
  • On the Expressive Power of Collective Attacks / Dvorak, W., Woltran, S., & Fandinno, J. (2018). On the Expressive Power of Collective Attacks. In 7th International Conference on Computational Models of Argument (pp. 1–27). IOS Press. http://hdl.handle.net/20.500.12708/57485
    Project: GRAPPA (2016–2019)
  • Evaluating SETAFs via Answer-Set Programming / Dvorak, W., Woltran, S., & Gressler, A. (2018). Evaluating SETAFs via Answer-Set Programming. In 2nd International Workshop on Systems and Algorithms for Formal Argumentation (pp. 10–21). CEUR-WS.org. http://hdl.handle.net/20.500.12708/57479
    Projects: GRAPPA (2016–2019) / START (2014–2022)
  • Solution-Based Phase Saving and MaxSAT for Employee Scheduling: A Computational Study / Winter, F., Musliu, N., Demirovic, E., & Stuckey, P. J. (2018). Solution-Based Phase Saving and MaxSAT for Employee Scheduling: A Computational Study. In 12th International Conference on the Practice and Theory of Automated Timetabling (pp. 453–457). http://hdl.handle.net/20.500.12708/57475
    Project: ARTIS (2017–2024)
  • ASP Programs with Groundings of Small Treewidth / Bliem, B. (2018). ASP Programs with Groundings of Small Treewidth. In F. Ferrarotti & S. Woltran (Eds.), Foundations of Information and Knowledge Systems: 10th International Symposium, FoIKS 2018 (pp. 97–113). LNCS. https://doi.org/10.1007/978-3-319-90050-6_6
    Project: START (2014–2022)
  • Equivalence between answer-set programs under (partially) fixed input / Bliem, B., & Woltran, S. (2018). Equivalence between answer-set programs under (partially) fixed input. Annals of Mathematics and Artificial Intelligence, 83(3–4), 277–295. https://doi.org/10.1007/s10472-017-9567-5
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • General and Fractional Hypertree Decompositions: Hard and Easy Cases (extended abstract) / Fischl, W., Gottlob, G., & Pichler, R. (2018). General and Fractional Hypertree Decompositions: Hard and Easy Cases (extended abstract). In Proceedings of the 12th Alberto Mendelzon International Workshop on Foundations of Data Management (pp. 1–4). {CEUR} Workshop Proceedings. http://hdl.handle.net/20.500.12708/55500
  • Min-conflicts heuristic for multi-mode resource-constrained projects scheduling / Musliu, N., & Ahmeti, A. (2018). Min-conflicts heuristic for multi-mode resource-constrained projects scheduling. In Proceedings of the Genetic and Evolutionary Computation Conference. GECCO: Genetic and Evolutionary Computation Conference, Seattle, Non-EU. ACM. https://doi.org/10.1145/3205455.3205620
    Project: ARTIS (2017–2024)
  • Rewriting Guarded Existential Rules into Small Datalog Programs / Ahmetaj, S., Ortiz de la Fuente, M. M., & Simkus, M. (2018). Rewriting Guarded Existential Rules into Small Datalog Programs. In B. Kimelfeld & Y. Amsterdamer (Eds.), 21st International Conference on Database Theory, {ICDT} 2018 (pp. 1–24). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.ICDT.2018.4
  • Enumeration Complexity of Conjunctive Queries with Functional Dependencies / Carmeli, N., & Kröll, M. (2018). Enumeration Complexity of Conjunctive Queries with Functional Dependencies. In B. Kimelfeld & Y. Amsterdamer (Eds.), 21st International Conference on Database Theory, {ICDT} 2018 (pp. 1–17). LIPIcs. https://doi.org/10.4230/LIPIcs.ICDT.2018.11
    Projects: FAIR (2013–2018) / HINT (2012–2017)
  • Weighted Model Counting on the GPU by Exploiting Small Treewidth / Fichte, J., Hecher, M., Woltran, S., & Zisser, M. (2018). Weighted Model Counting on the GPU by Exploiting Small Treewidth. In Y. Azar, H. Bast, & G. Herman (Eds.), 26th Annual European Symposium on Algorithms, {ESA} 2018 (pp. 28:2-28:16). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.ESA.2018.28
    Project: START (2014–2022)
  • Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? / Creignou, N., Pichler, R., & Woltran, S. (2018). Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? Logical Methods in Computer Science, 14(4), 1–25. https://doi.org/10.23638/LMCS-14(4:10)2018
    Projects: FAIR (2013–2018) / START (2014–2022)
  • Stepwise debugging of answer-set programs / Oetsch, J., Pührer, J., & Tompits, H. (2018). Stepwise debugging of answer-set programs. Theory and Practice of Logic Programming, 18(1), 30–80. https://doi.org/10.1017/s1471068417000217
  • Special Issue on Computational Logic in Multi-Agent Systems (CLIMA XIV) / Leite, J., Tran, C. S., Torroni, P., & Woltran, S. (2018). Special Issue on Computational Logic in Multi-Agent Systems (CLIMA XIV). Journal of Logic and Computation, 28(3), 475–476. https://doi.org/10.1093/logcom/exv005
  • A many-sorted variant of Japaridze's polymodal provability logic / Berger, G., Beklemishev, L. D., & Tompits, H. (2018). A many-sorted variant of Japaridze’s polymodal provability logic. Logic Journal of the IGPL, 26(5), 505–538. https://doi.org/10.1093/jigpal/jzy012
  • General Belief Revision / Delgrande, J. P., Peppas, P., & Woltran, S. (2018). General Belief Revision. Journal of the ACM, 65(5), 1–34. https://doi.org/10.1145/3203409
    Projects: Belief Change (2013–2017) / START (2014–2022)
  • Snarks with Special Spanning Trees / Hoffmann-Ostenhof, A., & Jatschka, T. (2018). Snarks with Special Spanning Trees. Graphs and Combinatorics, 35(1), 207–219. https://doi.org/10.1007/s00373-018-1973-x
  • Complexity of Secure Sets / Bliem, B., & Woltran, S. (2018). Complexity of Secure Sets. Algorithmica, 80(10), 2909–2940. https://doi.org/10.1007/s00453-017-0358-5
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • Limits of Schema Mappings / Kolaitis, P. G., Pichler, R., Sallinger, E., & Savenkov, V. (2018). Limits of Schema Mappings. Theory of Computing Systems, 62(4), 899–940. https://doi.org/10.1007/s00224-017-9812-7
  • Special Issue on Answer Set Programming / Schaub, T., & Woltran, S. (2018). Special Issue on Answer Set Programming. KI - Künstliche Intelligenz, 32(2–3), 101–103. https://doi.org/10.1007/s13218-018-0554-8
  • Parameter-Independent Strategies for pMDPs via POMDPs / Arming, S., Bartocci, E., Chatterjee, K., Katoen, J.-P., & Sokolova, A. (2018). Parameter-Independent Strategies for pMDPs via POMDPs. In A. McIver & A. Horvath (Eds.), Quantitative Evaluation of Systems: 15th International Conference, QEST 2018 (pp. 53–70). Springer. https://doi.org/10.1007/978-3-319-99154-2_4
  • General and Fractional Hypertree Decompositions: Hard and Easy Cases / Fischl, W., Gottlob, G., & Pichler, R. (2018). General and Fractional Hypertree Decompositions: Hard and Easy Cases. In Proceedings of the 37th {ACM} {SIGMOD-SIGACT-SIGAI} Symposium on Principles of Database Systems (pp. 17–32). ACM. https://doi.org/10.1145/3196959.3196962
    Projects: FAIR (2013–2018) / HyperTrac (2018–2022)
  • Lower bounds for symbolic computation on graphs / Dvorak, W. (2018). Lower bounds for symbolic computation on graphs. Helmuth Veith Memorial Workshop, Salzburg, Austria. http://hdl.handle.net/20.500.12708/86782
  • Expressibility of Argumentation Frameworks and its Relation to the Dynamics of Argumentation / Woltran, S. (2018). Expressibility of Argumentation Frameworks and its Relation to the Dynamics of Argumentation. AMANDE Workshop, Toulouse, Frankreich, EU. http://hdl.handle.net/20.500.12708/86807
  • Solving (Q)SAT Problems via Tree Decomposition and Dynamic Programming / Woltran, S. (2018). Solving (Q)SAT Problems via Tree Decomposition and Dynamic Programming. JFPC (Journées Francophones de Programmation par Contraintes), Amiens, Frankreich, EU. http://hdl.handle.net/20.500.12708/86806
  • Foundations of Information and Knowledge Systems / Ferrarotti, F., & Woltran, S. (Eds.). (2018). Foundations of Information and Knowledge Systems. Springer Cham. https://doi.org/10.1007/978-3-319-90050-6
  • Satisfiability in the Triguarded Fragment of First-Order Logic / Rudolph, S., & Simkus, M. (2018). Satisfiability in the Triguarded Fragment of First-Order Logic. In 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 27th - to - 29th, 2018. (p. 12). CEUR-WS.org. http://hdl.handle.net/20.500.12708/57722
  • The Triguarded Fragment of First-Order Logic / Rudolph, S., & Simkus, M. (2018). The Triguarded Fragment of First-Order Logic. In LPAR-22. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Awassa, Ethiopia, 16-21 November 2018 (pp. 604–619). EasyChair EPiC Series in Computing. http://hdl.handle.net/20.500.12708/57720
  • Compiling Model Representations for Querying Large ABoxes in Expressive DLs / Bajraktari, L., Ortiz, M., & Simkus, M. (2018). Compiling Model Representations for Querying Large ABoxes in Expressive DLs. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. IJCAI - International Joint Conference on Artificial Intelligence, Stockholm, EU. https://doi.org/10.24963/ijcai.2018/234
  • Combining Rules and Ontologies into Clopen Knowledge Bases / Bajraktari, L., Ortiz de la Fuente, M. M., & Simkus, M. (2018). Combining Rules and Ontologies into Clopen Knowledge Bases. In Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence e (AAAI-18) (pp. 1728–1735). http://hdl.handle.net/20.500.12708/57703
  • Crowd-Sourced Knowledge Graph Extension: A Belief Revision Based Approach. / Revenko, A., Sabou, R. M., Ahmeti, A., & Schauer, M. (2018). Crowd-Sourced Knowledge Graph Extension: A Belief Revision Based Approach. In Proceedings of the 6th AAAI Conference on Human Computation and Crowdsourcing (HCOMP). 6th AAAI Conference on Human Computation and Crowdsourcing (HCOMP), Zurich, Switzerland, Non-EU. AAAI. http://hdl.handle.net/20.500.12708/57701
  • Relaxing and Restraining Queries for OBDA - Extended Abstract / Andresel, M.-P., Ibanez Garcia, Y. A., Ortiz de la Fuente, M. M., & Simkus, M. (2018). Relaxing and Restraining Queries for OBDA - Extended Abstract. In Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, KR 2018, Tempe, Arizona, 30 October-2 November 2018. (pp. 617–618). http://hdl.handle.net/20.500.12708/57608
  • Taming Complex Role Inclusions for DL-Lite / Andresel, M.-P., Ibanez Garcia, Y. A., Ortiz de la Fuente, M. M., & Simkus, M. (2018). Taming Complex Role Inclusions for DL-Lite. In 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 27th - to - 29th, 2018. (p. 12). CEUR-WS.org. http://hdl.handle.net/20.500.12708/57607
  • Exploiting Treewidth for Counting Projected Answer Sets / Hecher, M., & Fichte, J. (2018). Exploiting Treewidth for Counting Projected Answer Sets. In 17th International Workshop on Non-Monotonic Reasoning (NMR) (pp. 1–10). AAAI Press. http://hdl.handle.net/20.500.12708/57582
    Project: START (2014–2022)
  • Solving the General Employee Scheduling Problem / Kletzander, L., & Musliu, N. (2018). Solving the General Employee Scheduling Problem. In 12th International Conference on the Practice and Theory of Automated Timetabling - PATAT 2018 (pp. 1–36). http://hdl.handle.net/20.500.12708/57573
    Project: ARTIS (2017–2024)
  • A Local Search Framework for Industrial Test Laboratory Scheduling / Mischek, F., & Musliu, N. (2018). A Local Search Framework for Industrial Test Laboratory Scheduling. In Proceedings of the 12th International Conference on the Practice and Theory of Auto­mated Timetabling (PATAT-2018) (pp. 465–467). http://hdl.handle.net/20.500.12708/57572
    Project: ARTIS (2017–2024)
  • Solver Independent Rotating Workforce Scheduling / Musliu, N., Schutt, A., & Stuckey, P. J. (2018). Solver Independent Rotating Workforce Scheduling. In Integration of Constraint Programming, Artificial Intelligence, and Operations Research (pp. 429–445). Springer. https://doi.org/10.1007/978-3-319-93031-2_31
    Project: ARTE (2012–2017)
  • Belief Update in the Horn Fragment / Haret, A., Creignou, N., Papini, O., & Woltran, S. (2018). Belief Update in the Horn Fragment. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. IJCAI - International Joint Conference on Artificial Intelligence, Stockholm, EU. ijcai.org. https://doi.org/10.24963/ijcai.2018/246
  • Consistent Approval-Based Multi-Winner Rules / Lackner, M., & Skowron, P. (2018). Consistent Approval-Based Multi-Winner Rules. In Proceedings of the 2018 ACM Conference on Economics and Computation. ACM Conference on Economics and Computation, Ithaca, New York, USA, Non-EU. https://doi.org/10.1145/3219166.3219170
    Projects: FAIR (2013–2018) / START (2014–2022)
  • On the Complexity of Extended and Proportional Justified Representation / Lackner, M., Aziz, H., Elkind, E., Huang, S., Sánchez-Fernández, L., & Skowron, P. (2018). On the Complexity of Extended and Proportional Justified Representation. In Proceedings of the Thirty-Second {AAAI} Conference on Artificial Intelligence, (AAAI-18), the 30th innovative Applications of Artificial Intelligence (IAAI-18), and the 8th {AAAI} Symposium on Educational Advances in Artificial Intelligence (EAAI-18) (pp. 902–909). AAAI Press. http://hdl.handle.net/20.500.12708/57543
    Projects: FAIR (2013–2018) / START (2014–2022)
  • Effective Heuristics for Committee Scoring Rules / Lackner, M., Faliszewski, P., Peters, D., & Talmon, N. (2018). Effective Heuristics for Committee Scoring Rules. In Proceedings of the Thirty-Second {AAAI} Conference on Artificial Intelligence, (AAAI-18), the 30th innovative Applications of Artificial Intelligence (IAAI-18), and the 8th {AAAI} Symposium on Educational Advances in Artificial Intelligence (EAAI-18) (pp. 1023–1030). AAAI Press. http://hdl.handle.net/20.500.12708/57542
    Projects: FAIR (2013–2018) / START (2014–2022)
  • Multiwinner Elections With Diversity Constraints / Lackner, M., Bredereck, R., Faliszewski, P., Igarashi, A., & Skowron, P. (2018). Multiwinner Elections With Diversity Constraints. In Proceedings of the Thirty-Second {AAAI} Conference on Artificial Intelligence, (AAAI-18), the 30th innovative Applications of Artificial Intelligence (IAAI-18), and the 8th {AAAI} Symposium on Educational Advances in Artificial Intelligence (EAAI-18) (pp. 933–940). AAAI Press. http://hdl.handle.net/20.500.12708/57541
    Projects: FAIR (2013–2018) / START (2014–2022)
  • A New Logic for Jointly Representing Hard and Soft Constraints / Maly, J., & Woltran, S. (2018). A New Logic for Jointly Representing Hard and Soft Constraints. In Second Workshop on Logics for Reasoning about Preferences, Uncertainty, and Vagueness (pp. 1–4). http://hdl.handle.net/20.500.12708/57539
    Project: START (2014–2022)
  • Approval-Based Multi-Winner Rules and Strategic Voting / Lackner, M., & Skowron, P. (2018). Approval-Based Multi-Winner Rules and Strategic Voting. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. IJCAI - International Joint Conference on Artificial Intelligence, Stockholm, EU. ijcai.org. https://doi.org/10.24963/ijcai.2018/47
    Projects: FAIR (2013–2018) / START (2014–2022)
  • Exploiting Treewidth for Counting Projected Answer Sets / Fichte, J., & Hecher, M. (2018). Exploiting Treewidth for Counting Projected Answer Sets. In Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, {KR} 2018 (pp. 639–640). AAAI Press. http://hdl.handle.net/20.500.12708/57533
    Project: START (2014–2022)
  • Preference Orders on Families of Sets - When Can Impossibility Results Be Avoided? / Maly, J., Woltran, S., & Truszczynski, M. (2018). Preference Orders on Families of Sets - When Can Impossibility Results Be Avoided? In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. IJCAI - International Joint Conference on Artificial Intelligence, Stockholm, EU. ijcai.org. https://doi.org/10.24963/ijcai.2018/60
    Project: START (2014–2022)
  • Single-Shot Epistemic Logic Program Solving / Bichler, M., Morak, M., & Woltran, S. (2018). Single-Shot Epistemic Logic Program Solving. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. IJCAI - International Joint Conference on Artificial Intelligence, Stockholm, EU. ijcai.org. https://doi.org/10.24963/ijcai.2018/237
    Project: START (2014–2022)
  • Computing the Schulze Method for Large-Scale Preference Data Sets / Csar, T., Lackner, M., & Pichler, R. (2018). Computing the Schulze Method for Large-Scale Preference Data Sets. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. IJCAI - International Joint Conference on Artificial Intelligence, Stockholm, EU. ijcai.org. https://doi.org/10.24963/ijcai.2018/25
    Projects: FAIR (2013–2018) / HyperTrac (2018–2022) / START (2014–2022)
  • Exploiting Treewidth for Projected Model Counting and Its Limits / Fichte, J. K., Hecher, M., Morak, M., & Woltran, S. (2018). Exploiting Treewidth for Projected Model Counting and Its Limits. In Theory and Applications of Satisfiability Testing – SAT 2018 (pp. 165–184). Springer. https://doi.org/10.1007/978-3-319-94144-8_11
    Projects: FAIR (2013–2018) / START (2014–2022)
  • Default Logic and Bounded Treewidth / Fichte, J. K., Hecher, M., & Schindler, I. (2018). Default Logic and Bounded Treewidth. In Language and Automata Theory and Applications (pp. 130–142). Springer. https://doi.org/10.1007/978-3-319-77313-1_10
    Project: START (2014–2022)
  • Belief Revision Operators with Varying Attitudes Towards Initial Beliefs / Haret, A., & Woltran, S. (2018). Belief Revision Operators with Varying Attitudes Towards Initial Beliefs. In 17th International Workshop On Non-Monotonic Reasoning (pp. 156–165). http://hdl.handle.net/20.500.12708/57504
  • Preference Aggregation with Incomplete CP-Nets / Haret, A., Novaro, A., & Grandi, U. (2018). Preference Aggregation with Incomplete CP-Nets. In Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, KR 2018 (pp. 308–318). AAAI Press. http://hdl.handle.net/20.500.12708/57503
  • A Quantitative Analysis of Multi-Winner Rules / Lackner, M., & Skowron, P. (2018). A Quantitative Analysis of Multi-Winner Rules. In Proceedings of the 7th International Workshop on Computational Social Choice (COMSOC 2018) (pp. 1–29). Computing Research Repository (CoRR). http://hdl.handle.net/20.500.12708/57490
    Projects: FAIR (2013–2018) / START (2014–2022)
  • Ceteris paribus majority for social ranking / Haret, A., Khani, H., Moretti, S., & Öztürk, M. (2018). Ceteris paribus majority for social ranking. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. IJCAI - International Joint Conference on Artificial Intelligence, Stockholm, EU. ijcai.org. https://doi.org/10.24963/ijcai.2018/42
  • Application of ASP in formal argumentation / Dvorak, W., Pührer, J., Wallner, J. P., Woltran, S., & Diller, M. (2018). Application of ASP in formal argumentation. In 2nd Workshop on Trends and Applications of Answer Set Programming (TAASP 2018) (pp. 1–11). http://hdl.handle.net/20.500.12708/57477
    Projects: GRAPPA (2016–2019) / START (2014–2022)
  • A Single-Shot Epistemic Logic Program Solver / Bichler, M., Morak, M., & Woltran, S. (2018). A Single-Shot Epistemic Logic Program Solver. In 11th Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2018) (pp. 1–14). http://hdl.handle.net/20.500.12708/57441
    Project: START (2014–2022)
  • Manipulation of Semantic Aggregation Procedures for Propositional Knowledge Bases and Argumentation Frameworks / Haret, A., & Wallner, J. P. (2018). Manipulation of Semantic Aggregation Procedures for Propositional Knowledge Bases and Argumentation Frameworks. In E. Fermé & S. Villata (Eds.), Proceedings of the 17th International Workshop on Non-monotonic Reasoning (p. 10). http://hdl.handle.net/20.500.12708/57432
    Project: START (2014–2022)
  • Extension Enforcement under Grounded Semantics in Abstract Argumentation / Niskanen, A., Wallner, J. P., & Järvisalo, M. (2018). Extension Enforcement under Grounded Semantics in Abstract Argumentation. In M. Thielscher, F. Toni, & F. Wolter (Eds.), Proceedings of the 16th International Conference on Principles of Knowledge Representation and Reasoning (pp. 178–183). AAAI Press. http://hdl.handle.net/20.500.12708/57431
  • Structural Constraints for Dynamic Operators in Abstract Argumentation / Wallner, J. P. (2018). Structural Constraints for Dynamic Operators in Abstract Argumentation. In S. Modgil, K. Budzynska, & J. Lawrence (Eds.), Computational Models of Argument (pp. 73–84). IOS Press. http://hdl.handle.net/20.500.12708/57426
    Project: GRAPPA (2016–2019)
  • Weighted Abstract Dialectical Frameworks / Brewka, G., Strass, H., Wallner, J. P., & Woltran, S. (2018). Weighted Abstract Dialectical Frameworks. In S. McIlraith & K. Weinberger (Eds.), Proceedings AAAI 2018 (pp. 1779–1786). AAAI Press. http://hdl.handle.net/20.500.12708/57336
    Project: GRAPPA (2016–2019)
  • Variable Elimination for DLP-Functions / Woltran, S., Goncalves, R., Janhunen, T., Knorr, M., & Leite, J. (2018). Variable Elimination for DLP-Functions. In AAAI Publications, Sixteenth International Conference on Principles of Knowledge Representation and Reasoning (pp. 643–644). AAAI. http://hdl.handle.net/20.500.12708/57297
    Project: START (2014–2022)

2017

  • Computational Social Choice in the Clouds / Csar, T., Lackner, M., Pichler, R., & Sallinger, E. (2017). Computational Social Choice in the Clouds. In Workshop Präferenzen und Personalisierung in der Informatik bei der Konferenz “Datenbanksysteme für Business, Technologie und Web” (BTW) (pp. 163–167). http://hdl.handle.net/20.500.12708/57077
    Projects: FAIR (2013–2018) / HINT (2012–2017) / START (2014–2022)
  • htd - A Free, Open-Source Framework for (Customized) Tree Decompositions and Beyond / Abseher, M., Musliu, N., & Woltran, S. (2017). htd - A Free, Open-Source Framework for (Customized) Tree Decompositions and Beyond. In D. Salvagnin & M. Lombardi (Eds.), Integration of AI and OR Techniques in Constraint Programming (pp. 376–386). Lecture Notes in Computer Science / Springer. https://doi.org/10.1007/978-3-319-59776-8_30
    Projects: ARTE (2012–2017) / D-Flat (2013–2017) / START (2014–2022)
  • Expansion-based (QBF) Solving on Tree Decompositions / Charwat, G., & Woltran, S. (2017). Expansion-based (QBF) Solving on Tree Decompositions. In M. Maratea & I. Serina (Eds.), Proceedings of the 24th International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion (RCRA@AI*IA 2017) (pp. 16–26). CEUR-WS.org. http://hdl.handle.net/20.500.12708/57127
    Project: START (2014–2022)
  • Personnel Scheduling as Satisfiability Modulo Theories / Erkinger, C., & Musliu, N. (2017). Personnel Scheduling as Satisfiability Modulo Theories. In Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence. 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), Melbourne, Australia, Non-EU. ijcai.org. https://doi.org/10.24963/ijcai.2017/86
    Project: ARTE (2012–2017)
  • Improved Set-based Symbolic Algorithms for Parity Games / Chatterjee, K., Dvorak, W., Henzinger, M., & Loitzenbauer, V. (2017). Improved Set-based Symbolic Algorithms for Parity Games. In V. Goranko & M. Dam (Eds.), Computer Science Logic - CSL 2017 (pp. 1–21). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.CSL.2017.18
  • Winner Determination in Huge Elections with MapReduce. AAAI 2017: 451-458 / Csar, T., Lackner, M., Pichler, R., & Sallinger, E. (2017). Winner Determination in Huge Elections with MapReduce. AAAI 2017: 451-458. In AAAI 2017 (pp. 451–458). http://hdl.handle.net/20.500.12708/57076
    Projects: FAIR (2013–2018) / HINT (2012–2017) / START (2014–2022)
  • Ranking Specific Sets of Objects / Maly, J., & Woltran, S. (2017). Ranking Specific Sets of Objects. In Workshop Präferenzen und Personalisierung in der Informatik (pp. 193–201). http://hdl.handle.net/20.500.12708/57051
    Projects: GRAPPA (2016–2019) / HINT (2012–2017) / START (2014–2022)
  • The Impact of Treewidth on {ASP} Grounding and Solving / Moldovan, M., Bliem, B., Morak, M., Woltran, S., & Bliem, B. (2017). The Impact of Treewidth on {ASP} Grounding and Solving. In Proceedings of the 4th International Workshop on Grounding and Transformations for Theories with Variables (GTTV 2017) (pp. 1–13). http://hdl.handle.net/20.500.12708/57064
    Project: START (2014–2022)
  • Modeling and solving a real-life multi-skill shift design problem / Bonutti, A., Ceschia, S., De Cesco, F., Musliu, N., & Schaerf, A. (2017). Modeling and solving a real-life multi-skill shift design problem. Annals of Operations Research, 252(2), 365–382. https://doi.org/10.1007/s10479-016-2175-7
    Project: ARTE (2012–2017)
  • Managing Change in Graph-Structured Data Using Description Logics / Ahmetaj, S., Calvanese, D., Ortiz de la Fuente, M. M., & Simkus, M. (2017). Managing Change in Graph-Structured Data Using Description Logics. ACM Transactions on Computational Logic, 18(4), 1–35. https://doi.org/10.1145/3143803
  • A Multiparametric View on Answer Set Programming / Fichte, J., Kronegger, M., & Woltran, S. (2017). A Multiparametric View on Answer Set Programming. In Proceedings of the 10th Workshop on Answer Set Programming and Other Computing Paradigms co-located with the 14th International Conference on Logic Programming and Nonmonotonic Reasoning (ASPOCP@LPNMR’17) (pp. 1–14). http://hdl.handle.net/20.500.12708/57098
    Project: START (2014–2022)
  • DynASP2.5: Dynamic Programming on Tree Decompositions in Action / Fichte, J., Hecher, M., Morak, M., & Woltran, S. (2017). DynASP2.5: Dynamic Programming on Tree Decompositions in Action. In D. Lokshtanov & N. Nishimura (Eds.), 12th International Symposium on Parameterized and Exact Computation (IPEC 2017) (pp. 17:1-17:13). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.IPEC.2017.17
    Project: START (2014–2022)
  • SAT-Based Local Improvement for Finding Tree Decompositions of Small Width / Fichte, J. K., Lodha, N., & Szeider, S. (2017). SAT-Based Local Improvement for Finding Tree Decompositions of Small Width. In S. Gaspers & T. Walsh (Eds.), Theory and Applications of Satisfiability Testing – SAT 2017 (pp. 401–411). Lecture Notes in Computer Science (LNCS) / Springer. https://doi.org/10.1007/978-3-319-66263-3_25
  • Planning the trip itinerary for tourist groups / Sylejmani, K., Dorn, J., & Musliu, N. (2017). Planning the trip itinerary for tourist groups. Information Technology and Tourism, 17(3), 275–314. https://doi.org/10.1007/s40558-017-0080-9
  • Merging in the Horn Fragment / Haret, A., Rümmele, S., & Woltran, S. (2017). Merging in the Horn Fragment. ACM Transactions on Computational Logic, 18(1), 1–32. https://doi.org/10.1145/3043700
    Projects: Belief Change (2013–2017) / FAIR (2013–2018)
  • Comparing the expressiveness of argumentation semantics / Dvořák, W., & Spanring, C. (2017). Comparing the expressiveness of argumentation semantics. Journal of Logic and Computation, exw008. https://doi.org/10.1093/logcom/exw008
    Project: GRAPPA (2016–2019)
  • A Hybrid Approach for the Sudoku Problem: Using Constraint Programming in Iterated Local Search / Musliu, N., & Winter, F. (2017). A Hybrid Approach for the Sudoku Problem: Using Constraint Programming in Iterated Local Search. IEEE Intelligent Systems, 32(2), 52–62. https://doi.org/10.1109/mis.2017.29
    Project: ARTE (2012–2017)
  • MaxSAT-based large neighborhood search for high school timetabling / Demirović, E., & Musliu, N. (2017). MaxSAT-based large neighborhood search for high school timetabling. Computers and Operations Research, 78, 172–180. https://doi.org/10.1016/j.cor.2016.08.004
    Project: ARTE (2012–2017)
  • Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning / Abseher, M., Musliu, N., & Woltran, S. (2017). Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning. Journal of Artificial Intelligence Research, 58, 829–858. https://doi.org/10.1613/jair.5312
    Projects: ARTE (2012–2017) / D-Flat (2013–2017) / START (2014–2022)
  • Conformant planning as a case study of incremental QBF solving / Egly, U., Kronegger, M., Lonsing, F., & Pfandler, A. (2017). Conformant planning as a case study of incremental QBF solving. Annals of Mathematics and Artificial Intelligence, 80(1), 21–45. http://hdl.handle.net/20.500.12708/147186
    Projects: FAIR (2013–2018) / START (2014–2022)
  • Ranking Specific Sets of Objects / Maly, J., & Woltran, S. (2017). Ranking Specific Sets of Objects. Datenbank-Spektrum: Zeitschrift Für Datenbanktechnologien Und Information Retrieval, 17(3), 255–265. https://doi.org/10.1007/s13222-017-0264-7
    Projects: GRAPPA (2016–2019) / HINT (2012–2017) / START (2014–2022)
  • Implementing Courcelle's Theorem in a declarative framework for dynamic programming / Bliem, B., Pichler, R., & Woltran, S. (2017). Implementing Courcelle’s Theorem in a declarative framework for dynamic programming. Journal of Logic and Computation, exv089. https://doi.org/10.1093/logcom/exv089
    Projects: D-Flat (2013–2017) / FAIR (2013–2018)
  • When you must forget: Beyond strong persistence when forgetting in answer set programming / GONÇALVES, R., KNORR, M., LEITE, J., & WOLTRAN, S. (2017). When you must forget: Beyond strong persistence when forgetting in answer set programming. Theory and Practice of Logic Programming, 17(5–6), 837–854. https://doi.org/10.1017/s1471068417000382
    Projects: Belief Change (2013–2017) / START (2014–2022)
  • A Hybrid Feature Selection Algorithm Based on Large Neighborhood Search / Taghizadeh, G., & Musliu, N. (2017). A Hybrid Feature Selection Algorithm Based on Large Neighborhood Search. In B. Hu & M. López-Ibáñez (Eds.), Evolutionary Computation in Combinatorial Optimization (pp. 30–43). Lecture Notes in Computer Science / Springer. https://doi.org/10.1007/978-3-319-55453-2_3
  • Solving Advanced Argumentation Problems with Answer-Set Programming / Diller, M., Linsbichler, T., Woltran, S., Brewka, G., & Heissenberger, G. (2017). Solving Advanced Argumentation Problems with Answer-Set Programming. In Proceedings of the 31st AAAI Conference on Artificial Intelligence (pp. 1077–1083). http://hdl.handle.net/20.500.12708/55706
    Project: GRAPPA (2016–2019)
  • Clopen Knowledge Bases: Combining Description Logics and Answer Set Programming / Bajraktari, L., Ortiz de la Fuente, M. M., & Simkus, M. (2017). Clopen Knowledge Bases: Combining Description Logics and Answer Set Programming. In A. Artale, B. Glimm, & R. Kontchakov (Eds.), Proceedings of the 30th International Workshop on Description Logics (pp. 1–13). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/55477
  • Deviation in Belief Change on Fragments of Propositional Logic / Haret, A., & Woltran, S. (2017). Deviation in Belief Change on Fragments of Propositional Logic. In C. Beierle, G. Kern-Isberner, M. Ragni, & F. Stolzenburg (Eds.), Proceedings of the 6th Workshop on Dynamics of Knowledge and Belief (DKB-2017) and the 5th Workshop KI & Kognition (KIK-2017) (p. 13). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/55459
    Project: Belief Change (2013–2017)
  • The Impact of Treewidth on ASP Grounding and Solving / Bliem, B., Moldovan, M., Morak, M., & Woltran, S. (2017). The Impact of Treewidth on ASP Grounding and Solving. In Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence. 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), Melbourne, Australia, Non-EU. AAAI Press. https://doi.org/10.24963/ijcai.2017/118
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • lpopt: A Rule Optimization Tool for Answer Set Programming / Morak, M., Bichler, M., & Woltran, S. (2017). lpopt: A Rule Optimization Tool for Answer Set Programming. In M. Hermenegildo & P. Lopez-Garcia (Eds.), Logic-Based Program Synthesis and Transformation (pp. 114–130). Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-319-63139-4_7
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • Function Symbols in Tuple-Generating Dependencies: Expressive Power and Computability / Gottlob, G., Pichler, R., & Sallinger, E. (2017). Function Symbols in Tuple-Generating Dependencies: Expressive Power and Computability. In E. Sallinger (Ed.), 11th Alberto Mendelzon International Workshop on Foundations of Data Management and the Web, AMW 2017 (pp. 1–5). CEUR Workshop Proceedings / CEUR-WS.org. http://hdl.handle.net/20.500.12708/57055
    Projects: FAIR (2013–2018) / HINT (2012–2017)
  • SEA-PARAM: Exploring Schedulers in Parametric MDPs / Arming, S., Bartocci, E., & Sokolova, A. (2017). SEA-PARAM: Exploring Schedulers in Parametric MDPs. In Electronic Proceedings in Theoretical Computer Science (pp. 25–38). EPCTS. https://doi.org/10.4204/eptcs.250.3
  • A Multi-stage Simulated Annealing Algorithm for the Torpedo Scheduling Problem / Kletzander, L., & Musliu, N. (2017). A Multi-stage Simulated Annealing Algorithm for the Torpedo Scheduling Problem. In Integration of AI and OR Techniques in Constraint Programming (pp. 344–358). Lecture Notes in Computer Science (LNCS) / Springer. https://doi.org/10.1007/978-3-319-59776-8_28
    Project: ARTE (2012–2017)
  • Structure-Driven Answer-Set Solving / Hecher, M. (2017). Structure-Driven Answer-Set Solving. In 4th International Conference on Logic Programming and Nonmonotonic Reasoning Doctoral Consortium (LPNMR DC) (p. 1). http://hdl.handle.net/20.500.12708/57104
    Project: START (2014–2022)
  • Stable Model Semantics for Tuple-Generating Dependencies Revisited / Pieris, A., Morak, M., & Alviano, M. (2017). Stable Model Semantics for Tuple-Generating Dependencies Revisited. In E. Sallinger & J. Van den Bussche (Eds.), Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. ACM. https://doi.org/10.1145/3034786.3034794
    Project: START (2014–2022)
  • A Study of Unrestricted Abstract Argumentation Frameworks / Baumann, R., & Spanring, C. (2017). A Study of Unrestricted Abstract Argumentation Frameworks. In Proceedings of the 26th International Joint Conference on Artificial Intelligence (pp. 807–813). http://hdl.handle.net/20.500.12708/57059
  • Towards Preprocessing for Abstract Argumentation Frameworks / Woltran, S. (2017). Towards Preprocessing for Abstract Argumentation Frameworks. In Proceedings of the 4th International Workshop on Defeasible and Ampliative Reasoning (DARe-17) (p. 1). http://hdl.handle.net/20.500.12708/57058
    Project: GRAPPA (2016–2019)
  • On the Complexity of Enumerating the Extensions of Abstract Argumentation Frameworks / Kröll, M., Pichler, R., & Woltran, S. (2017). On the Complexity of Enumerating the Extensions of Abstract Argumentation Frameworks. In Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence. 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), Melbourne, Australia, Non-EU. https://doi.org/10.24963/ijcai.2017/159
    Projects: FAIR (2013–2018) / GRAPPA (2016–2019) / HINT (2012–2017)
  • On the Complexity of Hard Enumeration Problems / Creignou, N., Kröll, M., Pichler, R., Skritek, S., & Vollmer, H. (2017). On the Complexity of Hard Enumeration Problems. In Language and Automata Theory and Applications - 11th International Conference, LATA 2017 (pp. 183–195). http://hdl.handle.net/20.500.12708/57056
    Projects: FAIR (2013–2018) / HINT (2012–2017)
  • Workshop Präferenzen und Personalisierung in der Informatik (PPI17) / Pfandler, A., & Endres, M. (2017). Workshop Präferenzen und Personalisierung in der Informatik (PPI17). In Workshop Präferenzen und Personalisierung in der Informatik bei der Konferenz “Datenbanksysteme für Business, Technologie und Web” (BTW) (pp. 155–157). Gesellschaft für Informatik. http://hdl.handle.net/20.500.12708/57039
    Project: FAIR (2013–2018)
  • Swift Logic for Big Data and Knowledge Graphs / Bellomarini, L., Gottlob, G., Pieris, A., & Sallinger, E. (2017). Swift Logic for Big Data and Knowledge Graphs. In Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence. 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), Melbourne, Australia, Non-EU. https://doi.org/10.24963/ijcai.2017/1
    Projects: FAIR (2013–2018) / HINT (2012–2017)
  • A General Notion of Equivalence for Abstract Argumentation / Dvorak, W. (2017). A General Notion of Equivalence for Abstract Argumentation. In A General Notion of Equivalence for Abstract Argumentation (p. 1). http://hdl.handle.net/20.500.12708/55700
  • Answer Set Solving with Bounded Treewidth Revisited / Hecher, M., Fichte, J., Morak, M., & Woltran, S. (2017). Answer Set Solving with Bounded Treewidth Revisited. In M. Balduccini & T. Janhunen (Eds.), Logic Programming and Nonmonotonic Reasoning (pp. 132–145). Springer. https://doi.org/10.1007/978-3-319-61660-5_13
  • Making Cross Products and Guarded Ontology Languages Compatible / Morak, M., Pieris, A., & Bourhis, P. (2017). Making Cross Products and Guarded Ontology Languages Compatible. In Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence. 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), Melbourne, Australia, Non-EU. https://doi.org/10.24963/ijcai.2017/122
    Project: START (2014–2022)
  • Backdoor Trees for Answer Set Programming / Fichte, J., & Szeider, S. (2017). Backdoor Trees for Answer Set Programming. In B. Bogaerts & A. Harrison (Eds.), Proceedings of the 10th Workshop on Answer Set Programming and Other Computing Paradigms co-located with the 14th International Conference on Logic Programming and Nonmonotonic Reasoning (ASPOCP@LPNMR’17 (pp. 1–16). http://hdl.handle.net/20.500.12708/55469
  • A General Notion of Equivalence for Abstract Argumentation / Dvorak, W., Linsbichler, T., Woltran, S., & Baumann, R. (2017). A General Notion of Equivalence for Abstract Argumentation. In Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence. 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), Melbourne, Australia, Non-EU. https://doi.org/10.24963/ijcai.2017/111
    Project: GRAPPA (2016–2019)

2016

  • Fuzzy data exchange / Medina, J., & Pichler, R. (2016). Fuzzy data exchange. Fuzzy Sets and Systems, 301, 129–145. https://doi.org/10.1016/j.fss.2015.12.004
    Project: HINT (2012–2017)
  • Introducing the Second International Competition on Computational Models of Argumentation / Gaggl, S. A., Linsbichler, T., Maratea, M., & Woltran, S. (2016). Introducing the Second International Competition on Computational Models of Argumentation. In M. Thimm, F. Cerutti, H. Strass, & M. Vallati (Eds.), Proceedings of the First International Workshop on Systems and Algorithms for Formal Argumentation (p. 6). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/56778
  • Unsere Empfehlung für Sie: Präferenzen und Personalisierung in der Informatik / Endres, M., & Pfandler, A. (2016). Unsere Empfehlung für Sie: Präferenzen und Personalisierung in der Informatik. In H. C. Mayr & M. Pinzger (Eds.), Informatik 2016 (pp. 1927–1934). Gesellschaft für Informatik, Bonn. http://hdl.handle.net/20.500.12708/56664
  • ASP for Anytime Dynamic Programming on Tree Decompositions (Extended Abstract) / Bliem, B., Kaufmann, B., Schaub, T., & Woltran, S. (2016). ASP for Anytime Dynamic Programming on Tree Decompositions (Extended Abstract). In G. Friedrich, M. Helmert, & F. Wotawa (Eds.), KI 2016: Advances in Artificial Intelligence (pp. 257–263). LNCS/Springer. http://hdl.handle.net/20.500.12708/56694
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • Investigating the relationship between argumentation semantics via signatures / Dunne, P. E., Linsbichler, T., Spanring, C., & Woltran, S. (2016). Investigating the relationship between argumentation semantics via signatures. In G. Friedrich, M. Helmert, & F. Wotawa (Eds.), Advances in Artificial Intelligence - 39th Annual German Conference on AI, Proceedings (pp. 271–277). Springer. http://hdl.handle.net/20.500.12708/56782
  • Providing Built-In Counters in a Declarative Dynamic Programming Environment / Abseher, M., Moldovan, M., & Woltran, S. (2016). Providing Built-In Counters in a Declarative Dynamic Programming Environment. In G. Friedrich, M. Helmert, & F. Wotawa (Eds.), KI 2016: Advances in Artificial Intelligence (pp. 3–16). LNCS/Springer. https://doi.org/10.1007/978-3-319-46073-4_1
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • Clique-Width and Directed Width Measures for Answer-Set Programming / Bliem, B., Ordyniak, S., & Woltran, S. (2016). Clique-Width and Directed Width Measures for Answer-Set Programming. In G. A. Kaminka, M. Fox, P. Bouquet, E. Hüllermeier, V. Dignum, F. Dignum, & F. van Harmelen (Eds.), ECAI 2016 - 22nd European Conference on Artificial Intelligence (pp. 1105–1113). IOS Press. http://hdl.handle.net/20.500.12708/56679
    Project: START (2014–2022)
  • Beyond IC Postulates: Classification Criteria for Merging Operators / Haret, A., Pfandler, A., & Woltran, S. (2016). Beyond IC Postulates: Classification Criteria for Merging Operators. In G. A. Kaminka, M. Fox, P. Bouquet, E. Hüllermeier, V. Dignum, F. Dignum, & F. van Harmelen (Eds.), ECAI 2016 - 22nd European Conference on Artificial Intelligence (pp. 372–380). IOS Press. http://hdl.handle.net/20.500.12708/56666
    Project: FAIR (2013–2018)
  • Conflicts in Abstract Argumentation / Spanring, C. (2016). Conflicts in Abstract Argumentation. In Cardiff Argumentation Forum (p. 2). http://hdl.handle.net/20.500.12708/56768
  • Intertranslatability of Abstract Argumentation Frameworks / Polberg, S. (2016). Intertranslatability of Abstract Argumentation Frameworks. In Cardiff Argumentation Forum (p. 3). http://hdl.handle.net/20.500.12708/56767
  • Winner Determination in Huge Elections with MapReduce / Csar, T., Lackner, M., Pichler, R., & Sallinger, E. (2016). Winner Determination in Huge Elections with MapReduce. In M. Endres, N. Mattei, & A. Pfandler (Eds.), 10th Multidisciplinary Workshop on Advances in Preference Handling (p. 7). http://hdl.handle.net/20.500.12708/56661
    Projects: FAIR (2013–2018) / HINT (2012–2017) / SEE (2012–2016) / START (2014–2022)
  • Feature Extractors for Describing Vehicle Routing Problem Instances / Rasku, J., Musliu, N., & Kärkkäinen, T. (2016). Feature Extractors for Describing Vehicle Routing Problem Instances. In 5th Student Conference on Operational Research (SCOR 2016) (p. 13). http://hdl.handle.net/20.500.12708/56917
  • Dynamic Programming-based QBF Solving / Charwat, G., & Woltran, S. (2016). Dynamic Programming-based QBF Solving. In F. Lonsing & M. Seidl (Eds.), Proceedings of the 4th International Workshop on Quantified Boolean Formulas (QBF 2016) (p. 14). CEUR-WS.org. http://hdl.handle.net/20.500.12708/56683
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • Counting Answer Sets via Dynamic Programming / Fichte, J., Hecher, M., Morak, M., & Woltran, S. (2016). Counting Answer Sets via Dynamic Programming. In T. Eiter, W. Faber, & S. Woltran (Eds.), Proceedings of the Workshop on Trends and Applications of Answer Set Programming (TAASP 2016) (p. 14). http://hdl.handle.net/20.500.12708/56808
    Project: START (2014–2022)
  • Clique-Width and Directed Width Measures for Answer-Set Programming / Bliem, B., Ordyniak, S., & Woltran, S. (2016). Clique-Width and Directed Width Measures for Answer-Set Programming. In T. Eiter, W. Faber, & S. Woltran (Eds.), Proceedings of the Workshop on Trends and Applications of Answer Set Programming (TAASP 2016) (p. 17). http://hdl.handle.net/20.500.12708/56809
    Project: START (2014–2022)
  • The Impact of Active Domain Predicates on Guarded Existential Rules / Gottlob, G., Pieris, A., & Šimkus, M. (2016). The Impact of Active Domain Predicates on Guarded Existential Rules. In M. M. Ortiz de la Fuente & S. Schlobach (Eds.), Web Reasoning and Rule Systems (pp. 94–110). Lecture Notes in Computer Science / Springer. https://doi.org/10.1007/978-3-319-45276-0_8
    Projects: HINT (2012–2017) / START (2014–2022)
  • Verification of Evolving Graph-structured Data under Expressive Path Constraints / Calvanese, D., Ortiz de la Fuente, M. M., & Simkus, M. (2016). Verification of Evolving Graph-structured Data under Expressive Path Constraints. In W. Martens & T. Zeume (Eds.), 19th International Conference on Database Theory, ICDT 2016, Bordeaux, France, March 15-18, 2016 (pp. 15:1-15:19). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.ICDT.2016.15
    Projects: HINT (2012–2017) / SEE (2012–2016) / SemDat (2012–2016)
  • Revision of abstract dialectical frameworks: Preliminary report / Linsbichler, T., & Woltran, S. (2016). Revision of abstract dialectical frameworks: Preliminary report. In S. A. Gaggl, J. C. Nieves, & H. Strass (Eds.), Proceedings of the First international Workshop on Argumentation in Logic Programming and Non-Monotonic Reasoning (p. 8). http://hdl.handle.net/20.500.12708/56770
  • Complexity of Repair Checking and Consistent Query Answering / Arming, S., Pichler, R., & Sallinger, E. (2016). Complexity of Repair Checking and Consistent Query Answering. In W. Martens & T. Zeume (Eds.), 19th International Conference on Database Theory, ICDT 2016, Bordeaux, France, March 15-18, 2016 (pp. 21:1-21:18). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.ICDT.2016.21
    Projects: HINT (2012–2017) / SEE (2012–2016)
  • Limits of Schema Mappings / Kolaitis, P. G., Pichler, R., Sallinger, E., & Savenkov, V. (2016). Limits of Schema Mappings. In W. Martens & T. Zeume (Eds.), 19th International Conference on Database Theory, ICDT 2016, Bordeaux, France, March 15-18, 2016 (pp. 19:1-19:17). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.ICDT.2016.19
    Projects: HINT (2012–2017) / SEE (2012–2016)
  • On the Complexity of Enumerating the Answers to Well-designed Pattern Trees / Kröll, M., Pichler, R., & Skritek, S. (2016). On the Complexity of Enumerating the Answers to Well-designed Pattern Trees. In W. Martens & T. Zeume (Eds.), 19th International Conference on Database Theory, ICDT 2016, Bordeaux, France, March 15-18, 2016 (pp. 22:1-22:18). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.ICDT.2016.22
    Projects: HINT (2012–2017) / SEE (2012–2016)
  • A Datalog-Based Language for Querying RDF Graphs / Arenas, M., Gottlob, G., & Pieris, A. (2016). A Datalog-Based Language for Querying RDF Graphs. In R. Pichler & A. S. da Silva (Eds.), Proceedings of the 10th Alberto Mendelzon International Workshop on Foundations of Data Management, Panama City, Panama, May 8-10, 2016 (p. 4). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/56548
    Projects: HINT (2012–2017) / SEE (2012–2016) / START (2014–2022)
  • Conformant Planning as a Case Study of Incremental QBF Solving / Egly, U., Kronegger, M., Lonsing, F., & Pfandler, A. (2016). Conformant Planning as a Case Study of Incremental QBF Solving. Annals of Mathematics and Artificial Intelligence, 80(1), 21–45. https://doi.org/10.1007/s10472-016-9501-2
    Project: Boolean (2011–2019)
  • On rejected arguments and implicit conflicts: The hidden power of argumentation semantics / Baumann, R., Dvořák, W., Linsbichler, T., Spanring, C., Strass, H., & Woltran, S. (2016). On rejected arguments and implicit conflicts: The hidden power of argumentation semantics. Artificial Intelligence, 241, 244–284. https://doi.org/10.1016/j.artint.2016.09.004
  • The role of self-attacking arguments in characterizations of equivalence notions / Baumann, R., & Woltran, S. (2016). The role of self-attacking arguments in characterizations of equivalence notions. Journal of Logic and Computation, 26(4), 1293–1313. https://doi.org/10.1093/logcom/exu010
  • Shift Design with Answer Set Programming / Abseher, M., Gebser, M., Musliu, N., Schaub, T., & Woltran, S. (2016). Shift Design with Answer Set Programming. Fundamenta Informaticae, 147(1), 1–25. http://hdl.handle.net/20.500.12708/149520
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy / Bliem, B., Charwat, G., Hecher, M., & Woltran, S. (2016). D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy. Fundamenta Informaticae, 147(1), 27–61. http://hdl.handle.net/20.500.12708/149519
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • The Power of Non-Ground Rules in Answer Set Programming / BICHLER, M., MORAK, M., & WOLTRAN, S. (2016). The Power of Non-Ground Rules in Answer Set Programming. Theory and Practice of Logic Programming, 16(5–6), 552–569. https://doi.org/10.1017/s1471068416000338
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • Guarded-Based Disjunctive Tuple-Generating Dependencies / Bourhis, P., Manna, M., Morak, M., & Pieris, A. (2016). Guarded-Based Disjunctive Tuple-Generating Dependencies. ACM Transactions on Database Systems, 41(4), 1–45. https://doi.org/10.1145/2976736
    Project: START (2014–2022)
  • Universities and computer science in the European crisis of refugees / Conrad, K., Musliu, N., Pichler, R., & Werthner, H. (2016). Universities and computer science in the European crisis of refugees. Communications of the ACM, 59(10), 31–33. https://doi.org/10.1145/2893180
  • Belief Merging within Fragments of Propositional Logic / Creignou, N., Papini, O., Rümmele, S., & Woltran, S. (2016). Belief Merging within Fragments of Propositional Logic. ACM Transactions on Computational Logic, 17(3), 1–28. https://doi.org/10.1145/2898436
    Project: FAIR (2013–2018)
  • Managing Change in Graph-Structured Data Using Description Logics / Ortiz de la Fuente, M. M., & Simkus, M. (2016). Managing Change in Graph-Structured Data Using Description Logics. Workshop on New Trends in Belief Change, Vienna, Austria. http://hdl.handle.net/20.500.12708/86468
    Project: SemDat (2012–2016)
  • Dynamic Programming on Tree Decompositions in Practice / Woltran, S. (2016). Dynamic Programming on Tree Decompositions in Practice. 8th European Starting AI Researcher Symposium, Den Haag, EU. http://hdl.handle.net/20.500.12708/86435
    Project: START (2014–2022)
  • Semantic Acyclicity Under Constraints / Barcelo, P., Gottlob, G., & Pieris, A. (2016). Semantic Acyclicity Under Constraints. In T. Milo & W.-C. Tang (Eds.), Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. ACM. https://doi.org/10.1145/2902251.2902302
    Projects: HINT (2012–2017) / SEE (2012–2016) / START (2014–2022)
  • An Exact Algorithm for Unicost Set Covering / Demirovic, E., Le Calvar, T., Musliu, N., & Inoue, K. (2016). An Exact Algorithm for Unicost Set Covering. In Doctoral Program of the 22nd International Conference on the Principles and Practice of Constraint Programming (CP 2016) (p. 9). http://hdl.handle.net/20.500.12708/56918
  • Modeling and solving staff scheduling with partial weighted maxSAT / Demirovic, E., Musliu, N., & Winter, F. (2016). Modeling and solving staff scheduling with partial weighted maxSAT. In PATAT 2016: Proceedings of the 11th International Conference of the Practice and Theory of Automated Timetabling (p. 17). http://hdl.handle.net/20.500.12708/56872
  • Integer Programming and Heuristic Approaches for a Multi-Stage Nurse Rostering Problem / Mischek, F., & Musliu, N. (2016). Integer Programming and Heuristic Approaches for a Multi-Stage Nurse Rostering Problem. In PATAT 2016: Proceedings of the 11th International Conference of the Practice and Theory of Automated Timetabling (p. 18). http://hdl.handle.net/20.500.12708/56871
  • Understanding the Abstract Dialectical Framework / Polberg, S. (2016). Understanding the Abstract Dialectical Framework. In L. Michael & A. C. Kakas (Eds.), Logics in Artificial Intelligence (pp. 430–446). Springer. https://doi.org/10.1007/978-3-319-48758-8_28
  • Grappavis - A system for advanced graph-based argumentation / Heissenberger, G., & Woltran, S. (2016). Grappavis - A system for advanced graph-based argumentation. In P. Baroni, T. F. Gordon, T. Scheffler, & M. Stede (Eds.), Computational Models of Argument - Proceedings of COMMA 2016 (pp. 473–474). IOS Press. http://hdl.handle.net/20.500.12708/56781
    Project: START (2014–2022)
  • Quantifying the difference between argumentation semantics / Doutre, S., & Mailly, J.-G. (2016). Quantifying the difference between argumentation semantics. In P. Baroni, T. F. Gordon, T. Scheffler, & M. Stede (Eds.), Computational Models of Argument - Proceedings of COMMA 2016 (pp. 255–262). IOS Press. http://hdl.handle.net/20.500.12708/56780
  • Perfection in abstract argumentation / Spanring, C. (2016). Perfection in abstract argumentation. In P. Baroni, T. F. Gordon, T. Scheffler, & M. Stede (Eds.), Computational Models of Argument - Proceedings of COMMA 2016 (pp. 439–446). IOS Press. http://hdl.handle.net/20.500.12708/56779
  • Verifiability of argumentation semantics / Baumann, R., Linsbichler, T., & Woltran, S. (2016). Verifiability of argumentation semantics. In P. Baroni, T. F. Gordon, T. Scheffler, & M. Stede (Eds.), Computational Models of Argument - Proceedings of COMMA 2016 (pp. 83–94). IOS Press. http://hdl.handle.net/20.500.12708/56777
  • Translation-Based Revision and Merging for Minimal Horn Reasoning / Brewka, G., Mailly, J.-G., & Woltran, S. (2016). Translation-Based Revision and Merging for Minimal Horn Reasoning. In G. A. Kaminka, M. Fox, P. Bouquet, E. Hüllermeier, V. Dignum, F. Dignum, & F. van Harmelen (Eds.), Proceedings of the 22nd European Conference on Artificial Intelligence (pp. 734–742). IOS Press. http://hdl.handle.net/20.500.12708/56775
  • A uniform account of realizability in abstract argumentation / Linsbichler, T., Puehrer, J., & Strass, H. (2016). A uniform account of realizability in abstract argumentation. In G. A. Kaminka, M. Fox, P. Bouquet, E. Hüllermeier, V. Dignum, F. Dignum, & F. van Harmelen (Eds.), Proceedings of the 22nd European Conference on Artificial Intelligence (pp. 252–260). IOS Press. http://hdl.handle.net/20.500.12708/56773
  • How different are two argumentation semantics? / Doutre, S., & Mailly, J.-G. (2016). How different are two argumentation semantics? In Dixièmes Journées d’Intelligence Artificielle Fondamentale (p. 8). http://hdl.handle.net/20.500.12708/56769
  • Towards advanced systems for abstract argumentation / Woltran, S. (2016). Towards advanced systems for abstract argumentation. In M. Thimm, F. Cerutti, H. Strass, & M. Vallati (Eds.), Proceedings of the First International Workshop on Systems and Algorithms for Formal Argumentation (p. 3). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/56745
  • A Compilation Technique for Interactive Ontology-mediated Data Exploration / Andresel, M.-P., Ortiz de la Fuente, M. M., & Simkus, M. (2016). A Compilation Technique for Interactive Ontology-mediated Data Exploration. In M. Lenzerini & R. Penaloza (Eds.), Proceedings of the 29th International Workshop on Description Logics, Cape Town, South Africa, April 22-25, 2016. (p. 12). CEUR Workshop Proceedings / CEUR-WS.org. http://hdl.handle.net/20.500.12708/56678
    Projects: HINT (2012–2017) / SemDat (2012–2016)
  • Polynomial Disjunctive Datalog Rewritings of Instance Queries in Expressive Description Logics / Ahmetaj, S., Ortiz de la Fuente, M. M., & Simkus, M. (2016). Polynomial Disjunctive Datalog Rewritings of Instance Queries in Expressive Description Logics. In M. Lenzerini & R. Penaloza (Eds.), Proceedings of the 29th International Workshop on Description Logics, Cape Town, South Africa, April 22-25, 2016. (p. 13). CEUR Workshop Proceedings / CEUR-WS.org. http://hdl.handle.net/20.500.12708/56673
    Projects: HINT (2012–2017) / SemDat (2012–2016)
  • Closed Predicates in Description Logics: Results on Combined Complexity / Ngo, N., Ortiz de la Fuente, M. M., & Simkus, M. (2016). Closed Predicates in Description Logics: Results on Combined Complexity. In R. Pichler & A. S. da Silva (Eds.), Proceedings of the 10th Alberto Mendelzon International Workshop on Foundations of Data Management, Panama City, Panama, May 8-10, 2016 (p. 5). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/56672
    Projects: HINT (2012–2017) / SemDat (2012–2016)
  • Polynomial Datalog Rewritings for Ontology Mediated Queries with Closed Predicates / Ahmetaj, S., Ortiz de la Fuente, M. M., & Simkus, M. (2016). Polynomial Datalog Rewritings for Ontology Mediated Queries with Closed Predicates. In R. Pichler & A. S. da Silva (Eds.), Proceedings of the 10th Alberto Mendelzon International Workshop on Foundations of Data Management, Panama City, Panama, May 8-10, 2016 (p. 5). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/56671
    Projects: HINT (2012–2017) / SemDat (2012–2016)
  • Semantic Acyclicity Under Constraints / Barceló, P., Gottlob, G., & Pieris, A. (2016). Semantic Acyclicity Under Constraints. In R. Pichler & A. S. da Silva (Eds.), Proceedings of the 10th Alberto Mendelzon International Workshop on Foundations of Data Management, Panama City, Panama, May 8-10, 2016 (p. 5). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/56547
    Projects: HINT (2012–2017) / SEE (2012–2016) / START (2014–2022)
  • On the Complexity of Enumerating the Answers to Well-Designed Pattern Trees / Kröll, M., Pichler, R., & Skritek, S. (2016). On the Complexity of Enumerating the Answers to Well-Designed Pattern Trees. In R. Pichler & A. S. da Silva (Eds.), Proceedings of the 10th Alberto Mendelzon International Workshop on Foundations of Data Management, Panama City, Panama, May 8-10, 2016 (p. 5). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/56490
    Projects: HINT (2012–2017) / SEE (2012–2016)
  • lpopt: A Rule Optimization Tool for Answer Set Programming / Bichler, M., Morak, M., & Woltran, S. (2016). lpopt: A Rule Optimization Tool for Answer Set Programming. In M. Hermenegildo & P. Lopez-Garcia (Eds.), Pre-proceedings of the 26th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2016) (p. 14). http://hdl.handle.net/20.500.12708/56841
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • Distributing Knowledge Into Simple Bases / Haret, A., Mailly, J.-G., & Woltran, S. (2016). Distributing Knowledge Into Simple Bases. In S. Kambhampati (Ed.), Proceedings of the 25th International Joint Conference on Artificial Intelligence (pp. 1109–1115). IJCAI/AAAI Press. http://hdl.handle.net/20.500.12708/56772
  • Investigating the relationship between argumentation semantics via signature / Dunne, P. E., Linsbichler, T., Spanring, C., & Woltran, S. (2016). Investigating the relationship between argumentation semantics via signature. In S. Kambhampati (Ed.), Proceedings of the 25th International Joint Conference on Artificial Intelligence (pp. 1051–1057). IJCAI/AAAI Press. http://hdl.handle.net/20.500.12708/56771
  • Merging of Abstract Argumentation Frameworks / Delobelle, J., Haret, A., Konieczny, S., Mailly, J.-G., Rossit, J., & Woltran, S. (2016). Merging of Abstract Argumentation Frameworks. In C. Baral, J. P. Delgrande, & F. Wolter (Eds.), Principles of Knowledge Representation and Reasoning: Proceedings of the 15th International Conference (pp. 33–42). AAAI Press. http://hdl.handle.net/20.500.12708/56766
  • On the functional completeness of argumentation semantics / Giacomin, M., Linsbichler, T., & Woltran, S. (2016). On the functional completeness of argumentation semantics. In C. Baral, J. P. Delgrande, & F. Wolter (Eds.), Principles of Knowledge Representation and Reasoning: Proceedings of the 15th International Conference (pp. 43–52). AAAI Press. http://hdl.handle.net/20.500.12708/56765
  • Distributing Knowledge Into Simple Bases / Haret, A., Mailly, J.-G., & Woltran, S. (2016). Distributing Knowledge Into Simple Bases. In G. Kern-Isberner & R. Wassermann (Eds.), Proceedings of the 16th International Workshop on Non-monotonic reasoning (p. 9). http://hdl.handle.net/20.500.12708/56764
  • Using enthymemes to fill the gap between logical argumentation and revision of abstract argumentation frameworks / Mailly, J.-G. (2016). Using enthymemes to fill the gap between logical argumentation and revision of abstract argumentation frameworks. In G. Kern-Isberner & R. Wassermann (Eds.), Proceedings of the 16th International Workshop on Non-monotonic reasoning (p. 11). http://hdl.handle.net/20.500.12708/56762
  • Characterizing realizability in abstract argumentation / Linsbichler, T., Puehrer, J., & Strass, H. (2016). Characterizing realizability in abstract argumentation. In G. Kern-Isberner & R. Wassermann (Eds.), Proceedings of the 16th International Workshop on Non-monotonic reasoning (p. 10). http://hdl.handle.net/20.500.12708/56761
  • Verifiability of argumentation semantics / Baumann, R., Linsbichler, T., & Woltran, S. (2016). Verifiability of argumentation semantics. In G. Kern-Isberner & R. Wassermann (Eds.), Proceedings of the 16th International Workshop on Non-monotonic reasoning (p. 10). http://hdl.handle.net/20.500.12708/56747
  • Complexity of Secure Sets / Bliem, B., & Woltran, S. (2016). Complexity of Secure Sets. In E. W. Mayr (Ed.), Graph-Theoretic Concepts in Computer Science (pp. 64–77). LNCS/Springer. https://doi.org/10.1007/978-3-662-53174-7_5
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • On Efficiently Enumerating Semi-Stable Extensions via Dynamic Programming on Tree Decompositions / Bliem, B., Hecher, M., & Woltran, S. (2016). On Efficiently Enumerating Semi-Stable Extensions via Dynamic Programming on Tree Decompositions. In P. Baroni, T. F. Gordon, T. Scheffler, & M. Stede (Eds.), Computational Models of Argument (pp. 107–118). IOS Press. http://hdl.handle.net/20.500.12708/56690
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • Strong Backdoors for Default Logic / Fichte, J. K., Meier, A., & Schindler, I. (2016). Strong Backdoors for Default Logic. In N. Creignou & D. Le Berre (Eds.), Theory and Applications of Satisfiability Testing – SAT 2016 (pp. 45–59). https://doi.org/10.1007/978-3-319-40970-2_4
    Project: START (2014–2022)
  • ASP for Anytime Dynamic Programming on Tree Decompositions / Bliem, B., Kaufmann, B., Schaub, T., & Woltran, S. (2016). ASP for Anytime Dynamic Programming on Tree Decompositions. In S. Kambhampati (Ed.), Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9-15 July 2016 (pp. 979–986). IJCAI/AAAI Press. http://hdl.handle.net/20.500.12708/56682
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • Closed Predicates in Description Logics: Results on Combined Complexity / Ngo, N., Ortiz de la Fuente, M. M., & Simkus, M. (2016). Closed Predicates in Description Logics: Results on Combined Complexity. In C. Baral, J. P. Delgrande, & F. Wolter (Eds.), Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, {KR} 2016, Cape Town, South Africa, April 25-29, 2016. (pp. 237–246). AAAI Press. http://hdl.handle.net/20.500.12708/56676
    Projects: HINT (2012–2017) / SemDat (2012–2016)
  • Polynomial Datalog Rewritings for Expressive Description Logics with Closed Predicates / Ahmetaj, S., Ortiz de la Fuente, M. M., & Simkus, M. (2016). Polynomial Datalog Rewritings for Expressive Description Logics with Closed Predicates. In S. Kambhampati (Ed.), Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9-15 July 2016 (pp. 878–885). IJCAI/AAAI Press. http://hdl.handle.net/20.500.12708/56675
    Projects: HINT (2012–2017) / SemDat (2012–2016)
  • Subset Minimization in Dynamic Programming on Tree Decompositions / Bliem, B., Charwat, G., Hecher, M., & Woltran, S. (2016). Subset Minimization in Dynamic Programming on Tree Decompositions. In A. Darwiche (Ed.), Beyond NP, Papers from the 2016 AAAI Workshop (pp. 300–306). AAAI Press. http://hdl.handle.net/20.500.12708/56613
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • Ontology-Mediated Queries Distributing over Components / Berger, G., & Pieris, A. (2016). Ontology-Mediated Queries Distributing over Components. In S. Kambhampati (Ed.), Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9-15 July 2016 (pp. 943–949). IJCAI/AAAI Press. http://hdl.handle.net/20.500.12708/56546
    Projects: HINT (2012–2017) / SEE (2012–2016) / START (2014–2022)
  • The Challenge of Optional Matching in SPARQL / Ahmetaj, S., Fischl, W., Kröll, M., Pichler, R., Šimkus, M., & Skritek, S. (2016). The Challenge of Optional Matching in SPARQL. In M. Gyssens & G. R. Simari (Eds.), Lecture Notes in Computer Science (pp. 169–190). Lecture Notes in Computer Science (LNCS) / Springer. https://doi.org/10.1007/978-3-319-30024-5_10
    Projects: HINT (2012–2017) / SEE (2012–2016)
  • Equivalence Between Answer-Set Programs Under (Partially) Fixed Input / Bliem, B., & Woltran, S. (2016). Equivalence Between Answer-Set Programs Under (Partially) Fixed Input. In M. Gyssens & G. R. Simari (Eds.), Lecture Notes in Computer Science (pp. 95–111). Lecture Notes in Computer Science (LNCS) / Springer. https://doi.org/10.1007/978-3-319-30024-5_6
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • Answer Set Solving using Tree Decompositions and Dynamic Programming -- The DynASP2 System / Fichte, J., Hecher, M., Morak, M., & Woltran, S. (2016). Answer Set Solving using Tree Decompositions and Dynamic Programming -- The DynASP2 System (DBAI-TR-2016-101). http://hdl.handle.net/20.500.12708/39081
    Project: START (2014–2022)
  • Multiparametric View on Answer Set Programming / Fichte, J., Kronegger, M., & Woltran, S. (2016). Multiparametric View on Answer Set Programming (DBAI-TR-2016-99). http://hdl.handle.net/20.500.12708/39080
    Project: START (2014–2022)
  • Backdoor Trees for Answer Set Programming / Fichte, J., & Szeider, S. (2016). Backdoor Trees for Answer Set Programming (DBAI-TR-2016-98). http://hdl.handle.net/20.500.12708/39079
    Project: START (2014–2022)
  • Treewidth-Preserving Modeling in ASP / Bichler, M., Bliem, B., Moldovan, M., Morak, M., & Woltran, S. (2016). Treewidth-Preserving Modeling in ASP (DBAI-TR-2016-97). http://hdl.handle.net/20.500.12708/39078
    Project: START (2014–2022)
  • htd -- A Free, Open-Source Framework for Tree Decompositions and Beyond / Abseher, M., Musliu, N., & Woltran, S. (2016). htd -- A Free, Open-Source Framework for Tree Decompositions and Beyond (DBAI-TR-2016-96). http://hdl.handle.net/20.500.12708/39077
    Project: START (2014–2022)
  • BDD-based Dynamic Programming on Tree Decompositions / Charwat, G., & Woltran, S. (2016). BDD-based Dynamic Programming on Tree Decompositions (DBAI-TR-2016-95, DBAI). http://hdl.handle.net/20.500.12708/39076
    Project: START (2014–2022)
  • Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning / Abseher, M., Musliu, N., & Woltran, S. (2016). Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning (DBAI-TR-2016-94). http://hdl.handle.net/20.500.12708/39075
    Project: START (2014–2022)
  • Proceedings of the 10th Alberto Mendelzon International Workshop on Foundations of Data Management, Panama City, Panama, May 8-10, 2016 / Pichler, R., & da Silva, A. S. (Eds.). (2016). Proceedings of the 10th Alberto Mendelzon International Workshop on Foundations of Data Management, Panama City, Panama, May 8-10, 2016. CEUR-WS.org. http://hdl.handle.net/20.500.12708/24225
  • 10th Workshop on Advances in Preference Handling (M-PREF) / Endres, M., Mattei, N., & Pfandler, A. (Eds.). (2016). 10th Workshop on Advances in Preference Handling (M-PREF). Online Publication. http://hdl.handle.net/20.500.12708/24224

2015

  • Abstract Solvers for Dung’s Argumentation Frameworks / Brochenin, R., Linsbichler, T., Maratea, M., Wallner, J. P., & Woltran, S. (2015). Abstract Solvers for Dung’s Argumentation Frameworks. In E. Black, S. Modgil, & N. Oren (Eds.), Theory and Applications of Formal Argumentation (pp. 40–58). Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-319-28460-6_3
  • Shift Design with Answer Set Programming / Abseher, M., Gebser, M., Musliu, N., Schaub, T., & Woltran, S. (2015). Shift Design with Answer Set Programming. In D. Inclezan & M. Maratea (Eds.), 8th Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP 2015 (p. 13). http://hdl.handle.net/20.500.12708/56218
    Projects: ARTE (2012–2017) / D-Flat (2013–2017) / START (2014–2022)
  • D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy / Bliem, B., Charwat, G., Hecher, M., & Woltran, S. (2015). D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy. In D. Inclezan & M. Maratea (Eds.), 8th Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP 2015 (p. 15). http://hdl.handle.net/20.500.12708/56186
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • Complexity-Sensitive Decision Procedures for Abstract Argumentation (Extended Abstract) / Dvorak, W., Järvisalo, M., Wallner, J. P., & Woltran, S. (2015). Complexity-Sensitive Decision Procedures for Abstract Argumentation (Extended Abstract). In Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence (IJCAI 2015 (pp. 4173–4177). http://hdl.handle.net/20.500.12708/56291
  • Reduction-Based Approaches to Implement Modgil’s Extended Argumentation Frameworks / Dvořák, W., Gaggl, S. A., Linsbichler, T., & Wallner, J. P. (2015). Reduction-Based Approaches to Implement Modgil’s Extended Argumentation Frameworks. In T. Eiter, H. Strass, M. Truszczynski, & S. Woltran (Eds.), Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation (pp. 249–264). Springer. https://doi.org/10.1007/978-3-319-14726-0_17
  • A Glimpse on Gerhard Brewka's Contributions to Artificial Intelligence / Eiter, T., Strass, H., Truszczynski, M., & Woltran, S. (2015). A Glimpse on Gerhard Brewka’s Contributions to Artificial Intelligence. In T. Eiter, H. Strass, M. Truszczynski, & S. Woltran (Eds.), Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation (pp. 1–16). Springer LNCS. http://hdl.handle.net/20.500.12708/28886
  • Infinite Argumentation Frameworks / Baumann, R., & Spanring, C. (2015). Infinite Argumentation Frameworks. In T. Eiter, H. Strass, M. Truszczynski, & S. Woltran (Eds.), Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation (pp. 281–295). Springer LNCS. https://doi.org/10.1007/978-3-319-14726-0_19
  • Preference-Based Diagnosis Selection in Multi-Context Systems / Eiter, T., Fink, M., & Weinzierl, A. (2015). Preference-Based Diagnosis Selection in Multi-Context Systems. In T. Eiter, H. Strass, M. Truszczynski, & S. Woltran (Eds.), Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation (pp. 233–248). Springer International Publishing Switzerland. https://doi.org/10.1007/978-3-319-14726-0_16
  • Metaheuristic Algorithms and Tree Decomposition / Hammerl, T., Musliu, N., & Schafhauser, W. (2015). Metaheuristic Algorithms and Tree Decomposition. In J. Kacprzyk & W. Pedrycz (Eds.), Springer Handbook of Computational Intelligence (pp. 1255–1270). Springer. https://doi.org/10.1007/978-3-662-43505-2_64
    Project: ARTE (2012–2017)
  • Hunt for the Collapse of Semantics in Infinite Abstract Argumentation Frameworks / Spanring, C. (2015). Hunt for the Collapse of Semantics in Infinite Abstract Argumentation Frameworks. In C. Schulz & D. Liew (Eds.), 2015 Imperial College Computing Student Workshop (pp. 70–77). OpenAccess Series in Informatics. https://doi.org/10.4230/OASIcs.ICCSW.2015.70
  • Comparing the expressiveness of argumentation semantics / Dvorak, W., & Spanring, C. (2015). Comparing the expressiveness of argumentation semantics (DBAI-TR-2014-90). http://hdl.handle.net/20.500.12708/38661
  • Characteristics of Multiple Viewpoints in Abstract Argumentation / Dunne, P. E., Dvorak, W., Linsbichler, T., & Woltran, S. (2015). Characteristics of Multiple Viewpoints in Abstract Argumentation (DBAI-TR-2015-89). http://hdl.handle.net/20.500.12708/38660
  • Methods for solving reasoning problems in abstract argumentation - A survey / Charwat, G., Dvořák, W., Gaggl, S. A., Wallner, J. P., & Woltran, S. (2015). Methods for solving reasoning problems in abstract argumentation - A survey. Artificial Intelligence, 220, 28–63. https://doi.org/10.1016/j.artint.2014.11.008
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • Characteristics of multiple viewpoints in abstract argumentation / Dunne, P. E., Dvořák, W., Linsbichler, T., & Woltran, S. (2015). Characteristics of multiple viewpoints in abstract argumentation. Artificial Intelligence, 228, 153–178. https://doi.org/10.1016/j.artint.2015.07.006
  • Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory / Strass, H., & Wallner, J. P. (2015). Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory. Artificial Intelligence, 226, 34–74. https://doi.org/10.1016/j.artint.2015.05.003
  • Backdoors to Normality for Disjunctive Logic Programs / Fichte, J. K., & Szeider, S. (2015). Backdoors to Normality for Disjunctive Logic Programs. ACM Transactions on Computational Logic, 17(1), 1–23. https://doi.org/10.1145/2818646
    Project: START (2014–2022)
  • Dual-normal logic programs - the forgotten class / FICHTE, J. K., TRUSZCZYŃSKI, M., & WOLTRAN, S. (2015). Dual-normal logic programs - the forgotten class. Theory and Practice of Logic Programming, 15(4–5), 495–510. https://doi.org/10.1017/s1471068415000186
    Project: START (2014–2022)
  • Improved answer-set programming encodings for abstract argumentation / GAGGL, S. A., MANTHEY, N., RONCA, A., WALLNER, J. P., & WOLTRAN, S. (2015). Improved answer-set programming encodings for abstract argumentation. Theory and Practice of Logic Programming, 15(4–5), 434–448. https://doi.org/10.1017/s1471068415000149
    Project: START (2014–2022)
  • The complexity of handling minimal solutions in logic-based abduction / Pfandler, A., Pichler, R., & Woltran, S. (2015). The complexity of handling minimal solutions in logic-based abduction. Journal of Logic and Computation, 25(3), 805–825. https://doi.org/10.1093/logcom/exu053
    Project: FAIR (2013–2018)
  • Intra- and interdiagram consistency checking of behavioral multiview models / Kaufmann, P., Kronegger, M., Pfandler, A., Seidl, M., & Widl, M. (2015). Intra- and interdiagram consistency checking of behavioral multiview models. Computer Languages, Systems and Structures, 44, 72–88. https://doi.org/10.1016/j.cl.2015.08.003
    Project: FAIR (2013–2018)
  • On the undecidability of the equivalence of second-order tuple generating dependencies / Feinerer, I., Pichler, R., Sallinger, E., & Savenkov, V. (2015). On the undecidability of the equivalence of second-order tuple generating dependencies. Information Systems, 48, 113–129. https://doi.org/10.1016/j.is.2014.09.003
    Projects: HINT (2012–2017) / SEE (2012–2016)
  • Regular Path Queries in Lightweight Description Logics: Complexity and Algorithms / Bienvenu, M., Ortiz, M., & Simkus, M. (2015). Regular Path Queries in Lightweight Description Logics: Complexity and Algorithms. Journal of Artificial Intelligence Research, 53, 315–374. https://doi.org/10.1613/jair.4577
    Projects: FAIR (2013–2018) / SEE (2012–2016) / SemDat (2012–2016)
  • Reasoning in Abstract Dialectical Frameworks using Quantified Boolean Formulas / Diller, M., Wallner, J. P., & Woltran, S. (2015). Reasoning in Abstract Dialectical Frameworks using Quantified Boolean Formulas. Argument and Computation, 6(2), 149–177. https://doi.org/10.1080/19462166.2015.1036922
  • Applications of logical approaches to argumentation / Leite, J., Tran, C. S., Torroni, P., & Woltran, S. (2015). Applications of logical approaches to argumentation. Argument and Computation, 6(1), 1–2. https://doi.org/10.1080/19462166.2014.1003407
  • Linking Open-World Knowledge Bases Using Nonmonotonic Rules / Eiter, T., & Simkus, M. (2015). Linking Open-World Knowledge Bases Using Nonmonotonic Rules. In F. Calimeri, G. Ianni, & M. Truszczynski (Eds.), Logic Programming and Nonmonotonic Reasoning (pp. 294–308). Springer LNCS. https://doi.org/10.1007/978-3-319-23264-5_25
    Projects: ASP (2012–2015) / HEX-Programme (2008–2012) / HINT (2012–2017) / SEE (2012–2016)
  • Modern SAT Solvers -- History, Techniques, and Success -- / Fichte, J. (2015). Modern SAT Solvers -- History, Techniques, and Success --. UIB Department Seminar at Informatics, University of Bergen, Bergen, Norwegen, Non-EU. http://hdl.handle.net/20.500.12708/86182
  • Ontological Conjunctive Query Answering via Existential Rules / Pieris, A., & Thomazo, M. (2015). Ontological Conjunctive Query Answering via Existential Rules. 27th European Summer School in Logic, Language and Information (ESSLLI 2015), Barcelona, EU. http://hdl.handle.net/20.500.12708/86240
  • Dynamic Programming on Tree Decomposition in Practice. Some Lessons Learned / Woltran, S. (2015). Dynamic Programming on Tree Decomposition in Practice. Some Lessons Learned. 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2015), Timisoara, EU. http://hdl.handle.net/20.500.12708/86188
  • Towards Reconciling SPARQL and Certain Answers / Ahmetaj, S., & Fischl, W. (2015). Towards Reconciling SPARQL and Certain Answers. PhDs in Logic VII, Wien, Austria. http://hdl.handle.net/20.500.12708/86056
    Projects: HINT (2012–2017) / SEE (2012–2016)
  • Function Symbols in Tuple-Generating Dependencies / Gottlob, G., Pichler, R., & Sallinger, E. (2015). Function Symbols in Tuple-Generating Dependencies. In T. Milo & D. Calvanese (Eds.), Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI  Symposium on Principles of Database Systems. ACM. https://doi.org/10.1145/2745754.2745756
    Projects: HINT (2012–2017) / SEE (2012–2016) / START (2014–2022)
  • Chase Termination for Guarded Existential Rules / Calautti, M., Gottlob, G., & Pieris, A. (2015). Chase Termination for Guarded Existential Rules. In T. Milo & D. Calvanese (Eds.), Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI  Symposium on Principles of Database Systems. ACM. https://doi.org/10.1145/2745754.2745773
    Projects: HINT (2012–2017) / SEE (2012–2016) / START (2014–2022)
  • Default Negation for Non-Guarded Existential Rules / Alviano, M., & Pieris, A. (2015). Default Negation for Non-Guarded Existential Rules. In T. Milo & D. Calvanese (Eds.), Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI  Symposium on Principles of Database Systems. ACM. https://doi.org/10.1145/2745754.2745758
    Projects: HINT (2012–2017) / SEE (2012–2016) / START (2014–2022)
  • Towards Reconciling SPARQL and Certain Answers / Ahmetaj, S., Fischl, W., Pichler, R., Šimkus, M., & Skritek, S. (2015). Towards Reconciling SPARQL and Certain Answers. In A. Gangemi, L. Stefano, & A. Panconesi (Eds.), Proceedings of the 24th International Conference on World Wide Web. ACM. https://doi.org/10.1145/2736277.2741636
    Projects: HINT (2012–2017) / SEE (2012–2016)
  • Efficient Evaluation and Approximation of Well-designed Pattern Trees / Barcelo, P., Pichler, R., & Skritek, S. (2015). Efficient Evaluation and Approximation of Well-designed Pattern Trees. In T. Milo & D. Calvanese (Eds.), Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI  Symposium on Principles of Database Systems. ACM. https://doi.org/10.1145/2745754.2745767
    Projects: HINT (2012–2017) / SEE (2012–2016)
  • The Combined Complexity of Reasoning with Closed Predicates in Description Logics / Ngo, N., Ortiz de la Fuente, M. M., & Simkus, M. (2015). The Combined Complexity of Reasoning with Closed Predicates in Description Logics. In D. Calvanese & B. Konev (Eds.), Proceedings of the 28th International Workshop on Description Logics, Athens,Greece, June 7-10, 2015 (pp. 249–261). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/55398
    Projects: HINT (2012–2017) / SemDat (2012–2016)
  • Navigational Queries Based on Frontier-Guarded Datalog: Preliminary Results / Bienvenu, M., Ortiz de la Fuente, M. M., & Simkus, M. (2015). Navigational Queries Based on Frontier-Guarded Datalog: Preliminary Results. In Proceedings of the 9th Alberto Mendelzon International Workshop on Foundations of Data Management, Lima, Peru, May 6 - 8, 2015 (pp. 162–171). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/55397
    Projects: HINT (2012–2017) / SemDat (2012–2016)
  • From Classical to Consistent Query Answering under Existential Rules / Pieris, A. (2015). From Classical to Consistent Query Answering under Existential Rules. In Proceedings of the Joint Ontology Workshops 2015 Episode 1: The Argentine Winter of Ontology co-located with the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015) (p. 1). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/56416
  • Polynomial Combined Rewritings for Linear Existential Rules and DL-Lite with n-ary Relations / Gottlob, G., Manna, M., & Pieris, A. (2015). Polynomial Combined Rewritings for Linear Existential Rules and DL-Lite with n-ary Relations. In Proceedings of the 28th International Workshop on Description Logics, Athens,Greece, June 7-10, 2015 (p. 4). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/56410
    Project: START (2014–2022)
  • From Classical to Consistent Query Answering under Existential Rules / Lukasiewicz, T., Martinez, M. V., Pieris, A., & Simari, G. I. (2015). From Classical to Consistent Query Answering under Existential Rules. In Proceedings of the 9th Alberto Mendelzon International Workshop on Foundations of Data Management, Lima, Peru, May 6 - 8, 2015 (p. 6). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/56409
    Project: START (2014–2022)
  • The Hidden Power of Abstract Argumentation Semantics / Linsbichler, T., Spanring, C., & Woltran, S. (2015). The Hidden Power of Abstract Argumentation Semantics. In E. Black, S. Modgil, & N. Oren (Eds.), Theory and Applications of Formal Argumentation (pp. 146–162). Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-319-28460-6_9
  • On the Functional Completeness of Argumentation Semantics / Giacomin, M., Linsbichler, T., & Woltran, S. (2015). On the Functional Completeness of Argumentation Semantics. In C. Beierle, G. Kern-Isberner, M. Ragni, & F. Stolzenburg (Eds.), Proceedings of the 5th Workshop on Dynamics of Knowledge and Belief (DKB-2015) and the 4th Workshop KI & Kognition (KIK-2015) (p. 12). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/56276
  • Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning / Dusberger, F., Abseher, M., Musliu, N., & Woltran, S. (2015). Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning. In Q. Yang & M. Wooldridge (Eds.), Proceedings of IJCAI 2015, the 24th International Joint Conference on Artificial Intelligence (pp. 275–282). AAAI Press. http://hdl.handle.net/20.500.12708/56206
    Projects: ARTE (2012–2017) / D-Flat (2013–2017) / START (2014–2022)
  • Fixed-parameter Tractable Reductions to SAT for Planning / de Haan, R., Kronegger, M., & Pfandler, A. (2015). Fixed-parameter Tractable Reductions to SAT for Planning. In Q. Yang & M. Wooldridge (Eds.), Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence - IJCAI 2015 (pp. 2897–2903). AAAI Press. http://hdl.handle.net/20.500.12708/56184
    Project: FAIR (2013–2018)
  • Using Statistics for Computing Joins with MapReduce / Csar, T., Pichler, R., Sallinger, E., & Savenkov, V. (2015). Using Statistics for Computing Joins with MapReduce. In A. Cali & M.-E. Vidal (Eds.), Proceedings of the 9th Alberto Mendelzon International Workshop on Foundations of Data Management, Lima, Peru, May 6 - 8, 2015 (p. 6). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/56102
    Projects: HINT (2012–2017) / START (2014–2022)
  • Chase Termination for Guarded Existential Rules / Calautti, M., Gottlob, G., & Pieris, A. (2015). Chase Termination for Guarded Existential Rules. In A. Cali & M.-E. Vidal (Eds.), Proceedings of the 9th Alberto Mendelzon International Workshop on Foundations of Data Management, Lima, Peru, May 6 - 8, 2015 (p. 6). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/56099
    Projects: HINT (2012–2017) / SEE (2012–2016) / START (2014–2022)
  • Binary Frontier-Guarded ASP with Function Symbols / Šimkus, M. (2015). Binary Frontier-Guarded ASP with Function Symbols. In N. Bassiliades, G. Gottlob, F. Sadri, A. Paschke, & D. Roman (Eds.), Rule Technologies: Foundations, Tools, and Applications (pp. 311–327). Springer LNCS. https://doi.org/10.1007/978-3-319-21542-6_20
    Projects: HINT (2012–2017) / Hybride Wissensbasen (2008–2012) / SEE (2012–2016)
  • Towards Reconciling SPARQL and Certain Answers (Extended Abstract) / Ahmetaj, S., Fischl, W., Pichler, R., Simkus, M., & Skritek, S. (2015). Towards Reconciling SPARQL and Certain Answers (Extended Abstract). In A. Cali & M.-E. Vidal (Eds.), Proceedings of the 9th Alberto Mendelzon International Workshop on Foundations of Data Management, Lima, Peru, May 6 - 8, 2015 (p. 6). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/56096
    Projects: HINT (2012–2017) / SEE (2012–2016)
  • Efficient Evaluation of Well-designed Pattern Trees (Extended Abstract) / Barceló, P., Pichler, R., & Skritek, S. (2015). Efficient Evaluation of Well-designed Pattern Trees (Extended Abstract). In A. Cali & M.-E. Vidal (Eds.), Proceedings of the 9th Alberto Mendelzon International Workshop on Foundations of Data Management, Lima, Peru, May 6 - 8, 2015 (p. 6). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/56095
    Projects: HINT (2012–2017) / SEE (2012–2016)
  • DL-Lite and Conjunctive Queries Extended by Optional Matching / Ahmetaj, S., Fischl, W., Pichler, R., Simkus, M., & Skritek, S. (2015). DL-Lite and Conjunctive Queries Extended by Optional Matching. In D. Calvanese & B. Konev (Eds.), Proceedings of the 28th International Workshop on Description Logics, Athens,Greece, June 7-10, 2015 (p. 4). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/56094
    Projects: HINT (2012–2017) / SEE (2012–2016)
  • A Rule-based Framework for Creating Instance Data from OpenStreetMap / Eiter, T., Pan, J. Z., Schneider, P., Šimkus, M., & Xiao, G. (2015). A Rule-based Framework for Creating Instance Data from OpenStreetMap. In B. ten Cate & A. Mileo (Eds.), Web Reasoning and Rule Systems (pp. 93–104). Springer LNCS. https://doi.org/10.1007/978-3-319-22002-4_8
    Projects: ASP (2012–2015) / HINT (2012–2017) / SEE (2012–2016)
  • Consistency Checking of Re-engineered UML Class Diagrams via Datalog+/- / Gottlob, G., Orsi, G., & Pieris, A. (2015). Consistency Checking of Re-engineered UML Class Diagrams via Datalog+/-. In Rule Technologies: Foundations, Tools, and Applications (pp. 35–53). Springer LNCS. https://doi.org/10.1007/978-3-319-21542-6_3
  • Polynomial Rewritings for Linear Existential Rules / Gottlob, G., Manna, M., & Pieris, A. (2015). Polynomial Rewritings for Linear Existential Rules. In Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015 (pp. 2992–2998). AAAI Press. http://hdl.handle.net/20.500.12708/56412
    Project: START (2014–2022)
  • Beyond SPARQL under OWL 2 QL Entailment Regime: Rules to the Rescue / Gottlob, G., & Pieris, A. (2015). Beyond SPARQL under OWL 2 QL Entailment Regime: Rules to the Rescue. In roceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015 (pp. 2999–3007). AAAI Press. http://hdl.handle.net/20.500.12708/56411
    Project: START (2014–2022)
  • From Classical to Consistent Query Answering under Existential Rules / Lukasiewicz, T., Martinez, M. V., Pieris, A., & Simari, G. I. (2015). From Classical to Consistent Query Answering under Existential Rules. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (pp. 1546–1552). AAAI Press. http://hdl.handle.net/20.500.12708/56408
    Project: START (2014–2022)
  • Recent Advances in Datalog+/- / Gottlob, G., Morak, M., & Pieris, A. (2015). Recent Advances in Datalog+/-. In Reasoning Web. Web Logic Rules - 11th International Summer School 2015, Berlin, Germany, July 31 - August 4, 2015, Tutorial Lectures. (pp. 193–217). Springer. http://hdl.handle.net/20.500.12708/56288
    Project: START (2014–2022)
  • Merging in the Horn Fragment / Haret, A., Rümmele, S., & Woltran, S. (2015). Merging in the Horn Fragment. In Q. Yang & M. Wooldridge (Eds.), Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence - IJCAI 2015 (pp. 3041–3047). AAAI Press. http://hdl.handle.net/20.500.12708/56274
  • An extension-based approach to belief revision in abstract argumentation / Diller, M., Haret, A., Linsbichler, T., Rümmele, S., & Woltran, S. (2015). An extension-based approach to belief revision in abstract argumentation. In Q. Yang & M. Wooldridge (Eds.), Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence - IJCAI 2015 (pp. 2926–2932). AAAI Press. http://hdl.handle.net/20.500.12708/56273
  • Parameterized Complexity of Asynchronous Border Minimization / Ganian, R., Kronegger, M., Pfandler, A., & Popa, A. (2015). Parameterized Complexity of Asynchronous Border Minimization. In R. Jain, S. Jain, & F. Stephan (Eds.), Lecture Notes in Computer Science (pp. 428–440). Springer. https://doi.org/10.1007/978-3-319-17142-5_36
    Project: FAIR (2013–2018)
  • Shift Design with Answer Set Programming / Abseher, M., Gebser, M., Musliu, N., Schaub, T., & Woltran, S. (2015). Shift Design with Answer Set Programming. In F. Calimeri, G. Ianni, & M. Truszczynski (Eds.), Logic Programming and Nonmonotonic Reasoning (pp. 32–39). Springer. https://doi.org/10.1007/978-3-319-23264-5_4
    Projects: ARTE (2012–2017) / D-Flat (2013–2017) / START (2014–2022)
  • Efficient Problem Solving on Tree Decompositions Using Binary Decision Diagrams / Charwat, G., & Woltran, S. (2015). Efficient Problem Solving on Tree Decompositions Using Binary Decision Diagrams. In F. Calimeri, G. Ianni, & M. Truszczynski (Eds.), Logic Programming and Nonmonotonic Reasoning (pp. 213–227). Springer. https://doi.org/10.1007/978-3-319-23264-5_19
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • Variable-Deletion Backdoors to Planning / Kronegger, M., Pfandler, A., & Ordyniak, S. (2015). Variable-Deletion Backdoors to Planning. In B. Bonet & S. Koenig (Eds.), Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, January 25-30, 2015, Austin, Texas, USA (pp. 3305–3312). AAAI Press. http://hdl.handle.net/20.500.12708/56214
    Project: FAIR (2013–2018)
  • Democratix: A Declarative Approach to Winner Determination / Charwat, G., & Pfandler, A. (2015). Democratix: A Declarative Approach to Winner Determination. In T. Walsh (Ed.), Algorithmic Decision Theory (pp. 253–269). Springer. https://doi.org/10.1007/978-3-319-23114-3_16
    Projects: D-Flat (2013–2017) / FAIR (2013–2018) / START (2014–2022)
  • Manipulation of k-Approval in Nearly Single-Peaked Electorates / Erdélyi, G., Lackner, M., & Pfandler, A. (2015). Manipulation of k-Approval in Nearly Single-Peaked Electorates. In T. Walsh (Ed.), Algorithmic Decision Theory (pp. 71–85). Springer. https://doi.org/10.1007/978-3-319-23114-3_5
    Projects: FAIR (2013–2018) / START (2014–2022)
  • On the Parameterized Complexity of Belief Revision / Pfandler, A., Rümmele, S., Wallner, J. P., & Woltran, S. (2015). On the Parameterized Complexity of Belief Revision. In Q. Yang & M. Wooldridge (Eds.), Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence - IJCAI 2015 (pp. 3149–3155). AAAI Press. http://hdl.handle.net/20.500.12708/56180
    Projects: FAIR (2013–2018) / START (2014–2022)
  • Distance-Bounded Consistent Query Answering / Pfandler, A., & Sallinger, E. (2015). Distance-Bounded Consistent Query Answering. In Q. Yang & M. Wooldridge (Eds.), Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015 (pp. 2262–2269). AAAI Press. http://hdl.handle.net/20.500.12708/56100
    Projects: FAIR (2013–2018) / HINT (2012–2017) / SEE (2012–2016) / START (2014–2022)
  • Extending ALCQIO with Trees / Kotek, T., imkus, M., Veith, H., & Zuleger, F. (2015). Extending ALCQIO with Trees. In 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science. 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2015), Kyoto, Japan, Austria. IEEE. https://doi.org/10.1109/lics.2015.54
    Projects: Automated Bound Analysis (2013–2016) / FAIR (2013–2018) / PROSEED (2011–2015) / SEE (2012–2016)
  • D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy / Bliem, B., Charwat, G., Hecher, M., & Woltran, S. (2015). D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy (DBAI-TR-2015-93). http://hdl.handle.net/20.500.12708/38634
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • Revisiting Extension-Based Semantics of Abstract Dialectical Frameworks / Polberg, S. (2015). Revisiting Extension-Based Semantics of Abstract Dialectical Frameworks (DBAI-TR-2015-88). http://hdl.handle.net/20.500.12708/38659
  • Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation / Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation. (2015). In T. Eiter, H. Strass, M. Truszczynski, & S. Woltran (Eds.), Lecture Notes in Computer Science. Springer. https://doi.org/10.1007/978-3-319-14726-0

2014

  • Numeric semantics of class diagrams with multiplicity and uniqueness constraints / Feinerer, I., & Salzer, G. (2014). Numeric semantics of class diagrams with multiplicity and uniqueness constraints. Software and Systems Modeling, 13(3), 1167–1187. https://doi.org/10.1007/s10270-012-0294-4
  • Automating the Parameter Selection in VRP: An Off-line Parameter Tuning Tool Comparison / Rasku, J., Musliu, N., & Kärkkäinen, T. (2014). Automating the Parameter Selection in VRP: An Off-line Parameter Tuning Tool Comparison. In Modeling, Simulation and Optimization for Science and Technology. Computational Methods in Applied Sciences, Volume 34 (pp. 191–209). Springer Netherlands. http://hdl.handle.net/20.500.12708/28570
    Project: ARTE (2012–2017)
  • Towards a Description Logic for Program Analysis: Extending ALCQIO with Reachability / Kotek, T., Simkus, M., Veith, H., & Zuleger, F. (2014). Towards a Description Logic for Program Analysis: Extending ALCQIO with Reachability. In International Workshop on Description Logics (p. 4). http://hdl.handle.net/20.500.12708/55329
  • Shape and Content: Incorporating Domain Knowledge into Shape Analysis / Calvanese, D., Kotek, T., Simkus, M., Veith, H., & Zuleger, F. (2014). Shape and Content: Incorporating Domain Knowledge into Shape Analysis. In International Workshop on Description Logics (p. 4). http://hdl.handle.net/20.500.12708/55330
  • Conformant Planning as a Case Study of Incremental QBF Solving / Egly, U., Kronegger, M., Lonsing, F., & Pfandler, A. (2014). Conformant Planning as a Case Study of Incremental QBF Solving. In Artificial Intelligence and Symbolic Computation (pp. 120–131). Springer. https://doi.org/10.1007/978-3-319-13770-4_11
    Projects: Boolean (2011–2019) / FAIR (2013–2018)
  • Backdoors to Planning / Kronegger, M., Pfandler, A., & Ordyniak, S. (2014). Backdoors to Planning. In C. E. Brodley & P. Stone (Eds.), Proceedings of the Twenty-Eighth AAAI Conference on Aritifical Intelligence (pp. 2300–2307). AAAI Press. http://hdl.handle.net/20.500.12708/55794
    Project: FAIR (2013–2018)
  • Backdoors to Planning / Kronegger, M., Pfandler, A., & Ordyniak, S. (2014). Backdoors to Planning. In M. R. Fellows, S. Gaspers, & T. Walsh (Eds.), Proceedings of the 2nd Workshop on the Parameterized Complexity of Computational Reasoning (PCCR) (p. 2). http://hdl.handle.net/20.500.12708/55774
    Project: FAIR (2013–2018)
  • Characteristics of Multiple Viewpoints in Abstract Argumentation / Dunne, P. E., Dvorak, W., Linsbichler, T., & Woltran, S. (2014). Characteristics of Multiple Viewpoints in Abstract Argumentation. In C. Baral, G. De Giacomo, & T. Eiter (Eds.), Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference (pp. 72–81). AAAI Press. http://hdl.handle.net/20.500.12708/55234
  • Resolution-Based Grounded Semantics Revisited / Dvorak, W., Linsbichler, T., Oikarinen, E., & Woltran, S. (2014). Resolution-Based Grounded Semantics Revisited. In S. Parsons, N. Oren, C. Reed, & F. Cerutti (Eds.), Computational Models of Argument (pp. 269–280). IOS Press. http://hdl.handle.net/20.500.12708/55238
  • Compact Argumentation Frameworks / Baumann, R., Dvorak, W., Linsbichler, T., Strass, H., & Woltran, S. (2014). Compact Argumentation Frameworks. In S. Konieczny & H. Tompits (Eds.), 15th International Workshop on Non-monotonic Reasoning (NMR 2014) (p. 10). http://hdl.handle.net/20.500.12708/55236
  • Compact Argumentation Frameworks / Baumann, R., Dvorak, W., Linsbichler, T., Strass, H., & Woltran, S. (2014). Compact Argumentation Frameworks. In Proceedings of the 21st European Conference on Artificial Intelligence (pp. 69–74). http://hdl.handle.net/20.500.12708/55733
  • Complexity of super-coherence problems in ASP / ALVIANO, M., FABER, W., & WOLTRAN, S. (2014). Complexity of super-coherence problems in ASP. Theory and Practice of Logic Programming, 14(3), 339–361. https://doi.org/10.1017/s147106841300001x
  • A Parameterized Complexity Analysis of Generalized CP-Nets / Kronegger, M., Lackner, M., Pfandler, A., & Pichler, R. (2014). A Parameterized Complexity Analysis of Generalized CP-Nets. In M. R. Fellows, S. Gaspers, & T. Walsh (Eds.), Proceedings of the 2nd Workshop on the Parameterized Complexity of Computational Reasoning (PCCR) (p. 2). http://hdl.handle.net/20.500.12708/55773
    Project: FAIR (2013–2018)
  • SPARQL Update for Materialized Triple Stores under DL-Lite_RDFS Entailment / Ahmeti, A., Calvanese, D., & Polleres, A. (2014). SPARQL Update for Materialized Triple Stores under DL-Lite_RDFS Entailment. In M. Bienvenu, M. M. Ortiz de la Fuente, R. Rosati, & M. Simkus (Eds.), Informal Proceedings of the 27th International Workshop on Description Logics, Vienna, Austria, July 17-20, 2014 (p. 13). CEUR-WS. http://hdl.handle.net/20.500.12708/55895
    Project: SEE (2012–2016)
  • Schema-Agnostic Query Rewriting in SPARQL 1.1 / Bischof, S., Krötzsch, M., Polleres, A., & Rudolph, S. (2014). Schema-Agnostic Query Rewriting in SPARQL 1.1. In P. Mika (Ed.), The Semantic Web - ISWC 2014 (p. 17). LNCS/Springer. http://hdl.handle.net/20.500.12708/55787
    Project: SEE (2012–2016)
  • Updating RDFS ABoxes and TBoxes in SPARQL / Ahmeti, A., Calvanese, D., & Polleres, A. (2014). Updating RDFS ABoxes and TBoxes in SPARQL. In P. Mika (Ed.), The Semantic Web – ISWC 2014 (pp. 441–456). LNCS/Springer. https://doi.org/10.1007/978-3-319-11964-9_28
    Project: SEE (2012–2016)
  • Integrating Distributed Configurations With RDFS and SPARQL / Schenner, G., Bischof, S., Polleres, A., & Steyskal, S. (2014). Integrating Distributed Configurations With RDFS and SPARQL. In A. Felfernig, F. Cipriano, & A. Haag (Eds.), Proceedings of the 16th International Configuration Workshop (p. 7). CEUR-WS. http://hdl.handle.net/20.500.12708/55784
    Project: SEE (2012–2016)
  • Querying the Web of Data with XSPARQL 1.1 / Dell´Aglio, D., Polleres, A., Lopes, N., & Bischof, S. (2014). Querying the Web of Data with XSPARQL 1.1. In R. Verborgh & E. Mannens (Eds.), Proceedings of the ISWC Developers Workshop 2014 (p. 6). CEUR-WS. http://hdl.handle.net/20.500.12708/55785
    Project: SEE (2012–2016)
  • Capturing Relational Schemas and Functional Dependencies in RDFS / Fischl, W., Calvanese, D., Pichler, R., Simkus, M., & Sallinger, E. (2014). Capturing Relational Schemas and Functional Dependencies in RDFS. Reasoning Web, International Summer School 2014, Athens, Greece. http://hdl.handle.net/20.500.12708/85949
    Projects: HINT (2012–2017) / SEE (2012–2016)
  • The break scheduling problem: complexity results and practical algorithms / Widl, M., & Musliu, N. (2014). The break scheduling problem: complexity results and practical algorithms. Memetic Computing, 6(2), 97–112. https://doi.org/10.1007/s12293-014-0131-0
    Projects: ARTE (2012–2017) / Boolean (2011–2019) / FAME (2011–2014)
  • Tractable answer-set programming with weight constraints: bounded treewidth is not enough / PICHLER, R., RÜMMELE, S., SZEIDER, S., & WOLTRAN, S. (2014). Tractable answer-set programming with weight constraints: bounded treewidth is not enough. Theory and Practice of Logic Programming, 14(2), 141–164. https://doi.org/10.1017/s1471068412000099
    Project: Complex Reason (2010–2014)
  • Generalizations of Dung Frameworks and Their Role in Formal Argumentation / Brewka, G., Polberg, S., & Woltran, S. (2014). Generalizations of Dung Frameworks and Their Role in Formal Argumentation. IEEE Intelligent Systems, 29(1), 30–38. https://doi.org/10.1109/mis.2013.122
  • Complexity-Sensitive Decision Procedures for Abstract Argumentation / Dvořák, W., Järvisalo, M., Wallner, J. P., & Woltran, S. (2014). Complexity-Sensitive Decision Procedures for Abstract Argumentation. Artificial Intelligence, 206, 53–78. https://doi.org/10.1016/j.artint.2013.10.001
  • Belief revision within fragments of propositional logic / Creignou, N., Papini, O., Pichler, R., & Woltran, S. (2014). Belief revision within fragments of propositional logic. Journal of Computer and System Sciences, 80(2), 427–449. https://doi.org/10.1016/j.jcss.2013.08.002
  • Shape and Content - A Database-Theoretic Perspective on the Analysis of Data Structures / Calvanese, D., Kotek, T., Šimkus, M., Veith, H., & Zuleger, F. (2014). Shape and Content - A Database-Theoretic Perspective on the Analysis of Data Structures. In E. Albert & E. Sekerinski (Eds.), Integrated Formal Methods (pp. 3–17). Springer / LNCS. https://doi.org/10.1007/978-3-319-10181-1_1
  • A SAT-based Debugging Tool for State Machines and Sequence Diagrams / Kaufmann, P., Kronegger, M., Pfandler, A., Seidl, M., & Widl, M. (2014). A SAT-based Debugging Tool for State Machines and Sequence Diagrams. PUMA/RiSE Workshop, Mondsee, Austria. http://hdl.handle.net/20.500.12708/86017
  • Automated Employee Scheduling / Musliu, N. (2014). Automated Employee Scheduling. SWORDS 2014 - Szeged WORkshop on Discrete Structures, Szeged, EU. http://hdl.handle.net/20.500.12708/86011
    Project: ARTE (2012–2017)
  • Scheduling Problems: Case Studies and Solution Techniques / Musliu, N. (2014). Scheduling Problems: Case Studies and Solution Techniques. International Conference on Automated Planning and Scheduling (ICAPS), Delft, EU. http://hdl.handle.net/20.500.12708/86010
    Project: ARTE (2012–2017)
  • Conformant Planning as a Case Study of Incremental QBF Solving / Egly, U., Kronegger, M., Lonsing, F., & Pfandler, A. (2014). Conformant Planning as a Case Study of Incremental QBF Solving. International Workshop on Quantified Boolean Formulas, Helsinki, EU. http://hdl.handle.net/20.500.12708/85946
    Projects: Boolean (2011–2019) / FAIR (2013–2018)
  • On the Parameterized Complexity of Generalized CP-Nets / Kronegger, M., Lackner, M., Pfandler, A., & Pichler, R. (2014). On the Parameterized Complexity of Generalized CP-Nets. Workshop on Challenges in Algorithmic Social Choice (CASC), Bad Belzig, Deutschland, EU. http://hdl.handle.net/20.500.12708/85939
    Project: FAIR (2013–2018)
  • Comparing the Power of Different Semantics for Abstract Argumentation / Woltran, S. (2014). Comparing the Power of Different Semantics for Abstract Argumentation. Workshop on the Dynamics of Argumentation, Rules and Conditionals DARC, University Luxembourg, Luxembourg, EU. http://hdl.handle.net/20.500.12708/85863
  • Nested dependencies: structure and reasoning / Kolaitis, P. G., Pichler, R., Sallinger, E., & Savenkov, V. (2014). Nested dependencies: structure and reasoning. In R. Hull & M. Grohe (Eds.), Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS’14, Snowbird, UT, USA, June 22-27, 2014 (pp. 176–187). ACM. http://hdl.handle.net/20.500.12708/58804
  • Containment and equivalence of well-designed SPARQL / Pichler, R., & Skritek, S. (2014). Containment and equivalence of well-designed SPARQL. In R. Hull & M. Grohe (Eds.), Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems. ACM. https://doi.org/10.1145/2594538.2594542
    Project: SEE (2012–2016)
  • DEMOCRATIX: A Declarative Approach to Winner Determination / Charwat, G., & Pfandler, A. (2014). DEMOCRATIX: A Declarative Approach to Winner Determination. In A. Procaccia & T. Walsh (Eds.), Proceedings of the Fifth International Workshop on Computational Social Choice (p. 15). http://hdl.handle.net/20.500.12708/55772
    Projects: D-Flat (2013–2017) / FAIR (2013–2018)
  • Axiom of Choice, Maximal Independent Sets, Argumentation and Dialogue Games / Spanring, C. (2014). Axiom of Choice, Maximal Independent Sets, Argumentation and Dialogue Games. In R. Neykova & N. Ng (Eds.), 2014 Imperial College Computing Student Workshop (p. 8). http://hdl.handle.net/20.500.12708/55243
  • Probabilistic Abstract Dialectical Frameworks / Polberg, S., & Doder, D. (2014). Probabilistic Abstract Dialectical Frameworks. In E. Fermé & J. Leite (Eds.), Logics in Artificial Intelligence (pp. 591–599). Springer. https://doi.org/10.1007/978-3-319-11558-0_42
  • Probabilistic Argumentation Frameworks – A Logical Approach / Doder, D., & Woltran, S. (2014). Probabilistic Argumentation Frameworks – A Logical Approach. In U. Straccia & A. Cali (Eds.), Lecture Notes in Computer Science (pp. 134–147). Springer. https://doi.org/10.1007/978-3-319-11508-5_12
  • Extension-based Semantics of Abstract Dialectical Frameworks / Polberg, S. (2014). Extension-based Semantics of Abstract Dialectical Frameworks. In U. Endriss & J. Leite (Eds.), STAIRS 2014 (pp. 240–249). IOS Press. http://hdl.handle.net/20.500.12708/55240
  • Revisiting Support in Abstract Argumentation Systems / Polberg, S., & Oren, N. (2014). Revisiting Support in Abstract Argumentation Systems. In S. Parsons, N. Oren, C. Reed, & F. Cerutti (Eds.), Computational Models of Argument (pp. 369–376). IOS Press. http://hdl.handle.net/20.500.12708/55239
  • Splitting Abstract Dialectical Frameworks / Linsbichler, T. (2014). Splitting Abstract Dialectical Frameworks. In S. Parsons, N. Oren, C. Reed, & F. Cerutti (Eds.), Computational Models of Argument (pp. 357–368). IOS Press. http://hdl.handle.net/20.500.12708/55237
  • Extension-based Semantics of Abstract Dialectical Frameworks / Polberg, S. (2014). Extension-based Semantics of Abstract Dialectical Frameworks. In S. Konieczny & H. Tompits (Eds.), 15th International Workshop on Non-monotonic Reasoning (NMR 2014) (p. 10). http://hdl.handle.net/20.500.12708/55235
  • Abstract Argumentation - All Problems Solved? / Woltran, S. (2014). Abstract Argumentation - All Problems Solved? In T. Schaub (Ed.), Proceedings ECAI 2014. IOS Press. http://hdl.handle.net/20.500.12708/55232
  • Computing Secure Sets in Graphs using Answer Set Programming. / Abseher, M., Bliem, B., Charwat, G., Dusberger, F., & Woltran, S. (2014). Computing Secure Sets in Graphs using Answer Set Programming. In 7th Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP 2014. ASPOCP 2014 - 7th Workshop on Answer Set Programming and Other Computing Paradigms, Wien, Austria. http://hdl.handle.net/20.500.12708/55222
    Project: D-Flat (2013–2017)
  • The D-FLAT System for Dynamic Programming on Tree Decompositions / Abseher, M., Bliem, B., Charwat, G., Dusberger, F., Hecher, M., & Woltran, S. (2014). The D-FLAT System for Dynamic Programming on Tree Decompositions. In E. Fermé & J. Leite (Eds.), Logics in Artificial Intelligence (pp. 558–572). Springer. https://doi.org/10.1007/978-3-319-11558-0_39
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • Reasoning in Abstract Dialectical Frameworks Using Quantified Boolean Formulas / Diller, M., Wallner, J. P., & Woltran, S. (2014). Reasoning in Abstract Dialectical Frameworks Using Quantified Boolean Formulas. In Computational Models of Argument (pp. 241–252). IOS Press. http://hdl.handle.net/20.500.12708/55157
  • Towards Practical Deletion Repair of Inconsistent DL-programs / Eiter, T., Fink, M., & Stepanova, D. (2014). Towards Practical Deletion Repair of Inconsistent DL-programs. In M. Bienvenu, M. M. Ortiz de la Fuente, R. Rosati, & M. Simkus (Eds.), Informal Proceedings of the 27th International Workshop on Description Logics (pp. 169–180). CEUR-WS. http://hdl.handle.net/20.500.12708/55751
    Project: ASP (2012–2015)
  • Contextualized Knowledge Repositories with Justifiable Exceptions / Bozzato, L., Eiter, T., & Serafini, L. (2014). Contextualized Knowledge Repositories with Justifiable Exceptions. In M. Bienvenu, M. M. Ortiz de la Fuente, R. Rosati, & M. Simkus (Eds.), Informal Proceedings of the 27th International Workshop on Description Logics (pp. 112–123). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/55719
  • Using OpenStreetMap Data to Create Benchmarks for Description Logic Reasoners 51-57 / Eiter, T., Schneider, P., Simkus, M., & Xiao, G. (2014). Using OpenStreetMap Data to Create Benchmarks for Description Logic Reasoners 51-57. In Informal Proceedings of the 3rd International Workshop on OWL Reasoner Evaluation (ORE 2014) (pp. 51–57). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/55387
    Projects: FAIR (2013–2018) / SEE (2012–2016)
  • Nested Regular Path Queries in Description Logics (Extended Abstract) / Bienvenu, M., Calvanese, D., Ortiz de la Fuente, M. M., & Simkus, M. (2014). Nested Regular Path Queries in Description Logics (Extended Abstract). In G. Gottlob & J. Perez (Eds.), Proceedings of the 8th Alberto Mendelzon Workshop on Foundations of Data Management. CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/55386
    Projects: FAIR (2013–2018) / SEE (2012–2016) / SemDat (2012–2016)
  • Planning Problems for Graph Structured Data in Description Logics / Ahmetaj, S., Calvanese, D., Ortiz de la Fuente, M. M., & Simkus, M. (2014). Planning Problems for Graph Structured Data in Description Logics. In M. Bienvenu, M. M. Ortiz de la Fuente, R. Rosati, & M. Simkus (Eds.), Informal Proceedings of the 27th International Workshop on Description Logics (pp. 4–7). CEUR-WS. http://hdl.handle.net/20.500.12708/55993
    Projects: FAIR (2013–2018) / SEE (2012–2016) / SemDat (2012–2016)
  • Modeling and Solving a Real-Life Multi-Skill Shift Design Problem / Bonutti, A., De Cesco, F., Musliu, N., & Schaerf, A. (2014). Modeling and Solving a Real-Life Multi-Skill Shift Design Problem. In Proceedings of the 10th International Conference of the Practice and Theory of Automated Timetabling (p. 3). http://hdl.handle.net/20.500.12708/55984
    Project: ARTE (2012–2017)
  • Solving High School Timetabling with Satisfiability Modulo Theories / Demirovic, E., & Musliu, N. (2014). Solving High School Timetabling with Satisfiability Modulo Theories. In Proceedings of the 10th International Conference of the Practice and Theory of Automated Timetabling (p. 25). http://hdl.handle.net/20.500.12708/55983
    Project: ARTE (2012–2017)
  • Application of Machine Learning to Algorithm Selection for TSP / Pihera, J., & Musliu, N. (2014). Application of Machine Learning to Algorithm Selection for TSP. In 26th IEEE International Conference on Tools with Artificial Intelligence (pp. 47–54). http://hdl.handle.net/20.500.12708/55982
    Project: ARTE (2012–2017)
  • Modeling High School Timetabling as PartialWeighted maxSAT / Demirovic, E., & Musliu, N. (2014). Modeling High School Timetabling as PartialWeighted maxSAT. In The Proceedings of 4th Workshop on Logic and Search (a SAT / ICLP workshop at FLoC 2014) (p. 15). http://hdl.handle.net/20.500.12708/55981
    Project: ARTE (2012–2017)
  • Expressiveness of guarded existential rule languages / Gottlob, G., Rudolph, S., & Simkus, M. (2014). Expressiveness of guarded existential rule languages. In R. Hull & M. Grohe (Eds.), Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems. ACM Press. https://doi.org/10.1145/2594538.2594556
    Projects: FAIR (2013–2018) / HINT (2012–2017)
  • Revisiting the Hardness of Query Answering in Expressive Description Logics / Ortiz, M., & Šimkus, M. (2014). Revisiting the Hardness of Query Answering in Expressive Description Logics. In R. Kontchakov & M.-L. Mugnier (Eds.), Web Reasoning and Rule Systems (pp. 216–223). Springer Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-319-11113-1_18
    Projects: FAIR (2013–2018) / SEE (2012–2016) / SemDat (2012–2016)
  • Nested Regular Path Queries in Description Logics / Bienvenu, M., Calvanese, D., Ortiz de la Fuente, M. M., & Simkus, M. (2014). Nested Regular Path Queries in Description Logics. In C. Baral, G. De Giacomo, & T. Eiter (Eds.), Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference (KR 2014) (pp. 218–227). AAAI Press. http://hdl.handle.net/20.500.12708/55963
    Projects: FAIR (2013–2018) / SEE (2012–2016) / SemDat (2012–2016)
  • Planning and Change in Graph Structured Data under Description Logics Constraints / Ahmetaj, S., Calvanese, D., Ortiz de la Fuente, M. M., & Simkus, M. (2014). Planning and Change in Graph Structured Data under Description Logics Constraints. In G. Gottlob & J. Perez (Eds.), Proceedings of the 8th Alberto Mendelzon Workshop on Foundations of Data Management. CEUR-Proceedings. http://hdl.handle.net/20.500.12708/55930
    Projects: FAIR (2013–2018) / SEE (2012–2016) / SemDat (2012–2016)
  • Managing Change in Graph-Structured Data Using Description Logics / Ahmetaj, S., Calvanese, D., Ortiz de la Fuente, M. M., & Simkus, M. (2014). Managing Change in Graph-Structured Data Using Description Logics. In C. E. Brodley & P. Stone (Eds.), Proceedings of the Twenty-Eighth AAAI Conference on Aritifical Intelligence (pp. 966–973). AAAI Press/IJCAI. http://hdl.handle.net/20.500.12708/55928
    Projects: FAIR (2013–2018) / SEE (2012–2016) / SemDat (2012–2016)
  • Expressive Identification Constraints to Capture Functional Dependencies in Description Logics / Calvanese, D., Fischl, W., Pichler, R., Sallinger, E., & Simkus, M. (2014). Expressive Identification Constraints to Capture Functional Dependencies in Description Logics. In Informal Proceedings of the 27th International Workshop on Description Logics (DL 2014) (p. 5). CEUR-WS. http://hdl.handle.net/20.500.12708/55903
    Projects: HINT (2012–2017) / SEE (2012–2016)
  • Capturing Relational Schemas and Functional Dependencies in RDFS / Calvanese, D., Fischl, W., Pichler, R., Sallinger, E., & Simkus, M. (2014). Capturing Relational Schemas and Functional Dependencies in RDFS. In Proceedings of the Twenty-Eighth AAAI Conference on Aritifical Intelligence (pp. 1003–1011). http://hdl.handle.net/20.500.12708/55901
    Projects: HINT (2012–2017) / SEE (2012–2016)
  • A Parameterized Complexity Analysis of Generalized CP-Nets / Kronegger, M., Lackner, M., Pfandler, A., & Pichler, R. (2014). A Parameterized Complexity Analysis of Generalized CP-Nets. In C. E. Brodley & P. Stone (Eds.), Proceedings of the Twenty-Eighth AAAI Conference on Aritifical Intelligence (pp. 1091–1097). http://hdl.handle.net/20.500.12708/55793
    Project: FAIR (2013–2018)
  • Combined Complexity of Repair Checking and Consistent Query Answering / Arming, S., Pichler, R., & Sallinger, E. (2014). Combined Complexity of Repair Checking and Consistent Query Answering. In G. Gottlob & J. Perez (Eds.), Proceedings of the 8th Alberto Mendelzon Workshop on Foundations of Data Management, Cartagena de Indias, Colombia, June 4-6, 2014 (p. 6). CEUR. http://hdl.handle.net/20.500.12708/55791
    Project: HINT (2012–2017)
  • On the Hardness of Counting the Solutions of SPARQL Queries / Pichler, R., & Skritek, S. (2014). On the Hardness of Counting the Solutions of SPARQL Queries. In G. Gottlob & J. Perez (Eds.), Proceedings of the 8th Alberto Mendelzon Workshop on Foundations of Data Management (p. 6). CEUR-WS. http://hdl.handle.net/20.500.12708/55783
    Project: SEE (2012–2016)
  • Analyzing the Computational Complexity of Abstract Dialectical Frameworks via Approximation Fixpoint Theory / Strass, H., & Wallner, J. P. (2014). Analyzing the Computational Complexity of Abstract Dialectical Frameworks via Approximation Fixpoint Theory. In C. Baral, G. De Giacomo, & T. Eiter (Eds.), Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference (pp. 101–110). AAAI Press. http://hdl.handle.net/20.500.12708/55119
  • Benchmarking Database Systems for Graph Pattern Matching / Pobiedina, N., Rümmele, S., Skritek, S., & Werthner, H. (2014). Benchmarking Database Systems for Graph Pattern Matching. In Lecture Notes in Computer Science (pp. 226–241). Springer Verlag. https://doi.org/10.1007/978-3-319-10073-9_18
    Project: SEE (2012–2016)
  • A SAT-Based Debugging Tool for State Machines and Sequence Diagrams / Kaufmann, P., Kronegger, M., Pfandler, A., Seidl, M., & Widl, M. (2014). A SAT-Based Debugging Tool for State Machines and Sequence Diagrams. In Proceedings of the 7th International Conference on Software Language Engineering (SLE) (pp. 21–40). http://hdl.handle.net/20.500.12708/55748
    Projects: Boolean (2011–2019) / FAIR (2013–2018) / FAME (2011–2014)
  • Belief merging within fragments of propositional logic / Creignou, N., Papini, O., Rümmele, S., & Woltran, S. (2014). Belief merging within fragments of propositional logic. In Proceedings of the 15th International Workshop on Non-Monotonic Reasoning (p. 10). http://hdl.handle.net/20.500.12708/55732
  • Belief merging within fragments of propositional logic / Creignou, N., Papini, O., Rümmele, S., & Woltran, S. (2014). Belief merging within fragments of propositional logic. In Proceedings of the 21st European Conference on Artificial Intelligence (pp. 231–236). http://hdl.handle.net/20.500.12708/55731
  • GRAPPA: A Semantical Framework for Graph-Based Argument Processing / Brewka, G., & Woltran, S. (2014). GRAPPA: A Semantical Framework for Graph-Based Argument Processing. In Proceedings of 21st European Conference on Artificial Intelligence (pp. 153–158). http://hdl.handle.net/20.500.12708/55701
  • Certain Answers to Well-Designed SPARQL Queries / Pichler, R. (2014). Certain Answers to Well-Designed SPARQL Queries. In Dagstuhl Reports 4(8) (pp. 15–16). http://hdl.handle.net/20.500.12708/55369
    Project: SEE (2012–2016)
  • An Introduction to Abstract Argumentation / Woltran, S. (2014). An Introduction to Abstract Argumentation. In A. Chapman, B. Ludaescher, & A. Schreiber (Eds.), Proceedings 6th USENIX Workshop on the Theory and Practice of Provenance. http://hdl.handle.net/20.500.12708/55233
  • D-FLAT: Progress Report / Abseher, M., Bliem, B., Charwat, G., Dusberger, F., Hecher, M., & Woltran, S. (2014). D-FLAT: Progress Report (DBAI-TR-2014-86). http://hdl.handle.net/20.500.12708/38156
    Project: D-Flat (2013–2017)
  • Informal Proceedings of the 27th International Workshop on Description Logics / Informal Proceedings of the 27th International Workshop on Description Logics. (2014). In M. Bienvenu, M. M. Ortiz de la Fuente, R. Rosati, & M. Simkus (Eds.), CEUR Workshop Proceedings. CEUR-Proceedings. http://hdl.handle.net/20.500.12708/23938

2013

  • Reaching Back to Move Forward: Using Old Ideas to Achieve a New Level of Query Optimization / Gottlob, G., Lanzinger, M. P., Longo, D. M., Okulmus, C., Pichler, R., & Selzer, A. (2013). Reaching Back to Move Forward: Using Old Ideas to Achieve a New Level of Query Optimization. In B. Kimelfeld, M. V. Martinez, & R. Angles (Eds.), Proceedings of the 15th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW 2023). CEUR-WS.org. https://doi.org/10.34726/5396
    Download: PDF (932 KB)
    Projects: DeConquer (2023–2027) / KnowledgeGraph (2020–2028) / SustainGraph (2023–2025)
  • ARVis: Visualizing Relations between Answer Sets / Ambroz, T., Charwat, G., Jusits, A., Wallner, J. P., & Woltran, S. (2013). ARVis: Visualizing Relations between Answer Sets. In P. Cabalar & T. C. Son (Eds.), Logic Programming and Nonmonotonic Reasoning (pp. 73–78). Springer. https://doi.org/10.1007/978-3-642-40564-8_8
  • Scheduling of electric vehicle charging operations / Bucar, D., Bessler, S., Musliu, N., & Grønbæk, J. (2013). Scheduling of electric vehicle charging operations. In Proceedings of MISTA 2013- Multidisciplinary International Scheduling Conference: Theory and Applications (pp. 1–13). http://hdl.handle.net/20.500.12708/55080
    Project: ARTE (2012–2017)
  • Solving Constraints for Generational Search / Pötzl, D., & Holzer, A. (2013). Solving Constraints for Generational Search. In 12 (pp. 197–213). Springer / LNCS. https://doi.org/10.1007/978-3-642-38916-0_12
  • UMAP: A Universal Layer for Schema Mapping Languages / Chertes, F., & Feinerer, I. (2013). UMAP: A Universal Layer for Schema Mapping Languages. In H. Decker, L. Lhotská, S. Link, J. Basl, & A. M. Tjoa (Eds.), Lecture Notes in Computer Science (pp. 349–363). Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-40173-2_28
  • Automated Shift Design and Break Scheduling / Di Gaspero, L., Gärtner, J., Musliu, N., Schaerf, A., Schafhauser, W., & Slany, W. (2013). Automated Shift Design and Break Scheduling. In Automated Scheduling and Planning, Studies in Computational Intelligence Volume 505 (pp. 109–127). Springer. http://hdl.handle.net/20.500.12708/28216
    Project: ARTE (2012–2017)
  • Computational Aspects of Nearly Single-Peaked Electorates / Erdélyi, G., Lackner, M., & Pfandler, A. (2013). Computational Aspects of Nearly Single-Peaked Electorates. In Twenty-Seventh AAAI Conference on Artificial Intelligence (AAAI-13) (pp. 283–289). AAAI Press. http://hdl.handle.net/20.500.12708/54792
    Project: FAIR (2013–2018)
  • A Parameterized Complexity Analysis of Generalized CP-Nets / Kronegger, M., Lackner, M., Pfandler, A., & Pichler, R. (2013). A Parameterized Complexity Analysis of Generalized CP-Nets. In 7th Multidisciplinary Workshop on Advances in Preference Handling (p. 7). http://hdl.handle.net/20.500.12708/54788
    Project: FAIR (2013–2018)
  • The Fourth Answer Set Programming Competition: Preliminary Report / Alviano, M., Calimeri, F., Charwat, G., Dao-Tran, M., Dodaro, C., Ianni, G., Krennwallner, T., Kronegger, M., Oetsch, J., Pfandler, A., Puehrer, J., Redl, C., Ricca, F., Schneider, P., Schwengerer, M., Spendier, L., Wallner, J. P., & Xiao, G. (2013). The Fourth Answer Set Programming Competition: Preliminary Report. In P. Cabalar & T. C. Son (Eds.), 12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2013) (pp. 42–53). Springer. http://hdl.handle.net/20.500.12708/54640
    Projects: ASP (2012–2015) / HEX-Programme (2008–2012)
  • VCWC: A Versioning Competition Workflow Compiler / Charwat, G., Ianni, G., Krennwallner, T., Kronegger, M., Pfandler, A., Redl, C., Schwengerer, M., Spendier, L., Wallner, J. P., & Xiao, G. (2013). VCWC: A Versioning Competition Workflow Compiler. In T. C. Son & P. Cabalar (Eds.), 12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2013) (pp. 233–238). Springer. http://hdl.handle.net/20.500.12708/54641
    Projects: ASP (2012–2015) / HEX-Programme (2008–2012)
  • Reasoning about Explanations for Negative Query Answers in DL-Lite / Calvanese, D., Ortiz, M., Simkus, M., & Stefanoni, G. (2013). Reasoning about Explanations for Negative Query Answers in DL-Lite. Journal of Artificial Intelligence Research, 48, 635–669. https://doi.org/10.1613/jair.3870
    Projects: Hybride Wissensbasen (2008–2012) / Net2 (2010–2013) / SemDat (2012–2016)
  • Loop Elimination for Database Updates / Savenkov, V., Pichler, R., & Koch, C. (2013). Loop Elimination for Database Updates. In G. Gottlob, G. Grasso, D. Olteanu, & C. Schallhart (Eds.), Big Data (pp. 48–61). Springer. https://doi.org/10.1007/978-3-642-39467-6_8
    Project: HINT (2012–2017)
  • Automated Test Case Generation in End-User Programming / Musliu, N., Slany, W., & Gärtner, J. (2013). Automated Test Case Generation in End-User Programming. In End-User Development (pp. 272–277). Springer. http://hdl.handle.net/20.500.12708/55075
  • Characteristics of Multiple Viewpoints in Abstract Argumentation / Dunne, P. E., Dvorak, W., Linsbichler, T., & Woltran, S. (2013). Characteristics of Multiple Viewpoints in Abstract Argumentation. 4th Workshop on Dynamics of Knowledge and Belief (DKB-2013), Koblenz, Germany, EU. http://hdl.handle.net/20.500.12708/85646
  • Strong Equivalence of Qualitative Optimization Problems / Faber, W., Truszczyński, M., & Woltran, S. (2013). Strong Equivalence of Qualitative Optimization Problems. Journal of Artificial Intelligence Research, 47, 351–391. https://doi.org/10.1613/jair.3991
  • Abstract Preference Frameworks - a Unifying Perspective on Separability and Strong Equivalence / Faber, W., Truszczynski, M., & Woltran, S. (2013). Abstract Preference Frameworks - a Unifying Perspective on Separability and Strong Equivalence. In Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence (pp. 297–303). AAAI Press. http://hdl.handle.net/20.500.12708/54899
  • The textcat package for n-gram based text categorization in R / Hornik, K., Mair, P., Rauch, J., Geiger, W., Buchta, C., & Feinerer, I. (2013). The textcat package for n-gram based text categorization in R. Journal of Statistical Software, 52(6), 1–17. http://hdl.handle.net/20.500.12708/155579
  • Global State Checker: Towards SAT-Based Reachability Analysis of Communicating State Machines / Kaufmann, P., Kronegger, M., Pfandler, A., Seidl, M., & Widl, M. (2013). Global State Checker: Towards SAT-Based Reachability Analysis of Communicating State Machines. In Proceedings of the 10th International Workshop on Model Driven Engineering, Verification and Validation co-located with 16th International Conference on Model Driven Engineering Languages and Systems (MODELS 2013) (pp. 31–40). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/54717
    Projects: Boolean (2011–2019) / FAIR (2013–2018) / FAME (2011–2014)
  • Making Use of Advances in Answer-Set Programming for Abstract Argumentation Systems / Dvořák, W., Gaggl, S. A., Wallner, J. P., & Woltran, S. (2013). Making Use of Advances in Answer-Set Programming for Abstract Argumentation Systems. In H. Tompits, S. Abreu, J. Oetsch, J. Puehrer, D. Seipel, M. Umeda, & A. Wolf (Eds.), Lecture Notes in Computer Science (pp. 114–133). Springer. https://doi.org/10.1007/978-3-642-41524-1_7
  • SPARQL Update under RDFS Entailment in Fully Materialized and Redundancy-Free Triple Stores / Ahmeti, A., & Polleres, A. (2013). SPARQL Update under RDFS Entailment in Fully Materialized and Redundancy-Free Triple Stores. In I. Celino, E. D. Valle, M. Krötzsch, & S. Schlobach (Eds.), Proceedings of the 2nd International Workshop on Ordering and Reasoning, OrdRing 2013 (p. 12). CEUR-WS. http://hdl.handle.net/20.500.12708/55897
    Project: SEE (2012–2016)
  • Complexity of redundancy detection on RDF graphs in the presence of rules, constraints, and queries / Pichler, R., Polleres, A., Skritek, S., & Woltran, S. (2013). Complexity of redundancy detection on RDF graphs in the presence of rules, constraints, and queries. Semantic Web: Interoperability, Usability, Applicability, 4(4), 351–393. http://hdl.handle.net/20.500.12708/155572
    Projects: SODI (2009–2013) / TTPC (2008–2012)
  • RDFS with attribute equations via SPARQL rewriting / Bischof, S., & Polleres, A. (2013). RDFS with attribute equations via SPARQL rewriting. In P. Cimiano, O. Corcho, V. Presutti, L. Hollink, & S. Rudolph (Eds.), The Semantic Web: Semantics and Big Data (pp. 335–350). Springer LNCS. https://doi.org/10.1007/978-3-642-38288-8_23
    Project: SEE (2012–2016)
  • City Data Pipeline - A System for Making Open Data Useful for Cities / Bischof, S., Polleres, A., & Sperl, S. (2013). City Data Pipeline - A System for Making Open Data Useful for Cities. In Proceedings of the I-SEMANTICS 2013 Posters & Demonstrations Track (p. 45). CEUR. http://hdl.handle.net/20.500.12708/55338
    Project: SEE (2012–2016)
  • On the relation between SPARQL1.1 and Answer Set Programming / Polleres, A., & Wallner, J. P. (2013). On the relation between SPARQL1.1 and Answer Set Programming. Journal of Applied Non-Classical Logics, 23(1–2), 159–212. https://doi.org/10.1080/11663081.2013.798992
    Project: SEE (2012–2016)
  • Peer Data Management / Roth, A., & Skritek, S. (2013). Peer Data Management. In P. G. Kolaitis, M. Lenzerini, & N. Schweikardt (Eds.), Data Exchange, Integration, and Streams (pp. 185–215). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany. https://doi.org/10.4230/DFU.Vol5.10452.185
    Projects: SEE (2012–2016) / SODI (2009–2013) / TTPC (2008–2012)
  • Algorithms for Core Computation in Data Exchange / Savenkov, V. (2013). Algorithms for Core Computation in Data Exchange. In P. G. Kolaitis, M. Lenzerini, & N. Schweikardt (Eds.), Data Exchange, Integration, and Streams (pp. 38–68). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany. https://doi.org/10.4230/DFU.Vol5.10452.38
    Project: HINT (2012–2017)
  • Reasoning about Schema Mappings / Sallinger, E. (2013). Reasoning about Schema Mappings. In P. G. Kolaitis, M. Lenzerini, & N. Schweikardt (Eds.), Data Exchange, Integration, and Streams (pp. 97–127). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany. https://doi.org/10.4230/DFU.Vol5.10452.97
    Project: HINT (2012–2017)
  • The cf2 argumentation semantics revisited. / Gaggl, S. A., & Woltran, S. (2013). The cf2 argumentation semantics revisited. Journal of Logic and Computation, 23(5), 925–949. https://doi.org/10.1093/logcom/exs011
  • Relaxed Notions of Schema Mapping Equivalence Revisited / Pichler, R., Sallinger, E., & Savenkov, V. (2013). Relaxed Notions of Schema Mapping Equivalence Revisited. Theory of Computing Systems, 52(3), 483–541. https://doi.org/10.1007/s00224-012-9397-0
    Project: SODI (2009–2013)
  • Parametric Properties of Ideal Semantics / Dunne, P. E., Dvořák, W., & Woltran, S. (2013). Parametric Properties of Ideal Semantics. Artificial Intelligence, 202, 1–28. https://doi.org/10.1016/j.artint.2013.06.004
  • Efficient large-scale configuration via integer linear programming / Feinerer, I. (2013). Efficient large-scale configuration via integer linear programming. Artificial Intelligence for Engineering Design, Analysis and Manufacturing, 27(1), 37–49. https://doi.org/10.1017/s0890060412000376
  • Beyond the schools of psychology 1: A digital analysis of Psychological Review, 1894-1903 / Green, C., Feinerer, I., & Burman, J. (2013). Beyond the schools of psychology 1: A digital analysis of Psychological Review, 1894-1903. Journal of the History of the Behavioral Sciences, 49(2), 167–189. http://hdl.handle.net/20.500.12708/155581
  • A Model-Theoretic Approach to Belief Change in Answer Set Programming / Delgrande, J., Schaub, T., Tompits, H., & Woltran, S. (2013). A Model-Theoretic Approach to Belief Change in Answer Set Programming. ACM Transactions on Computational Logic, 14(2), 1–46. https://doi.org/10.1145/2480759.2480766
    Project: Methods (2009–2013)
  • Model-Based Recasting in Answer-Set Programming / Eiter, T., Fink, M., Pührer, J., Tompits, H., & Woltran, S. (2013). Model-Based Recasting in Answer-Set Programming. Journal of Applied Non-Classical Logics, 23(1–2), 75–104. https://doi.org/10.1080/11663081.2013.799318
  • Static Analysis and Optimization of Semantic Web Queries / Letelier, A., Pérez, J., Pichler, R., & Skritek, S. (2013). Static Analysis and Optimization of Semantic Web Queries. ACM Transactions on Database Systems, 38(4), 1–45. https://doi.org/10.1145/2500130
    Projects: SEE (2012–2016) / SODI (2009–2013) / TTPC (2008–2012)
  • Tractable counting of the answers to conjunctive queries / Pichler, R., & Skritek, S. (2013). Tractable counting of the answers to conjunctive queries. Journal of Computer and System Sciences, 79(6), 984–1001. https://doi.org/10.1016/j.jcss.2013.01.012
    Projects: SODI (2009–2013) / TTPC (2008–2012)
  • Default Negation for Datalog+/- / Pieris, A. (2013). Default Negation for Datalog+/-. Workshop on Grounding and Transformations for Theories With Variables (GTTV), Corunna, Spain, EU. http://hdl.handle.net/20.500.12708/86239
  • Coping with High Complexity: Structure Matters / Pichler, R. (2013). Coping with High Complexity: Structure Matters. The 32nd INTERNATIONAL CONFERENCE OF THE CHILEAN COMPUTER SOCIETY (SCCC), Temuco, Non-EU. http://hdl.handle.net/20.500.12708/85923
  • On the Limits of Expressiveness in Abstract Argumentation Semantics / Woltran, S. (2013). On the Limits of Expressiveness in Abstract Argumentation Semantics. Belief Change and Argumentation in Multi-Agent Scenarios, Dagstuhl, Germany, EU. http://hdl.handle.net/20.500.12708/85678
  • Applicability of ASP-based Problem Solving on Tree Decompositions / Bliem, B., Pichler, R., & Woltran, S. (2013). Applicability of ASP-based Problem Solving on Tree Decompositions. Third International Workshop on Graph Structures for Knowledge Representation and Reasoning (GKR) 2013, Peking, Non-EU. http://hdl.handle.net/20.500.12708/85667
    Projects: D-Flat (2013–2017) / FAIR (2013–2018)
  • Enhancing the Updatability of Projective Views / Guagliardo, P., Pichler, R., & Sallinger, E. (2013). Enhancing the Updatability of Projective Views. In Proceedings of the 7th Alberto Mendelzon International Workshop on Foundations of Data Management (p. 7). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/54848
    Project: HINT (2012–2017)
  • Advanced SAT Techniques for Abstract Argumentation / Wallner, J. P., Weissenbacher, G., & Woltran, S. (2013). Advanced SAT Techniques for Abstract Argumentation. In Lecture Notes in Computer Science (pp. 138–154). Springer / LNCS. https://doi.org/10.1007/978-3-642-40624-9_9
  • Efficient Updates of Uncertain Databases / Hubmer, A., Pichler, R., Savenkov, V., & Skritek, S. (2013). Efficient Updates of Uncertain Databases. In L. Bravo & M. Lenzerini (Eds.), Proceedings of the 7th Alberto Mendelzon International Workshop on Foundations of Data Management Puebla/Cholula, Mexico, May 21-23, 2013 (p. 7). CEUR-WS. http://hdl.handle.net/20.500.12708/54797
    Project: HINT (2012–2017)
  • Conformant Planning as a Benchmark for QBF-Solvers / Kronegger, M., Pfandler, A., & Pichler, R. (2013). Conformant Planning as a Benchmark for QBF-Solvers. In International Workshop on Quantified Boolean Formulas (QBF 2013) (p. 5). http://hdl.handle.net/20.500.12708/54793
    Project: FAIR (2013–2018)
  • Admissibility in the Abstract Dialectical Framework / Polberg, S., Wallner, J. P., & Woltran, S. (2013). Admissibility in the Abstract Dialectical Framework. In J. Leite, T. C. Son, P. Torroni, L. van der Torre, & S. Woltran (Eds.), Lecture Notes in Computer Science (pp. 102–118). Springer. https://doi.org/10.1007/978-3-642-40624-9_7
  • Backdoors to Abduction / Pfandler, A., Rümmele, S., & Szeider, S. (2013). Backdoors to Abduction. In F. Rossi (Ed.), Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence (pp. 1046–1052). AAAI Press. http://hdl.handle.net/20.500.12708/54790
    Projects: Complex Reason (2010–2014) / FAIR (2013–2018)
  • Parameterized Complexity of Optimal Planning: A Detailed Map / Kronegger, M., Pfandler, A., & Pichler, R. (2013). Parameterized Complexity of Optimal Planning: A Detailed Map. In F. Rossi (Ed.), Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence (pp. 954–961). AAAI Press. http://hdl.handle.net/20.500.12708/54787
    Project: FAIR (2013–2018)
  • Structural Properties for Deductive Argument Systems / Hunter, A., & Woltran, S. (2013). Structural Properties for Deductive Argument Systems. In L. van der Gaag (Ed.), Symbolic and Quantitative Approaches to Reasoning with Uncertainty (pp. 278–289). Springer. http://hdl.handle.net/20.500.12708/54786
  • Abstract Dialectical Frameworks Revisited / Brewka, G., Ellmauthaler, S., Strass, H., Wallner, J. P., & Woltran, S. (2013). Abstract Dialectical Frameworks Revisited. In F. Rossi (Ed.), Proceedings of the twenty-third International Joint Conference on Artificial Intelligence (IJCAI 2013) (pp. 803–809). AAAI Press. http://hdl.handle.net/20.500.12708/54784
    Project: FAIR (2013–2018)
  • Class Diagrams with Equated Association Chains / Feinerer, I., Salzer, G., & Sisel, T. (2013). Class Diagrams with Equated Association Chains. In 2013 International Symposium on Theoretical Aspects of Software Engineering. 7th International Symposium on Theoretical Aspects of Software Engineering, Birmingham, EU. https://doi.org/10.1109/tase.2013.35
  • Lossless Horizontal Decomposition with Domain Constraints on Interpreted Attributes / Feinerer, I., Guagliardo, P., & Franconi, E. (2013). Lossless Horizontal Decomposition with Domain Constraints on Interpreted Attributes. In G. Gottlob, G. Grasso, D. Olteanu, & C. Schallhart (Eds.), Big Data (pp. 77–91). Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-39467-6_10
  • Tractability Guarantees for DL-Lite Query Answering / Bienvenu, M., Ortiz de la Fuente, M. M., Simkus, M., & Xiao, G. (2013). Tractability Guarantees for DL-Lite Query Answering. In T. Eiter, B. Glimm, Y. Kazakov, & M. Krötzsch (Eds.), Informal Proceedings of the 26th International Workshop on Description Logics (pp. 41–52). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/55142
    Projects: FAIR (2013–2018) / Hybride Wissensbasen (2008–2012) / Net2 (2010–2013) / SEE (2012–2016) / SemDat (2012–2016)
  • Evolving Graph Databases under Description Logic Constraints / Calvanese, D., Ortiz de la Fuente, M. M., & Simkus, M. (2013). Evolving Graph Databases under Description Logic Constraints. In T. Eiter, B. Glimm, Y. Kazakov, & M. Krötzsch (Eds.), Informal Proceedings of the 26th International Workshop on Description Logics (pp. 120–131). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/55141
    Projects: Hybride Wissensbasen (2008–2012) / Net2 (2010–2013) / SemDat (2012–2016)
  • Algorithm Selection for the Graph Coloring Problem / Musliu, N., & Schwengerer, M. (2013). Algorithm Selection for the Graph Coloring Problem. In Learning and Intelligent Optimization, 7th International Conference, LION 7 (pp. 389–403). Srringer. http://hdl.handle.net/20.500.12708/55073
    Project: ARTE (2012–2017)
  • Applying Machine Learning for Solver Selection in Scheduling / Musliu, N. (2013). Applying Machine Learning for Solver Selection in Scheduling. In Proceedings of the 10th Metaheuristic International Conference (MIC 2013) (pp. 240–242). http://hdl.handle.net/20.500.12708/55072
    Project: ARTE (2012–2017)
  • Conjunctive Regular Path Queries in Lightweight Description Logics / Bienvenu, M., Ortiz de la Fuente, M. M., & Simkus, M. (2013). Conjunctive Regular Path Queries in Lightweight Description Logics. In F. Rossi (Ed.), IJCAI 2013, Proceedings of the 23rd International Joint Conference on Artificial Intelligence (pp. 761–767). AAAI Press. http://hdl.handle.net/20.500.12708/55043
    Projects: FAIR (2013–2018) / Hybride Wissensbasen (2008–2012) / Net2 (2010–2013) / SEE (2012–2016) / SemDat (2012–2016)
  • Tractable Queries for Lightweight Description Logics / Bienvenu, M., Ortiz de la Fuente, M. M., Simkus, M., & Xiao, G. (2013). Tractable Queries for Lightweight Description Logics. In F. Rossi (Ed.), IJCAI 2013, Proceedings of the 23rd International Joint Conference on Artificial Intelligence (pp. 768–774). AAAI Press. http://hdl.handle.net/20.500.12708/55042
    Projects: FAIR (2013–2018) / Hybride Wissensbasen (2008–2012) / Net2 (2010–2013) / SEE (2012–2016) / SemDat (2012–2016)
  • Web object identification for web automation and meta-search / Kordomatis, I., Herzog, C., Fayzrakhmanov, R. R., Krüpl-Sypien, B., Holzinger, W., & Baumgartner, R. (2013). Web object identification for web automation and meta-search. In C. David, D. R. Moreno, & R. Akerkar (Eds.), Proceedings of the 3rd International Conference on Web Intelligence, Mining and Semantics - WIMS ’13. ACM. https://doi.org/10.1145/2479787.2479798
    Project: TAMCROW (2011–2013)
  • Analyzing the Features of Employee Scheduling Problems (abstract) / Musliu, N. (2013). Analyzing the Features of Employee Scheduling Problems (abstract). In XXVI EURO - INFORMS Joint International Conference, Abstracts (p. 1). http://hdl.handle.net/20.500.12708/55081
  • Declarative Dynamic Programming as an Alternative Realization of Courcelle’s Theorem / Bliem, B., Pichler, R., & Woltran, S. (2013). Declarative Dynamic Programming as an Alternative Realization of Courcelle’s Theorem. In G. Gutin & S. Szeider (Eds.), Parameterized and Exact Computation (pp. 28–40). Springer. https://doi.org/10.1007/978-3-319-03898-8_4
    Project: D-Flat (2013–2017)
  • Feature-based object identification for web automation / Herzog, C., Kordomatis, I., Holzinger, W., Fayzrakhmanov, R. R., & Krüpl-Sypien, B. (2013). Feature-based object identification for web automation. In D. Shin (Ed.), Proceedings of the 28th Annual ACM Symposium on Applied Computing - SAC ’13. ACM. https://doi.org/10.1145/2480362.2480504
    Project: TAMCROW (2011–2013)
  • Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? / Creignou, N., Pichler, R., & Woltran, S. (2013). Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? In F. Rossi (Ed.), Proceedings of the 23rd International Joint Conference on Artificial Intelligence (pp. 954–961). AAAI Press. http://hdl.handle.net/20.500.12708/54860
    Project: FAIR (2013–2018)
  • AGM-Style Belief Revision of Logic Programs under Answer Set Semantics / Delgrande, J., Peppas, P., & Woltran, S. (2013). AGM-Style Belief Revision of Logic Programs under Answer Set Semantics. In P. Cabalar & T. C. Son (Eds.), Logic Programming and Nonmonotonic Reasoning (pp. 264–276). Springer. https://doi.org/10.1007/978-3-642-40564-8_27
  • Model-Based Recasting in Answer-Set Programming / Eiter, T., Fink, M., Puehrer, J., Tompits, H., & Woltran, S. (2013). Model-Based Recasting in Answer-Set Programming (DBAI-TR-2013-83). http://hdl.handle.net/20.500.12708/37698
  • Computational Logic in Multi-Agent Systems / Computational Logic in Multi-Agent Systems. (2013). In J. Leite, T. C. Son, P. Torroni, L. van der Torre, & S. Woltran (Eds.), Lecture Notes in Computer Science. Springer. https://doi.org/10.1007/978-3-642-40624-9

2012

  • A New Hyperheuristic Algorithm for Cross-Domain Search Problems / Lehrbaum, A., & Musliu, N. (2012). A New Hyperheuristic Algorithm for Cross-Domain Search Problems. In Y. Hamadi & M. Schoenauer (Eds.), Lecture Notes in Computer Science (pp. 437–442). Springer. https://doi.org/10.1007/978-3-642-34413-8_41
  • Datalog and Its Extensions for Semantic Web Databases / Gottlob, G., Orsi, G., Pieris, A., & Šimkus, M. (2012). Datalog and Its Extensions for Semantic Web Databases. In T. Eiter & T. Krennwallner (Eds.), Lecture Notes in Computer Science (pp. 54–77). Springer LNCS. https://doi.org/10.1007/978-3-642-33158-9_2
  • Parameterized Splitting: A Simple Modification-Based Approach / Baumann, R., Brewka, G., Dvorak, W., & Woltran, S. (2012). Parameterized Splitting: A Simple Modification-Based Approach. In E. Erdem, J. Lee, Y. Lierler, & D. Pearce (Eds.), Lecture Notes in Computer Science. Springer LNCS. https://doi.org/10.1007/978-3-642-30743-0
    Project: Argu (2009–2012)
  • The Added Value of Argumentation / Modgil, S., Toni, F., Bex, F., Bratko, I., Chesñevar, C. I., Dvořák, W., Falappa, M. A., Fan, X., Gaggl, S. A., García, A. J., González, M. P., Gordon, T. F., Leite, J., Možina, M., Reed, C., Simari, G. R., Szeider, S., Torroni, P., & Woltran, S. (2012). The Added Value of Argumentation. In S. Ossowski (Ed.), Agreement Technologies (pp. 357–403). Springer Netherlands. https://doi.org/10.1007/978-94-007-5583-3_21
  • Utilizing ASP for Generating and Visualizing Argumentation Frameworks / Charwat, G., Wallner, J. P., & Woltran, S. (2012). Utilizing ASP for Generating and Visualizing Argumentation Frameworks. In M. Fink & Y. Lierler (Eds.), 5th Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2012) (p. 15). CoRR. http://hdl.handle.net/20.500.12708/54185
  • The Complexity of Explaining Negative Query Answers in DL-Lite / Calvanese, D., Ortiz de la Fuente, M. M., Simkus, M., & Stefanoni, G. (2012). The Complexity of Explaining Negative Query Answers in DL-Lite. In G. Brewka, T. Eiter, & S. McIlraith (Eds.), Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference, KR 2012 (pp. 583–587). AAAI Press. http://hdl.handle.net/20.500.12708/54355
    Projects: Hybride Wissensbasen (2008–2012) / Net2 (2010–2013) / SemDat (2012–2016)
  • Strong Equivalence of Qualitative Optimization Problems / Faber, W., Truszczynski, M., & Woltran, S. (2012). Strong Equivalence of Qualitative Optimization Problems. In G. Brewka, T. Eiter, & S. McIlraith (Eds.), Proceedings of 13#^{th} int. conf. on Principles of Knowledge Representation and Reasoning (pp. 188–198). AAAI Press. http://hdl.handle.net/20.500.12708/54159
  • A tm Plug-In for Distributed Text Mining in R / Theußl, S., Feinerer, I., & Hornik, K. (2012). A tm Plug-In for Distributed Text Mining in R. Journal of Statistical Software, 51(5), 1–31. http://hdl.handle.net/20.500.12708/164399
  • Spherical k-Means Clustering / Hornik, K., Feinerer, I., Kober, M., & Buchta, C. (2012). Spherical k-Means Clustering. Journal of Statistical Software, 50(10), 1–22. http://hdl.handle.net/20.500.12708/164398
  • Conjunctive query answering in the description logic SH using knots / Eiter, T., Ortiz, M., & Šimkus, M. (2012). Conjunctive query answering in the description logic SH using knots. Journal of Computer and System Sciences, 78(1), 47–85. https://doi.org/10.1016/j.jcss.2011.02.012
    Projects: Hybride Wissensbasen (2008–2012) / Net2 (2010–2013) / SemDat (2012–2016)
  • Incorporating Data Concerns into Query Languages for Data Services / Ali, M. I., Pichler, R., Truong, H.-L., & Dustdar, S. (2012). Incorporating Data Concerns into Query Languages for Data Services. In R. Zhang, J. Zhang, Z. Zhang, J. Filipe, & J. Cordeiro (Eds.), Enterprise Information Systems (pp. 132–145). Springer. https://doi.org/10.1007/978-3-642-29958-2_9
    Project: SODI (2009–2013)
  • Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough / Pichler, R., Rümmele, S., Szeider, S., & Woltran, S. (2012). Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough. CoRR - Computing Research Repository. http://hdl.handle.net/20.500.12708/163667
    Project: TTPC (2008–2012)
  • An Effective Greedy Heuristic for the Social Golfer Problem / Triska, M., & Musliu, N. (2012). An Effective Greedy Heuristic for the Social Golfer Problem. Annals of Operations Research, 194(1), 413–425. https://doi.org/10.1007/s10479-011-0866-7
  • A blocks-based geometric model of web pages for automatic processing and information extraction / Fayzrakhmanov, R. (2012). A blocks-based geometric model of web pages for automatic processing and information extraction. Science and Business:Development Ways, 15(9), 56–64. http://hdl.handle.net/20.500.12708/164703
  • D-FLAT: Declarative Problem Solving Using Tree Decompositions and Answer-Set Programming / BLIEM, B., MORAK, M., & WOLTRAN, S. (2012). D-FLAT: Declarative Problem Solving Using Tree Decompositions and Answer-Set Programming. Theory and Practice of Logic Programming, 12(4–5), 445–464. https://doi.org/10.1017/s1471068412000129
    Project: D-Flat (2013–2017)
  • Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough / PICHLER, R., RÜMMELE, S., SZEIDER, S., & WOLTRAN, S. (2012). Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough. Theory and Practice of Logic Programming, 14(2), 141–164. https://doi.org/10.1017/s1471068412000099
    Project: Complex Reason (2010–2014)
  • Augmenting Tractable Fragments of Abstract Argumentation / Dvořák, W., Ordyniak, S., & Szeider, S. (2012). Augmenting Tractable Fragments of Abstract Argumentation. Artificial Intelligence, 186, 157–173. https://doi.org/10.1016/j.artint.2012.03.002
    Projects: Argu (2009–2012) / Complex Reason (2010–2014)
  • Towards fixed-parameter tractable algorithms for abstract argumentation / Dvořák, W., Pichler, R., & Woltran, S. (2012). Towards fixed-parameter tractable algorithms for abstract argumentation. Artificial Intelligence, 186, 1–37. https://doi.org/10.1016/j.artint.2012.03.005
    Projects: Argu (2009–2012) / SODI (2009–2013) / TTPC (2008–2012)
  • Quality-aware Service-Oriented Data Integration: Requirements, State of the Art and Open Challenges / Dustdar, S., Pichler, R., Savenkov, V., & Truong, H.-L. (2012). Quality-aware Service-Oriented Data Integration: Requirements, State of the Art and Open Challenges. ACM SIGMOD Record, 41(1), 11–19. http://hdl.handle.net/20.500.12708/163519
    Project: SODI (2009–2013)
  • An improved SAT formulation for the social golfer problem / Triska, M., & Musliu, N. (2012). An improved SAT formulation for the social golfer problem. Annals of Operations Research, 194(1), 427–438. https://doi.org/10.1007/s10479-010-0702-5
  • Knowledge Base Change and Abstract Dialectical Frameworks / Wallner, J. P. (2012). Knowledge Base Change and Abstract Dialectical Frameworks. Workshop on the Dynamics of Argumentation, Rules and Conditionals DARC, University Luxembourg, Luxembourg, EU. http://hdl.handle.net/20.500.12708/85502
  • Computational Aspects of Abstract Dialectical Frameworks / Wallner, J. P. (2012). Computational Aspects of Abstract Dialectical Frameworks. Principles of Knowledge Representation and Reasoning Doctoral Consortium (KR-DC), Toronto, Canada, Non-EU. http://hdl.handle.net/20.500.12708/85370
    Project: Argu (2009–2012)
  • CEGARTIX: A SAT-Based Argumentation System / Dvorak, W., Järvisalo, M., Wallner, J. P., & Woltran, S. (2012). CEGARTIX: A SAT-Based Argumentation System. Theory and Application of Satisfiability Testing -- SAT, Guangzhou, Non-EU. http://hdl.handle.net/20.500.12708/85369
  • Fixed-Parameter Algorithms for Finding Minimal Models / Lackner, M., & Pfandler, A. (2012). Fixed-Parameter Algorithms for Finding Minimal Models. Logic and interactions 2012, CIRM, Marseille, France, EU. http://hdl.handle.net/20.500.12708/85367
  • A Comprehensive Analysis of the cf2 Argumentation Semantics: From Characterization to Implementation / Gaggl, S. (2012). A Comprehensive Analysis of the cf2 Argumentation Semantics: From Characterization to Implementation. Principles of Knowledge Representation and Reasoning Doctoral Consortium (KR-DC), Toronto, Canada, Non-EU. http://hdl.handle.net/20.500.12708/85499
  • Characteristics of Argumentation Semantics / Woltran, S. (2012). Characteristics of Argumentation Semantics. Logique à Marseille -- Camilla Schwind à l’honneur, Marseille, EU. http://hdl.handle.net/20.500.12708/85463
  • Fixed-Parameter Algorithms for Finding Minimal Models / Lackner, M., & Pfandler, A. (2012). Fixed-Parameter Algorithms for Finding Minimal Models. Universität Siegen, Siegen, Deutschland, EU. http://hdl.handle.net/20.500.12708/85373
  • dynPARTIX 2.0 - Dynamic Programming Argumentation Reasoning Tool / Charwat, G., & Dvorak, W. (2012). dynPARTIX 2.0 - Dynamic Programming Argumentation Reasoning Tool. In B. Verheij, S. Szeider, & S. Woltran (Eds.), Proceedings of Computational Models of Argument - Proceedings of COMMA 2012 (pp. 507–508). Frontiers in Artificial Intelligence and Applications / IOS Press. http://hdl.handle.net/20.500.12708/54497
    Project: Argu (2009–2012)
  • Comparing the Expressiveness of Argumentation Semantics / Dvorak, W., & Spanring, C. (2012). Comparing the Expressiveness of Argumentation Semantics. In B. Verheij, S. Szeider, & S. Woltran (Eds.), Proceedings of Computational Models of Argument - Proceedings of COMMA 2012 (pp. 261–272). Frontiers in Artificial Intelligence and Applications / IOS Press. http://hdl.handle.net/20.500.12708/54496
    Project: Argu (2009–2012)
  • SPAM: A SPARQL Analysis and Manipulation Tool / Letelier, A., Perez, J., Pichler, R., & Skritek, S. (2012). SPAM: A SPARQL Analysis and Manipulation Tool. In Z. M. Özsoyoglu (Ed.), Proceedings of the VLDB (pp. 1958–1961). http://hdl.handle.net/20.500.12708/54495
  • Foundational aspects of semantic web optimization / Skritek, S. (2012). Foundational aspects of semantic web optimization. In X. L. Dong & M. T. Özsu (Eds.), Proceedings of the on SIGMOD/PODS 2012 PhD Symposium - PhD ’12. ACM Press. https://doi.org/10.1145/2213598.2213611
  • WPPS: A novel and comprehensive framework for web page understanding and information extraction / Fayzrakhmanov, R. (2012). WPPS: A novel and comprehensive framework for web page understanding and information extraction. In B. White & P. Isaias (Eds.), Proceeding of the International Conference IADIS WWW/Internet (pp. 19–26). IADIS Press. http://hdl.handle.net/20.500.12708/54492
  • WPPS: A Framework for Web Page Processing / Fayzrakhmanov, R. R. (2012). WPPS: A Framework for Web Page Processing. In X. S. Wang, I. Cruz, A. Delis, & G. Huang (Eds.), Web Information Systems Engineering - WISE 2012 (pp. 800–803). https://doi.org/10.1007/978-3-642-35063-4_70
  • Preprocessing of Complex Non-Ground Rules in Answer Set Programming / Morak, M., & Woltran, S. (2012). Preprocessing of Complex Non-Ground Rules in Answer Set Programming. In A. Dovier & V. S. Costa (Eds.), Technical Communications of the 28th International Conference on Logic Programming (pp. 247–258). LIPIcs. http://hdl.handle.net/20.500.12708/54464
  • Towards hybrid techniques for efficient declarative configuration / Feinerer, I. (2012). Towards hybrid techniques for efficient declarative configuration. In Proceedings of the Workshop on Configuration at ECAI 2012 (pp. 27–30). http://hdl.handle.net/20.500.12708/54424
  • Answering Expressive Path Queries over Lightweight DL Knowledge Bases / Bienvenu, M., Ortiz de la Fuente, M. M., & Simkus, M. (2012). Answering Expressive Path Queries over Lightweight DL Knowledge Bases. In Y. Kazakov, D. Lembo, & F. Wolter (Eds.), Proc. of the 2012 International Workshop on Description Logics (DL 2012) (pp. 81–91). http://hdl.handle.net/20.500.12708/54354
    Projects: Hybride Wissensbasen (2008–2012) / Net2 (2010–2013) / SemDat (2012–2016)
  • Tourist trip planning: solo versus group traveling / Sylejmani, K., Dorn, J., & Musliu, N. (2012). Tourist trip planning: solo versus group traveling. In 30th Workshop of the UK Planning and Scheduling Special Interest Group. UK Planning and Scheduling Special Interest Group, Austria. SIGPLAN. http://hdl.handle.net/20.500.12708/54347
  • A Taboo Search approach for solving Multi Constrained Team Orienteering Problem for application in touristic trip planning / Sylejmani, K., Dorn, J., & Musliu, N. (2012). A Taboo Search approach for solving Multi Constrained Team Orienteering Problem for application in touristic trip planning. In 12th International Conference on HybridIntelligent Systems (pp. 300–305). IEEE Computer Society. http://hdl.handle.net/20.500.12708/54346
  • Valued-Based Argumentation for Tree-like Value Graphs / Kim, E. J., & Ordyniak, S. (2012). Valued-Based Argumentation for Tree-like Value Graphs. In B. Verheij, S. Szeider, & S. Woltran (Eds.), Fourth International Conference on Computational Models of Argument (Comma 2012) (pp. 378–389). IOS Press. http://hdl.handle.net/20.500.12708/54321
    Projects: Complex Reason (2010–2014) / Complexity (2011–2013)
  • Abstract Argumentation via Monadic Second Order Logic / Dvořák, W., Szeider, S., & Woltran, S. (2012). Abstract Argumentation via Monadic Second Order Logic. In E. Hüllermeier, S. Link, T. Fober, & B. Seeger (Eds.), Lecture Notes in Computer Science (pp. 85–98). Lecture Notes in Computer Science / Springer. https://doi.org/10.1007/978-3-642-33362-0_7
    Projects: Argu (2009–2012) / Complex Reason (2010–2014)
  • Towards Practical Query Answering for Horn SHIQ. / Eiter, T., Ortiz de la Fuente, M. M., Simkus, M., Tran, T.-K., & Xiao, G. (2012). Towards Practical Query Answering for Horn SHIQ. In Y. Kazakov, D. Lembo, & F. Wolter (Eds.), Proc. of the 2012 International Workshop on Description Logics (DL 2012) (pp. 158–168). CEUR workshop proceedings. http://hdl.handle.net/20.500.12708/54289
    Projects: Hybride Wissensbasen (2008–2012) / SemDat (2012–2016)
  • The Parameterized Complexity of Abduction / Fellows, M. R., Pfandler, A., Rosamond, F. A., & Rümmele, S. (2012). The Parameterized Complexity of Abduction. In J. Hoffmann & B. Selman (Eds.), Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence (pp. 743–749). AAAI Press. http://hdl.handle.net/20.500.12708/54202
    Project: TTPC (2008–2012)
  • Evaluating Abstract Dialectical Frameworks with ASP / Ellmauthaler, S., & Wallner, J. P. (2012). Evaluating Abstract Dialectical Frameworks with ASP. In B. Verheij, S. Szeider, & S. Woltran (Eds.), Proceedings of Computational Models of Argument - Proceedings of COMMA 2012 (pp. 505–506). IOS Press. http://hdl.handle.net/20.500.12708/54186
  • Fixed-Parameter Algorithms for Closed World Reasoning / Lackner, M., & Pfandler, A. (2012). Fixed-Parameter Algorithms for Closed World Reasoning. In L. D. Raedt, C. Bessiere, D. Dubois, P. Doherty, P. Frasconi, F. Heintz, & P. Lucas (Eds.), Proceedings of the ECAI Conference (pp. 492–497). IOS Press. http://hdl.handle.net/20.500.12708/54183
  • Multicut on Graphs of Bounded Clique-Width / Lackner, M., Pichler, R., Rümmele, S., & Woltran, S. (2012). Multicut on Graphs of Bounded Clique-Width. In G. Lin (Ed.), Combinatorial Optimization and Applications (pp. 115–126). Springer. https://doi.org/10.1007/978-3-642-31770-5_11
    Project: TTPC (2008–2012)
  • Fixed-Parameter Algorithms for Finding Minimal Models / Lackner, M., & Pfandler, A. (2012). Fixed-Parameter Algorithms for Finding Minimal Models. In G. Brewka, T. Eiter, & S. McIlraith (Eds.), Proceedings of 13#^{th} int. conf. on Principles of Knowledge Representation and Reasoning (p. 11). AAAI Press. http://hdl.handle.net/20.500.12708/54179
    Project: TTPC (2008–2012)
  • The Complexity of Nearly Single-Peaked Consistency / Erdély, G., Lackner, M., & Pfandler, A. (2012). The Complexity of Nearly Single-Peaked Consistency. In F. Brandt & P. Faliszewski (Eds.), Proceedings of fourth int. conference on Computational Social Choice (p. 12). http://hdl.handle.net/20.500.12708/54178
    Project: TTPC (2008–2012)
  • Computational Aspects of cf2 and stage2 Argumentation Semantics. / Dvorak, W., & Gaggl, S. (2012). Computational Aspects of cf2 and stage2 Argumentation Semantics. In B. Verheij, S. Szeider, & S. Woltran (Eds.), Proceedings of Fourth International Conference on Computational Models of Argument (pp. 273–284). “Frontiers in Artificial Intelligence and Applications” series/IOS Press. http://hdl.handle.net/20.500.12708/54177
  • Incorporating Stage Semantics in the SCC-recursive Schema for Argumentation Semantics. / Dvorak, W., & Gaggl, S. (2012). Incorporating Stage Semantics in the SCC-recursive Schema for Argumentation Semantics. In R. Rosati & S. Woltran (Eds.), Proceedings of 14#^{th} International Workshop on Non-Monotonic Reasoning (p. 9). http://hdl.handle.net/20.500.12708/54176
    Project: Argu (2009–2012)
  • Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming / Morak, M., Musliu, N., Pichler, R., Rümmele, S., & Woltran, S. (2012). Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming. In Y. Hamadi & M. Schoenauer (Eds.), Lecture Notes in Computer Science (pp. 130–144). Springer. https://doi.org/10.1007/978-3-642-34413-8_10
  • Complexity-Sensitive Decision Procedures for Abstract Argumentation / Dvorak, W., Järvisalo, M., Wallner, J. P., & Woltran, S. (2012). Complexity-Sensitive Decision Procedures for Abstract Argumentation. In G. Brewka, T. Eiter, & S. McIlraith (Eds.), Proceedings of 13#^{th} int. conf. of Principles of Knowledge Representation and Reasoning (pp. 54–64). AAAI Press. http://hdl.handle.net/20.500.12708/54155
    Project: Argu (2009–2012)
  • Belief Revision within Fragments of Propositional Logic / Creignou, N., Papini, O., Pichler, R., & Woltran, S. (2012). Belief Revision within Fragments of Propositional Logic. In G. Brewka, T. Eiter, & S. McIlraith (Eds.), Proceedings of 13#^{th} int. conf. on Principles of Knowledge Representation and Reasoning (p. 11). AAAI Press. http://hdl.handle.net/20.500.12708/54154
    Project: TTPC (2008–2012)
  • Static analysis and optimization of semantic web queries / Letelier, A., Pérez, J., Pichler, R., & Skritek, S. (2012). Static analysis and optimization of semantic web queries. In M. Benedikt, M. Krötzsch, & M. Lenzerini (Eds.), Proceedings of the 31st symposium on Principles of Database Systems - PODS ’12. ACM. https://doi.org/10.1145/2213556.2213572
    Project: SODI (2009–2013)
  • Union and Intersection of Schema Mappings / Perez, J., Pichler, R., Sallinger, E., & Savenkov, V. (2012). Union and Intersection of Schema Mappings. In J. Freire & D. Suciu (Eds.), Proceedings of the 6th Alberto Mendelzon International Workshop on Foundations of Data Management (p. 13). CEUR-WS.org. http://hdl.handle.net/20.500.12708/54149
    Project: SODI (2009–2013)
  • Information Extraction from Web Pages Based on Their Visual Representation / Fayzrakhmanov, R. (2012). Information Extraction from Web Pages Based on Their Visual Representation. In Lecture Notes in Computer Science (pp. 342–346). Springer. http://hdl.handle.net/20.500.12708/53953
  • Reasoning and Query Answering in Description Logics / Ortiz, M., & Šimkus, M. (2012). Reasoning and Query Answering in Description Logics. In T. Eiter & T. Krennwallner (Eds.), Lecture Notes in Computer Science (pp. 1–53). Springer LNCS. https://doi.org/10.1007/978-3-642-33158-9_1
    Projects: Hybride Wissensbasen (2008–2012) / SemDat (2012–2016)
  • Query Rewriting for Horn-SHIQ Plus Rules / Eiter, T., Ortiz de la Fuente, M. M., Simkus, M., Tran, T.-K., & Xiao, G. (2012). Query Rewriting for Horn-SHIQ Plus Rules. In J. Hoffmann & B. Selman (Eds.), Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence (pp. 726–733). AAAI Press. http://hdl.handle.net/20.500.12708/54357
    Projects: Hybride Wissensbasen (2008–2012) / Net2 (2010–2013) / SemDat (2012–2016)
  • Configuration Repair via Flow Networks / Salzer, G., Feinerer, I., & Sisel, T. (2012). Configuration Repair via Flow Networks. In C. Li & A. Felfernig (Eds.), Lecture Notes in Computer Science (pp. 321–330). https://doi.org/10.1007/978-3-642-34624-8_37
  • The cf2 Argumentation Semantics Revisited. / Gaggl, S., & Woltran, S. (2012). The cf2 Argumentation Semantics Revisited. (DBAI-TR-2012-77). http://hdl.handle.net/20.500.12708/37419
    Project: Argu (2009–2012)
  • Incorporating Stage Semantics in the SCC-recursive Schema for Argumentation Semantics. / Dvorak, W., & Gaggl, S. (2012). Incorporating Stage Semantics in the SCC-recursive Schema for Argumentation Semantics. (DBAI-TR-2012-78). http://hdl.handle.net/20.500.12708/37418
    Project: Argu (2009–2012)
  • Abstract Argumentation via Monadic Second Order Logic. / Dvorak, W., Szeider, S., & Woltran, S. (2012). Abstract Argumentation via Monadic Second Order Logic. (DBAI-TR-2012-79). http://hdl.handle.net/20.500.12708/37417
    Projects: Argu (2009–2012) / Complex Reason (2010–2014)

2011

2010

  • Scheduling content multicast trees with minimal repetitions / Bessler, S., Lang, L. F., & Musliu, N. (2010). Scheduling content multicast trees with minimal repetitions. In 2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS). Networks 2010, Warsaw, Poland, EU. https://doi.org/10.1109/netwks.2010.5624910
  • Bounded treewidth as a key to tractability of knowledge representation and reasoning / Gottlob, G., Pichler, R., & Wei, F. (2010). Bounded treewidth as a key to tractability of knowledge representation and reasoning. Artificial Intelligence, 174(1), 105–132. https://doi.org/10.1016/j.artint.2009.10.003
  • Tractable database design and datalog abduction through bounded treewidth / Gottlob, G., Pichler, R., & Wei, F. (2010). Tractable database design and datalog abduction through bounded treewidth. Information Systems, 35(3), 278–298. https://doi.org/10.1016/j.is.2009.09.003
  • Monadic datalog over finite structures of bounded treewidth / Gottlob, G., Pichler, R., & Wei, F. (2010). Monadic datalog over finite structures of bounded treewidth. ACM Transactions on Computational Logic, 12(1), 1–48. https://doi.org/10.1145/1838552.1838555
  • A hybrid LS-CP solver for the shifts and breaks design problem / Di Gaspero, L., Gärtner, J., Musliu, N., Schaerf, A., Schafhauser, W., & Slany, W. (2010). A hybrid LS-CP solver for the shifts and breaks design problem. In Proceedings of PATAT 2010 - The 8th International Conference on the Practice and Theory of Automated Timetabling (p. 3). http://hdl.handle.net/20.500.12708/53591
  • A hybrid LS-CP solver for the shifts and breaks design problem / Di Gaspero, L., Gärtner, J., Musliu, N., Schaerf, A., Schafhauser, W., & Slany, W. (2010). A hybrid LS-CP solver for the shifts and breaks design problem. In Proceedings of 7th International Workshop on Hybrid Metaheuristics (pp. 46–61). Lecture Notes in Computer Sciences. http://hdl.handle.net/20.500.12708/53204
  • A Break Scheduling System for Supervision Personnel Using AI techniques. / Beer, A., Gärtner, J., Musliu, N., Schafhauser, W., & Slany, W. (2010). A Break Scheduling System for Supervision Personnel Using AI techniques. IEEE Intelligent Systems, 25(2), 60–73. http://hdl.handle.net/20.500.12708/165999
  • An improved memetic algorithm for break scheduling / Widl, M., & Musliu, N. (2010). An improved memetic algorithm for break scheduling. In Proceddings of 7th International Workshop on Hybrid Metaheuristics (pp. 133–147). Lecture Notes in Computer Sciences. http://hdl.handle.net/20.500.12708/53207
  • Modelling web navigation with the user in mind / Fayzrakhmanov, R., Göbel, M., Holzinger, W., Krüpl, B., Mager, A., & Baumgartner, R. (2010). Modelling web navigation with the user in mind. In Proceedings of the 2010 International Cross Disciplinary Conference on Web Accessibility (W4A) - W4A ’10. 2010 International Cross Disciplinary Conference on Web Accessibility - W4A2010, Raleigh, USA, Non-EU. ACM Press. https://doi.org/10.1145/1805986.1806006
  • Web 2.0 Vision for the Blind / Baumgartner, R., Krüpl, B., Goebel, M., Klein, D., & Gattringer, R. (2010). Web 2.0 Vision for the Blind. In Proceedings of the 2nd Web Science Conference - WebSci2010. 2#^{nd} Web Science Conference - WebSci2010, Raleigh, USA, Non-EU. http://hdl.handle.net/20.500.12708/53510
  • A unified ontology-based web page model for improving accessibility / Fayzrakhmanov, R., Goebel, M., Holzinger, W., Krüpl, B., & Baumgartner, R. (2010). A unified ontology-based web page model for improving accessibility. In M. Rappa & P. Jones (Eds.), Proceedings of the 19th international conference on World wide web - WWW ’10. ACM Press. https://doi.org/10.1145/1772690.1772817
  • A New SNA Centrality Measure Quantifying the Distance to the Nearest Center / Bohn, A., Theußl, S., Feinerer, I., Hornik, K., Mair, P., & Walchhofer, N. (2010). A New SNA Centrality Measure Quantifying the Distance to the Nearest Center. In H. Locarek-Junge & C. Weihs (Eds.), Studies in Classification, Data Analysis, and Knowledge Organization (pp. 579–586). Springer. https://doi.org/10.1007/978-3-642-10745-0_63
  • Towards a General Argumentation System based on Answer-Set Programming / Gaggl, S. (2010). Towards a General Argumentation System based on Answer-Set Programming. In M. Hermenegildo & T. Schaub (Eds.), Technical Communications of the 26th International Conference on Logic Programming (pp. 265–269). Leibniz International Proceedings in Informatics / Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICLP.2010.265
    Project: Argu (2009–2012)
  • Redundancy Elimination on RDF Graphs in the Presence of Rules, Constraints, and Queries / Pichler, R., Polleres, A., Skritek, S., & Woltran, S. (2010). Redundancy Elimination on RDF Graphs in the Presence of Rules, Constraints, and Queries. In P. Hitzler & T. Lukasiewicz (Eds.), Web Reasoning and Rule Systems (pp. 133–148). Lecture Notes/ Springer. https://doi.org/10.1007/978-3-642-15918-3_11
  • Minimising RDF Graphs under Rules and Constraints Revisited / Pichler, R., Polleres, A., Skritek, S., & Woltran, S. (2010). Minimising RDF Graphs under Rules and Constraints Revisited. In A. H. F. Laender & L. V. S. Lakshmanan (Eds.), Proceedings of the 4th Alberto Mendelzon International Workshop on Foundations of Data Management. CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/53438
  • Computing Product Configurations via UML and Integer Linear Programming / Falkner, A., Feinerer, I., Salzer, G., & Schenner, G. (2010). Computing Product Configurations via UML and Integer Linear Programming. International Journal of Mass Customisation, 3(4), 351. https://doi.org/10.1504/ijmassc.2010.037650
  • Algorithms for Propositional Model Counting / Samer, M., & Szeider, S. (2010). Algorithms for Propositional Model Counting. Journal of Discrete Algorithms, 8(1), 50–64. https://doi.org/10.1016/j.jda.2009.06.002
    Project: Complexity (2011–2013)
  • On the distributivity of LTL specifications / Samer, M., & Veith, H. (2010). On the distributivity of LTL specifications. ACM Transactions on Computational Logic, 11(3), 1–26. https://doi.org/10.1145/1740582.1740588
  • Answer-Set Programming Encodings for Argumentation Frameworks / Egly, U., Gaggl, S., & Woltran, S. (2010). Answer-Set Programming Encodings for Argumentation Frameworks. Argument and Computation, 1(2), 147–177. http://hdl.handle.net/20.500.12708/167366
    Projects: Argu (2009–2012) / TTPC (2008–2012)
  • Towards practical feasibility of core computation in data exchange / Pichler, R., & Savenkov, V. (2010). Towards practical feasibility of core computation in data exchange. Theoretical Computer Science, 411(7–9), 935–957. https://doi.org/10.1016/j.tcs.2009.09.035
  • Kernel-based machine learning for fast text mining in R / Karatzoglou, A., & Feinerer, I. (2010). Kernel-based machine learning for fast text mining in R. Computational Statistics & Data Analysis, 54(2), 290–297. https://doi.org/10.1016/j.csda.2009.09.023
  • Counting complexity of propositional abduction / Hermann, M., & Pichler, R. (2010). Counting complexity of propositional abduction. Journal of Computer and System Sciences, 76(7), 634–649. https://doi.org/10.1016/j.jcss.2009.12.001
  • Complexity of semi-stable and stage semantics in argumentation frameworks / Dvořák, W., & Woltran, S. (2010). Complexity of semi-stable and stage semantics in argumentation frameworks. Information Processing Letters, 110(11), 425–430. https://doi.org/10.1016/j.ipl.2010.04.005
    Project: Argu (2009–2012)
  • Strong Equivalence in Argumentation / Woltran, S. (2010). Strong Equivalence in Argumentation. In J. Dix, J. Leite, G. Governatori, & W. Jamroga (Eds.), Computational Logic in Multi-Agent Systems (p. 14). Lecture Notes/ Springer. https://doi.org/10.1007/978-3-642-14977-1_4
  • Support Vector Machines for Large Scale Text Mining in R / Feinerer, I., & Karatzoglou, A. (2010). Support Vector Machines for Large Scale Text Mining in R. In Y. Lechevallier & G. Saporta (Eds.), Proceedings of COMPSTAT’2010 19th International Conference on Computational StatisticsParis France, August 22-27, 2010 Keynote, Invited and Contributed Papers (pp. 991–998). Physica. http://hdl.handle.net/20.500.12708/53342
  • Algorithms for computing the core of universal solutions / Savenkov, V. (2010). Algorithms for computing the core of universal solutions. Data Exchange, Integration, and Streams (DEIS’10), Schloß Dagstuhl, Deutschland, EU. http://hdl.handle.net/20.500.12708/85054
  • Theory of Peer Data Management / Skritek, S. (2010). Theory of Peer Data Management. Data Exchange, Integration, and Streams (DEIS’10), Schloß Dagstuhl, Deutschland, EU. http://hdl.handle.net/20.500.12708/85055
  • Computational Aspects of Abstract Argumentation / Woltran, S. (2010). Computational Aspects of Abstract Argumentation. Helsinki Graduate School in Computer Science and Engineering, Helsinki, EU. http://hdl.handle.net/20.500.12708/85068
  • Efficient Algorithms for Nonmonotonic Reasoning Using Treewidth / Rümmele, S. (2010). Efficient Algorithms for Nonmonotonic Reasoning Using Treewidth. KR 2010 Doctoral Consortium, Toronto, Canada, Non-EU. http://hdl.handle.net/20.500.12708/85035
  • Deciding Equivalence between Extended Datalog Programs. A Brief Survey / Woltran, S. (2010). Deciding Equivalence between Extended Datalog Programs. A Brief Survey. Datalog 2.0 Workshop, Oxford, UK, EU. http://hdl.handle.net/20.500.12708/85016
  • Sets of Boolean Connectives That Make Argumentation Easier / Creignou, N., Schmidt, J., Thomas, M., & Woltran, S. (2010). Sets of Boolean Connectives That Make Argumentation Easier. In T. Janhunen & I. Niemelä (Eds.), Logics in Artificial Intelligence (pp. 117–129). Springer. https://doi.org/10.1007/978-3-642-15675-5_12
  • An Optimization for Reasoning with Forest Logic Programs / Feier, C., & Heymans, S. (2010). An Optimization for Reasoning with Forest Logic Programs. In S. Woltran & M. Balduccini (Eds.), Proc. of the Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2010) (p. 15). http://hdl.handle.net/20.500.12708/53511
  • Looking For the Sweet Spot Between Low-Threshold Participation and Expressiveness in Social Media / Krüpl, B. (2010). Looking For the Sweet Spot Between Low-Threshold Participation and Expressiveness in Social Media. In Proceedings of the 2nd Web Science Conference - WebSci2010. 2#^{nd} Web Science Conference - WebSci2010, Raleigh, USA, Non-EU. http://hdl.handle.net/20.500.12708/53509
  • Uncertain Databases in Collaborative Data Management / Pichler, R., Savenkov, V., Skritek, S., & Truong, H.-L. (2010). Uncertain Databases in Collaborative Data Management. In A. de Keijzer & M. van Keulen (Eds.), CTIT Workshop Proceedings Series (pp. 129–143). CTIT, Centre for Telematics and Information Technology. http://hdl.handle.net/20.500.12708/53505
  • Representing Preferences Among Sets / Brewka, G., Truszczynski, M., & Woltran, S. (2010). Representing Preferences Among Sets. In M. Fox & D. Poole (Eds.), Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2010. AAAI Press. http://hdl.handle.net/20.500.12708/53441
  • The Complexity of Handling Minimal Solutions in Logic-Based Abduction / Pichler, R., & Woltran, S. (2010). The Complexity of Handling Minimal Solutions in Logic-Based Abduction. In H. Coelho, R. Studer, & M. Woolridge (Eds.), Prooceedings of ECAI 2010 - 19th European Conference on Artificial Intelligence (pp. 895–900). IOS Press. http://hdl.handle.net/20.500.12708/53439
  • A Dynamic-Programming Based ASP-Solver / Morak, M., Pichler, R., Rümmele, S., & Woltran, S. (2010). A Dynamic-Programming Based ASP-Solver. In R. Goebel, J. Siekmann, & W. Wahlster (Eds.), Logics in Artificial Intelligence (pp. 369–372). Springer. https://doi.org/10.1007/978-3-642-15675-5_34
  • Counting and Enumeration Problems with Bounded Treewidth / Pichler, R., Rümmele, S., & Woltran, S. (2010). Counting and Enumeration Problems with Bounded Treewidth. In R. Goebel, J. Siekmann, & W. Wahlster (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning (pp. 387–404). Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-17511-4_22
  • Schema Mapping Optimization in the Presence of Target Constraints / Sallinger, E., Pichler, R., & Savenkov, V. (2010). Schema Mapping Optimization in the Presence of Target Constraints. In H. Kaiser & R. Kirner (Eds.), Proceedings of the Junior Scientist Conference 2010 (pp. 309–310). http://hdl.handle.net/20.500.12708/53423
    Project: HINT (2012–2017)
  • Decentralized Diagnosis: Complexity Analysis and Datalog Encodings / Pfandler, A., Pichler, R., & Woltran, S. (2010). Decentralized Diagnosis: Complexity Analysis and Datalog Encodings. In H. Kaiser & R. Kirner (Eds.), Proceedings of the Junior Scientist Conference 2010 (pp. 291–292). http://hdl.handle.net/20.500.12708/53424
  • Implementing a Peer Database Management System / Skritek, S., & Pichler, R. (2010). Implementing a Peer Database Management System. In H. Kaiser & R. Kirner (Eds.), Proceedings of the Junior Scientist Conference 2010 (pp. 299–300). http://hdl.handle.net/20.500.12708/53422
  • cf2 Semantics Revisited / Gaggl, S., & Woltran, S. (2010). cf2 Semantics Revisited. In P. Baroni, F. Cerutti, M. Giacomin, & G. R. Simari (Eds.), Computational Models of Argument (pp. 243–254). IOS Press. http://hdl.handle.net/20.500.12708/53354
    Project: Argu (2009–2012)
  • Analysis and Algorithms for Stemming Inversion / Feinerer, I. (2010). Analysis and Algorithms for Stemming Inversion. In P.-J. Cheng, M.-Y. Kan, W. Lam, & P. Nakov (Eds.), Information Retrieval Technology (pp. 290–299). Springer. https://doi.org/10.1007/978-3-642-17187-1_28
  • Reasoning in Argumentation Frameworks of Bounded Clique-Width / Dvorak, W., Szeider, S., & Woltran, S. (2010). Reasoning in Argumentation Frameworks of Bounded Clique-Width. In P. Baroni, F. Cerutti, M. Giacomin, & G. R. Simari (Eds.), Proceedings of COMMA 2010 (pp. 219–230). IOS Press. http://hdl.handle.net/20.500.12708/53323
    Projects: Argu (2009–2012) / Complex Reason (2010–2014)
  • Ant Colony Optimization for Tree Decompositions / Hammerl, T., & Musliu, N. (2010). Ant Colony Optimization for Tree Decompositions. In Evolutionary Computation in Combinatorial Optimization, 10th European Conference, EvoCOP 2010, Proceedings (pp. 95–106). Lecture Notes in Computer Science, Springer. http://hdl.handle.net/20.500.12708/53205
  • Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough / Pichler, R., Rümmele, S., Szeider, S., & Woltran, S. (2010). Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough. In F. Lin, U. Sattler, & M. Truszczynski (Eds.), Proc. of KR 2010 (p. 10). AAAI Press. http://hdl.handle.net/20.500.12708/53171
    Projects: Argu (2009–2012) / Complex Reason (2010–2014)
  • Towards Fixed-Parameter Tractable Algorithms for Argumentation / Dvorak, W., Pichler, R., & Woltran, S. (2010). Towards Fixed-Parameter Tractable Algorithms for Argumentation. In F. Lin, U. Sattler, & M. Truszczynski (Eds.), Proc. of KR 2010 (p. 11). AAAI Press. http://hdl.handle.net/20.500.12708/53170
    Projects: Argu (2009–2012) / TTPC (2008–2012)
  • Abstract Dialectical Frameworks / Brewka, G., & Woltran, S. (2010). Abstract Dialectical Frameworks. In F. Lin, U. Sattler, & M. Truszczynski (Eds.), Proc. of KR 2010 (p. 10). AAAI Press. http://hdl.handle.net/20.500.12708/53169
    Project: Argu (2009–2012)
  • Multicut Algorithms via Tree Decompositions / Pichler, R., Rümmele, S., & Woltran, S. (2010). Multicut Algorithms via Tree Decompositions. In T. Calamoneri & J. Diaz (Eds.), Lecture Notes in Computer Science (pp. 167–179). LNCS, Springer. https://doi.org/10.1007/978-3-642-13073-1_16
    Projects: Argu (2009–2012) / TTPC (2008–2012)
  • Characterizing Strong Equivalence for Argumentation Frameworks / Oikarinen, E., & Woltran, S. (2010). Characterizing Strong Equivalence for Argumentation Frameworks. In F. Lin, U. Sattler, & M. Truszczynski (Eds.), Proc. of KR 2010 (p. 11). AAAI Press. http://hdl.handle.net/20.500.12708/53133
    Project: Argu (2009–2012)
  • Semantic Online Tourism Market Monitoring / Fröschl, K. A., Baumgartner, R., Walchhofer, N., Hronsky, M., & Pöttler, M. (2010). Semantic Online Tourism Market Monitoring. In Proceedings of the International Conference in Lugano (pp. 629–640). Springer Wien/New York. http://hdl.handle.net/20.500.12708/52974
  • On the Intertranslatability of Argumentation Semantics / Dvorak, W., & Woltran, S. (2010). On the Intertranslatability of Argumentation Semantics. In Proceedings of the Conference on Thirty Years of Nonmonotonic Reasoning (p. 15). http://hdl.handle.net/20.500.12708/53356
    Project: Argu (2009–2012)

2009

  • Manifold Answer-Set Programs for Meta-reasoning / Faber, W., & Woltran, S. (2009). Manifold Answer-Set Programs for Meta-reasoning. In E. Erdem, F. Lin, & T. Schaub (Eds.), Logic Programming and Nonmonotonic Reasoning: 10th International Conference, LPNMR 2009, Potsdam, Germany, September 14-18, 2009, Proceedings (pp. 115–128). Springer. https://doi.org/10.1007/978-3-642-04238-6_12
    Projects: Argu (2009–2012) / TTPC (2008–2012)
  • Belief Revision with Bounded Treewidth / Pichler, R., Rümmele, S., & Woltran, S. (2009). Belief Revision with Bounded Treewidth. In E. Erdem, F. Lin, & T. Schaub (Eds.), Logic Programming and Nonmonotonic Reasoning: 10th International Conference, LPNMR 2009, Potsdam, Germany, September 14-18, 2009, Proceedings (pp. 250–263). Springer. https://doi.org/10.1007/978-3-642-04238-6_22
    Project: TTPC (2008–2012)
  • ccT on Stage: Generalised Uniform Equivalence Testing for Verifying Student Assignment Solutions / Oetsch, J., Seidl, M., Tompits, H., & Woltran, S. (2009). ccT on Stage: Generalised Uniform Equivalence Testing for Verifying Student Assignment Solutions. In E. Erdem, F. Lin, & T. Schaub (Eds.), Logic Programming and Nonmonotonic Reasoning: 10th International Conference, LPNMR 2009, Potsdam, Germany, September 14-18, 2009, Proceedings (pp. 382–395). Springer. https://doi.org/10.1007/978-3-642-04238-6_32
    Project: Methods (2009–2013)
  • Testing while modelling staff scheduling problems / Beer, A., Gärtner, J., Musliu, N., Schafhauser, W., & Slany, W. (2009). Testing while modelling staff scheduling problems. In 23rd EUROPEAN CONFERENCE ON OPERATIONAL RESEARCH, BOOK OF ABSTRACTS (p. 198). http://hdl.handle.net/20.500.12708/52811
    Project: Softnet (2006–2011)
  • Temple - a language for staff scheduling problems / Schafhauser, W., Beer, A., Gärtner, J., Musliu, N., & Slany, W. (2009). Temple - a language for staff scheduling problems. In 23rd EUROPEAN CONFERENCE ON OPERATIONAL RESEARCH, BOOK OF ABSTRACTS (p. 198). http://hdl.handle.net/20.500.12708/52810
    Project: Softnet (2006–2011)
  • Local Search for Shift and Break Scheduling / Musliu, N., Beer, A., Gärtner, J., Schafhauser, W., & Slany, W. (2009). Local Search for Shift and Break Scheduling. In 23rd EUROPEAN CONFERENCE ON OPERATIONAL RESEARCH, BOOK OF ABSTRACTS (p. 102). http://hdl.handle.net/20.500.12708/52809
    Project: Softnet (2006–2011)
  • TEMPLE - A Modeling Language for Resource Planning and Scheduling Problems / Beer, A., Gärtner, J., Musliu, N., Schafhauser, W., & Slany, W. (2009). TEMPLE - A Modeling Language for Resource Planning and Scheduling Problems (DBAI-TR-2009-65). http://hdl.handle.net/20.500.12708/35721
  • A Memetic Algorithm for a Break Scheduling Problem / Musliu, N., Schafhauser, W., & Widl, M. (2009). A Memetic Algorithm for a Break Scheduling Problem. In Cd Mic 2009 (p. 10). http://hdl.handle.net/20.500.12708/52808
    Project: Softnet (2006–2011)
  • A Framework for Programming with Module Consequences / Faber, W., & Woltran, S. (2009). A Framework for Programming with Module Consequences. In M. De Vos & T. Schaub (Eds.), Proc. of the 2#^{nd} International Workshop on Software Engineering for Answer Set Programming (SEA’09) (pp. 34–48). http://hdl.handle.net/20.500.12708/52763
    Projects: Argu (2009–2012) / TTPC (2008–2012)
  • Manifold Answer-Set Programs for Meta-Reasoning / Faber, W., & Woltran, S. (2009). Manifold Answer-Set Programs for Meta-Reasoning. In A. Herzig & B. Johnston (Eds.), Proc. of the IJCAI-09 Workshop on Nonmonotonic Reasoning, Action and Change (NRAC’09) (pp. 33–40). ePress of the University of Technology, Sydney. http://hdl.handle.net/20.500.12708/52762
    Projects: Argu (2009–2012) / TTPC (2008–2012)
  • A Flight Meta-Search Engine with Metamorph / Krüpl, B., Holzinger, W., Darmaputra, Y., & Baumgartner, R. (2009). A Flight Meta-Search Engine with Metamorph. In J. Quemada & G. Léon (Eds.), WWW 2009 Proceedings (p. 2). Association for Computing Machinery, Inc. (ACM). http://hdl.handle.net/20.500.12708/52815
    Project: ABBA (2009–2011)
  • Automated Ontology-Driven Metasearch Generation with Metamorph / Holzinger, W., Krüpl, B., & Baumgartner, R. (2009). Automated Ontology-Driven Metasearch Generation with Metamorph. In G. Vossen, D. D. E. Long, & J. X. Yu (Eds.), Web Information Systems Engineering - WISE 2009: 10th International Conference, Poznen, Poland, October 5-7, 2009, Proceedings (pp. 473–480). Springer. https://doi.org/10.1007/978-3-642-04409-0_46
    Project: ABBA (2009–2011)
  • Nonparametric Distribution Analysis for Text Mining / Karatzoglou, A., Feinerer, I., & Hornik, K. (2009). Nonparametric Distribution Analysis for Text Mining. In Advances in Data Analysis, Data Handling and Business Intelligence (pp. 295–305). Springer. https://doi.org/10.1007/978-3-642-01044-6_27
  • On Using Distributed Extended XQuery for Web Data Sources as Services / Ali, M. I., Pichler, R., Truong, H.-L., & Dustdar, S. (2009). On Using Distributed Extended XQuery for Web Data Sources as Services. In M. Gaedke, M. Grossniklaus, & O. Díaz (Eds.), Web Engineering, 9th International Conference, ICWE 2009 San Sebastián, Spain, June 24-26 2009 Proceedings (pp. 497–500). Springer. https://doi.org/10.1007/978-3-642-02818-2_47
    Project: SODI (2009–2013)
  • Alternation as a programming paradigm / Dvořák, W., Gottlob, G., Pichler, R., & Woltran, S. (2009). Alternation as a programming paradigm. In A. Porto & F. J. Lopez-Fraguas (Eds.), Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming - PPDP ’09. ACM Press. https://doi.org/10.1145/1599410.1599419
    Project: TTPC (2008–2012)
  • Encoding deductive argumentation in quantified Boolean formulae / Besnard, P., Hunter, A., & Woltran, S. (2009). Encoding deductive argumentation in quantified Boolean formulae. Artificial Intelligence, 173(15), 1406–1423. https://doi.org/10.1016/j.artint.2009.06.006
    Project: Argu (2009–2012)
  • Hyperequivalence of logic programs with respect to supported models / Truszczyński, M., & Woltran, S. (2009). Hyperequivalence of logic programs with respect to supported models. Annals of Mathematics and Artificial Intelligence, 53(1–4), 331–365. https://doi.org/10.1007/s10472-009-9119-8
  • Characterising Equilibrium Logic and Nested Logic Programs: Reductions and Complexity / PEARCE, D., TOMPITS, H., & WOLTRAN, S. (2009). Characterising Equilibrium Logic and Nested Logic Programs: Reductions and Complexity. Theory and Practice of Logic Programming, 9(05), 565–616. https://doi.org/10.1017/s147106840999010x
  • Modularity Aspects of Disjunctive Stable Models / Janhunen, T., Oikarinen, E., Tompits, H., & Woltran, S. (2009). Modularity Aspects of Disjunctive Stable Models. Journal of Artificial Intelligence Research, 35, 813–857. https://doi.org/10.1613/jair.2810
  • A Comparison of Tools for Teaching Formal Software Verification / Feinerer, I., & Salzer, G. (2009). A Comparison of Tools for Teaching Formal Software Verification. Formal Aspects of Computing, 21(3), 293–301. https://doi.org/10.1007/s00165-008-0084-5
  • Complexity of Counting the Optimal Solution / Hermann, M., & Pichler, R. (2009). Complexity of Counting the Optimal Solution. Theoretical Computer Science, 410(38–40), 3814–3825. http://hdl.handle.net/20.500.12708/166542
  • Covering graphs with few complete bipartite subgraphs / Fleischner, H., Mujuni, E., Paulusma, D., & Szeider, S. (2009). Covering graphs with few complete bipartite subgraphs. Theoretical Computer Science, 410(21–23), 2045–2053. https://doi.org/10.1016/j.tcs.2008.12.059
  • Relativized hyperequivalence of logic programs for modular programming / TRUSZCZYŃSKI, M., & WOLTRAN, S. (2009). Relativized hyperequivalence of logic programs for modular programming. Theory and Practice of Logic Programming, 9(6), 781–819. https://doi.org/10.1017/s1471068409990159
  • A Solver for QBFs in Negation Normal Form / Egly, U., Seidl, M., & Woltran, S. (2009). A Solver for QBFs in Negation Normal Form. Constraints, 14(1), 38–79. http://hdl.handle.net/20.500.12708/165275
  • Characterizing Strong Equivalence for Argumentation Frameworks / Woltran, S. (2009). Characterizing Strong Equivalence for Argumentation Frameworks. Argumentation Christmas Meeting, Leipzig, EU. http://hdl.handle.net/20.500.12708/84908
  • Argumentation with Bounded Tree-Width / Dvorak, W. (2009). Argumentation with Bounded Tree-Width. Advanced Course in Artificial Intelligence ’09, Belfast, GB, EU. http://hdl.handle.net/20.500.12708/84891
    Project: Argu (2009–2012)
  • ASPARTIX: A System for Computing Different Argumentation Semantics in Answer-Set Programming / Gaggl, S. (2009). ASPARTIX: A System for Computing Different Argumentation Semantics in Answer-Set Programming. Advanced Course in Artificial Intelligence ’09, Belfast, GB, EU. http://hdl.handle.net/20.500.12708/84885
    Project: Argu (2009–2012)
  • Merging Logic Programs under Answer Set Semantics / Delgrande, J. P., Schaub, T., Tompits, H., & Woltran, S. (2009). Merging Logic Programs under Answer Set Semantics. In P. M. Hill & D. S. Warren (Eds.), Logic Programming: 25th International Conference, ICLP 2009, Pasadena, CA, USA, July 14-17, 2009, Proceedings (pp. 160–174). Springer. https://doi.org/10.1007/978-3-642-02846-5_17
    Project: TTPC (2008–2012)
  • spock: A Debugging Support Tool for Logic Programs under the Answer-Set Semantics / Gebser, M., Pührer, J., Schaub, T., Tompits, H., & Woltran, S. (2009). spock: A Debugging Support Tool for Logic Programs under the Answer-Set Semantics. In D. Seipel, M. Hanus, & A. Wolf (Eds.), Lecture Notes in Computer Science (pp. 247–252). Springer. https://doi.org/10.1007/978-3-642-00675-3_17
  • DEMo: Data Exchange Modeling Tool / Pichler, R., & Savenkov, V. (2009). DEMo: Data Exchange Modeling Tool. In H. V. Jagadish (Ed.), Proceedings of the 35#^{th}Int. Conf. on Very Large Data Bases (p. 4). http://hdl.handle.net/20.500.12708/52812
    Project: SODI (2009–2013)
  • Normalization and Optimization of Schema Mappings / Gottlob, G., Pichler, R., & Savenkov, V. (2009). Normalization and Optimization of Schema Mappings. In H. V. Jagadish (Ed.), Proceedings of the 35#^{th}Int. Conf. on Very Large Data Bases (p. 12). VLDB Endowment. http://hdl.handle.net/20.500.12708/52806
    Project: SODI (2009–2013)
  • User-Guided Wrapping of PDF Documents Using Graph Matching Techniques / Hassan, T. (2009). User-Guided Wrapping of PDF Documents Using Graph Matching Techniques. In A. Apostolos, M. Cheriet, & U. Pal (Eds.), Proc. of the 10#^{th} Int. Conf. on Document Analysis and Recognition (pp. 631–635). http://hdl.handle.net/20.500.12708/52786
    Project: GraphWrap (2008–2010)
  • GraphWrap-A System for Interactive Wrapping of PDF Documents Using Graph Matching Techniques / Hassan, T. (2009). GraphWrap-A System for Interactive Wrapping of PDF Documents Using Graph Matching Techniques. In U. M. Borghoff, B. Chidlovskii, & S. Rönnau (Eds.), Proc. of the 2009 ACM Symposium on Document Engineering (pp. 247–248). http://hdl.handle.net/20.500.12708/52785
    Project: GraphWrap (2008–2010)
  • Object-Level Document Analysis of PDF Files / Hassan, T. (2009). Object-Level Document Analysis of PDF Files. In U. M. Borghoff, B. Chidlovskii, & S. Rönnau (Eds.), Proc. of the 2009 ACM Symposium on Document Engineering (pp. 47–55). http://hdl.handle.net/20.500.12708/52784
    Project: