Skip to Content

TU Wien Fakultät für Informatik DBAI Database and Artificial Intelligence Group
Top-level Navigation: Current-level Navigation:

Path: DBAI > Research > Projects > Decodyn Project

Tools: Print

Treating Hard Problems with Decomposition and Dynamic Programming

FWF
(funded by the Austrian Science Fund (FWF) under grant Y698)

Contents

News

Project ended

2022-09
The project ended at 31.05.2022.

Recent Awards for Markus Hecher

2022-09

Recently, Markus Hecher has won the EurAI dissertation award 2021, as well as the GI Dissertationspreis 2021 for his excellent PhD thesis. Further, for his contributions in KR and AI so far, he received the KR Early Career Award 2022.

Erwin Schrödinger Research Funding

2022-03

An Erwin Schrödinger Research Funding was granted to team member Markus Hecher. He will work on his project "QuantASP - Quantitatives Schlussfolgern und Zählen für ASP" (translation: quantitative reasoning and counting for ASP) at the "Computer Science and Artificial Intelligence Laboratory" at M.I.T. (Massachusetts Institute of Technology).

Dissertation Awards for PhD theses

2021-12

For their respective dissertations, Jan Maly received the "Dissertationspreis der Stadt Wien" from the city council of Vienna, and Markus Hecher received the "award of excellence" from the Austrian ministry of education, science, and research. You can find out more about the awardees and their theses here.

Accepted Papers at CP and KR

2021-10

We are happy to announce that two papers by team members have been accepted to this year's International Conference on Principles and Practice of Constraint Programming (CP 2021) and another two papers (one long, one short) at the International Conference on Principles of Knowledge Representation and Reasoning (KR 2021).

Best Paper Awards at ICLP'21

2021-09
Best Paper at ICLP'21

We are pleased to announce that Viktor Besin, Markus Hecher and PI Stefan Woltran won the Best Paper Award and Best Student Paper Award with their paper Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs at the International Conference on Logic Programming ICLP 2021.

Successful Argumentation Solvers at ICCMA

2021-08

The project team submitted two argumentation solvers to this year's International Competition on Computational Models of Argumentation (ICCMA): the new tree decomposition-based portfolio A-Folio DPDB and the updated ASP-based ASPARTIX-V21 system.

We are happy to announce that A-Folio DPDB won the classical tracks for complete and stable semantics, and ASPARTIX-V21 won the classical track for stage semantics!

Special Issue on LPNMR'19 papers

2021-08

The new Special Issue of Theory and Practice of Logic Programming on revised and extended papers presented at LPNMR'19 with Guest Editors Marcello Balduccini, Yuliya Lierler, and PI Stefan Woltran (also co-chair of LPNMR'19) is now available.

Binational PhD thesis on Treewidth-Based Problem Solving

2021-07
PhD thesis defended by Markus Hecher

Team member Markus Hecher successfully defended his binational PhD thesis Advanced Tools and Methods for Treewidth-Based Problem Solving.

Congratulations!

Image (left to right): Markus Hecher, supervisor Stefan Woltran, and co-supervisor Torsten Schaub.

Erwin Schrödinger Research Funding

2021-05

An Erwin Schrödinger research funding was granted to project member Jan Maly for his project "A holistic analysis of participatory budgeting". Soon the project will start and Jan will continue his work at the Institute of Logic, Language and Computation of the University of Amsterdam.

Invited talk at CILC 2020

2020-10

PI Stefan Woltran was invited to give a talk at CILC 2020 titled "Computational Argumentation - Formal Models and Complexity Results".

The abstract can be found here.

Workshops and Competitions

2020-09

Team member Markus Hecher co-organized the first international competition on model counting (MC 2020), the first international workshop on model counting (MCW 2020), and the 13th edition of the Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2020).

Moreover, PI Stefan Woltran and team members Martin Lackner and Jan Maly organized the First Vienna Workshop on Computational Social Choice.

All of the events were a great success!

PhD thesis on Ranking Sets of Objects

2020-09
Jan Maly presents his thesis

Team member Jan Maly successfully defended his PhD thesis Ranking Sets of Objects: How to Deal with Impossibility Results.

The full thesis is available here.

Congratulations!

AAAI 2020: Two Accepted Papers

2020-02

We are delighted to announce that two papers by team members have been accepted for presentation at this year's AAAI conference in New York.

PACE 2019 co-organization

2019-08
Markus Hecher and Johannes Fichte giving a talk at PACE19 in Munich

Team member Markus Hecher successfully co-organize this years PACE-Challenge. A report on the challenge can written by Johannes Fichte and Markus Hecher can be found in the FTP Newsletter.

Expansion-based QBF Solving on Tree Decompositions

2019-06

Team member Günther Charwat published the paper "Expansion-based QBF Solving on Tree Decompositions" in Fundamenta Informaticae, vol. 167 describing the dynQBF system developed in the project.

LPNMR 2019 co-chair

2019-06
LPNMR 19 image

PI Stefan Woltran was co-chair for LPNMR 2019 (15th International Conference on Logic Programming and Nonmonotonic Reasoning). The conference took place in Philadelphia, USA on June 3 - 7, 2019.

Talk at Shonan Meeting 144

2019-03

Team member Markus Hecher participated and gave a talk at the Shonan Meeting 144 "Parameterized Graph Algorithms & Data Reduction" in Shonan, Japan titled "Projected model counting using small treewidth". The slides can be found here.

AAAI 2019: Four Accepted Papers

2019-02

We are delighted to announce that four papers by team members have been accepted for presentation at this year's AAAI conference in Hawaii. The conference proceedings are now available here.

Master thesis Andre Schidler

2019-01
Picture of winners of Epilog

Master student Andre Schidler presented his master thesis "A Solver for the Steiner Tree Problem with few Terminals" at the TU Epilog. The thesis was written under the supervision of PI Stefan Woltran and team member Johannes Fichte. The developed solver achieved the 4th place out of 12 participants in track A of the PACE 2018 competition.

taasp 2018

2018-11
Picture from taasp workshop

TU Wien hosted this years edition of the taasp. workshop with invited talks by Vladimir Lifschitz, and Gerd Brewka. The workshop was co-organized by team members Michael Morak and Markus Hecher.

PACE 2019 co-organization

2018-11

We are happy to announce that team member Markus Hecher will co-organize next years PACE-Challenge.

Stefan Woltran elected EurAI-Fellow

2018-08
Stefan Woltran with EurAI Followship certificate

Congratulations to PI Stefan Woltran, who has been elected a fellow of the European Association for Artificial Intelligence (EurAI).

KI Special Issue: Answer Set Programming Unleashed

2018-08
KI Special Issue Cover

The new Special Issue of KI on Answer Set Programming by Guest Editors Torsten Schaub and Stefan Woltran is now available, answering the questions "What Answer Set Programming is about" and "What Answer Set Programming can do for you".

PACE'18 Challenge results

2018-09
PACE'18: 4rd place certiciate

Andre Schidler, Johannes Fichten and Markus Hecher successfully participated in the PACE'18 challenge and achieved the 4th place out of 12 participants in track A.

Thank you to the competition organizers!


For older news, see the news archive.

Top

Goal of the Project

Handling computationally complex queries over huge data is an insurmountable obstacle for standard algorithms, thus novel methods are required. Our solution is to exploit structure. In reality, social networks are not random graphs and medical ontologies are not arbitrary sets of relations. Thus, structural parameters can serve as a key to apply recent techniques from the area of parameterized complexity. We shall focus here on the concept of decomposition (which divides the problem into smaller pieces making use of structural properties of the instance) and dynamic programming algorithms which solve the problem in terms of the decomposed instance. Notably, structure is not solely found in data like social networks but is also present in queries for complex reasoning (for instance, when seeking for a certain structure in molecules, this is naturally reflected in the query). The main vision of the decodyn project is to understand how structure can be simultaneously exploited on these two different levels, in such a way that (deco)mposition and (dyn)amic programming provide novel methods to make problems of this kind amenable to today's computers.

