Hans Tompits
Ao.Univ.Prof. Mag.rer.nat. Dr.techn.
Research Focus
- Logic and Computation: 100%
Research Areas
- computational logic, declarative logic programming, computational complexity, nonmonotonic reasoning, knowledge representation
About
Basic Research in logic-based Artificial Intelligence, computational Logic and logical Programming (Answer-Set Programming)
Roles
-
Associate Professor
Knowledge-Based Systems, E192-03 -
Curriculum Coordinator
Master Logic and Computation
Courses
2024W
- Artificial Intelligence Seminar / 184.068 / SE
- Bachelor Thesis for Computer Science and Business Informatics / 184.713 / PR
- Introduction to Knowledge-based Systems / 192.023 / VU
- Introduction to Quantum Computing, Complexity Theory, and Algorithmics / 192.042 / VU
- Logic for Knowledge Representation / 192.025 / VU
- Project in Computer Science 1 / 192.021 / PR
- Project in Computer Science 2 / 192.022 / PR
- Quantum Computing / 192.070 / VU
- Quantum Computing, Complexity Theory, and Algorithmics / 192.043 / VU
- Refutation Systems / 192.094 / VO
- Seminar for PhD Students / 184.721 / SE
- Seminar in Knowledge Representation and Reasoning / 184.712 / SE
- Seminar in Logic / 184.264 / SE
- Seminar in Theoretical Computer Science / 184.067 / SE
2025S
- Project in Computer Science 1 / 192.021 / PR
- Project in Computer Science 2 / 192.022 / PR
Projects
-
FAME: Formalizing and Managing Evolution in Model-Driven Engineering
2011 – 2014 / Vienna Science and Technology Fund (WWTF)
Publications: 157902 / 53735 / 53833 / 54407 / 54893 / 54894 / 55748 / 55974 / 55980 -
Methods and Methodologies for Developing Answer-Set Programs
2009 – 2013 / Austrian Science Fund (FWF)
Publications: 155838 / 162603 / 164382 / 23778 / 27700 / 52709 / 52745 / 52746 / 53224 / 53225 / 53226 / 53227 / 53228 / 53229 / 53230 / 53753 / 53754 / 53755 / 53756 / 53757 / 53785 / 53786 / 53787 / 54274 / 54275 / 54277 / 54279 / 54280 / 55044 / 55045 -
Formal Methods for Optimizing Nonmonotonic Logic Programs
2005 – 2008 / Austrian Science Fund (FWF)
Publications: 52303 / 52304 / 52413 / 52414 / 52542 / 52555 / 52556
Publications
2022
- Cross-Industry Overview of Fault-Tolerant Approaches used in Autonomous Systems / Horeis, T. F., Plinke, F., Kain, T., Tompits, H., Rinaldo, R. C., & Heinrich, J. (2022). Cross-Industry Overview of Fault-Tolerant Approaches used in Autonomous Systems. In Proceedings of the 35th VDI-Fachtagung Fahrerassistenzsysteme und Automatisiertes Fahren (pp. 89–108).
- PAUL: An Algorithmic Composer for Classical Piano Music Supporting Multiple Complexity Levels / Schön, F., & Tompits, H. (2022). PAUL: An Algorithmic Composer for Classical Piano Music Supporting Multiple Complexity Levels. In Progress in Artificial Intelligence - 21st EPIA Conference on Artificial Intelligence, Proceedings (EPIA 2022) (pp. 415–426). Springer. https://doi.org/10.1007/978-3-031-16474-3_34
2021
- D-DEG: A Dynamic Cooperation-Based Approach for Reducing Resource Consumption in Autonomous Vehicles. / Kain, T., Mehlhorn, M. A., Müller, J.-S., & Tompits, H. (2021). D-DEG: A Dynamic Cooperation-Based Approach for Reducing Resource Consumption in Autonomous Vehicles. In B. Castanier, M. Cepin, & D. Bigaud (Eds.), Proceedings of the 31st European Safety and Reliability Conference (ESREL 2021) (pp. 2807–2817). Research Publishing Services. http://hdl.handle.net/20.500.12708/55680
- Ein Ansatz zur Wiederherstellung ausgefallener Hardwarekomponenten in Fail-Operational Architekturen - Eine Erweiterung von FDIRO / Kain, T., Mehlhorn, M. A., Horeis, T. F., Heinrich, J., & Tompits, H. (2021). Ein Ansatz zur Wiederherstellung ausgefallener Hardwarekomponenten in Fail-Operational Architekturen - Eine Erweiterung von FDIRO. In VDI Wissensforum GmbH (Ed.), Technische Zuverlässigkeit 2021 (pp. 297–308). VDI Verlag. http://hdl.handle.net/20.500.12708/58693
- C-PO: A Context-Based Application-Placement Optimization for Autonomous Vehicles / Tompits, H., Kain, T., Horeis, T. F., Heinrich, J., Müller, J.-S., Plinke, F., Decke, H., & Mehlhorn, M. A. (2021). C-PO: A Context-Based Application-Placement Optimization for Autonomous Vehicles. In 2021 Design, Automation & Test in Europe Conference & Exhibition (DATE). DATE 2021, Grenoble, France. IEEE. https://doi.org/10.23919/date51398.2021.9473948
- Beyond Uniform Equivalence between Answer-set Programs / Oetsch, J., Seidl, M., Tompits, H., & Woltran, S. (2021). Beyond Uniform Equivalence between Answer-set Programs. ACM Transactions on Computational Logic, 22(1), 1–46. https://doi.org/10.1145/3422361
2020
- Catching the Ouroboros: On debugging non-ground answer-set programs / Oetsch, J., Pührer, J., & Tompits, H. (2020). Catching the Ouroboros: On debugging non-ground answer-set programs. 36th International Conference on Logic Programming (ICLP 2020), Rende, Italy. http://hdl.handle.net/20.500.12708/87161
- Sequent-Type Calculi for Systems of Nonmonotonic Paraconsistent Logics / Geibinger, T., & Tompits, H. (2020). Sequent-Type Calculi for Systems of Nonmonotonic Paraconsistent Logics. In Electronic Proceedings in Theoretical Computer Science (pp. 178–191). Electronic Proceedings in Theoretical Computer Science (EPTCS). https://doi.org/10.4204/eptcs.325.23
- Towards a Reliable and Context-Based System Architecture for Autonomous Vehicles / Kain, T., Mundhenk, P., Müller, J.-S., Tompits, H., Wesche, M., & Decke, H. (2020). Towards a Reliable and Context-Based System Architecture for Autonomous Vehicles. In Proceedings of the 2nd International Workshop on Autonomous Systems Design (pp. 1–7). Schloss Dagstuhl--Leibniz-Zentrum für Informatik. https://doi.org/10.4230/OASIcs.ASD.2020.1
- Optimizing the Placement of Applications in Autonomous Vehicles / Kain, T., Tompits, H., Müller, J.-S., Wesche, M., Martinez Flores, Y. A., & Decke, H. (2020). Optimizing the Placement of Applications in Autonomous Vehicles. In E-proceedings of the 30th European Safety and Reliability Conference and 15th Probabilistic Safety Assessment and Management Conference (p. 8). http://hdl.handle.net/20.500.12708/55587
- Fdiro: A General Approach for a Fail-Operational System Design / Kain, T., Tompits, H., Müller, J.-S., Mundhenk, P., Wesche, M., & Decke, H. (2020). Fdiro: A General Approach for a Fail-Operational System Design. In E-proceedings of the 30th European Safety and Reliability Conference and 15th Probabilistic Safety Assessment and Management Conference (ESREL2020 PSAM15) (p. 8). http://hdl.handle.net/20.500.12708/55586
- Sequent-Type Calculi for Three-Valued and Disjunctive Default Logic / Pkhakadze, S., & Tompits, H. (2020). Sequent-Type Calculi for Three-Valued and Disjunctive Default Logic. Axioms, 9(3), 84. https://doi.org/10.3390/axioms9030084
2019
- A Sequent-Type Calculus for Three-Valued Default Logic, Or: Tweety Meets Quartum Non Datur / Pkhakadze, S., & Tompits, H. (2019). A Sequent-Type Calculus for Three-Valued Default Logic, Or: Tweety Meets Quartum Non Datur. In Logic Programming and Nonmonotonic Reasoning (pp. 163–177). Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-030-20528-7_13
- On Translating Multi-Modal Logics to Quantified Propositional Logic / Marinkovic, V., & Tompits, H. (2019). On Translating Multi-Modal Logics to Quantified Propositional Logic. In Goedel’s Legacy Conference. Gödel’s Legacy: Does Future lie in the Past?, Wien, Austria. http://hdl.handle.net/20.500.12708/58144
- A Gentzen-Type Calculus for Disjunctive Default Logic. / Pkhakadze, S., & Tompits, H. (2019). A Gentzen-Type Calculus for Disjunctive Default Logic. In Goedel’s Legacy Conference. Gödel’s Legacy: Does Future lie in the Past?, Wien, Austria. http://hdl.handle.net/20.500.12708/58123
- Uhura: An Authoring Tool for Specifying Answer-Set Programs Using Controlled Natural Language / Kain, T., & Tompits, H. (2019). Uhura: An Authoring Tool for Specifying Answer-Set Programs Using Controlled Natural Language. In Logics in Artificial Intelligence (pp. 559–575). Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-030-19570-0_37
-
Characterising Relativised Strong Equivalence with Projection for Non-ground Answer-Set Programs
/
Geibinger, T., & Tompits, H. (2019). Characterising Relativised Strong Equivalence with Projection for Non-ground Answer-Set Programs. In F. Calimeri, N. Leone, & M. Manna (Eds.), Logics in Artificial Intelligence: 16th European Conference, JELIA 2019 (pp. 542–558). Springer. https://doi.org/10.1007/978-3-030-19570-0_36
Project: ARTIS (2017–2024)
2018
- Local Redundancy in SAT: Generalizations of Blocked Clauses / Kiesl, B., Seidl, M., Tompits, H., & Biere, A. (2018). Local Redundancy in SAT: Generalizations of Blocked Clauses. Logical Methods in Computer Science, 14(4). https://doi.org/10.23638/LMCS-14(4:3)2018
- Stepwise debugging of answer-set programs / Oetsch, J., Pührer, J., & Tompits, H. (2018). Stepwise debugging of answer-set programs. Theory and Practice of Logic Programming, 18(1), 30–80. https://doi.org/10.1017/s1471068417000217
- A many-sorted variant of Japaridze's polymodal provability logic / Berger, G., Beklemishev, L. D., & Tompits, H. (2018). A many-sorted variant of Japaridze’s polymodal provability logic. Logic Journal of the IGPL, 26(5), 505–538. https://doi.org/10.1093/jigpal/jzy012
- From Łukasiewicz to Gentzen: On Sequent-type Refutation Calculi for Three-valued Logics / Tompits, H. (2018). From Łukasiewicz to Gentzen: On Sequent-type Refutation Calculi for Three-valued Logics. Refutation Symposium 2018 at Poznań Reasoning Week, Poznań, Poland, EU. http://hdl.handle.net/20.500.12708/86853
- An Approach for Representing Answer Sets in Natural Language / Fang, M., & Tompits, H. (2018). An Approach for Representing Answer Sets in Natural Language. In Declarative Programming and Knowledge Management - Conference on Declarative Programming, DECLARE 2017, Unifying INAP, WFLP, and WLP, Würzburg, Germany, September 19-22, 2017, Revised Selected Papers. (pp. 115–131). Springer LNCS. http://hdl.handle.net/20.500.12708/57752
- A Tableau Calculus for a Multi-modal Logic of Dishonesty / Pavlovic, S., & Tompits, H. (2018). A Tableau Calculus for a Multi-modal Logic of Dishonesty. In AI*IA 2018 - Advances in Artificial Intelligence - XVIIth International Conference of the Italian Association for Artificial Intelligence, Trento, Italy, November 20-23, 2018, Proceedings (pp. 238–251). Springer. http://hdl.handle.net/20.500.12708/57749
2017
-
Blocked Clauses in First-Order Logic
/
Kiesl, B., Suda, M., Seidl, M., Tompits, H., & Biere, A. (2017). Blocked Clauses in First-Order Logic. In T. Eiter & D. Sands (Eds.), LPAR-21. 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning. EasyChair. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:3-3121
Download: PDF (412 KB) - Blockedness in Propositional Logic: Are You Satisfied With Your Neighborhood? / Kiesl, B., Seidl, M., Tompits, H., & Biere, A. (2017). Blockedness in Propositional Logic: Are You Satisfied With Your Neighborhood? In F. Bacchus (Ed.), Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence. https://doi.org/10.24963/ijcai.2017/687
- $$\mathsf {Harvey}$$ : A System for Random Testing in ASP / Greßler, A., Oetsch, J., & Tompits, H. (2017). $$\mathsf {Harvey}$$ : A System for Random Testing in ASP. In M. Balduccini & T. Janhunen (Eds.), Logic Programming and Nonmonotonic Reasoning (pp. 229–235). Lecture Notes in Computer Science, Springer LNCS. https://doi.org/10.1007/978-3-319-61660-5_21
- An Approach for Representing Answer Sets in Natural Language / Tompits, H., & Fang, M. (2017). An Approach for Representing Answer Sets in Natural Language. In D. Seipel, M. Hanus, & S. Abreu (Eds.), Declare 2017 - Conference on Declarative Programming (pp. 107–122). Technical Report, Institute of Computer Science, University of Würzburg. http://hdl.handle.net/20.500.12708/57281
2016
-
Super-Blocked Clauses
/
Kiesl, B., Seidl, M., Tompits, H., & Biere, A. (2016). Super-Blocked Clauses. In N. Olivetti & A. Tiwari (Eds.), Automated Reasoning : 8th International Joint Conference, IJCAR 2016, Coimbra, Portugal, June 27 – July 2, 2016, Proceedings. Cham. https://doi.org/10.1007/978-3-319-40229-1_5
Download: PDF (321 KB)
2015
- On Structural Analysis of Non-Ground Answer-Set Programs / Kiesl, B., Schüller, P., & Tompits, H. (2015). On Structural Analysis of Non-Ground Answer-Set Programs. In M. De Vos, T. Eiter, Y. Lierler, & F. Toni (Eds.), Proceedings of the Technical Communications of the 31st International Conference on Logic Programming (ICLP 2015) (p. 14). http://hdl.handle.net/20.500.12708/56289
2014
- On Axiomatic Rejection for the Description Logic $$\mathcal {ALC}$$ / Berger, G., & Tompits, H. (2014). On Axiomatic Rejection for the Description Logic $$\mathcal {ALC}$$. In M. Hanus & R. Rocha (Eds.), Declarative Programming and Knowledge Management (pp. 65–82). Springer LNCS. https://doi.org/10.1007/978-3-319-08909-6_5
- Compact Argumentation Frameworks / Baumann, R., Dvorak, W., Linsbichler, T., Strass, H., & Woltran, S. (2014). Compact Argumentation Frameworks. In S. Konieczny & H. Tompits (Eds.), 15th International Workshop on Non-monotonic Reasoning (NMR 2014) (p. 10). http://hdl.handle.net/20.500.12708/55236
- Extension-based Semantics of Abstract Dialectical Frameworks / Polberg, S. (2014). Extension-based Semantics of Abstract Dialectical Frameworks. In S. Konieczny & H. Tompits (Eds.), 15th International Workshop on Non-monotonic Reasoning (NMR 2014) (p. 10). http://hdl.handle.net/20.500.12708/55235
2013
-
SeaLion: An Eclipse-based IDE for Answer-Set Programming with Advanced Debugging Support
/
Busoniu, P.-A., Oetsch, J., Puehrer, J., Skocovsky, P., & Tompits, H. (2013). SeaLion: An Eclipse-based IDE for Answer-Set Programming with Advanced Debugging Support. In Theory and Practice of Logic Programming, Volume 13, Special Issue 4-5 (29th International Conference on Logic Programming) (pp. 657–673). Cambridge University Press. http://hdl.handle.net/20.500.12708/55044
Project: Methods (2009–2013) - Making Use of Advances in Answer-Set Programming for Abstract Argumentation Systems / Dvořák, W., Gaggl, S. A., Wallner, J. P., & Woltran, S. (2013). Making Use of Advances in Answer-Set Programming for Abstract Argumentation Systems. In H. Tompits, S. Abreu, J. Oetsch, J. Puehrer, D. Seipel, M. Umeda, & A. Wolf (Eds.), Applications of Declarative Programming and Knowledge Management (pp. 114–133). Springer. https://doi.org/10.1007/978-3-642-41524-1_7
-
HEX-Programs with Nested Program Calls
/
Eiter, T., Krennwallner, T., & Redl, C. (2013). HEX-Programs with Nested Program Calls. In H. Tompits, S. Abreu, J. Oetsch, J. Puehrer, D. Seipel, M. Umeda, & A. Wolf (Eds.), Applications of Declarative Programming and Knowledge Management (pp. 269–278). Springer. https://doi.org/10.1007/978-3-642-41524-1_15
Projects: ASP (2012–2015) / HEX-Programme (2008–2012) -
A Model-Theoretic Approach to Belief Change in Answer Set Programming
/
Delgrande, J., Schaub, T., Tompits, H., & Woltran, S. (2013). A Model-Theoretic Approach to Belief Change in Answer Set Programming. ACM Transactions on Computational Logic, 14(2), 1–46. https://doi.org/10.1145/2480759.2480766
Project: Methods (2009–2013) - On Axiomatic Rejection for the Description Logic ALC / Berger, G., & Tompits, H. (2013). On Axiomatic Rejection for the Description Logic ALC. In M. Hanus & R. Rocha (Eds.), Kiel Declarative Programming Days 2013 (pp. 78–92). http://hdl.handle.net/20.500.12708/55038
-
Kara: A System for Visualising and Visual Editing of Interpretations for Answer-Set Programs
/
Kloimüllner, C., Oetsch, J., Puehrer, J., & Tompits, H. (2013). Kara: A System for Visualising and Visual Editing of Interpretations for Answer-Set Programs. In Applications of Declarative Programming and Knowledge Management, 19th International Conference, INAP 2011 and 25th Workshop on Logic Programming, WLP 2011 Vienna, Austria, September 28-30, 2011 Revised Selected Papers (pp. 325–344). Springer, LNAI. http://hdl.handle.net/20.500.12708/54279
Project: Methods (2009–2013) -
Guided Merging of Sequence Diagrams
/
Widl, M., Biere, A., Kaufmann, P., Egly, U., Heule, M., Kappel, G., Seidl, M., & Tompits, H. (2013). Guided Merging of Sequence Diagrams. In Software Language Engineering (pp. 164–183). Lecture Notes in Computer Science Volume 7745. https://doi.org/10.1007/978-3-642-36089-3_10
Projects: Boolean (2011–2019) / FAME (2011–2014) - Model-Based Recasting in Answer-Set Programming / Eiter, T., Fink, M., Pührer, J., Tompits, H., & Woltran, S. (2013). Model-Based Recasting in Answer-Set Programming. Journal of Applied Non-Classical Logics, 23(1–2), 75–104. https://doi.org/10.1080/11663081.2013.799318
-
The Parameterized Complexity of Constraint Satisfaction and Reasoning
/
Szeider, S. (2013). The Parameterized Complexity of Constraint Satisfaction and Reasoning. In H. Tompits, S. Abreu, J. Oetsch, J. Pührer, D. Seipel, M. Umeda, & A. Wolf (Eds.), Applications of Declarative Programming and Knowledge Management (pp. 27–37). Springer / LNCS. https://doi.org/10.1007/978-3-642-41524-1_2
Project: Complex Reason (2010–2014) -
The SeaLion has Landed: An IDE for Answer-Set Programming-Preliminary Report
/
Oetsch, J., Puehrer, J., & Tompits, H. (2013). The SeaLion has Landed: An IDE for Answer-Set Programming-Preliminary Report. In Applications of Declarative Programming and Knowledge Management, 19th International Conference, INAP 2011, and 25th Workshop on Logic Programming, WLP 2011, Vienna, Austria, September 28-30, 2011, Revised Selected Papers (pp. 305–324). Springer, LNAI. http://hdl.handle.net/20.500.12708/54280
Project: Methods (2009–2013) - Model-Based Recasting in Answer-Set Programming / Eiter, T., Fink, M., Puehrer, J., Tompits, H., & Woltran, S. (2013). Model-Based Recasting in Answer-Set Programming (DBAI-TR-2013-83). http://hdl.handle.net/20.500.12708/37698
-
Applications of Declarative Programming and Knowledge Management, 19th International Conference, INAP 2011 and 25th Workshop on Logic Programming, WLP 2011 Vienna, Austria, September 28-30, 2011, Revised Selected Papers
/
Tompits, H., Abreu, S., Oetsch, J., Puehrer, J., Seipel, D., Umeda, M., & Wolf, A. (Eds.). (2013). Applications of Declarative Programming and Knowledge Management, 19th International Conference, INAP 2011 and 25th Workshop on Logic Programming, WLP 2011 Vienna, Austria, September 28-30, 2011, Revised Selected Papers. Springer, LNAI. http://hdl.handle.net/20.500.12708/23778
Project: Methods (2009–2013)
2012
-
On the Small-Scope Hypothesis for Testing Answer-Set Programs
/
Oetsch, J., Prischink, M., Puehrer, J., Schwengerer, M., & Tompits, H. (2012). On the Small-Scope Hypothesis for Testing Answer-Set Programs. In 13th International Conference on Principles of Knowledge Representation and Reasoning (pp. 43–53). AAAI Press. http://hdl.handle.net/20.500.12708/54275
Project: Methods (2009–2013) -
Event-Sequence Testing using Answer-Set Programming
/
Brain, M., Erdem, E., Inoue, K., Oetsch, J., Puehrer, J., Tompits, H., & Yilmaz, C. (2012). Event-Sequence Testing using Answer-Set Programming. International Journal On Advances in Software, 5(3 & amp; 4), 15. http://hdl.handle.net/20.500.12708/164382
Project: Methods (2009–2013) -
Stepwise Debugging of Description-Logic Programs
/
Oetsch, J., Puehrer, J., & Tompits, H. (2012). Stepwise Debugging of Description-Logic Programs. In Correct Reasoning - Essays on Logic-Based AI in Honour of Vladimir Lifschitz (pp. 492–508). Springer, LNCS 7265. http://hdl.handle.net/20.500.12708/27700
Project: Methods (2009–2013) - Extending Object-Oriented Languages by Declarative Specifications of Complex Objects using Answer-Set Programming / Oetsch, J., Puehrer, J., & Tompits, H. (2012). Extending Object-Oriented Languages by Declarative Specifications of Complex Objects using Answer-Set Programming. In 26th Workshop on Logic Programming (WLP 2012) (pp. 129–137). http://hdl.handle.net/20.500.12708/54278
-
LANA: A Language for Annotating Answer-Set Programs
/
De Vos, M., Kisa, D. G., Oetsch, J., Puehrer, J., & Tompits, H. (2012). LANA: A Language for Annotating Answer-Set Programs. In 14th International Workshop on Non-Monotonic Reasoning (p. 9). http://hdl.handle.net/20.500.12708/54274
Project: Methods (2009–2013) -
Guided Merging of Sequence Diagrams
/
Widl, M., Biere, A., Kaufmann, P., Egly, U., Heule, M., Kappel, G., Seidl, M., & Tompits, H. (2012). Guided Merging of Sequence Diagrams. In K. Czarnecki & G. Hedin (Eds.), SLE 2012 - Pre-proceedings (pp. 163–182). http://hdl.handle.net/20.500.12708/54255
Projects: Boolean (2011–2019) / FAME (2011–2014) -
An FLP-Style Answer-Set Semantics for Abstract-Constraint Programs with Disjunctions
/
Oetsch, J., Puehrer, J., & Tompits, H. (2012). An FLP-Style Answer-Set Semantics for Abstract-Constraint Programs with Disjunctions. In Technical Communications of the 28th International Conference on Logic Programming (p. 12). LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. http://hdl.handle.net/20.500.12708/54277
Project: Methods (2009–2013) - Annotating Answer-Set Programs in LANA / DE VOS, M., KISA, D. G., OETSCH, J., PÜHRER, J., & TOMPITS, H. (2012). Annotating Answer-Set Programs in LANA. In Theory and Practice of Logic Programming (pp. 619–637). Cambridge University Press. https://doi.org/10.1017/s147106841200021x
-
Towards Semantics-Aware Merge Support in Optimistic Model Versioning
/
Kaufmann, P., Egly, U., Gabmeyer, S., Kappel, G., Seidl, M., Tompits, H., Widl, M., & Wimmer, M. (2012). Towards Semantics-Aware Merge Support in Optimistic Model Versioning. In Models in Software Engineering (pp. 246–256). Springer LNCS. https://doi.org/10.1007/978-3-642-29645-1_24
Projects: Boolean (2011–2019) / FAME (2011–2014) -
Towards Scenario-Based Testing of UML Diagrams
/
Kaufmann, P., Egly, U., Gabmeyer, S., Kappel, G., Seidl, M., Tompits, H., Widl, M., & Wimmer, M. (2012). Towards Scenario-Based Testing of UML Diagrams. In Tests and Proofs (pp. 149–155). Springer. https://doi.org/10.1007/978-3-642-30473-6_12
Projects: Boolean (2011–2019) / FAME (2011–2014)
2011
-
Embedding Non-Ground Logic Programs into Autoepistemic Logic for Knowledge Base Combination
/
Bruijn, J. D., Eiter, T., Polleres, A., & Tompits, H. (2011). Embedding Non-Ground Logic Programs into Autoepistemic Logic for Knowledge Base Combination. ACM Transactions on Computational Logic, 12(3), 1–39. https://doi.org/10.1145/1929954.1929957
Project: Methods (2009–2013) -
Stepping through an Answer-Set Program
/
Oetsch, J., Puehrer, J., & Tompits, H. (2011). Stepping through an Answer-Set Program. In Logic Programming and Nonmonotonic Reasoning. 11th International Conference, LPNMR 2011 (pp. 134–147). Springer. https://doi.org/10.1007/978-3-642-20895-9_13
Project: Methods (2009–2013) -
Random vs. Structure-Based Testing of Answer-Set Programs: An Experimental Comparison
/
Janhunen, T., Niemelä, I., Oetsch, J., Puehrer, J., & Tompits, H. (2011). Random vs. Structure-Based Testing of Answer-Set Programs: An Experimental Comparison. In Logic Programming and Nonmonotonic Reasoning. 11th International Conference, LPNMR 2011 (pp. 242–247). Springer. https://doi.org/10.1007/978-3-642-20895-9_26
Project: Methods (2009–2013) -
Gentzen-Type Refutation Systems for Three-Valued Logics with an Application to Disproving Strong Equivalence
/
Oetsch, J., & Tompits, H. (2011). Gentzen-Type Refutation Systems for Three-Valued Logics with an Application to Disproving Strong Equivalence. In Logic Programming and Nonmonotonic Reasoning. 11th International Conference, LPNMR 2011 (pp. 254–259). Springer. https://doi.org/10.1007/978-3-642-20895-9_28
Project: Methods (2009–2013) -
Answer-Set Programming as a new Approach to Event-Sequence Testing
/
Erdem, E., Inoue, K., Oetsch, J., Puehrer, J., Tompits, H., & Yilmaz, C. (2011). Answer-Set Programming as a new Approach to Event-Sequence Testing. In Proceedings of The Second International Conference on Advances in System Testing and Validation Lifecycle (pp. 25–34). Xpert Publishing Services. http://hdl.handle.net/20.500.12708/53785
Project: Methods (2009–2013) -
Kara: A System for Visualising and Visual Editing of Interpretations for Answer-Set Programs
/
Kloimüllner, C., Oetsch, J., Puehrer, J., & Tompits, H. (2011). Kara: A System for Visualising and Visual Editing of Interpretations for Answer-Set Programs. In 19th International Conference on Applications of Declarative Programming and Knowledge Management (INAP 2011) and 25th Workshop on Logic Programming (WLP 2011) (pp. 152–164). INFSYS Research Report. http://hdl.handle.net/20.500.12708/53786
Project: Methods (2009–2013) -
The SeaLion has Landed: An IDE for Answer-Set Programming-Preliminary Report
/
Oetsch, J., Puehrer, J., & Tompits, H. (2011). The SeaLion has Landed: An IDE for Answer-Set Programming-Preliminary Report. In 19th International Conference on Applications of Declarative Programming and Knowledge Management (INAP 2011) and 25th Workshop on Logic Programming (WLP 2011) (pp. 141–151). INFSYS Research Report. http://hdl.handle.net/20.500.12708/53787
Project: Methods (2009–2013) -
VIDEAS: Supporting Answer-Set Program Development using Model-Driven Engineering Techniques
/
Oetsch, J., Puehrer, J., Seidl, M., Tompits, H., & Zwickl, P. (2011). VIDEAS: Supporting Answer-Set Program Development using Model-Driven Engineering Techniques. In Proceedings of the MELO 2011Workshop: Model-Driven Engineering, Logic and Optimization: friends or foes? (p. 16). http://hdl.handle.net/20.500.12708/53757
Project: Methods (2009–2013) -
VIDEAS: A Development Tool for Answer-Set Programs Based on Model-Driven Engineering Technology
/
Oetsch, J., Pührer, J., Seidl, M., Tompits, H., & Zwickl, P. (2011). VIDEAS: A Development Tool for Answer-Set Programs Based on Model-Driven Engineering Technology. In Logic Programming and Nonmonotonic Reasoning (pp. 382–387). Springer. https://doi.org/10.1007/978-3-642-20895-9_45
Projects: FAME (2011–2014) / Methods (2009–2013) -
Parsing Combinatory Categorial Grammar with Answer Set Programming: Preliminary Report
/
Lierler, Y., & Schüller, P. (2011). Parsing Combinatory Categorial Grammar with Answer Set Programming: Preliminary Report. In S. Abreu, J. Oetsch, J. Puehrer, D. Seipel, H. Tompits, M. Umeda, & A. Wolf (Eds.), 19th International Conference on Applications of Declarative Programming and Knowledge Management (INAP 2011) and 25th Workshop on Logic Programming (WLP 2011) (pp. 208–219). INFSYS Research Report. http://hdl.handle.net/20.500.12708/53743
Project: IncMan (2009–2012) -
Nested HEX-Programs
/
Eiter, T., Krennwallner, T., & Redl, C. (2011). Nested HEX-Programs. In H. Tompits (Ed.), 19th International Conference on Applications of Declarative Programming and Knowledge Management (INAP 2011) (p. 6). Computing Research Repository (CoRR), arXiv. http://hdl.handle.net/20.500.12708/53703
Projects: ASP (2012–2015) / HEX-Programme (2008–2012) / Hybride Wissensbasen (2008–2012) -
Towards Semantics-Aware Merge Support in Optimistic Model Versioning
/
Kaufmann, P., Egly, U., Gabmeyer, S., Kappel, G., Seidl, M., Tompits, H., Widl, M., & Wimmer, M. (2011). Towards Semantics-Aware Merge Support in Optimistic Model Versioning. In Proceedings of the Models and Evolution Workshop @ MoDELS’11 (p. 10). http://hdl.handle.net/20.500.12708/53735
Projects: Boolean (2011–2019) / FAME (2011–2014) / FAME (2011–2014) - Proceedings of the 19th International Conference on Applications of Declarative Programming and Knowledge Management (INAP 2011) and 25th Workshop on Logic Programming (WLP 2011) / Abreu, S., Oetsch, J., Puehrer, J., Seipel, D., Tompits, H., Umeda, M., & Wolf, A. (Eds.). (2011). Proceedings of the 19th International Conference on Applications of Declarative Programming and Knowledge Management (INAP 2011) and 25th Workshop on Logic Programming (WLP 2011). TU Wien. http://hdl.handle.net/20.500.12708/23363
2010
-
Catching the Ouroboros: On debugging non-ground answer-set programs
/
OETSCH, J., PÜHRER, J., & TOMPITS, H. (2010). Catching the Ouroboros: On debugging non-ground answer-set programs. In M. Hermenegildo & T. Schaub (Eds.), Theory and Practice of Logic Programming (pp. 513–529). Theory and Practice of Logic Programming / Cambridge University Press. https://doi.org/10.1017/s1471068410000256
Project: Methods (2009–2013) -
The system Kato: Detecting cases of plagiarism for answer-set programs
/
OETSCH, J., PÜHRER, J., SCHWENGERER, M., & TOMPITS, H. (2010). The system Kato: Detecting cases of plagiarism for answer-set programs. In M. Hermenegildo & T. Schaub (Eds.), Theory and Practice of Logic Programming (pp. 759–775). Theory and Practice of Logic Programming / Cambridge University Press. https://doi.org/10.1017/s1471068410000402
Project: Methods (2009–2013) -
Methods and Methodologies for Developing Answer-Set Programs - Project Description
/
Oetsch, J., Puehrer, J., & Tompits, H. (2010). Methods and Methodologies for Developing Answer-Set Programs - Project Description. In M. Hermenegildo & T. Schaub (Eds.), Technical Communications of the 26th International Conference on Logic Programming (ICLP 2010) (pp. 154–161). Leibniz International Proceedings in Informatics / Schloss Dagstuhl - Leibniz-Zentrum für Informatik. http://hdl.handle.net/20.500.12708/53228
Project: Methods (2009–2013) -
On Testing Answer-Set Programs
/
Niemelä, I., Janhunen, T., Oetsch, J., Puehrer, J., & Tompits, H. (2010). On Testing Answer-Set Programs. In H. Coelho, R. Studer, & M. Wooldridge (Eds.), 19th European Conference on Artificial Intelligence (ECAI 2010) (pp. 951–956). IOS Press. http://hdl.handle.net/20.500.12708/53226
Project: Methods (2009–2013) -
Gentzen-type Refutation Systems for Three-Valued Logics
/
Oetsch, J., & Tompits, H. (2010). Gentzen-type Refutation Systems for Three-Valued Logics. In S. Abdennadher (Ed.), 24th Workshop on (Constraint) Logic Programming WLP’2010 (pp. 88–98). Technical Report, Faculty of Media Engineering and Technology, German University in Cairo. http://hdl.handle.net/20.500.12708/53225
Project: Methods (2009–2013) -
Let's Break the Rules: Interactive Procedural-Style Debugging of Answer-Set Programs
/
Oetsch, J., Puehrer, J., & Tompits, H. (2010). Let’s Break the Rules: Interactive Procedural-Style Debugging of Answer-Set Programs. In S. Abdennadher (Ed.), 24th Workshop on (Constraint) Logic Programming WLP’2010 (pp. 77–87). Technical Report, Faculty of Media Engineering and Technology, German University in Cairo. http://hdl.handle.net/20.500.12708/53224
Project: Methods (2009–2013)
2009
- spock: A Debugging Support Tool for Logic Programs under the Answer-Set Semantics / Gebser, M., Pührer, J., Schaub, T., Tompits, H., & Woltran, S. (2009). spock: A Debugging Support Tool for Logic Programs under the Answer-Set Semantics. In D. Seipel, M. Hanus, & A. Wolf (Eds.), Applications of Declarative Programming and Knowledge Management (pp. 247–252). Springer. https://doi.org/10.1007/978-3-642-00675-3_17
- Modularity Aspects of Disjunctive Stable Models / Janhunen, T., Oikarinen, E., Tompits, H., & Woltran, S. (2009). Modularity Aspects of Disjunctive Stable Models. Journal of Artificial Intelligence Research, 35, 813–857. https://doi.org/10.1613/jair.2810
- Characterising Equilibrium Logic and Nested Logic Programs: Reductions and Complexity / PEARCE, D., TOMPITS, H., & WOLTRAN, S. (2009). Characterising Equilibrium Logic and Nested Logic Programs: Reductions and Complexity. Theory and Practice of Logic Programming, 9(05), 565–616. https://doi.org/10.1017/s147106840999010x
-
ccT on Stage: Generalised Uniform Equivalence Testing for Verifying Student Assignment Solutions
/
Oetsch, J., Seidl, M., Tompits, H., & Woltran, S. (2009). ccT on Stage: Generalised Uniform Equivalence Testing for Verifying Student Assignment Solutions. In E. Erdem, F. Lin, & T. Schaub (Eds.), Logic Programming and Nonmonotonic Reasoning: 10th International Conference, LPNMR 2009, Potsdam, Germany, September 14-18, 2009, Proceedings (pp. 382–395). Springer. https://doi.org/10.1007/978-3-642-04238-6_32
Project: Methods (2009–2013) -
Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection
/
Puehrer, J., & Tompits, H. (2009). Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection. In E. Erdem, F. Lin, & T. Schaub (Eds.), Logic Programming and Nonmonotonic Reasoning: 10th International Conference, LPNMR 2009, Potsdam, Germany, September 14-18, 2009, Proceedings (pp. 264–276). Springer. https://doi.org/10.1007/978-3-642-04238-6_23
Project: Methods (2009–2013) -
Kato: A Plagiarism-Detection Tool for Answer-Set Programs
/
Oetsch, J., Schwengerer, M., & Tompits, H. (2009). Kato: A Plagiarism-Detection Tool for Answer-Set Programs. In A. Wolf & U. Geske (Eds.), 23rd Workshop on (Constraint) Logic Programming (pp. 75–79). Universitätsverlag Potsdam. http://hdl.handle.net/20.500.12708/52746
Project: Methods (2009–2013) -
Merging Logic Programs under Answer Set Semantics
/
Delgrande, J. P., Schaub, T., Tompits, H., & Woltran, S. (2009). Merging Logic Programs under Answer Set Semantics. In P. M. Hill & D. S. Warren (Eds.), Logic Programming: 25th International Conference, ICLP 2009, Pasadena, CA, USA, July 14-17, 2009, Proceedings (pp. 160–174). Springer. https://doi.org/10.1007/978-3-642-02846-5_17
Project: TTPC (2008–2012) - Testing Relativised Uniform Equivalence under Answer-Set Projection in the System ccT / Oetsch, J., Seidl, M., Tompits, H., & Woltran, S. (2009). Testing Relativised Uniform Equivalence under Answer-Set Projection in the System ccT. In D. Seipel, M. Hanus, & A. Wolf (Eds.), Applications of Declarative Programming and Knowledge Management (pp. 241–246). Springer. http://hdl.handle.net/20.500.12708/52744
2008
-
Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets
/
Gebser, M., Schaub, T., Tompits, H., & Woltran, S. (2008). Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets. In S. Hartmann & G. Kern-Isberner (Eds.), Foundations of Information and Knowledge Systems. Springer LNCS. https://doi.org/10.1007/978-3-540-77684-0_5
Project: Formale Methoden (2005–2008) -
Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence
/
Puehrer, J., Tompits, H., & Woltran, S. (2008). Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence. In M. G. de la Banda & E. Pontelli (Eds.), Logic Programming. Springer LNCS. https://doi.org/10.1007/978-3-540-89982-2_47
Project: Formale Methoden (2005–2008) - Combining Answer Set Programming with Description Logics for the Semantic Web / Eiter, T., Ianni, G., Lukasiewicz, T., Schindlauer, R., & Tompits, H. (2008). Combining Answer Set Programming with Description Logics for the Semantic Web. Artificial Intelligence, 172(12–13), 1495–1539. https://doi.org/10.1016/j.artint.2008.04.002
-
A Generalised Program-Correspondence Framework: Preliminary Report
/
Oetsch, J., & Tompits, H. (2008). A Generalised Program-Correspondence Framework: Preliminary Report. In S. Schwarz (Ed.), 22nd Workshop on (Constraint) Logic Programming (pp. 72–82). Technical Report, University Halle-Wittenberg, Institute of Computer Science. http://hdl.handle.net/20.500.12708/52542
Project: Formale Methoden (2005–2008) -
Notions of Strong Equivalence for Logic Programs with Ordered Disjunction
/
Faber, W., Tompits, H., & Woltran, S. (2008). Notions of Strong Equivalence for Logic Programs with Ordered Disjunction. In G. Brewka & J. Lang (Eds.), Proceedings of the 11th Conference on Principles of Knowledge Representation and Reasoning (KR’08) (pp. 433–443). AAAI Press. http://hdl.handle.net/20.500.12708/52556
Project: Formale Methoden (2005–2008) - Embedding Non-Ground Logic Programs into Autoepistemic Logic for Knowledge Base Combination / De Bruijn, J., Eiter, T., Polleres, A. F., & Tompits, H. (2008). Embedding Non-Ground Logic Programs into Autoepistemic Logic for Knowledge Base Combination (INFSYS RR-1843-08-12). http://hdl.handle.net/20.500.12708/35363
- Embedding Approaches to Combining Rules and Ontologies into Autoepistemic Logic / De Bruijn, J., Eiter, T., & Tompits, H. (2008). Embedding Approaches to Combining Rules and Ontologies into Autoepistemic Logic. In G. Brewka & J. Lang (Eds.), Proceedings of the 11th Conference on Principles of Knowledge Representation and Reasoning (KR’08) (pp. 485–495). AAAI Press. http://hdl.handle.net/20.500.12708/52557
-
Belief Revision of Logic Programs under Answer Set Semantics
/
Delgrande, J. P., Schaub, T., Tompits, H., & Woltran, S. (2008). Belief Revision of Logic Programs under Answer Set Semantics. In G. Brewka & J. Lang (Eds.), Proceedings of the 11th Conference on Principles of Knowledge Representation and Reasoning (KR’08) (pp. 411–421). AAAI Press. http://hdl.handle.net/20.500.12708/52555
Project: Formale Methoden (2005–2008) -
Program Correspondence under the Answer-Set Semantics: The Non-ground Case
/
Oetsch, J., & Tompits, H. (2008). Program Correspondence under the Answer-Set Semantics: The Non-ground Case. In M. G. de la Banda & E. Pontelli (Eds.), Logic Programming (pp. 591–605). Springer LNCS. https://doi.org/10.1007/978-3-540-89982-2_49
Project: Formale Methoden (2005–2008) -
A Meta-Programming Technique for Debugging Answer-Set Programs
/
Gebser, M., Puehrer, J., Schaub, T., & Tompits, H. (2008). A Meta-Programming Technique for Debugging Answer-Set Programs. In D. Fox & C. P. Gomes (Eds.), AAAI-08/IAAI-08 Proceedings (pp. 448–453). http://hdl.handle.net/20.500.12708/52303
Project: Formale Methoden (2005–2008)
2007
- A Knowledge-Based Approach for Selecting Information Sources / Eiter, T., Fink, M., & Tompits, H. (2007). A Knowledge-Based Approach for Selecting Information Sources. Theory and Practice of Logic Programming, 7(3), 249–300. http://hdl.handle.net/20.500.12708/169633
- Characterizing Notions of Strong Equivalence for Logic Programs with Ordered Disjunctions / Faber, W., Tompits, H., & Woltran, S. (2007). Characterizing Notions of Strong Equivalence for Logic Programs with Ordered Disjunctions. In 3rd Multidisciplinary Workshop on Advances in Preference Handling (M-PREF 2007) (p. 8). http://hdl.handle.net/20.500.12708/51849
- Facts do not Cease to Exist Because They are Ignored: Relativised Uniform Equivalence with Answer-Set Projection / Oetsch, J., Tompits, H., & Woltran, S. (2007). Facts do not Cease to Exist Because They are Ignored: Relativised Uniform Equivalence with Answer-Set Projection. In D. Pearce, A. F. Polleres, S. Woltran, & A. Valverde (Eds.), Proceedings of the LPNMR’07 Workshop on Correspondence and Equivalence for Nonmonotonic Theories (pp. 25–36). http://hdl.handle.net/20.500.12708/51829
- Facts Do Not Cease to Exist Because They Are Ignored: Relativised Uniform Equivalence with Answer-Set Projection / Oetsch, J., Tompits, H., & Woltran, S. (2007). Facts Do Not Cease to Exist Because They Are Ignored: Relativised Uniform Equivalence with Answer-Set Projection. AAAI ’ 07, Vancouver, Canada, Non-EU. http://hdl.handle.net/20.500.12708/84653
- A Preference-Based Framework for Updating Logic Programs / Delgrande, J. P., Schaub, T., & Tompits, H. (2007). A Preference-Based Framework for Updating Logic Programs. In C. Baral, G. Brewka, & J. Schlipf (Eds.), Logic Programming and Nonmonotonic Reasoning (pp. 71–83). Springer Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-540-72200-7_8
- Embedding Non-Ground Logic Programs into Autoepistemic Logic for Knowledge Base Combination / De Bruijn, J., Eiter, T., Polleres, A. F., & Tompits, H. (2007). Embedding Non-Ground Logic Programs into Autoepistemic Logic for Knowledge Base Combination. In M. Veloso (Ed.), Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI-07) (pp. 304–309). AAAI Press/IJCAI. http://hdl.handle.net/20.500.12708/51912
- That is illogical Captain! The Debugging Support Tool spock for Answer-Set Programs -- System Description / Brain, M., Gebser, M., Puehrer, J., Schaub, T., Tompits, H., & Woltran, S. (2007). That is illogical Captain! The Debugging Support Tool spock for Answer-Set Programs -- System Description. In Proceeding of the LPNMR’ 07 Workshop on Software Engineering for Answer Set Programming (pp. 71–85). http://hdl.handle.net/20.500.12708/51847
- Alternative Characterizations for Program Equivalence under Answer-Set Semantics: Preliminary Report / Gebser, M., Schaub, T., Tompits, H., & Woltran, S. (2007). Alternative Characterizations for Program Equivalence under Answer-Set Semantics: Preliminary Report. In Proceedings of the LPNMR’07 Workshop on Correspondence and Equivalence for Nonmonotonic Theories (pp. 37–48). CEUR-Proceedings. http://hdl.handle.net/20.500.12708/51830
- Relativised Equivalence in Equilibrium Logic and its Applications to Prediction and Explanation: Preliminary Report / Pearce, D., Tompits, H., & Woltran, S. (2007). Relativised Equivalence in Equilibrium Logic and its Applications to Prediction and Explanation: Preliminary Report. In Proceedings of the LPNMR’07 Workshop on Correspondence and Equivalence for Nonmonotonic Theories (pp. 49–60). CEUR-Proceedings. http://hdl.handle.net/20.500.12708/51831
- Modularity Aspects of Disjunctive Stable Models / Janhunen, T., Oikarinen, E., Tompits, H., & Woltran, S. (2007). Modularity Aspects of Disjunctive Stable Models. In Proceeding of the 9th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR ’07) (pp. 175–187). LNCS/Springer. http://hdl.handle.net/20.500.12708/51827
- Debugging ASP Programs by Means of ASP / Brain, M., Gebser, M., Puehrer, J., Schaub, T., Tompits, H., & Woltran, S. (2007). Debugging ASP Programs by Means of ASP. In Proceeding of the 9th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR ’07) (pp. 31–43). LNCS/Springer. http://hdl.handle.net/20.500.12708/51826
- Facts Do Not Cease to Exist Because They Are Ignored: Relativised Uniform Equivalence with Answer-Set Projection / Oetsch, J., Tompits, H., & Woltran, S. (2007). Facts Do Not Cease to Exist Because They Are Ignored: Relativised Uniform Equivalence with Answer-Set Projection. In Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence (p. 7). AAAI Press. http://hdl.handle.net/20.500.12708/51825
- Complexity of Rule Redundancy in Non-Ground Answer-Set Programming over Finite Domains / Fink, M., Pichler, R., Tompits, H., & Woltran, S. (2007). Complexity of Rule Redundancy in Non-Ground Answer-Set Programming over Finite Domains. In C. Baral, G. Brewka, & J. Schlipf (Eds.), Proceedings of the 9th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2007) (pp. 123–135). Springer. http://hdl.handle.net/20.500.12708/51780
- Complexity Results for Checking Equivalence of Stratified Logic Programs / Eiter, T., Fink, M., Tompits, H., & Woltran, S. (2007). Complexity Results for Checking Equivalence of Stratified Logic Programs. In M. Veloso (Ed.), Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI 2007) (pp. 330–335). AAAI Press. http://hdl.handle.net/20.500.12708/51779
- spock: A Debugging Support Tool for Logic Programs under the Answer-Set Semantics / Gebser, M., Puehrer, J., Schaub, T., Tompits, H., & Woltran, S. (2007). spock: A Debugging Support Tool for Logic Programs under the Answer-Set Semantics. In Proc. of 17th International Conference on Applications of Declarative Programming and Knowledge Management (INAP 2007) and 21st Workshop on (Constraint) Logic Programming (WLP 2007) (p. 4). Bayerische Julius-Maximilians-Universität Würzburg,. http://hdl.handle.net/20.500.12708/52027
- Testing Relativised Uniform Equivalence under Answer-Set Projection in the System ccT / Oetsch, J., Seidl, M., Tompits, H., & Woltran, S. (2007). Testing Relativised Uniform Equivalence under Answer-Set Projection in the System ccT. In Proc. of 17th International Conference on Applications of Declarative Programming and Knowledge Management (INAP 2007) and 21st Workshop on (Constraint) Logic Programming (WLP 2007) (p. 4). http://hdl.handle.net/20.500.12708/51977
- Combining Answer Set Programming with Description Logics for the Semantic Web / Eiter, T., Ianni, G., Lukasiewicz, T., Schindlauer, R., & Tompits, H. (2007). Combining Answer Set Programming with Description Logics for the Semantic Web (INFSYS RR-1843-07-04). http://hdl.handle.net/20.500.12708/33092
- Characterising Equilibrium Logic and Nested Logic Programs: Reductions and Complexity / Pearce, D., Tompits, H., & Woltran, S. (2007). Characterising Equilibrium Logic and Nested Logic Programs: Reductions and Complexity (GIA-TR-2007-12-01). http://hdl.handle.net/20.500.12708/33090
2006
- Reasoning with Rules and Ontologies / Eiter, T., Ianni, G., Polleres, A., Schindlauer, R., & Tompits, H. (2006). Reasoning with Rules and Ontologies. In P. Barahona, F. Bry, E. Franconi, N. Henze, & U. Sattler (Eds.), Reasoning Web Second International Summer School 2006, Lisbon, Portugal, September 4-8, 2006, Tutorial Lectures (pp. 93–127). Lecture Notes in Computer Science. Springer. https://doi.org/10.1007/11837787_4
- Algorithmic Aspectc of Model Representations / Pichler, R. (2006). Algorithmic Aspectc of Model Representations. In M. Fink, H. Tompits, & S. Woltran (Eds.), 20th Workshop on Logic Programming (WLP2006) (pp. 12–20). INFSYS Research Report. http://hdl.handle.net/20.500.12708/51472
-
ccT: A Tool for Checking Advanced Correspondence Problems in Answer-Set Programming
/
Oetsch, J., Seidl, M., Tompits, H., & Woltran, S. (2006). ccT: A Tool for Checking Advanced Correspondence Problems in Answer-Set Programming. In Proceedings. ICLP’06 Workshop: Lash’06, Seattle, Washington, Non-EU. http://hdl.handle.net/20.500.12708/51606
Project: ModelCVS (2006–2007) - dlvhex: A Tool for Semantic-Web Reasoning under the Answer-Set Semantics / Eiter, T., Ianni, G., Schindlauer, R., & Tompits, H. (2006). dlvhex: A Tool for Semantic-Web Reasoning under the Answer-Set Semantics. In A. F. Polleres, S. Decker, G. Gupta, & J. De Bruijn (Eds.), Informal Proceedings Workshop on Applications of Logic Programming in the Semantic Web and Semantic Web Services (ALPSWS 2006) (pp. 33–39). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/51581
- dlvhex: A System for Integrating Multiple Semantics in an Answer-Set Programming Framework / Eiter, T., Ianni, G., Schindlauer, R., & Tompits, H. (2006). dlvhex: A System for Integrating Multiple Semantics in an Answer-Set Programming Framework. In M. Fink, H. Tompits, & S. Woltran (Eds.), Proceedings 20th Workshop on Logic Programming and Constraint Systems (WLP ’06) (pp. 206–210). http://hdl.handle.net/20.500.12708/51580
- Effective Integration of Declarative Rules with External Evaluations for Semantic Web Reasoning / Eiter, T., Ianni, G., Schindlauer, R., & Tompits, H. (2006). Effective Integration of Declarative Rules with External Evaluations for Semantic Web Reasoning. In Y. Sure & J. Domingue (Eds.), The Semantic Web: Research and Applications. Proceedings 3rd European Conference on Semantic Web (ESWC 2006) (pp. 273–287). Lecture Notes in Computer Science. Springer. http://hdl.handle.net/20.500.12708/51579
- On Representational Issues about Combinations of Classical Theories with Nonmonotonic Rules / De Bruijn, J., Eiter, T., Polleres, A. F., & Tompits, H. (2006). On Representational Issues about Combinations of Classical Theories with Nonmonotonic Rules. In J. Lang, F. Lin, & J. Wang (Eds.), Proceedings of the First International Conference on Knowledge Science, Engineering and Management (KSEM 2006) (pp. 1–22). Lecture Notes in Computer Science, Springer. http://hdl.handle.net/20.500.12708/51660
- A RuleML Syntax for Answer-Set Programming / Eiter, T., Ianni, G., Schindlauer, R., & Tompits, H. (2006). A RuleML Syntax for Answer-Set Programming. In A. F. Polleres, S. Decker, G. Gupta, & J. De Bruijn (Eds.), Informal Proceedings Workshop on Applications of Logic Programming in the Semantic Web and Semantic Web Services (ALPSWS 2006), at FLOC/ICLP 2006. (pp. 107–108). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/51748
- dlvhex: A Prover for Semantic-Web Reasoning under Answer-Set Semantics / Eiter, T., Ianni, G., Schindlauer, R., & Tompits, H. (2006). dlvhex: A Prover for Semantic-Web Reasoning under Answer-Set Semantics. In T. Nishida, Z. Shi, U. Visser, X. Wu, J. Liu, B. Wah, W. Cheung, & Y.-M. Cheung (Eds.), Proceedings The 2006 IEEE/WIC/ACM International Conference on Web Intelligence (WI-06) (pp. 1073–1074). IEEE Computer Society Press. http://hdl.handle.net/20.500.12708/51711
- Towards Efficient Evaluation of HEX Programs / Eiter, T., Ianni, G., Schindlauer, R., & Tompits, H. (2006). Towards Efficient Evaluation of HEX Programs. In J. Dix & A. Hunter (Eds.), Proceedings of the 11th Workshop on Nonmonotonic Reasoning (pp. 40–46). Clausthal University of Technology. http://hdl.handle.net/20.500.12708/51648
- Forgetting in Managing Rules and Ontologies / Eiter, T., Ianni, G., Schindlauer, R., Tompits, H., & Wang, K. (2006). Forgetting in Managing Rules and Ontologies. In T. Nishida, Z. Shi, U. Visser, X. Wu, J. Liu, B. Wah, W. Cheung, & Y.-M. Cheung (Eds.), Proceedings The 2006 IEEE/WIC/ACM International Conference on Web Intelligence (WI-06) (pp. 411–419). IEEE Computer Society Press. http://hdl.handle.net/20.500.12708/51645
- Forgetting in Managing Rules and Ontologies / Eiter, T., Ianni, G., Schindlauer, R., Tompits, H., & Wang, K. (2006). Forgetting in Managing Rules and Ontologies. In A. F. Polleres, S. Decker, G. Gupta, & J. De Bruijn (Eds.), Informal Proceedings Workshop on Applications of Logic Programming in the Semantic Web and Semantic Web Services (ALPSWS 2006) (pp. 1–16). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/51641
-
ccT: A Tool for Checking Advanced Correspondence Problems in Answer-Set Programming
/
Oetsch, J., Seidl, M., Tompits, H., & Woltran, S. (2006). ccT: A Tool for Checking Advanced Correspondence Problems in Answer-Set Programming. In Proceedings of CIC-06 (pp. 3–11). IEEE Computer Society. http://hdl.handle.net/20.500.12708/51609
Project: ModelCVS (2006–2007) - A Preference-Based Framework for Updating Logic Programs: Preliminary Report / Delgrande, J. P., Schaub, T., & Tompits, H. (2006). A Preference-Based Framework for Updating Logic Programs: Preliminary Report. In E. Pontelli & T. C. Son (Eds.), Informal Proceedings Workshop on Preferences and their Applications in Logic Programming (PREFS 2006) (p. 15). FLOC-Workshop on Preferences and their Applications in Logic Programming (PREFS 2006). http://hdl.handle.net/20.500.12708/51592
- Replacements in Non-Ground Answer-Set Programming / Eiter, T., Fink, M., Tompits, H., Traxler, P., & Woltran, S. (2006). Replacements in Non-Ground Answer-Set Programming. In P. Doherty, J. Mylopoulos, & C. Welty (Eds.), Proceedings of the 10th International Conference on Principles of Knowledge Representation and Reasoning (KR 2006), Lake District of the United Kingdom, June 2--5 (pp. 340–351). AAAI Press. http://hdl.handle.net/20.500.12708/51567
- Replacements in Non-Ground Answer-Set Programming / Eiter, T., Fink, M., Tompits, H., Traxler, P., & Woltran, S. (2006). Replacements in Non-Ground Answer-Set Programming. In M. Fink, H. Tompits, & S. Woltran (Eds.), Proceedings of the 20th Workshop on Logic Programming (WLP 2006), Vienna, Austria, February 22--24 (p. 9). TU Wien, Institut fuer Informationssysteme. http://hdl.handle.net/20.500.12708/51566
-
A Tool for Advanced Correspondence Checking in Answer-Set Programming
/
Oetsch, J., Seidl, M., Tompits, H., & Woltran, S. (2006). A Tool for Advanced Correspondence Checking in Answer-Set Programming. In Proceedings is for the Eleventh International Workshop on Nonmonotonic Reasoning. 11th International Workshop on Nonmonotonic Reasoning, Lake District, UK, EU. http://hdl.handle.net/20.500.12708/51451
Project: ModelCVS (2006–2007) -
A Tool for Advanced Correspondence Checking in Answer-Set Programming: Preliminary Experimental Results
/
Oetsch, J., Seidl, M., Tompits, H., & Woltran, S. (2006). A Tool for Advanced Correspondence Checking in Answer-Set Programming: Preliminary Experimental Results. In Online Proceedings - WLP 2006. 20th Workshop on Logic Programming, Wien, EU. http://hdl.handle.net/20.500.12708/51450
Project: ModelCVS (2006–2007) -
ccT: A Correspondence-Checking Tool For Logic Programs Under The Answer-Set Semantics
/
Oetsch, J., Seidl, M., Tompits, H., & Woltran, S. (2006). ccT: A Correspondence-Checking Tool For Logic Programs Under The Answer-Set Semantics. In Proceedings of the JELIA2006 (pp. 502–505). Springer. http://hdl.handle.net/20.500.12708/51449
Project: ModelCVS (2006–2007) - Proceedings of the 20th Workshop on Logic Programming (WLP 2006), Vienna, Austria, February 22--24 / Fink, M., Tompits, H., & Woltran, S. (Eds.). (2006). Proceedings of the 20th Workshop on Logic Programming (WLP 2006), Vienna, Austria, February 22--24. TU Wien. http://hdl.handle.net/20.500.12708/22322
2005
- Reasoning about Evolving Nonmonotonic Knowledge Bases / Eiter, T., Fink, M., Sabbatini, G., & Tompits, H. (2005). Reasoning about Evolving Nonmonotonic Knowledge Bases. ACM Transactions on Computational Logic, 6(2), 389–440. http://hdl.handle.net/20.500.12708/173370
- Representing Paraconsistent Reasoning via Quantified Propositional Logic / Besnard, P., Schaub, T., Tompits, H., & Woltran, S. (2005). Representing Paraconsistent Reasoning via Quantified Propositional Logic. In L. Bertossi (Ed.), Inconsistency Tolerance (pp. 84–118). Springer, LNCS 3300. http://hdl.handle.net/20.500.12708/25356
- Nonmonotonic Description Logic Programs: Implementation and Experiments / Eiter, T., Ianni, G., Schindlauer, R., & Tompits, H. (2005). Nonmonotonic Description Logic Programs: Implementation and Experiments. In F. Baader & A. Voronkov (Eds.), Proceedings of the 12th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (pp. 511–527). Springer. http://hdl.handle.net/20.500.12708/51275
- Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming / Tompits, H., & Woltran, S. (2005). Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming. In M. De Vos & A. Provetti (Eds.), Answer Set Programming, Advances in Theory and Implementation, Proceedings of the 3rd Intl. ASP’05 Workshop (pp. 115–129). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/51106
- Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming / Tompits, H., & Woltran, S. (2005). Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming. In M. Gabbrielli & G. Gupta (Eds.), Proceedings of the 21st International Conference on Logic Programming (pp. 189–203). Springer. http://hdl.handle.net/20.500.12708/51103
- DLV-HEX: Dealing with Semantic Web under Answer-Set Programming / Eiter, T., Ianni, G., Schindlauer, R., & Tompits, H. (2005). DLV-HEX: Dealing with Semantic Web under Answer-Set Programming. In R. Mizoguchi (Ed.), Poster & Demonstration Proceedings of the 4th International Semantic Web Conference (ISWC 2005) (p. PID 73). http://hdl.handle.net/20.500.12708/51348
- NLP-DL: A KR System for Coupling Nonmonotonic Logic Programs with Description Logics / Eiter, T., Ianni, G., Schindlauer, R., & Tompits, H. (2005). NLP-DL: A KR System for Coupling Nonmonotonic Logic Programs with Description Logics. In R. Mizoguchi (Ed.), Poster & Demonstration Proceedings of the 4th International Semantic Web Conference (ISWC 2005) (p. PID 67). http://hdl.handle.net/20.500.12708/51347
- A General Framework for Expressing Preferences in Causal Reasoning and Planning / Delgrande, J. P., Schaub, T., & Tompits, H. (2005). A General Framework for Expressing Preferences in Causal Reasoning and Planning. In S. McIlraith, P. Peppas, & M. Thielscher (Eds.), Proceedings of the 7th International Symposium on Logical Formalizations of Commonsense Reasoning (COMMONSENSE 2005) (pp. 47–54). http://hdl.handle.net/20.500.12708/51336
- A Uniform Integration of Higher-Order Reasoning and External Evaluations in Answer -Set Programming / Eiter, T., Ianni, G., Schindlauer, R., & Tompits, H. (2005). A Uniform Integration of Higher-Order Reasoning and External Evaluations in Answer -Set Programming. In Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI-05) (pp. 90–96). Professional Book Center. http://hdl.handle.net/20.500.12708/51276
- On Solution Correspondences in Answer-Set Programming / Eiter, T., Tompits, H., & Woltran, S. (2005). On Solution Correspondences in Answer-Set Programming. In Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI-05) (pp. 97–102). http://hdl.handle.net/20.500.12708/51105
- Strong and Uniform Equivalence in Answer-Set Programming: Characterizations and Complexity Results for the Non-Ground Case / Eiter, T., Fink, M., Tompits, H., & Woltran, S. (2005). Strong and Uniform Equivalence in Answer-Set Programming: Characterizations and Complexity Results for the Non-Ground Case. In Proceedings, The Twentieth National Conference on Artificial Intelligence and the Seventeenth Innovative Applications of Artificial Intelligence Conference, (pp. 695–700). AAAI Press / The MIT Press 2005. http://hdl.handle.net/20.500.12708/51104
- Test and Comparison Results / Eiter, T., Fink, M., & Tompits, H. (2005). Test and Comparison Results. http://hdl.handle.net/20.500.12708/33055
- Self-assessment Report for Years 3+4 / Eiter, T., Fink, M., & Tompits, H. (2005). Self-assessment Report for Years 3+4. http://hdl.handle.net/20.500.12708/33054
2004
- On Eliminating Disjunctions in Stable Logic Programming / Tompits, H. (2004). On Eliminating Disjunctions in Stable Logic Programming. Seminarvortrag, Regensburg, Germany, EU. http://hdl.handle.net/20.500.12708/84319
- On Simplifying and Rewriting Logic Programs: Characterisations and Complexity / Tompits, H., & Woltran, S. (2004). On Simplifying and Rewriting Logic Programs: Characterisations and Complexity. Seminarvortrag, Regensburg, Germany, EU. http://hdl.handle.net/20.500.12708/84318
- Self-assessment report for year 2 / Eiter, T., Faber, W., & Tompits, H. (2004). Self-assessment report for year 2. http://hdl.handle.net/20.500.12708/32952
- Methods and Techniques for Query Optimization / Eiter, T., Faber, W., Fink, M., Greco, G., Lembo, D., & Tompits, H. (2004). Methods and Techniques for Query Optimization. http://hdl.handle.net/20.500.12708/32951
2003
- Quantifizierte Boole'sche Formeln für Anwendungen in der Wissensrepräsentation / Tompits, H. (2003). Quantifizierte Boole’sche Formeln für Anwendungen in der Wissensrepräsentation. Seminarvortrag, Regensburg, Germany, EU. http://hdl.handle.net/20.500.12708/84236
- Self-assessment report for year 1 / Eiter, T., Fink, M., & Tompits, H. (2003). Self-assessment report for year 1. http://hdl.handle.net/20.500.12708/32957
- Combining Answer Set Programming with Description Logics for the Semantic Web / Eiter, T., Lukasiewicz, T., Schindlauer, R., & Tompits, H. (2003). Combining Answer Set Programming with Description Logics for the Semantic Web. http://hdl.handle.net/20.500.12708/32933
- A Knowledge-Based Approach for Selecting Information Sources / Eiter, T., Fink, M., & Tompits, H. (2003). A Knowledge-Based Approach for Selecting Information Sources. http://hdl.handle.net/20.500.12708/32932
- On Eliminating Disjunctions in Stable Logic Programming / Eiter, T., Fink, M., Tompits, H., & Woltran, S. (2003). On Eliminating Disjunctions in Stable Logic Programming. http://hdl.handle.net/20.500.12708/32929
- On Computing Solutions to Belief Change Scenarios / Delgrande, J. P., Schaub, T., Tompits, H., & Woltran, S. (2003). On Computing Solutions to Belief Change Scenarios. http://hdl.handle.net/20.500.12708/32927
2002
- Declarative Update Policies for Nonmonotonic Knowledge Bases (INFSYS RR-1843-02-07) / Eiter, T., Fink, M., Sabbatini, G., & Tompits, H. (2002). Declarative Update Policies for Nonmonotonic Knowledge Bases (INFSYS RR-1843-02-07). http://hdl.handle.net/20.500.12708/32795
- Reasoning about Evolving Nonmonotonic Knowledge Bases / Eiter, T., Fink, M., Sabbatini, G., & Tompits, H. (2002). Reasoning about Evolving Nonmonotonic Knowledge Bases. http://hdl.handle.net/20.500.12708/32789
- On Encodings of Nested Logic Programs / Tompits, H. (2002). On Encodings of Nested Logic Programs. Seminarvortrag, Regensburg, Germany, EU. http://hdl.handle.net/20.500.12708/84097
- On Encodings of Nested Logic Programs / Tompits, H. (2002). On Encodings of Nested Logic Programs. Seminarvortrag, Regensburg, Germany, EU. http://hdl.handle.net/20.500.12708/84096
- Polynomial Translations of Nested Logic Programs into Disjunctive Logic Programs / Pearce, D., Schaub, T., Sarsakov, V., Tompits, H., & Woltran, S. (2002). Polynomial Translations of Nested Logic Programs into Disjunctive Logic Programs. http://hdl.handle.net/20.500.12708/32790
- A Knowledge-Based Approach to Information Site Selection / Eiter, T., Fink, M., & Tompits, H. (2002). A Knowledge-Based Approach to Information Site Selection. http://hdl.handle.net/20.500.12708/32788
2000
- On Updates of Logic Programs: Semantics and Properties / Eiter, T., Fink, M., Sabbatini, G., & Tompits, H. (2000). On Updates of Logic Programs: Semantics and Properties. http://hdl.handle.net/20.500.12708/32955
- Using Methods of Declarative Logic Programming for Intelligent InformationAgents / Eiter, T., Fink, M., Sabbatini, G., & Tompits, H. (2000). Using Methods of Declarative Logic Programming for Intelligent InformationAgents. http://hdl.handle.net/20.500.12708/32956
Supervisions
-
On the axiomatisation of non-validity: Sequent-type rejection systems and beyond
/
Rinke, M. (2023). On the axiomatisation of non-validity: Sequent-type rejection systems and beyond [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.113415
Download: PDF (2.19 MB) -
On constructing assertional and complementary sequent calculi for non-deterministic finite-valued logics
/
Gius, M. (2022). On constructing assertional and complementary sequent calculi for non-deterministic finite-valued logics [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.103584
Download: PDF (607 KB) -
PAUL-2: A transformer-based algorithmic composer of two-track piano pieces
/
Schön, F. (2022). PAUL-2: A transformer-based algorithmic composer of two-track piano pieces [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.103585
Download: PDF (1.88 MB) -
On automated theorem proving for assertional and refutational natural deduction systems
/
Maurer, M. (2022). On automated theorem proving for assertional and refutational natural deduction systems [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.105603
Download: PDF (945 KB) -
Testing for ASP - ASP for testing
/
Oetsch, J. (2021). Testing for ASP - ASP for testing [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2022.102508
Download: PDF (1.6 MB) -
Towards a reliable system architecture for autonomous vehicles
/
Kain, T. (2020). Towards a reliable system architecture for autonomous vehicles [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2020.75021
Download: PDF (13.9 MB) -
Structural reasoning methods for satisfiability solving and beyond
/
Kiesl-Reiter, B. (2019). Structural reasoning methods for satisfiability solving and beyond [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2019.65201
Download: PDF (1.16 MB) -
Sequent-type calculi for variants of default logic
/
Pkhakadze, S. (2019). Sequent-type calculi for variants of default logic [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2019.47663
Download: PDF (598 KB) -
On reductions for multi-modal logics
/
Marinkovic, V. (2019). On reductions for multi-modal logics [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2019.63112
Download: PDF (806 KB) -
Design and implementation of an agent architecture combining emotions and reasoning
/
Tapolczai, J. (2016). Design and implementation of an agent architecture combining emotions and reasoning [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2016.30049
Download: PDF (4.74 MB) -
Provability interpretations of a many-sorted polymodal logic
/
Berger, G. (2015). Provability interpretations of a many-sorted polymodal logic [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2015.25040
Download: PDF (982 KB) -
On transforming answer-set programs towards natural-language representations
/
Kiesl, B. (2014). On transforming answer-set programs towards natural-language representations [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2014.26928
Download: PDF (774 KB) -
On supporting the development of answer-set programs using model-driven engineering techniques
/
Busoniu, P.-A. (2013). On supporting the development of answer-set programs using model-driven engineering techniques [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2013.22110
Download: PDF (2.58 MB) - Visualisation and graphical editing of answer sets : the Kara system / Kloimüllner, C. (2012). Visualisation and graphical editing of answer sets : the Kara system [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/161083
- On replacements in answer-set programming based on partial evaluation / Heindl, A. (2007). On replacements in answer-set programming based on partial evaluation [Master Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/181940
- Strict implication / Gröbner, S. (2003). Strict implication [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/186747
- Quantified Boolean formulas - from theory to practice / Woltran, S. (2003). Quantified Boolean formulas - from theory to practice [Dissertation, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/183034
- Declarative logic-programming components for information agents / Fink, M. (2002). Declarative logic-programming components for information agents [Dissertation, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/181711
- Declarative logic programming for representing evolving nonmonotonic knowledge bases / Sabbatini, G. (2002). Declarative logic programming for representing evolving nonmonotonic knowledge bases [Dissertation, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/180877
- The system QUIP: a solver for advanced reasoning tasks using quantified boolean formulas / Klotz, V. (2001). The system QUIP: a solver for advanced reasoning tasks using quantified boolean formulas [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/180017