TU Wien Informatics

Overview Professors Scientific Staff Administrative Staff Student Staff External Lecturers By Responsibilities By Committee By Name
Related
Guest Professors Honoraries Alumni (LinkedIn) #5qw

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

Contact

2022W

2023S

 

Note: Due to the rollout of TU Wien’s new publication database, the list below may be slightly outdated. Once the migration is complete, everything will be up to date again.

2022

2021

2020

  • 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
  • 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, Italien, EU. 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

2019

2018

  • Stepwise debugging of answer-set programs / Pührer, J., Oetsch, 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
  • 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
  • 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 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
  • 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
  • $$\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
  • 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

2016

  • Super-Blocked Clauses / Kiesl, B., Seidl, M., Tompits, H., & Biere, A. (2016). Super-Blocked Clauses. In Automated Reasoning. 8th International Joint Conference, IJCAR 2016, Coimbra, Portugal, June 27 – July 2, 2016, Proceedings ; Olivetti, Nicola. Cham. https://doi.org/10.1007/978-3-319-40229-1_5

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

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

2013

2012

  • 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
  • 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
  • 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
  • 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
  • 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
  • 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
  • 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, FAME
  • 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, FAME
  • 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, FAME
  • 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

2011

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

  • Characterising Equilibrium Logic and Nested Logic Programs: Reductions and Complexity / PEARCE, D., TOMPITS, H., & WOLTRAN, S. (2009). Characterising Equilibrium Logic and Nested Logic Programs: Reductions and Complexity. Theory and Practice of Logic Programming, 9(05), 565–616. https://doi.org/10.1017/s147106840999010x
  • Modularity Aspects of Disjunctive Stable Models / Janhunen, T., Oikarinen, E., Tompits, H., & Woltran, S. (2009). Modularity Aspects of Disjunctive Stable Models. Journal of Artificial Intelligence Research, 35, 813–857. https://doi.org/10.1613/jair.2810
  • 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
  • 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
  • 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
  • spock: A Debugging Support Tool for Logic Programs under the Answer-Set Semantics / Gebser, M., Pührer, J., Schaub, T., Tompits, H., & Woltran, S. (2009). spock: A Debugging Support Tool for Logic Programs under the Answer-Set Semantics. In D. Seipel, M. Hanus, & A. Wolf (Eds.), Lecture Notes in Computer Science (pp. 247–252). Springer. https://doi.org/10.1007/978-3-642-00675-3_17
  • 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
  • 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

2007

2006

  • 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
  • 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
  • Reasoning with Rules and Ontologies / Eiter, T., Ianni, G., Polleres, A. F., Schindlauer, R., & Tompits, H. (2006). Reasoning with Rules and Ontologies. In P. Barahona, F. Bry, E. Franconi, N. Henze, & U. Sattler (Eds.), Lecture Notes in Computer Science. Reasoning Web (pp. 93–127). Lecture Notes in Computer Science. Springer. http://hdl.handle.net/20.500.12708/51647
  • 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
  • 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
  • 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
  • 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
  • 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
  • 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
  • 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
  • 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
  • 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

2004

2003

2002

2000

 

Note: Due to the rollout of TU Wien’s new publication database, the list below may be slightly outdated. Once the migration is complete, everything will be up to date again.