Several query languages which allow formalizations of complex reasoning tasks are nowadays available, among them variants of datalog or description logics. In the course of the project, we will first focus on Answer-Set Programming (also known as disjunctive datalog). In fact, Answer-Set Programming has shown great potential in the aforementioned application areas, but its use is still limited when problems of huge size have to be solved. In the second phase, we intend to migrate our results and methods to other reasoning paradigms and query languages.

Top

Project Team

Decodyn Project Team Stefan Woltran Michael Abseher Günther Charwat Johannes Fichte Bernhard Bliem Markus Hecher Michael Morak Emanuel Sallinger Nysret Musliu

Project leader

Current staff

Former staff

Internal project partners

External project partners

Top

Systems and Tools

Several systems delivered and extended in course of the project are publicly available.

Software

  • D-FLAT family: D-FLAT is a flexible declarative framework allowing for rapid prototyping of dynamic programming algorithms over tree decompositions making use of ASP solvers. The tree decomposition is generated via heuristics and the developer only has to specify the dynamic programming algorithm in a declarative way as an ASP program.
  • DynASP: DynASP is a dedicated ASP solver based on tree decomposition and dynamic programming. It is optimized for counting problems and supports the full ASP syntax.
  • lpopt: lpopt is a tool to decompose logic programming rules, given in the syntax of ASP, into smaller, more manageable rules, that are easier to handle for current ASP solvers and grounders.
  • htd: htd is a flexible and efficient software library that can be used to obtain tree decompositions of low width and other types of decompositions of a given input graph. It is used in D-FLAT, DynASP, dynBDD, dynQBF and dynClasp.
  • dynQBF: dynQBF is a solver for quantified boolean formulae based on dynamic programming over tree decompositions. It can handle problem instances of high treewidth efficiently by relying on binary decision diagrams for the storage of the intermediate results.

Utilities and Playground

Here we collect further developed utilities, as well as prototypical software that is used to explore new ideas and concepts.
  • dynBDD: DynBDD works in a way that is similar to D-FLAT, but instead of storing the intermediate results explicitly, it uses binary decision diagrams in order to save memory and to increase performance and robustness in case of high treewidth.
  • DecoVis: DecoVis is a visualization tool for the debugging and analysis of dynamic programming algorithms over tree decompositions. It provides a web front-end and benefits from powerful frameworks for graph visualization.
  • dynClasp: dynClasp is an approach to exploit the heuristics of state-of-the-art answer set programming solvers in such a way that they follow the insights one can gain from tree decompositions with the goal to enhance performance.
  • AdditionalStats and ClaspRe2: AdditionalStats and ClaspRe2 are tools to extract features (based on structural parameters from parameterized complexity theory) of ASP instances and classify them.
Top

Publications

Here, we provide a comprehensive list of all project publications. Technical reports that document the project progress are listed subsequently.

2021

  1. Viktor Besin, Markus Hecher and Stefan Woltran Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs In Theory and Practice of Logic Programming, 21 (5): 575-592, 2021.
    [ BibTeX | doi  ]
  2. Wolfgang Dvořák, Matthias König and Stefan Woltran On the Complexity of Preferred Semantics in Argumentation Frameworks with Bounded Cycle Length In Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning, KR 2021, Online event, November 3-12, 2021, pages 671-675, 2021.
    [ BibTeX | doi  ]
  3. Thomas Eiter, Markus Hecher and Rafael Kiesel Treewidth-Aware Cycle Breaking for Algebraic Answer Set Counting In Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning, KR 2021, Online event, November 3-12, 2021, pages 269-279, 2021.
    [ BibTeX | doi  ]
  4. Thomas Eiter, Markus Hecher and Rafael Kiesel aspmc: An Algebraic Answer Set Counter In Proceedings of the International Conference on Logic Programming 2021 Workshops co-located with the 37th International Conference on Logic Programming (ICLP 2021), Porto, Portugal (virtual), September 20th-21st, 2021, Volume 2970 of CEUR Workshop Proceedings, CEUR-WS.org, 2021.
    [ BibTeX ]
  5. Johannes Klaus Fichte, Markus Hecher and Valentin Roland 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, Volume 210 of LIPIcs, pages 24:1-24:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
    [ BibTeX | doi  ]
  6. Johannes Klaus Fichte, Markus Hecher, Ciaran McCreesh and Anas Shahab 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, Volume 210 of LIPIcs, pages 25:1-25:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
    [ BibTeX | doi  ]
  7. Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood and Arne Meier Decomposition-Guided Reductions for Argumentation and Treewidth In Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI 2021, Virtual Event / Montreal, Canada, 19-27 August 2021, pages 1880-1886, ijcai.org, 2021.
    [ BibTeX | doi  ]
  8. Michael Bernreiter, Jan Maly and Stefan Woltran Choice Logics and Their Computational Properties In Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI 2021, Virtual Event / Montreal, Canada, 19-27 August 2021, pages 1794-1800, ijcai.org, 2021.
    [ BibTeX | doi  ]
  9. Ringo Baumann, Gerhard Brewka and Markus Ulbricht Comparing Weak Admissibility Semantics to their Dung-style Counterparts (Extended Abstract) In Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI 2021, Virtual Event / Montreal, Canada, 19-27 August 2021, pages 4740-4744, ijcai.org, 2021.
    [ BibTeX | doi  ]
  10. Johannes Klaus Fichte, Markus Hecher, Michael Morak and Stefan Woltran DynASP2.5: Dynamic Programming on Tree Decompositions in Action In Algorithms, 14 (3): 81, 2021.
    [ BibTeX | doi  ]
  11. Wolfgang Dvořák, Matthias König and Stefan Woltran Graph-Classes of Argumentation Frameworks with Collective Attacks In Logics in Artificial Intelligence - 17th European Conference, JELIA 2021, Virtual Event, May 17-20, 2021, Proceedings, Volume 12678 of Lecture Notes in Computer Science, pages 3-17, Springer, 2021.
    [ BibTeX | doi  ]
  12. Wolfgang Dvořák, Alexander Gressler, Anna Rapberger and Stefan Woltran The Complexity Landscape of Claim-Augmented Argumentation Frameworks In Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Virtual Event, February 2-9, 2021, pages 6296-6303, AAAI Press, 2021.
    [ BibTeX ]
  13. Wolfgang Dvořák, Markus Ulbricht and Stefan Woltran Recursion in Abstract Argumentation is Hard - On the Complexity of Semantics Based on Weak Admissibility In Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Virtual Event, February 2-9, 2021, pages 6288-6295, AAAI Press, 2021.
    [ BibTeX ]
  14. Johannes Klaus Fichte, Markus Hecher and Arne Meier Knowledge-Base Degrees of Inconsistency: Complexity and Counting In Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Virtual Event, February 2-9, 2021, pages 6349-6357, AAAI Press, 2021.
    [ BibTeX ]
  15. Jorge Fandinno and Markus Hecher Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard In Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Virtual Event, February 2-9, 2021, pages 6312-6320, AAAI Press, 2021.
    [ BibTeX ]
  16. Johannes Oetsch, Martina Seidl, Hans Tompits and Stefan Woltran Beyond Uniform Equivalence between Answer-set Programs In ACM Trans. Comput. Log., 22 (1): 2:1-2:46, 2021.
    [ BibTeX | doi  ]

