Skip to Content

TU Wien Fakultät für Informatik KBS Knowledge-Based Systems Group
Top-level Navigation: Current-level Navigation:

Path: KBS > research > projects > mmdasp >

Tools: Drucken

Project: Methods and Methodologies for Developing Answer-Set Programs

"The M&M's of ASP"

(supported by the Austrian Science Foundation (FWF) under grant P21698.)

Project start: 01.09.2009

Duration: 36 months

Contents

Project team

Project Leader:

Project staff:

Project context

Answer-set programming (ASP) is an important formalism for declarative problem solving and nonmonotonic reasoning, having a model-oriented view for knowledge representation, i.e., models constitute answers to problems rather than proofs as in traditional logic-based approaches. Although different realisations of the ASP paradigm exist, it is usually identified with logic programming under the answer-set semantics, which we shall deal with in this project. The high relevance of this particular formalism lies not only in its intuitive character but is also due to the availability of sophisticated solvers, which lead to successful applications in diverse areas like diagnosis, planning, database repair, and Semantic-Web reasoning. However, a main obstacle for a wider acceptance of ASP is a lack of techniques for supporting the development of answer-set programs. Indeed, the need for tools, methods, and methodologies that ease the programming process has been clearly recognised in the ASP community, but, except for some preliminary work, no systematic study in this direction has been put forth so far.

Goal of the project

In this project, we address this challenging issue by providing adequate principles and techniques that are aimed to support the answer-set programmer during development. Generally, the focus of our research will be on methodologies for systematic program development, program testing, and debugging. In particular, in working on these areas, special emphasis will be given to modular programming concepts and to the ability of the developed techniques to respect the declarative nature of ASP. To support a sufficient level of applicability, we plan to offer solutions not only for the core language of ASP but also for important extensions thereof that are commonly used and realised in various answer-set solvers. Moreover, we will consider complexity and decidability issues for the identified methods whenever relevant and provide restricted techniques and approximations where needed. The methods resulting from the project should be incorporated in an integrated development environment for ASP that combines straightforward as well as advanced techniques realising a convenient tool for developing answer-set programs. In order to reach our goals, we will mainly rely on formal, logic-based methods, suitable for innovative novel support techniques for a declarative language. The availability of intelligent development methodologies and tools will have a major impact on the field of ASP as a whole, significantly advancing the state of the art. Furthermore, with such techniques at hand, both expert as well as novice programmers will have an enhanced access to powerful declarative problem-solving machineries.

Software

Available tasks for labs (Praktika) or master's theses (Diplom-/Masterarbeiten)

