default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHans Tompits
Person information
- affiliation: TU Wien, Vienna, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j27]Martin Gius, Hans Tompits
:
Sequent-type rejection systems for finite-valued non-deterministic logics. J. Appl. Non Class. Logics 33(3-4): 606-640 (2023)- [c107]Tobias Kain, Hans Tompits:
ReConf: An Automatic Context-Based Software Reconfiguration Tool for Autonomous Vehicles Using Answer-Set Programming. AI*IA 2023: 30-43 - [c106]Felix Schön, Hans Tompits:
PAUL-2: An Upgraded Transformer-Based Redesign of the Algorithmic Composer PAUL. AI*IA 2023: 278-291 - 2022
- [c105]Felix Schön, Hans Tompits:
PAUL: An Algorithmic Composer for Classical Piano Music Supporting Multiple Complexity Levels. EPIA 2022: 415-426 - 2021
- [j26]Johannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran:
Beyond Uniform Equivalence between Answer-set Programs. ACM Trans. Comput. Log. 22(1): 2:1-2:46 (2021) - [c104]Tobias Kain, Hans Tompits, Timo Frederik Horeis, Johannes Heinrich, Julian-Steffen Müller, Fabian Plinke, Hendrik Decke, Marcel Aguirre Mehlhorn:
C-PO: A Context-Based Application-Placement Optimization for Autonomous Vehicles. DATE 2021: 1288-1293 - 2020
- [j25]Sopo Pkhakadze, Hans Tompits:
Sequent-Type Calculi for Three-Valued and Disjunctive Default Logic. Axioms 9(3): 84 (2020) - [c103]Tobias Kain, Philipp Mundhenk, Julian-Steffen Müller, Hans Tompits, Maximilian Wesche, Hendrik Decke:
Towards a Reliable and Context-Based System Architecture for Autonomous Vehicles. ASD@DATE 2020: 1:1-1:7 - [c102]Tobias Geibinger, Hans Tompits:
Sequent-Type Calculi for Systems of Nonmonotonic Paraconsistent Logics. ICLP Technical Communications 2020: 178-191
2010 – 2019
- 2019
- [c101]Tobias Geibinger, Hans Tompits:
Characterising Relativised Strong Equivalence with Projection for Non-ground Answer-Set Programs. JELIA 2019: 542-558 - [c100]Tobias Kain, Hans Tompits:
\mathsf Uhura : An Authoring Tool for Specifying Answer-Set Programs Using Controlled Natural Language. JELIA 2019: 559-575 - [c99]Sopo Pkhakadze, Hans Tompits:
A Sequent-Type Calculus for Three-Valued Default Logic, Or: Tweety Meets Quartum Non Datur. LPNMR 2019: 163-177 - 2018
- [j24]Gerald Berger, Lev D. Beklemishev, Hans Tompits:
A many-sorted variant of Japaridze's polymodal provability logic. Log. J. IGPL 26(5): 505-538 (2018) - [j23]Benjamin Kiesl, Martina Seidl, Hans Tompits, Armin Biere:
Local Redundancy in SAT: Generalizations of Blocked Clauses. Log. Methods Comput. Sci. 14(4) (2018) - [j22]Johannes Oetsch, Jörg Pührer, Hans Tompits:
Stepwise debugging of answer-set programs. Theory Pract. Log. Program. 18(1): 30-80 (2018) - [c98]Sanja Pavlovic, Hans Tompits:
A Tableau Calculus for a Multi-modal Logic of Dishonesty. AI*IA 2018: 238-251 - 2017
- [c97]Benjamin Kiesl, Martina Seidl, Hans Tompits, Armin Biere:
Blockedness in Propositional Logic: Are You Satisfied With Your Neighborhood? IJCAI 2017: 4884-4888 - [c96]Min Fang, Hans Tompits:
An Approach for Representing Answer Sets in Natural Language. DECLARE 2017: 115-131 - [c95]Benjamin Kiesl, Martin Suda, Martina Seidl, Hans Tompits, Armin Biere:
Blocked Clauses in First-Order Logic. LPAR 2017: 31-48 - [c94]Alexander Greßler, Johannes Oetsch, Hans Tompits:
\mathsf Harvey : A System for Random Testing in ASP. LPNMR 2017: 229-235 - [i22]Benjamin Kiesl, Martin Suda, Martina Seidl, Hans Tompits, Armin Biere:
Blocked Clauses in First-Order Logic. CoRR abs/1702.00847 (2017) - [i21]Benjamin Kiesl, Martina Seidl, Hans Tompits, Armin Biere:
Local Redundancy in SAT: Generalizations of Blocked Clauses. CoRR abs/1702.05527 (2017) - [i20]Johannes Oetsch, Jörg Pührer, Hans Tompits:
Stepwise Debugging of Answer-Set Programs. CoRR abs/1705.06564 (2017) - 2016
- [c93]Benjamin Kiesl, Martina Seidl, Hans Tompits, Armin Biere:
Super-Blocked Clauses. IJCAR 2016: 45-61 - 2015
- [c92]Benjamin Kiesl, Peter Schüller, Hans Tompits:
On Structural Analysis of Non-Ground Answer-Set Programs. ICLP (Technical Communications) 2015 - 2014
- [i19]Tomi Janhunen, Emilia Oikarinen, Hans Tompits, Stefan Woltran:
Modularity Aspects of Disjunctive Stable Models. CoRR abs/1401.3484 (2014) - 2013
- [j21]Thomas Eiter, Michael Fink, Jörg Pührer, Hans Tompits, Stefan Woltran:
Model-based recasting in answer-set programming. J. Appl. Non Class. Logics 23(1-2): 75-104 (2013) - [j20]James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran:
A Model-Theoretic Approach to Belief Change in Answer Set Programming. ACM Trans. Comput. Log. 14(2): 14:1-14:46 (2013) - [j19]Paula-Andra Busoniu, Johannes Oetsch, Jörg Pührer, Peter Skocovsky, Hans Tompits:
SeaLion: An eclipse-based IDE for answer-set programming with advanced debugging support. Theory Pract. Log. Program. 13(4-5): 657-673 (2013) - [c91]Gerald Berger, Hans Tompits:
On Axiomatic Rejection for the Description Logic ALC. KDPD 2013: 65-82 - [e2]Hans Tompits, Salvador Abreu, Johannes Oetsch, Jörg Pührer, Dietmar Seipel, Masanobu Umeda, Armin Wolf:
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. Lecture Notes in Computer Science 7773, Springer 2013, ISBN 978-3-642-41523-4 [contents] - 2012
- [j18]Marina De Vos, Doga Gizem Kisa, Johannes Oetsch, Jörg Pührer, Hans Tompits:
Annotating answer-set programs in Lana. Theory Pract. Log. Program. 12(4-5): 619-637 (2012) - [c90]Johannes Oetsch, Jörg Pührer, Hans Tompits:
Stepwise Debugging of Description-Logic Programs. Correct Reasoning 2012: 492-508 - [c89]Johannes Oetsch, Jörg Pührer, Hans Tompits:
An FLP-Style Answer-Set Semantics for Abstract-Constraint Programs with Disjunctions. ICLP (Technical Communications) 2012: 222-234 - [c88]Johannes Oetsch, Michael Prischink, Jörg Pührer, Martin Schwengerer, Hans Tompits:
On the Small-Scope Hypothesis for Testing Answer-Set Programs. KR 2012 - [c87]Magdalena Widl, Armin Biere, Petra Brosch, Uwe Egly, Marijn Heule, Gerti Kappel, Martina Seidl, Hans Tompits:
Guided Merging of Sequence Diagrams. SLE 2012: 164-183 - [c86]Petra Brosch, Uwe Egly, Sebastian Gabmeyer, Gerti Kappel, Martina Seidl, Hans Tompits, Magdalena Widl, Manuel Wimmer:
Towards Scenario-Based Testing of UML Diagrams. TAP@TOOLS 2012: 149-155 - [i18]Marina De Vos, Doga Gizem Kisa, Johannes Oetsch, Jörg Pührer, Hans Tompits:
Annotating Answer-Set Programs in LANA? CoRR abs/1210.2195 (2012) - 2011
- [j17]Jos de Bruijn, Thomas Eiter, Axel Polleres, Hans Tompits:
Embedding nonground logic programs into autoepistemic logic for knowledge-base combination. ACM Trans. Comput. Log. 12(3): 20:1-20:39 (2011) - [c85]Johannes Oetsch, Jörg Pührer, Hans Tompits:
The SeaLion has Landed: An IDE for Answer-Set Programming - Preliminary Report. INAP/WLP 2011: 305-324 - [c84]Christian Kloimüllner, Johannes Oetsch, Jörg Pührer, Hans Tompits:
Kara: A System for Visualising and Visual Editing of Interpretations for Answer-Set Programs. INAP/WLP 2011: 325-344 - [c83]Johannes Oetsch, Jörg Pührer, Hans Tompits:
Stepping through an Answer-Set Program. LPNMR 2011: 134-147 - [c82]Tomi Janhunen, Ilkka Niemelä, Johannes Oetsch, Jörg Pührer, Hans Tompits:
Random vs. Structure-Based Testing of Answer-Set Programs: An Experimental Comparison. LPNMR 2011: 242-247 - [c81]Johannes Oetsch, Hans Tompits:
Gentzen-Type Refutation Systems for Three-Valued Logics with an Application to Disproving Strong Equivalence. LPNMR 2011: 254-259 - [c80]Johannes Oetsch, Jörg Pührer, Martina Seidl, Hans Tompits, Patrick Zwickl:
VIDEAS: A Development Tool for Answer-Set Programs Based on Model-Driven Engineering Technology. LPNMR 2011: 382-387 - [c79]Petra Brosch, Uwe Egly, Sebastian Gabmeyer, Gerti Kappel, Martina Seidl, Hans Tompits, Magdalena Widl, Manuel Wimmer:
Towards Semantics-Aware Merge Support in Optimistic Model Versioning. MoDELS (Workshops) 2011: 246-256 - [i17]Johannes Oetsch, Jörg Pührer, Hans Tompits:
The SeaLion has Landed: An IDE for Answer-Set Programming---Preliminary Report. CoRR abs/1109.3989 (2011) - [i16]Christian Kloimüllner, Johannes Oetsch, Jörg Pührer, Hans Tompits:
Kara: A System for Visualising and Visual Editing of Interpretations for Answer-Set Programs. CoRR abs/1109.4095 (2011) - [i15]Johannes Oetsch, Jörg Pührer, Hans Tompits:
Extending Object-Oriented Languages by Declarative Specifications of Complex Objects using Answer-Set Programming. CoRR abs/1112.0922 (2011) - 2010
- [j16]Johannes Oetsch, Jörg Pührer, Hans Tompits:
Catching the Ouroboros: On debugging non-ground answer-set programs. Theory Pract. Log. Program. 10(4-6): 513-529 (2010) - [j15]Johannes Oetsch, Jörg Pührer, Martin Schwengerer, Hans Tompits:
The system Kato: Detecting cases of plagiarism for answer-set programs. Theory Pract. Log. Program. 10(4-6): 759-775 (2010) - [c78]Tomi Janhunen, Ilkka Niemelä, Johannes Oetsch, Jörg Pührer, Hans Tompits:
On Testing Answer-Set Programs. ECAI 2010: 951-956 - [c77]Johannes Oetsch, Jörg Pührer, Hans Tompits:
Methods and Methodologies for Developing Answer-Set Programs - Project Description. ICLP (Technical Communications) 2010: 154-161 - [i14]Johannes Oetsch, Jörg Pührer, Martin Schwengerer, Hans Tompits:
The System Kato: Detecting Cases of Plagiarism for Answer-Set Programs. CoRR abs/1007.4971 (2010) - [i13]Johannes Oetsch, Jörg Pührer, Hans Tompits:
Catching the Ouroboros: On Debugging Non-ground Answer-Set Programs. CoRR abs/1007.4986 (2010)
2000 – 2009
- 2009
- [j14]Tomi Janhunen, Emilia Oikarinen, Hans Tompits, Stefan Woltran:
Modularity Aspects of Disjunctive Stable Models. J. Artif. Intell. Res. 35: 813-857 (2009) - [j13]David Pearce, Hans Tompits, Stefan Woltran:
Characterising equilibrium logic and nested logic programs: Reductions and complexity, . Theory Pract. Log. Program. 9(5): 565-616 (2009) - [c76]James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran:
Merging Logic Programs under Answer Set Semantics. ICLP 2009: 160-174 - [c75]Jörg Pührer, Hans Tompits:
Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection. LPNMR 2009: 264-276 - [c74]Johannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran:
ccT on Stage: Generalised Uniform Equivalence Testing for Verifying Student Assignment Solutions. LPNMR 2009: 382-395 - [i12]David Pearce, Hans Tompits, Stefan Woltran:
Characterising equilibrium logic and nested logic programs: Reductions and complexity. CoRR abs/0906.2228 (2009) - [i11]James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran:
A general approach to belief change in answer set programming. CoRR abs/0912.5511 (2009) - 2008
- [j12]Thomas Eiter, Giovambattista Ianni, Thomas Lukasiewicz, Roman Schindlauer, Hans Tompits:
Combining answer set programming with description logics for the Semantic Web. Artif. Intell. 172(12-13): 1495-1539 (2008) - [c73]Martin Gebser, Jörg Pührer, Torsten Schaub, Hans Tompits:
A Meta-Programming Technique for Debugging Answer-Set Programs. AAAI 2008: 448-453 - [c72]Martin Gebser, Torsten Schaub, Hans Tompits, Stefan Woltran:
Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets. FoIKS 2008: 24-41 - [c71]Jörg Pührer, Hans Tompits, Stefan Woltran:
Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence. ICLP 2008: 561-575 - [c70]Johannes Oetsch, Hans Tompits:
Program Correspondence under the Answer-Set Semantics: The Non-ground Case. ICLP 2008: 591-605 - [c69]James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran:
Belief Revision of Logic Programs under Answer Set Semantics. KR 2008: 411-421 - [c68]Wolfgang Faber, Hans Tompits, Stefan Woltran:
Notions of Strong Equivalence for Logic Programs with Ordered Disjunction. KR 2008: 433-443 - [c67]Jos de Bruijn, Thomas Eiter, Hans Tompits:
Embedding Approaches to Combining Rules and Ontologies into Autoepistemic Logic. KR 2008: 485-495 - [i10]Jos de Bruijn, Thomas Eiter, Axel Polleres, Hans Tompits:
Embedding Non-Ground Logic Programs into Autoepistemic Logic for Knowledge Base Combination. CoRR abs/0811.0359 (2008) - 2007
- [j11]James P. Delgrande, Torsten Schaub, Hans Tompits:
A General Framework for Expressing Preferences in Causal Reasoning and Planning. J. Log. Comput. 17(5): 871-907 (2007) - [j10]Thomas Eiter, Michael Fink, Hans Tompits:
A knowledge-based approach for selecting information sources. Theory Pract. Log. Program. 7(3): 249-300 (2007) - [c66]Johannes Oetsch, Hans Tompits, Stefan Woltran:
Facts Do Not Cease to Exist Because They Are Ignored: Relativised Uniform Equivalence with Answer-Set Projection. AAAI 2007: 458-464 - [c65]Jos de Bruijn, Thomas Eiter, Axel Polleres, Hans Tompits:
Embedding Non-Ground Logic Programs into Autoepistemic Logic for Knowledge-Base Combination. IJCAI 2007: 304-309 - [c64]Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran:
Complexity Results for Checking Equivalence of Stratified Logic Programs. IJCAI 2007: 330-335 - [c63]Martin Brain, Martin Gebser, Jörg Pührer, Torsten Schaub, Hans Tompits, Stefan Woltran:
Debugging ASP Programs by Means of ASP. LPNMR 2007: 31-43 - [c62]James P. Delgrande, Torsten Schaub, Hans Tompits:
A Preference-Based Framework for Updating Logic Programs. LPNMR 2007: 71-83 - [c61]Michael Fink, Reinhard Pichler, Hans Tompits, Stefan Woltran:
Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains. LPNMR 2007: 123-135 - [c60]Martin Gebser, Torsten Schaub, Hans Tompits, Stefan Woltran:
Alternative Characterizations for Program Equivalence under Answer-Set Semantics: Preliminary Report. CENT 2007 - [c59]Tomi Janhunen, Emilia Oikarinen, Hans Tompits, Stefan Woltran:
Modularity Aspects of Disjunctive Stable Models. LPNMR 2007: 175-187 - [c58]David Pearce, Hans Tompits, Stefan Woltran:
Relativised Equivalence in Equilibrium Logic and its Applications to Prediction and Explanation: Preliminary Report. CENT 2007 - [c57]Johannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran:
Testing Relativised Uniform Equivalence under Answer-Set Projection in the System ccT. INAP/WLP 2007: 241-246 - [c56]Martin Gebser, Jörg Pührer, Torsten Schaub, Hans Tompits, Stefan Woltran:
spock: A Debugging Support Tool for Logic Programs under the Answer-Set Semantics. INAP/WLP 2007: 247-252 - 2006
- [c55]Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits:
Effective Integration of Declarative Rules with External Evaluations for Semantic-Web Reasoning. ESWC 2006: 273-287 - [c54]Johannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran:
ccT: A Correspondence-Checking Tool for Logic Programs Under the Answer-Set Semantics. JELIA 2006: 502-505 - [c53]Thomas Eiter, Michael Fink, Hans Tompits, Patrick Traxler, Stefan Woltran:
Replacements in Non-Ground Answer-Set Programming. KR 2006: 340-351 - [c52]Jos de Bruijn, Thomas Eiter, Axel Polleres, Hans Tompits:
On Representational Issues About Combinations of Classical Theories with Nonmonotonic Rules. KSEM 2006: 1-22 - [c51]Thomas Eiter, Giovambattista Ianni, Axel Polleres, Roman Schindlauer, Hans Tompits:
Reasoning with Rules and Ontologies. Reasoning Web 2006: 93-127 - [c50]Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits, Kewen Wang:
Forgetting in Managing Rules and Ontologies. Web Intelligence 2006: 411-419 - [c49]Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits:
dlvhex: A Prover for Semantic-Web Reasoning under the Answer-Set Semantics. Web Intelligence 2006: 1073-1074 - [c48]Thomas Eiter, Michael Fink, Hans Tompits, Patrick Traxler, Stefan Woltran:
Replacements in Non-Ground Answer-Set Programming. WLP 2006: 145-153 - [c47]Johannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran:
A Tool for Advanced Correspondence Checking in Answer-Set Programming: Preliminary Experimental Results. WLP 2006: 200-205 - [c46]Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits:
dlvhex: A System for Integrating Multiple Semantics in an Answer-Set Programming Framework. WLP 2006: 206-210 - [e1]Michael Fink, Hans Tompits, Stefan Woltran:
20th Workshop on Logic Programming, Vienna, Austria, February 22--24, 2006. INFSYS Research Report 1843-06-02, Technische Universität Wien, Austria 2006 [contents] - [i9]Thomas Eiter, Michael Fink, Hans Tompits:
A Knowledge-Based Approach for Selecting Information Sources. CoRR abs/cs/0604086 (2006) - 2005
- [j9]Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits:
Reasoning about evolving nonmonotonic knowledge bases. ACM Trans. Comput. Log. 6(2): 389-440 (2005) - [c45]Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran:
Strong and Uniform Equivalence in Answer-Set Programming: Characterizations and Complexity Results for the Non-Ground Case. AAAI 2005: 695-700 - [c44]Hans Tompits, Stefan Woltran:
Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming. Answer Set Programming 2005 - [c43]Philippe Besnard, Torsten Schaub, Hans Tompits, Stefan Woltran:
Representing Paraconsistent Reasoning via Quantified Propositional Logic. Inconsistency Tolerance 2005: 84-118 - [c42]Hans Tompits, Stefan Woltran:
Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming. ICLP 2005: 189-203 - [c41]Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits:
A Uniform Integration of Higher-Order Reasoning and External Evaluations in Answer-Set Programming. IJCAI 2005: 90-96 - [c40]Thomas Eiter, Hans Tompits, Stefan Woltran:
On Solution Correspondences in Answer-Set Programming. IJCAI 2005: 97-102 - 2004
- [j8]James P. Delgrande, Torsten Schaub, Hans Tompits, Kewen Wang:
A Classification and Survey of Preference Handling Approaches in Nonmonotonic Reasoning. Comput. Intell. 20(2): 308-334 (2004) - [j7]James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran:
On Computing Belief Change Operations using Quantified Boolean Formulas. J. Log. Comput. 14(6): 801-826 (2004) - [c39]James P. Delgrande, Torsten Schaub, Hans Tompits:
Domain-Specific Preferences for Causal Reasoning and Planning. ICAPS 2004: 63-72 - [c38]Thomas Linke, Hans Tompits, Stefan Woltran:
On Acyclic and Head-Cycle Free Nested Logic Programs. ICLP 2004: 225-239 - [c37]Thomas Eiter, Thomas Lukasiewicz, Roman Schindlauer, Hans Tompits:
Combining Answer Set Programming with Description Logics for the Semantic Web. KR 2004: 141-151 - [c36]Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran:
On Eliminating Disjunctions in Stable Logic Programming. KR 2004: 447-458 - [c35]James P. Delgrande, Torsten Schaub, Hans Tompits:
Domain-Specific Preferences for Causal Reasoning and Planning. KR 2004: 673-682 - [c34]Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits:
Nonmonotonic Description Logic Programs: Implementation and Experiments. LPAR 2004: 511-527 - [c33]Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran:
Simplifying Logic Programs Under Uniform and Strong Equivalence. LPNMR 2004: 87-99 - [c32]Vladimir Sarsakov, Torsten Schaub, Hans Tompits, Stefan Woltran:
nlp: A Compiler for Nested Logic Programming. LPNMR 2004: 361-364 - [c31]Thomas Linke, Hans Tompits, Stefan Woltran:
On acyclic and head-cycle free nested logic programs. NMR 2004: 267-275 - [c30]Thomas Eiter, Thomas Lukasiewicz, Roman Schindlauer, Hans Tompits:
Well-Founded Semantics for Description Logic Programs in the Semantic Web. RuleML 2004: 81-97 - 2003
- [j6]Hans Tompits:
Expressing default abduction problems as quantified Boolean formulas. AI Commun. 16(2): 89-105 (2003) - [j5]Uwe Egly, Hans Tompits:
On Different Proof-Search Strategies for Orthologic. Stud Logica 73(1): 131-152 (2003) - [j4]James P. Delgrande, Torsten Schaub, Hans Tompits:
A Framework for Compiling Preferences in Logic Programs. Theory Pract. Log. Program. 3(2): 129-187 (2003) - [c29]Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran:
Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation. Answer Set Programming 2003 - [c28]Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits:
Declarative Update Policies for Nonmonotonic Knowledge Bases. Logics for Emerging Applications of Databases 2003: 85-129 - [c27]Philippe Besnard, Torsten Schaub, Hans Tompits, Stefan Woltran:
Paraconsistent Logics for Reasoning via Quantified Boolean Formulas, II: Circumscribing Inconsistent Theories. ECSQARU 2003: 528-539 - [c26]Uwe Egly, Martina Seidl, Hans Tompits, Stefan Woltran, Michael Zolda:
Comparing Different Prenexing Strategies for Quantified Boolean Formulas. SAT 2003: 214-228 - 2002
- [j3]