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

PhD thesis on dynamic programming and QBF solving

2017-09-22
Defense

Team member Günther Charwat successfully defended his PhD thesis BDD-based dynamic programming on tree decompositions, which includes a novel expansion-based approach for QBF solving (resulting in the QBF solver dynQBF).

The thesis abstract is available here.

Congratulations!

PACE'17 Challenge results

2017-09-06
PACE'17 (heuristic treewidth decomposition): 3rd place certiciate

Our tree decomposition library htd successfully participated in the PACE'17 challenge and achieved the third place in the "heuristic treewidth decomposition" track.


PACE'17 (heuristic tree decomposition): handover of certificates

Certificates were issued in course of the IPEC'17 conference. Thank you to the competition organizers!

We will provide a link to the official challence results when they are available on the webpage of the PACE'17 challenge.

QBF Evaluation'17 results

2017-08-31

We are happy to announce that our tree decomposition-based QBF solver dynQBF is ranked eight (out of 29 participants) in the 2-QBF track and 13th (out of 30 participants) in the PCNF track of the competitive evaluation of QBF solvers 2017 (QBFEval'17).

The QBF competition provides invaluable insights into state-of-the-art QBF solving. We would thus like to thank the organizers for all their effort!

LPNMR'17 and IPEC'17 contributions

2017-07

The following papers have been accepted: Answer Set Solving with Bounded Treewidth Revisited (at LPNMR'17, the paper is available here), and DynASP2.5: Dynamic Programming on Tree Decompositions in Action (at IPEC'17, see our preprint).

dynQBF 1.0.0

2017-06-25

We prepared a major release of our QBF solver dynQBF. dynQBF 1.0.0 (final) is available for download (sources and binary) at https://github.com/gcharwat/dynqbf/releases.

PhD finished

2017-04-28

Team member Michael Abseher successfully defended his PhD thesis Tailored Tree Decompositions for Efficient Problem Solving. The thesis abstract is available here. Congratulations!

JAIR journal publication

2017-04-25

We are happy to announce that our article Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning is now publicly available. You can download the article here.

IJCAI'17: Accepted paper

2017-04-24

We are looking forward to present our paper The Impact of Treewidth on ASP Grounding and Solving at IJCAI'17 (August 19-25, 2017) in Melbourne, Australia. The paper is available here.


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
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.

2017

  1. 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  ]
  2. 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  ]
  3. 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 ]
  4. 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  ]
  5. 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.
    [ BibTeX ]
  6. 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.
    [ BibTeX ]
  7. 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  ]
  8. 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), 2017.
    To appear.
    [ BibTeX ]
  9. 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, 2017.
    Early access available, to appear.
    [ Abstract | BibTeX | pdf  ]
  10. Bernhard Bliem, Reinhard Pichler and Stefan Woltran Implementing Courcelle's Theorem in a declarative framework for dynamic programming In Journal of Logic and Computation, 2017.
    Early access available, to appear.
    [ Abstract | BibTeX | doi  ]
  11. Phokion G. Kolaitis, Reinhard Pichler, Emanuel Sallinger and Vadim Savenkov Nested Dependencies: Structure and Reasoning In ACM Transactions on Database Systems, 2017.
    To appear.
    [ BibTeX ]
  12. 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. To appear.
    [ BibTeX ]

2016

  1. Manuel Bichler, Michael Morak and Stefan Woltran lpopt: A Rule Optimization Tool for Answer Set Programming In Pre-Proc. of the 26th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2016), 2016.
    [ Abstract | BibTeX | pdf  ]
  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: 2017-09-22 22:03

Home / Kontakt / Webmaster / Offenlegung gemäß § 25 Mediengesetz: Inhaber der Website ist das Institut für Informationssysteme 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.