2020

  1. Johannes Klaus Fichte, Markus Hecher and Maximilian F. I. Kieler Treewidth-Aware Quantifier Elimination and Expansion for QCSP In Principles and Practice of Constraint Programming - 26th International Conference, CP 2020, Louvain-la-Neuve, Belgium, September 7-11, 2020, Proceedings, Volume 12333 of Lecture Notes in Computer Science, pages 248-266, Springer, 2020.
    [ BibTeX | doi  ]
  2. Johannes Klaus Fichte, Markus Hecher and Stefan Szeider A Time Leap Challenge for SAT-Solving In Principles and Practice of Constraint Programming - 26th International Conference, CP 2020, Louvain-la-Neuve, Belgium, September 7-11, 2020, Proceedings, Volume 12333 of Lecture Notes in Computer Science, pages 267-285, Springer, 2020.
    [ BibTeX | doi  ]
  3. Johannes Klaus Fichte, Markus Hecher and Stefan Szeider Breaking Symmetries with RootClique and LexTopSort In Principles and Practice of Constraint Programming - 26th International Conference, CP 2020, Louvain-la-Neuve, Belgium, September 7-11, 2020, Proceedings, Volume 12333 of Lecture Notes in Computer Science, pages 286-303, Springer, 2020.
    [ BibTeX | doi  ]
  4. Johannes Klaus Fichte, Markus Hecher and André Schidler Solving the Steiner Tree Problem with few Terminals In 32nd IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2020, Baltimore, MD, USA, November 9-11, 2020, pages 293-300, IEEE, 2020.
    [ BibTeX | doi  ]
  5. Markus Hecher Treewidth-aware Reductions of Normal ASP to SAT - Is Normal ASP Harder than SAT after All? In Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, KR 2020, Rhodes, Greece, September 12-18, 2020, pages 485-495, 2020.
    [ BibTeX | doi  ]
  6. Johannes Klaus Fichte, Markus Hecher and Andreas Pfandler Lower Bounds for QBFs of Bounded Treewidth In LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020, pages 410-424, ACM, 2020.
    [ BibTeX | doi  ]
  7. Markus Hecher, Patrick Thier and Stefan Woltran Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology In Theory and Applications of Satisfiability Testing - SAT 2020 - 23rd International Conference, Alghero, Italy, July 3-10, 2020, Proceedings, Volume 12178 of Lecture Notes in Computer Science, pages 343-360, Springer, 2020.
    [ BibTeX | doi  ]
  8. Sarah Alice Gaggl, Thomas Linsbichler, Marco Maratea and Stefan Woltran Design and results of the Second International Competition on Computational Models of Argumentation In Artif. Intell., 279, 2020.
    [ BibTeX | doi  ]
  9. Ricardo Gonçalves, Matthias Knorr, João Leite and Stefan Woltran On the limits of forgetting in Answer Set Programming In Artif. Intell., 286: 103307, 2020.
    [ BibTeX | doi  ]
  10. Manuel Bichler, Michael Morak and Stefan Woltran lpopt: A Rule Optimization Tool for Answer Set Programming In Fundam. Informaticae, 177 (3-4): 275-296, 2020.
    [ BibTeX | doi  ]
  11. Michael Abseher, Bernhard Bliem, Günther Charwat, Frederico Dusberger and Stefan Woltran Computing secure sets in graphs using answer set programming In J. Log. Comput., 30 (4): 837-862, 2020.
    [ BibTeX | pdf  | doi  ]
  12. Gerhard Brewka, Martin Diller, Georg Heissenberger, Thomas Linsbichler and Stefan Woltran Solving Advanced Argumentation Problems with Answer Set Programming In Theory Pract. Log. Program., 20 (3): 391-431, 2020.
    [ BibTeX | doi  ]
  13. Manuel Bichler, Michael Morak and Stefan Woltran selp: A Single-Shot Epistemic Logic Program Solver In Theory Pract. Log. Program., 20 (4): 435-455, 2020.
    [ BibTeX | doi  ]
  14. Markus Hecher, Michael Morak and Stefan Woltran Structural Decompositions of Epistemic Logic Programs In The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, New York, NY, USA, February 7-12, 2020, pages 2830-2837, AAAI Press, 2020.
    [ BibTeX ]
  15. Stefan Woltran Computational Argumentation - Formal Models and Complexity Results (invited talk) In Proceedings of the 35th Italian Conference on Computational Logic - CILC 2020, Rende, Italy, October 13-15, 2020, Volume 2710 of CEUR Workshop Proceedings, pages 2, CEUR-WS.org, 2020.
    [ BibTeX ]
  16. Zeynep Gozen Saribatur, Johannes Peter Wallner and Stefan Woltran Explaining Non-Acceptability in Abstract Argumentation In ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020 - Including 10th Conference on Prestigious Applications of Artificial Intelligence (PAIS 2020), Volume 325 of Frontiers in Artificial Intelligence and Applications, pages 881-888, IOS Press, 2020.
    [ BibTeX | doi  ]
  17. Jan Maly Lifting Preferences over Alternatives to Preferences over Sets of Alternatives: The Complexity of Recognizing Desirable Families of Sets In The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, New York, New York, USA, February 7 -12, 2020., pages 2152-2159, 2020.
    [ BibTeX ]
  18. Michael Bernreiter, Jan Maly and Stefan Woltran 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, Volume 2678 of CEUR Workshop Proceedings, CEUR-WS.org, 2020.
    [ BibTeX ]
  19. Wolfgang Dvořák and Stefan Woltran Complexity of abstract argumentation under a claim-centric view In Artificial Intelligence, 285, 2020.
    [ BibTeX | doi  ]
  20. Bernhard Bliem, Michael Morak, Marius Moldovan and Stefan Woltran The Impact of Treewidth on Grounding and Solving of Answer Set Programs In J. Artif. Intell. Res., 67: 35-80, 2020.
    [ BibTeX | doi  ]
  21. Johannes Klaus Fichte, Markus Hecher, Patrick Thier and Stefan Woltran Exploiting Database Management Systems and Treewidth for Counting In Practical Aspects of Declarative Languages - 22nd International Symposium, PADL 2020, New Orleans, LA, USA, January 20-21, 2020, Proceedings, Volume 12007 of Lecture Notes in Computer Science, pages 151-167, Springer, 2020.
    [ BibTeX | doi  ]