Publications

    2011

  1. J. Oetsch, J. Pührer, H. Tompits:
    "Extending Object-Oriented Languages by Declarative Specifications of Complex Objects using Answer-Set Programming";
    Submitted to: "34th International Conference on Software Engineering (ICSE 2012), NIER Track".

  2. P. Brosch, U. Egly, S. Gabmeyer, G. Kappel, M. Seidl, H. Tompits, M. Widl, M. Wimmer:
    "Towards Semantics-Aware Merge Support in Optimistic Model Versioning";
    In: "International Workshop on Models and Evolution (ME 2011)".

  3. J. Oetsch, J. Pührer, H. Tompits:
    "The SeaLion has Landed: An IDE for Answer-Set Programming-Preliminary Report";
    In: "25th Workshop on Logic Programming (WLP 2011)", INFSYS Research Report 1843-11-06, 141 - 151.

  4. C. Kloimüllner, J. Oetsch, J. Pührer, H. Tompits:
    "Kara: A System for Visualising and Visual Editing of Interpretations for Answer-Set Programs";
    In: "25th Workshop on Logic Programming (WLP 2011)", INFSYS Research Report 1843-11-06, 152 - 164.

  5. E. Erdem, K. Inoue, J. Oetsch, J. Pührer, H. Tompits, C. Yilmaz:
    "Answer-Set Programming as a new Approach to Event-Sequence Testing";
    In: "3rd International Conference on Advances in System Testing and Validation Lifecycle (VALID 2011)", XPS, 25 - 34.

  6. J. Oetsch, J. Pührer, M. Seidl, H. Tompits, P. Zwickl:
    "VIDEAS: Supporting Answer-Set Program Development using Model-Driven Engineering Techniques";
    In: "MELO 2011 - Model-Driven Engineering, Logic and Optimization: friends or foes?"

  7. T. Janhunen, I. Niemelä, J. Oetsch, J. Pührer, H. Tompits:
    "Random vs. Structure-Based Testing of Answer-Set Programs: An Experimental Comparison";
    In: "11th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2011)", Springer, LNCS, 6645 (2011), 242 - 247.

  8. J. Oetsch, H. Tompits:
    "Gentzen-Type Refutation Systems for Three-Valued Logics with an Application to Disproving Strong Equivalence";
    In: "11th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2011)", Springer, LNCS, 6645 (2011), 254 - 259.

  9. J. Oetsch, J. Pührer, H. Tompits:
    "Stepping through an Answer-Set Program ";
    In: "11th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2011)", Springer, LNCS, 6645 (2011), 134 - 147.

  10. J. Oetsch, J. Pührer, M. Seidl, H. Tompits, P. Zwickl:
    "VIDEAS: A Development Tool for Answer-Set Programs based on Model-Driven Engineering Technology ";
    In: "11th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2011)", Springer, LNCS, 6645 (2011), 382 - 387.

  11. J. De Bruijn, T. Eiter, A. Polleres, H. Tompits:
    "Embedding non-ground logic programs into autoepistemic logic for knowledge base combination";
    ACM TOCL, to appear, 2011.

    12. 2010

  12. T. Janhunen, I. Niemelä, J. Oetsch, J. Pührer, H. Tompits:
    "On Testing Answer-Set Programs";
    In: "19th European Conference on Artificial Intelligence (ECAI 2010)", H. Coelho, R. Studer, M. Wooldridge (ed.); IOS Press, Volume 215 of Frontiers in Artificial Intelligence and Applications (2010), ISBN: 978-1-60750-605-8; 951 - 956.

  13. J. Oetsch, J. Pührer, H. Tompits:
    "Catching the Ouroboros: On Debugging Non-ground Answer-Set Programs";
    In: "26th International Conference on Logic Programming (ICLP 2010)", M. Hermenegildo, T. Schaub (ed.); Theory and Practice of Logic Programming / Cambridge University Press, 10 / 4-6 / Cambridge, England, United Kingdom (2010), ISSN: 1471-0684; 513 - 529.

  14. J. Oetsch, J. Pührer, M. Schwengerer, H. Tompits:
    "The System Kato: Detecting Cases of Plagiarism for Answer-Set Programs";
    In: "26th International Conference on Logic Programming (ICLP 2010)", M. Hermenegildo, T. Schaub (ed.); Theory and Practice of Logic Programming / Cambridge University Press, 10 / 4-6 / Cambridge, England, United Kingdom (2010), ISSN: 1471-0684; 759 - 775.

  15. J. Oetsch, J. Pührer, H. Tompits:
    "Methods and Methodologies for Developing Answer-Set Programs---Project Description";
    In: "Technical Communications of the 26th International Conference on Logic Programming (ICLP 2010)", M. Hermenegildo, T. Schaub (ed.); Leibniz International Proceedings in Informatics / Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 7 / Dagstuhl, Germany (2010), ISBN: 978-3-939897-17-0; 154 - 161.

  16. J. Oetsch, J. Puehrer, H. Tompits:
    "Let's Break the Rules: Interactive Procedural-Style Debugging of Answer-Set Programs";
    In: "24th Workshop on (Constraint) Logic Programming WLP'2010", S. Abdennadher (ed.); Technical Report, Faculty of Media Engineering and Technology, German University in Cairo, Cairo, Egypt (2010), 77 - 87.

  17. J. Oetsch, H. Tompits:
    "Gentzen-type Refutation Systems for Three-Valued Logics";
    In: "24th Workshop on (Constraint) Logic Programming WLP'2010", S. Abdennadher (ed.); Technical Report, Faculty of Media Engineering and Technology, German University in Cairo, Cairo, Egypt (2010), 88 - 98.

  18. J. Pührer, S. Heymans, T. Eiter:
    "Dealing with Inconsistency when Combining Ontologies and Rules using DL-Programs";
    In: "The Semantic Web: Research and Applications, 7th Extended Semantic Web Conference", L. Aroyo, G. Antoniou, E. Hyvönen, A. ten Teije, H. Stuckenschmidt, L. Cabral, T. Tudorache (ed.); Springer, 6088 (2010), ISBN: 978-3-642-13485-2; 183 -197.

    19. 2009

  19. J. Oetsch, M. Schwengerer, H. Tompits:
    "Kato: A Plagiarism-Detection Tool for Answer-Set Programs";
    In: "23rd Workshop on (Constraint) Logic Programming", A. Wolf, U. Geske (ed.); Universitätsverlag Potsdam, (2009), ISBN: 978-3-86956-026-7; 75 - 79.

  20. J. Oetsch, M. Seidl, H. Tompits, S. Woltran:
    "ccT on Stage: Generalised Uniform Equivalence Testing for Verifying Student Assignment Solutions";
    In: "Logic Programming and Nonmonotonic Reasoning", E. Erdem, F. Lin, T. Schaub (ed.); Springer, 5753 (2009), ISBN: 978-3-642-04237-9; 382 - 395;

  21. J. Pührer, H. Tompits:
    "Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection";
    In: "Logic Programming and Nonmonotonic Reasoning", E. Erdem, F. Lin, T. Schaub (ed.); Springer, 5753 (2009), ISBN: 978-3-642-04237-9; 264 - 276.

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