2019

  1. M. Ayaz Dzulfikar, Johannes Klaus Fichte and Markus Hecher The PACE 2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration (Invited Paper) In 14th International Symposium on Parameterized and Exact Computation, IPEC 2019, September 11-13, 2019, Munich, Germany, pages 25:1-25:23, 2019.
    [ BibTeX | doi  ]
  2. Mario Alviano, Carmine Dodaro, Johannes Klaus Fichte, Markus Hecher, Tobias Philipp and Jakob Rath Inconsistency Proofs for ASP: The ASP - DRUPE Format In Theory Pract. Log. Program., 19 (5-6): 891-907, 2019.
    [ BibTeX | doi  ]
  3. Johannes Klaus Fichte, Markus Hecher and Markus Zisser An Improved GPU-Based SAT Model Counter In Principles and Practice of Constraint Programming - 25th International Conference, CP 2019, Stamford, CT, USA, September 30 - October 4, 2019, Proceedings, pages 491-509, 2019.
    [ BibTeX | doi  ]
  4. Jan Maly, Miroslaw Truszczynski and Stefan Woltran Preference Orders on Families of Sets - When Can Impossibility Results Be Avoided? In J. Artif. Intell. Res., 66: 1147-1197, 2019.
    [ BibTeX | doi  ]
  5. Wolfgang Faber, Michael Morak and Stefan Woltran On Uniform Equivalence of Epistemic Logic Programs In Theory and Practice of Logic Programming, 19 (5-6): 826-840, 2019.
    [ BibTeX ]
  6. Johannes Klaus Fichte, Markus Hecher and Andreas Pfandler Untere Schranken für quantifizierte Boole'sche Formeln mit beschränkter Baumweite In 8. Newsletter der GI-Fachgruppe Komplexität, Gastbeitrag, 2019.
    [ BibTeX ]
  7. Johannes Klaus Fichte, Martin Kronegger and Stefan Woltran A multiparametric view on answer set programming In Ann. Math. Artif. Intell., 86 (1-3): 121-147, 2019.
    [ BibTeX | doi  ]
  8. Adrian Haret and Stefan Woltran Belief Revision Operators with Varying Attitudes Towards Initial Beliefs In Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI 2019, Macao, China, August 10-16, 2019, pages 1726-1733, 2019.
    [ BibTeX | doi  ]
  9. Clemens Gangl, Martin Lackner, Jan Maly and Stefan Woltran Aggregating Expert Opinions in Support of Medical Diagnostic Decision-Making In Knowledge Representation for Health Care/ProHealth, KR4HC 2019, Poznan, Poland June 26, 2019, pages 56-62, 2019.
    Position Paper
    [ BibTeX ]
  10. Wolfgang Faber, Michael Morak and Stefan Woltran Strong Equivalence for Epistemic Logic Programs Made Easy In The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, Honolulu, Hawaii, USA, January 27 - February 1, 2019., pages 2809-2816, 2019.
    [ BibTeX ]
  11. Ricardo Gonçalves, Tomi Janhunen, Matthias Knorr, João Leite and Stefan Woltran Forgetting in Modular Answer Set Programming In The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, Honolulu, Hawaii, USA, January 27 - February 1, 2019., pages 2843-2850, 2019.
    [ BibTeX ]
  12. Johannes Klaus Fichte, Markus Hecher and Arne Meier Counting Complexity for Reasoning in Abstract Argumentation In The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, Honolulu, Hawaii, USA, January 27 - February 1, 2019., pages 2827-2834, 2019.
    [ BibTeX ]
  13. Wolfgang Dvorák and Stefan Woltran Complexity of Abstract Argumentation under a Claim-Centric View In The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, Honolulu, Hawaii, USA, January 27 - February 1, 2019., pages 2801-2808, 2019.
    [ BibTeX ]
  14. Günther Charwat and Stefan Woltran Expansion-based QBF Solving on Tree Decompositions In Fundam. Inform., 167 (1-2): 59-92, 2019.
    [ BibTeX | pdf  | doi  ]
  15. Johannes Klaus Fichte and Markus Hecher Treewidth and Counting Projected Answer Sets In Logic Programming and Nonmonotonic Reasoning - 15th International Conference, LPNMR 2019, Philadelphia, PA, USA, June 3-7, 2019, Proceedings, pages 105-119, 2019.
    [ BibTeX | doi  ]

2018

  1. Bernhard Bliem and Stefan Woltran Defensive alliances in graphs of bounded treewidth In Discrete Applied Mathematics, 251, 2018.
    [ BibTeX ]
  2. Nadia Creignou, Reinhard Pichler and Stefan Woltran Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? In Logical Methods in Computer Science, 14 (4), 2018.
    [ BibTeX | doi  ]
  3. Martin Diller, Wolfgang Dvořák, Jörg Pührer Johannes P. Wallner and Stefan Woltran Application of ASP in Formal Argumentation In Workshop on Trends and Applications of Answer Set Programming (taasp) 2018, 2018.
    [ BibTeX ]
  4. Tomi Janhunen, Matthias Knorr, João Leite, Stefan Woltran Ricardo Gonçalves Variable Elimination for DLP-Functions In Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, (KR 2018), pages 643-644, AAAI Press, 2018.
    [ BibTeX ]
  5. Adrian Haret and Stefan Woltran Belief Revision Operators with Varying Attitudes Towards Initial Beliefs In 17th International Workshop on Non-Monotonic Reasoning (NMR 2018), pages 156-167, 2018.
    [ BibTeX ]
  6. Adrian Haret and Johannes Wallner Manipulation of Semantic Aggregation Procedures for Propositional Knowledge Bases and Argumentation Frameworks In 17th International Workshop on Non-Monotonic Reasoning (NMR 2018), pages 146-155, 2018.
    [ BibTeX ]
  7. Johannes K. Fichte and Markus Hecher Exploiting Treewidth for Counting Projected Answer Sets In 17th International Workshop on Non-Monotonic Reasoning (NMR 2018), pages 21-30, 2018.
    [ BibTeX ]
  8. Johannes K. Fichte and Markus Hecher Exploiting Treewidth for Counting Projected Answer Sets In Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, KR 2018, Tempe, Arizona, 30 October - 2 November 2018., pages 639-640, 2018.
    [ BibTeX ]
  9. Johannes K. Fichte, Markus Hecher, Neha Lodha and Stefan Szeider An SMT Approach to Fractional Hypertree Width In Principles and Practice of Constraint Programming, pages 109-127, Springer International Publishing, 2018.
    [ BibTeX | doi  ]
  10. Jan Maly and Stefan Woltran A New Logic for Jointly Representing Hard and Soft Constraints In Proceedings of the Second Workshop on Logics for Reasoning about Preferences, Uncertainty, and Vagueness co-located with the 9th International Joint Conference on Automated Reasoning, PRUV@IJCAR 2018, Oxford, UK, July 19th, 2018., Volume 2157 of CEUR Workshop Proceedings, CEUR-WS.org, 2018.
    [ BibTeX ]
  11. Johannes K. Fichte, Markus Hecher, Stefan Woltran and Markus Zisser Weighted Model Counting on the GPU by Exploiting Small Treewidth In 26th Annual European Symposium on Algorithms (ESA 2018), Dagstuhl, Germany, Volume 112 of LIPIcs, pages 28:1-28:16, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018.
    [ BibTeX | doi  ]
  12. Manuel Bichler, Michael Morak and Stefan Woltran selp: A Single-Shot Epistemic Logic Program Solver In 11th Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2018), 2018.
    [ BibTeX ]
  13. Martin Lackner and Piotr Skowron A Quantitative Analysis of Multi-Winner Rules In Proceedings of the 7th International Workshop on Computational Social Choice (COMSOC 2018), 2018.
    [ BibTeX ]
  14. Phokion G. Kolaitis, Reinhard Pichler, Emanuel Sallinger and Vadim Savenkov Nested Dependencies: Structure and Reasoning In ACM Transactions on Database Systems, 2018.
    To appear.
    [ BibTeX ]
  15. Nadia Creignou, Adrian Haret, Odile Papini and Stefan Woltran Belief Update in the Horn Fragment In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI-18, pages 1781-1787, International Joint Conferences on Artificial Intelligence Organization, 2018.
    [ BibTeX | doi  ]
  16. Jan Maly, Miroslaw Truszczynski and Stefan Woltran 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-18, pages 433-439, International Joint Conferences on Artificial Intelligence Organization, 2018.
    [ BibTeX | doi  ]
  17. Manuel Bichler, Michael Morak and Stefan Woltran Single-Shot Epistemic Logic Program Solving In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI-18, pages 1714-1720, International Joint Conferences on Artificial Intelligence Organization, 2018.
    [ BibTeX | doi  ]
  18. Theresa Csar, Martin Lackner and Reinhard Pichler Computing the Schulze Method for Large-Scale Preference Data Sets In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI-18, pages 180-187, International Joint Conferences on Artificial Intelligence Organization, 2018.
    [ BibTeX | doi  ]
  19. Martin Lackner and Piotr Skowron Approval-Based Multi-Winner Rules and Strategic Voting In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI-18, pages 340-346, International Joint Conferences on Artificial Intelligence Organization, 2018.
    [ BibTeX | doi  ]
  20. Bernhard Bliem ASP Programs with Groundings of Small Treewidth In Foundations of Information and Knowledge Systems, pages 97-113, Springer International Publishing, 2018.
    [ Abstract | BibTeX | doi  ]
  21. Bernhard Bliem and Stefan Woltran Equivalence between answer-set programs under (partially) fixed input In Annals of Mathematics and Artificial Intelligence, 83 (3): 277-295, 2018.
    [ Abstract | BibTeX | doi  ]
  22. Bernhard Bliem Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs In Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017), Dagstuhl, Germany, Volume 58 of OpenAccess Series in Informatics (OASIcs), pages 12:1-12:12, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018.
    [ Abstract | BibTeX | doi  ]
  23. Bernhard Bliem and Stefan Woltran Complexity of Secure Sets In Algorithmica, 80 (10): 2909-2940, 2018.
    [ Abstract | BibTeX | doi  ]
  24. Martin Lackner and Piotr Skowron Consistent Approval-Based Multi-Winner Rules In Proceedings of the 2018 ACM Conference on Economics and Computation, New York, NY, USA, EC '18 , pages 47-48, ACM, 2018.
    [ BibTeX | doi  ]
  25. Haris Aziz, Edith Elkind, Shenwei Huang, Martin Lackner, Luis Sánchez-Fernández and Piotr Skowron On the Complexity of Extended and Proportional Justified Representation In Proceedings of the 32nd AAAI Conference on Artificial Intelligence (AAAI 2018), pages 902-909, AAAI Press, 2018.
    [ BibTeX ]
  26. Piotr Faliszewski, Martin Lackner, Dominik Peters and Nimrod Talmon Effective Heuristics for Committee Scoring Rules In Proceedings of the 32nd AAAI Conference on Artificial Intelligence (AAAI 2018), pages 1023-1030, AAAI Press, 2018.
    [ BibTeX ]
  27. Robert Bredereck, Piotr Faliszewski, Ayumi Igarashi, Martin Lackner and Piotr Skowron Multiwinner Elections with Diversity Constraints In Proceedings of the 32nd AAAI Conference on Artificial Intelligence (AAAI 2018), pages 933-940, AAAI Press, 2018.
    [ BibTeX ]
  28. Johannes Klaus Fichte, Markus Hecher, Michael Morak and Stefan Woltran Exploiting Treewidth for Projected Model Counting and Its Limits In Theory and Applications of Satisfiability Testing - SAT 2018 - 21st International Conference, SAT 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9-12, 2018, Proceedings, pages 165-184, 2018.
    [ BibTeX | doi  ]
  29. Johannes Klaus Fichte, Markus Hecher and Irina Schindler Default Logic and Bounded Treewidth In Language and Automata Theory and Applications - 12th International Conference, LATA 2018, Ramat Gan, Israel, April 9-11, 2018, Proceedings, Volume 10792 of Lecture Notes in Computer Science, pages 130-142, Springer, 2018.
    [ BibTeX ]

2017

  1. Johannes Klaus Fichte, Markus Hecher, Michael Morak and Stefan Woltran DynASP2.5: Dynamic Programming on Tree Decompositions in Action In 12th International Symposium on Parameterized and Exact Computation, IPEC 2017, September 6-8, 2017, Vienna, Austria, Volume 89 of LIPIcs, pages 17:1-17:13, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017.
    [ BibTeX | pdf  ]
  2. Günther Charwat and Stefan Woltran Expansion-based QBF Solving on Tree Decompositions In Proc. of the 24th International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion (RCRA@AI*IA 2017), Volume 2011 of CEUR Workshop Proceedings, pages 16-26, CEUR-WS.org, 2017.
    [ BibTeX ]
  3. Bernhard Bliem, Marius Moldovan, Michael Morak and Stefan Woltran The Impact of Treewidth on ASP Grounding and Solving In Proc. of the 4th International Workshop on Grounding and Transformations for Theories with Variables (GTTV 2017), 2017.
    [ BibTeX | pdf  ]
  4. Johannes Klaus Fichte, Neha Lodha and Stefan Szeider SAT-Based Local Improvement for Finding Tree Decompositions of Small Width In Proc. of the 20th International Conference on Theory and Applications of Satisfiability Testing (SAT 2017), Volume 10491 of LNCS, pages 401-411, Springer, 2017.
    [ BibTeX | doi  ]
  5. Jan Maly and Stefan Woltran Ranking Specific Sets of Objects In Datenbank-Spektrum, 17 (3): 255-265, 2017.
    [ Abstract | BibTeX | doi  ]
  6. Bernhard Bliem Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs Ph.D. Thesis, Fakultät für Informatik an der Technischen Universität Wien, 2017.
    Stefan Woltran advisor.
    [ Abstract | BibTeX | pdf  ]
  7. Günther Charwat BDD-based Dynamic Programming on Tree Decompositions - Towards an Alternative Approach for Efficient QBF Solving Ph.D. Thesis, Fakultät für Informatik an der Technischen Universität Wien, 2017.
    Stefan Woltran advisor.
    [ Abstract | BibTeX ]
  8. Ricardo Gonçalves, Matthias Knorr, João Leite and Stefan Woltran When You Must Forget: Beyond Strong Persistence when Forgetting in Answer Set Programming In Theory and Practice of Logic Programming, 17 (5-6): 837-854, 2017.
    [ Abstract | BibTeX | doi  ]
  9. Michael Abseher, Nysret Musliu and Stefan Woltran htd - A Free, Open-Source Framework for (Customized) Tree Decompositions and Beyond In Proc. of the 14th International Conference on Integration of AI and OR Techniques in Constraint Programming (CPAIOR 2017), Volume 10335 of LNCS, pages 376-386, Springer, 2017.
    [ Abstract | BibTeX | doi  ]
  10. Jan Maly and Stefan Woltran Ranking Specific Sets of Objects In Datenbanksysteme für Business, Technologie und Web (BTW 2017), Volume P-266 of LNI, pages 193-201, GI, 2017.
    [ Abstract | BibTeX ]
  11. Bernhard Bliem and Stefan Woltran Defensive Alliances in Graphs of Bounded Treewidth In CoRR, abs/1707.04251, 2017.
    [ Abstract | BibTeX | pdf  ]
  12. Michael Abseher Tailored tree decompositions for efficient problem solving Ph.D. Thesis, Fakultät für Informatik an der Technischen Universität Wien, 2017.
    Stefan Woltran and Nysret Musliu advisors.
    [ Abstract | BibTeX | pdf  ]
  13. Pierre Bourhis, Michael Morak and Andreas Pieris Making Cross Products and Guarded Ontology Languages Compatible In Proc. of the 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), pages 880-886, AAAI Press, 2017.
    [ Abstract | BibTeX | pdf  ]
  14. Bernhard Bliem, Marius Moldovan, Michael Morak and Stefan Woltran The Impact of Treewidth on ASP Grounding and Solving In Proc. of the 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), pages 852-858, AAAI Press, 2017.
    [ Abstract | BibTeX | pdf  ]
  15. Johannes Klaus Fichte, Markus Hecher, Michael Morak and Stefan Woltran Answer Set Solving with Bounded Treewidth Revisited In CoRR, abs/1702.02890, 2017.
    [ Abstract | BibTeX | pdf  ]
  16. Johannes Klaus Fichte, Markus Hecher, Michael Morak and Stefan Woltran Answer Set Solving with Bounded Treewidth Revisited In Proc. of the 14th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2017), Volume 10377 of LNCS, pages 132-145, Springer, 2017.
    [ Abstract | BibTeX | doi  ]
  17. Johannes Klaus Fichte, Martin Kronegger and Stefan Woltran A Multiparametric View on Answer Set Programming In Proc. of the 10th Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP'17), Volume 1868 of CEUR Workshop Proceedings, CEUR-WS.org, 2017.
    [ Abstract | BibTeX | pdf  ]
  18. Johannes Klaus Fichte and Stefan Szeider Backdoor Trees for Answer Set Programming In Proc. of the 10th Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP'17), Volume 1868 of CEUR Workshop Proceedings, CEUR-WS.org, 2017.
    [ Abstract | BibTeX | pdf  ]
  19. Michael Abseher, Nysret Musliu and Stefan Woltran Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning In Journal of Artificial Intelligence Research, 58: 829-858, 2017.
    [ Abstract | BibTeX | pdf  ]
  20. Mario Alviano, Michael Morak and Andreas Pieris Stable Model Semantics for Tuple-Generating Dependencies Revisited In Proc. of the 36th ACM Symposium on Principles of Database Systems (PODS 2017), pages 377-388, ACM, 2017.
    [ Abstract | BibTeX | doi  ]
  21. Uwe Egly, Martin Kronegger, Florian Lonsing and Andreas Pfandler Conformant Planning as a Case Study of Incremental QBF Solving In Annals of Mathematics and Artificial Intelligence, 80 (1): 21-45, 2017.
    [ Abstract | BibTeX | pdf  ]
  22. Bernhard Bliem, Reinhard Pichler and Stefan Woltran Implementing Courcelle's Theorem in a declarative framework for dynamic programming In Journal of Logic and Computation, 27 (4): 1067-1094, 2017.
    [ Abstract | BibTeX | pdf  ]
  23. Markus Zisser Feature Extraction of Parameterized Complexity Measurements in ASP 2017.
    Bachelor's Thesis, Fakultät für Informatik an der Technischen Universität Wien, Johannes K. Fichte and Stefan Woltran advisors.
    [ BibTeX ]

2016

  1. Manuel Bichler, Michael Morak and Stefan Woltran lpopt: A Rule Optimization Tool for Answer Set Programming In Proc. of the 26th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2016), Volume 10184 of LNCS, pages 114-130, Springer, 2016.
    [ Abstract | BibTeX | doi  ]
  2. Johannes Klaus Fichte, Markus Hecher, Michael Morak and Stefan Woltran Counting Answer Sets via Dynamic Programming In Workshop on Trends and Applications of Answer Set Programming (TAASP 2016), 2016.
    [ Abstract | BibTeX | pdf  ]
  3. Bernhard Bliem, Sebastian Ordyniak and Stefan Woltran Clique-Width and Directed Width Measures for Answer-Set Programming In Workshop on Trends and Applications of Answer Set Programming (TAASP 2016), 2016.
    [ Abstract | BibTeX | pdf  ]
  4. Pablo Barceló, Georg Gottlob and Andreas Pieris Semantic Acyclicity Under Constraints In Proc. of the 10th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW 2016), Volume 1644 of CEUR Workshop Proceedings, CEUR-WS.org, 2016.
    [ BibTeX | pdf  ]
  5. Georg Gottlob, Andreas Pieris and Mantas Simkus The Impact of Active Domain Predicates on Guarded Existential Rules In Proc. of the 10th International Conference on Web Reasoning and Rule Systems (RR 2016), Volume 9898 of LNCS, pages 94-110, Springer, 2016.
    [ Abstract | BibTeX | doi  ]
  6. Marcelo Arenas, Georg Gottlob and Andreas Pieris A Datalog-Based Language for Querying RDF Graphs In Proc. of the 10th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW 2016), Volume 1644 of CEUR Workshop Proceedings, CEUR-WS.org, 2016.
    [ BibTeX | pdf  ]
  7. Pablo Barceló, Georg Gottlob and Andreas Pieris Semantic Acyclicity Under Constraints In Proc. of the 35th ACM Symposium on Principles of Database Systems (PODS 2016), pages 343-354, ACM, 2016.
    [ Abstract | BibTeX | doi  ]
  8. Bernhard Bliem, Benjamin Kaufmann, Torsten Schaub and Stefan Woltran ASP for Anytime Dynamic Programming on Tree Decompositions (Extended Abstract) In Proc. of the 39th German Conference on Artificial Intelligence (KI 2016), Volume 9904 of LNCS, pages 257-263, 2016.
    [ Abstract | BibTeX | pdf  ]
  9. Pierre Bourhis, Marco Manna, Michael Morak and Andreas Pieris Guarded-Based Disjunctive Tuple-Generating Dependencies In ACM Transactions on Database Systems, 41 (4): 27:1-27:45, 2016.
    [ Abstract | BibTeX | doi  ]
  10. Johannes Klaus Fichte, Arne Meier and Irina Schindler Strong Backdoors for Default Logic In Proc. of the 19th International Conference Theory and Applications of Satisfiability Testing (SAT 2016), LNCS , pages 45-59, Springer, 2016.
    [ Abstract | BibTeX | pdf  ]
  11. Johannes Klaus Fichte, Arne Meier and Irina Schindler Strong Backdoors for Default Logic In CoRR, abs/1602.06052, 2016.
    [ Abstract | BibTeX | pdf  ]
  12. Manuel Bichler, Michael Morak and Stefan Woltran The Power of Non-Ground Rules in Answer Set Programming In Theory and Practice of Logic Programming, 16 (5-6): 552-569, 2016.
    [ Abstract | BibTeX | doi  ]
  13. Bernhard Bliem, Markus Hecher and Stefan Woltran On Efficiently Enumerating Semi-Stable Extensions via Dynamic Programming on Tree Decompositions In Proc. of the 6th International Conference on Computational Models of Argument (COMMA 2016), Volume 287 of Frontiers in Artificial Intelligence and Applications, pages 107-118, IOS Press, 2016.
    [ Abstract | BibTeX | doi  ]
  14. Georg Heissenberger and Stefan Woltran GrappaVis - A System for Advanced Graph-Based Argumentation In Proc. of the 6th International Conference on Computational Models of Argument (COMMA 2016), Volume 287 of Frontiers in Artificial Intelligence and Applications, pages 473-474, IOS Press, 2016.
    [ Abstract | BibTeX | system page  | doi  ]
  15. Bernhard Bliem, Sebastian Ordyniak and Stefan Woltran Clique-Width and Directed Width Measures for Answer-Set Programming In Proc. of the 22nd European Conference on Artificial Intelligence (ECAI 2016), Volume 285 of FAIA, pages 1105-1113, IOS Press, 2016.
    [ Abstract | BibTeX | doi  ]
  16. Michael Abseher, Marius Moldovan and Stefan Woltran Providing Built-In Counters in a Declarative Dynamic Programming Environment In Proc. of the 39th German Conference on Artificial Intelligence (KI 2016), Volume 9904 of LNCS, pages 3-16, Springer, 2016.
    [ Abstract | BibTeX | doi  ]
  17. Günther Charwat and Stefan Woltran Dynamic Programming-based QBF Solving In Proc. of the 4th International Workshop on Quantified Boolean Formulas (QBF 2016), Volume 1719 of CEUR Workshop Proceedings, pages 27-40, CEUR-WS.org, 2016.
    [ Abstract | BibTeX | pdf  ]
  18. Bernhard Bliem, Günther Charwat, Markus Hecher and Stefan Woltran D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy In Fundamenta Informaticae, 147 (1): 27-61, 2016.
    [ Abstract | BibTeX | doi  ]
  19. Michael Abseher, Martin Gebser, Nysret Musliu, Torsten Schaub and Stefan Woltran Shift Design with Answer Set Programming In Fundamenta Informaticae, 147 (1): 1-25, 2016.
    [ Abstract | BibTeX | doi  ]
  20. Georg Heissenberger A System For Advanced Graphical Argumentation Formalisms Master's Thesis, Fakultät für Informatik an der Technischen Universität Wien, 2016.
    Stefan Woltran and Martin Diller advisors.
    [ Abstract | BibTeX | pdf  | system page  ]
  21. Gerald Berger and Andreas Pieris Ontology-Mediated Queries Distributing over Components In Proc. of the 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), pages 943-949, AAAI Press, 2016.
    [ Abstract | BibTeX | pdf  ]
  22. Bernhard Bliem, Robert Bredereck and Rolf Niedermeier Complexity of Efficient and Envy-Free Resource Allocation: Few Agents, Resources, or Utility Levels In Proc. of the 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), pages 102-108, AAAI Press, 2016.
    [ Abstract | BibTeX | pdf  ]
  23. Bernhard Bliem, Benjamin Kaufmann, Torsten Schaub and Stefan Woltran ASP for Anytime Dynamic Programming on Tree Decompositions In Proc. of the 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), pages 979-986, AAAI Press, 2016.
    [ Abstract | BibTeX | pdf  ]
  24. Bernhard Bliem and Stefan Woltran Equivalence between Answer-Set Programs under (Partially) Fixed Input In Proc. of the Ninth International Symposium on Foundations of Information and Knowledge Systems (FoIKS 2016), Volume 9616 of LNCS, pages 95-111, Springer, 2016.
    [ Abstract | BibTeX | pdf  ]
  25. Bernhard Bliem, Günther Charwat, Markus Hecher and Stefan Woltran Subset Minimization in Dynamic Programming on Tree Decompositions In AAAI-16 Workshop on Beyond NP, WS-16-05 , pages 300-306, 2016.
    [ Abstract | BibTeX | pdf  ]
  26. Theresa Csar, Martin Lackner, Reinhard Pichler and Emanuel Sallinger Winner Determination in Huge Elections with MapReduce In Proc. of the 10th Multidisciplinary Workshop on Advances in Preference Handling (MPREF 2016), 2016.
    [ Abstract | BibTeX | pdf  ]
  27. Thomas Ambroz and Andreas Jusits Designing a System for the Experimental Analysis and Visualization of Dynamic Programming on Tree Decompositions Master's Thesis, Fakultät für Informatik an der Technischen Universität Wien, 2016.
    Stefan Woltran and Günther Charwat advisors.
    [ Abstract | BibTeX | system page  ]
  28. Bernhard Bliem and Stefan Woltran Complexity of Secure Sets In 41st International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2015), Volume 9224 of LNCS, pages 64-77, Springer, 2016.
    [ Abstract | BibTeX | doi  ]
  29. Marie-Louise Bruner and Martin Lackner A Fast Algorithm for Permutation Pattern Matching Based on Alternating Runs In Algorithmica, 75 (1): 84-117, 2016.
    [ Abstract | BibTeX | pdf  ]

2015

  1. Michael Abseher, Bernhard Bliem, Günther Charwat, Frederico Dusberger and Stefan Woltran Computing Secure Sets in Graphs using Answer Set Programming In Journal of Logic and Computation, 2015.
    (Special issue of ASPOCP 2014)
    [ Abstract | BibTeX | pdf  ]
  2. Johannes Klaus Fichte Backdoors to Tractability of Disjunctive Answer Set Programming Ph.D. Thesis, Fakultät für Informatik an der Technischen Universität Wien, 2015.
    Stefan Szeider advisor.
    [ Abstract | BibTeX | pdf  ]
  3. Stefan Woltran Dynamic Programming on Tree Decompositions in Practice - Some Lessons Learned In 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2015), pages 22, IEEE Computer Society, 2015.
    [ Abstract | BibTeX | doi  ]
  4. Marius Moldovan Implementing variations of the Traveling Salesperson Problem in a declarative dynamic programming environment Master's Thesis, Fakultät für Informatik an der Technischen Universität Wien, 2015.
    Stefan Woltran and Michael Abseher advisors.
    [ Abstract | BibTeX | pdf  ]
  5. Markus Hecher Optimizing Second-Level Dynamic Programming Algorithms Master's Thesis, Fakultät für Informatik an der Technischen Universität Wien, 2015.
    Stefan Woltran and Bernhard Bliem advisors.
    [ Abstract | BibTeX | pdf  ]
  6. Manuel Bichler Optimizing Non-Ground Answer Set Programs via Rule Decomposition 2015.
    Bachelor's Thesis, Fakultät für Informatik an der Technischen Universität Wien, Stefan Woltran advisor.
    [ Abstract | BibTeX | pdf  ]
  7. Johannes Klaus Fichte and Stefan Szeider Backdoors to Normality for Disjunctive Logic Programs In ACM Trans. Comput. Logic, 17 (1): 7:1-7:23, 2015.
    Extended and updated version of a paper that appeared in Proc. of the 27th AAAI Conference on Artificial Intelligence (AAAI'13).
    [ Abstract | BibTeX | doi  ]
  8. Günther Charwat Dynamic Programming on Tree Decompositions using Binary Decision Diagrams: Research Summary In Proc. of the Technical Communications of the 31st International Conference on Logic Programming (ICLP 2015), Volume 1433 of CEUR Workshop Proceedings, CEUR-WS.org, 2015.
    [ Abstract | BibTeX | pdf  ]
  9. Sarah Alice Gaggl, Norbert Manthey, Alessandro Ronca, Johannes Peter Wallner and Stefan Woltran Improved answer-set programming encodings for abstract argumentation In Theory and Practice of Logic Programming, 15 (4-5): 434-448, 2015.
    [ Abstract | BibTeX | pdf  ]
  10. Bernhard Bliem, Günther Charwat, Markus Hecher and Stefan Woltran D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy In Eighth Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2015), 2015.
    [ Abstract | BibTeX | pdf  | system page  ]
  11. Michael Abseher, Martin Gebser, Nysret Musliu, Torsten Schaub and Stefan Woltran Shift Design with Answer Set Programming In Eighth Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2015), 2015.
    [ Abstract | BibTeX | pdf  ]
  12. Günther Charwat and Stefan Woltran Efficient Problem Solving on Tree Decompositions using Binary Decision Diagrams In Proc. of the 13th International Conference on Logic Programming and Non-monotonic Reasoning (LPNMR 2015), Volume 9345 of LNCS, pages 213-227, Springer, 2015.
    [ Abstract | BibTeX | pdf  | slides  ]
  13. Michael Abseher, Martin Gebser, Nysret Musliu, Torsten Schaub and Stefan Woltran Shift-design with Answer Set Programming In Proc. of the 13th International Conference on Logic Programming and Non-monotonic Reasoning (LPNMR 2015), d by ASP yet., Volume 9345 of LNCS, pages 32-39, Springer, 2015.
    [ Abstract | BibTeX | pdf  | slides  ]
  14. Günther Charwat and Andreas Pfandler Democratix: A Declarative Approach to Winner Determination In Proc. of the 4th International Conference on Algorithmic Decision Theory (ADT 2015), Volume 9346 of LNCS, pages 253-269, Springer, 2015.
    [ Abstract | BibTeX | pdf  | slides  | system page  ]
  15. Gabor Erdelyi, Martin Lackner and Andreas Pfandler Manipulation of k-Approval in Nearly Single-Peaked Electorates In Proc. of the 4th International Conference on Algorithmic Decision Theory (ADT 2015), Volume 9346 of LNCS, pages 71-85, 2015.
    [ Abstract | BibTeX | pdf  ]
  16. Michael Abseher, Frederico Dusberger, Nysret Musliu and Stefan Woltran Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning In Proc. of the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015), pages 275-282, AAAI Press, 2015.
    [ Abstract | BibTeX | pdf  ]
  17. Andreas Pfandler, Stefan Rümmele, Johannes Peter Wallner and Stefan Woltran On the Parameterized Complexity of Belief Revision In Proc. of the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015), pages 3149-3155, AAAI Press, 2015.
    [ Abstract | BibTeX | pdf  ]
  18. Andreas Pfandler and Emanuel Sallinger Distance-Bounded Consistent Query Answering In Proc. of the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015), pages 2262-2269, AAAI Press, 2015.
    [ Abstract | BibTeX | pdf  ]
  19. Georg Gottlob, Marco Manna and Andreas Pieris Polynomial Rewritings for Linear Existential Rules In Proc. of the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015), pages 2992-2998, AAAI Press, 2015.
    [ Abstract | BibTeX | pdf  ]
  20. Georg Gottlob and Andreas Pieris Beyond SPARQL under OWL 2 QL Entailment Regime: Rules to the Rescue In Proc. of the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015), pages 2999-3007, AAAI Press, 2015.
    [ Abstract | BibTeX | pdf  ]
  21. Edith Elkind and Martin Lackner Structure in Dichotomous Preferences In Proc. of the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015), pages 2019-2025, AAAI Press, 2015.
    [ Abstract | BibTeX | pdf  ]
  22. Johannes Klaus Fichte, Miroslaw Truszczńsky and Stefan Woltran Dual-normal Logic Programs -- the Forgotten Class In Theory and Practice of Logic Programming, 15: 495-510, 2015.
    [ Abstract | BibTeX | doi  ]
  23. Georg Gottlob, Michael Morak and Andreas Pieris Recent Advances in Datalog+/- In Reasoning Web Summer School (RW 2015), Volume 9203 of LNCS, pages 193-217, Springer, 2015.
    [ Abstract | BibTeX ]
  24. Theresa Csar, Reinhard Pichler, Emanuel Sallinger and Vadim Savenkov Using Statistics for Computing Joins with MapReduce In Proc. of the 9th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW 2015), Volume 1378 of CEUR Workshop Proceedings, CEUR-WS.org, 2015.
    [ BibTeX | pdf  ]
  25. Georg Gottlob, Marco Manna and Andreas Pieris Polynomial Combined Rewritings for Linear Existential Rules and DL-Lite with n-ary Relations In Proc. of the 28th International Workshop on Description Logics (DL 2015), Volume 1350 of CEUR Workshop Proceedings, CEUR-WS.org, 2015.
    [ BibTeX | pdf  ]
  26. Georg Gottlob, Reinhard Pichler and Emanuel Sallinger Function Symbols in Tuple-Generating Dependencies: Expressive Power and Computability In Proc. of the 34th ACM Symposium on Principles of Database Systems (PODS 2015), pages 65-77, ACM, 2015.
    [ Abstract | BibTeX | doi  ]
  27. Mario Alviano and Andreas Pieris Default Negation for Non-Guarded Existential Rules In Proc. of the 34th ACM Symposium on Principles of Database Systems (PODS 2015), pages 79-90, ACM, 2015.
    [ Abstract | BibTeX | doi  ]
  28. Marco Calautti, Georg Gottlob and Andreas Pieris Chase Termination for Guarded Existential Rules In Proc. of the 34th ACM Symposium on Principles of Database Systems (PODS 2015), pages 91-103, ACM, 2015.
    [ Abstract | BibTeX | doi  ]
  29. Marco Calautti, Georg Gottlob and Andreas Pieris Chase Termination for Guarded Existential Rules In Proc. of the 9th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW 2015), Volume 1378 of CEUR Workshop Proceedings, CEUR-WS.org, 2015.
    [ Abstract | BibTeX | pdf  ]
  30. Thomas Lukasiewicz, Maria Vanina Martinez, Andreas Pieris and Gerardo I. Simari From Classical to Consistent Query Answering under Existential Rules In Proc. of the 9th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW 2015), Volume 1378 of CEUR Workshop Proceedings, CEUR-WS.org, 2015.
    [ Abstract | BibTeX | pdf  ]
  31. Thomas Lukasiewicz, Maria Vanina Martinez, Andreas Pieris and Gerardo I. Simari From Classical to Consistent Query Answering under Existential Rules In Proc. of the 29th AAAI Conference on Artificial Intelligence (AAAI 2015), pages 1546-1552, AAAI Press, 2015.
    [ Abstract | BibTeX | pdf  ]
  32. Günther Charwat, Wolfgang Dvořák, Sarah Alice Gaggl, Johannes Peter Wallner and Stefan Woltran Methods for Solving Reasoning Problems in Abstract Argumentation - A Survey In Artificial Intelligence, 220 (0): 28-63, 2015.
    [ Abstract | BibTeX | doi  ]
  33. Johannes Klaus Fichte and Stefan Szeider Backdoors to Tractable Answer-Set Programming In Arificial Intelligence, 220 (0): 64-103, 2015.
    Extended and updated version of a paper that appeared in Proc. of the 22nd International Conference on Artificial Intelligence (IJCAI'11).
    [ Abstract | BibTeX | doi  ]

2014

  1. Bernhard Bliem and Stefan Woltran Complexity of Secure Sets In CoRR, abs/1411.6549, 2014.
    [ BibTeX | pdf  ]
  2. Michael Abseher, Bernhard Bliem, Günther Charwat, Frederico Dusberger, Markus Hecher and Stefan Woltran The D-FLAT System for Dynamic Programming on Tree Decompositions In Proc. of the 14th European Conference on Logics in Artificial Intelligence (JELIA 2014), Volume 8761 of LNCS, pages 558-572, Springer, 2014.
    [ Abstract | BibTeX | pdf  | system page  ]
  3. Michael Abseher, Bernhard Bliem, Günther Charwat, Frederico Dusberger, Markus Hecher and Stefan Woltran The D-FLAT System for Dynamic Programming on Tree Decompositions In Fourth International Workshop on Logic and Search (LaSh 2014), 2014.
    [ Abstract | BibTeX | pdf  | system page  ]

Technical Reports

2016

  1. Johannes K. Fichte, Markus Hecher, Michael Morak and Stefan Woltran Answer Set Solving using Tree Decompositions and Dynamic Programming -- The DynASP2 System Technical Report DBAI-TR-2016-101, DBAI, Fakultät für Informatik an der Technischen Universität Wien, 2016.
    [ Abstract | BibTeX | pdf  ]
  2. Johannes K. Fichte, Martin Kronegger and Stefan Woltran Multiparametric View on Answer Set Programming Technical Report DBAI-TR-2016-99, DBAI, Fakultät für Informatik an der Technischen Universität Wien, 2016.
    [ Abstract | BibTeX | pdf  ]
  3. Johannes K. Fichte and Stefan Szeider Backdoor Trees for Answer Set Programming Technical Report DBAI-TR-2016-98, DBAI, Fakultät für Informatik an der Technischen Universität Wien, 2016.
    [ Abstract | BibTeX | pdf  ]
  4. Manuel Bichler, Bernhard Bliem, Marius Moldovan, Michael Morak and Stefan Woltran Treewidth-Preserving Modeling in ASP Technical Report DBAI-TR-2016-97, DBAI, Fakultät für Informatik an der Technischen Universität Wien, 2016.
    [ Abstract | BibTeX | pdf  ]
  5. Michael Abseher, Nysret Musliu and Stefan Woltran htd -- A Free, Open-Source Framework for Tree Decompositions and Beyond Technical Report DBAI-TR-2016-96, DBAI, Fakultät für Informatik an der Technischen Universität Wien, 2016.
    [ Abstract | BibTeX | pdf  ]
  6. Günther Charwat and Stefan Woltran BDD-based Dynamic Programming on Tree Decompositions Technical Report DBAI-TR-2016-95, DBAI, Fakultät für Informatik an der Technischen Universität Wien, 2016.
    [ Abstract | BibTeX | pdf  ]
  7. Michael Abseher, Nysret Musliu and Stefan Woltran Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning Technical Report DBAI-TR-2016-94, DBAI, Fakultät für Informatik an der Technischen Universität Wien, 2016.
    [ Abstract | BibTeX | pdf  ]

2015

  1. Bernhard Bliem, Günther Charwat, Markus Hecher and Stefan Woltran D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy Technical Report DBAI-TR-2015-93, DBAI, Fakultät für Informatik an der Technischen Universität Wien, 2015.
    [ Abstract | BibTeX | pdf  ]
Top
Last updated: 2022-10-09 14:14

Home / Kontakt / Webmaster / Offenlegung gemäß § 25 Mediengesetz: Inhaber der Website ist das Institut für Logic and Computation an der Technischen Universität Wien, 1040 Wien. Die TU Wien distanziert sich von den Inhalten aller extern gelinkten Seiten und übernimmt diesbezüglich keine Haftung. Disclaimer / Datenschutzerklärung