dblp.uni-trier.dewww.uni-trier.de

Hans Tompits Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
99EEJames P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran: Merging Logic Programs under Answer Set Semantics. ICLP 2009: 160-174
98EEJörg Pührer, Hans Tompits: Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection. LPNMR 2009: 264-276
97EEJohannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran: ccT on Stage: Generalised Uniform Equivalence Testing for Verifying Student Assignment Solutions. LPNMR 2009: 382-395
96EEDavid Pearce, Hans Tompits, Stefan Woltran: Characterising equilibrium logic and nested logic programs: Reductions and complexity CoRR abs/0906.2228: (2009)
2008
95 Martin Gebser, Jörg Pührer, Torsten Schaub, Hans Tompits: A Meta-Programming Technique for Debugging Answer-Set Programs. AAAI 2008: 448-453
94EEMartin Gebser, Torsten Schaub, Hans Tompits, Stefan Woltran: Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets. FoIKS 2008: 24-41
93EEJörg Pührer, Hans Tompits, Stefan Woltran: Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence. ICLP 2008: 561-575
92EEJohannes Oetsch, Hans Tompits: Program Correspondence under the Answer-Set Semantics: The Non-ground Case. ICLP 2008: 591-605
91 James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran: Belief Revision of Logic Programs under Answer Set Semantics. KR 2008: 411-421
90 Wolfgang Faber, Hans Tompits, Stefan Woltran: Notions of Strong Equivalence for Logic Programs with Ordered Disjunction. KR 2008: 433-443
89 Jos de Bruijn, Thomas Eiter, Hans Tompits: Embedding Approaches to Combining Rules and Ontologies into Autoepistemic Logic. KR 2008: 485-495
88EEThomas 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)
87EEJos 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
86 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
85EEMartin Gebser, Torsten Schaub, Hans Tompits, Stefan Woltran: Alternative Characterizations for Program Equivalence under Answer-Set Semantics: Preliminary Report. CENT 2007
84EEDavid Pearce, Hans Tompits, Stefan Woltran: Relativised Equivalence in Equilibrium Logic and its Applications to Prediction and Explanation: Preliminary Report. CENT 2007
83EEJos de Bruijn, Thomas Eiter, Axel Polleres, Hans Tompits: Embedding Non-Ground Logic Programs into Autoepistemic Logic for Knowledge-Base Combination. IJCAI 2007: 304-309
82EEThomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran: Complexity Results for Checking Equivalence of Stratified Logic Programs. IJCAI 2007: 330-335
81EEJohannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran: Testing Relativised Uniform Equivalence under Answer-Set Projection in the System ccT. INAP/WLP 2007: 241-246
80EEMartin 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
79EEMichael Fink, Reinhard Pichler, Hans Tompits, Stefan Woltran: Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains. LPNMR 2007: 123-135
78EETomi Janhunen, Emilia Oikarinen, Hans Tompits, Stefan Woltran: Modularity Aspects of Disjunctive Stable Models. LPNMR 2007: 175-187
77EEMartin Brain, Martin Gebser, Jörg Pührer, Torsten Schaub, Hans Tompits, Stefan Woltran: Debugging ASP Programs by Means of ASP. LPNMR 2007: 31-43
76EEJames P. Delgrande, Torsten Schaub, Hans Tompits: A Preference-Based Framework for Updating Logic Programs. LPNMR 2007: 71-83
75EEJames 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)
74EEThomas Eiter, Michael Fink, Hans Tompits: A knowledge-based approach for selecting information sources. TPLP 7(3): 249-300 (2007)
2006
73EEMichael Fink, Hans Tompits, Stefan Woltran: 20th Workshop on Logic Programming, Vienna, Austria, February 22--24, 2006 Technische Universität Wien, Austria 2006
72EEThomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits: Effective Integration of Declarative Rules with External Evaluations for Semantic-Web Reasoning. ESWC 2006: 273-287
71EEJohannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran: ccT: A Correspondence-Checking Tool for Logic Programs Under the Answer-Set Semantics. JELIA 2006: 502-505
70 Thomas Eiter, Michael Fink, Hans Tompits, Patrick Traxler, Stefan Woltran: Replacements in Non-Ground Answer-Set Programming. KR 2006: 340-351
69EEJos de Bruijn, Thomas Eiter, Axel Polleres, Hans Tompits: On Representational Issues About Combinations of Classical Theories with Nonmonotonic Rules. KSEM 2006: 1-22
68EEThomas Eiter, Giovambattista Ianni, Axel Polleres, Roman Schindlauer, Hans Tompits: Reasoning with Rules and Ontologies. Reasoning Web 2006: 93-127
67EEThomas Eiter, Michael Fink, Hans Tompits, Patrick Traxler, Stefan Woltran: Replacements in Non-Ground Answer-Set Programming. WLP 2006: 145-153
66EEJohannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran: A Tool for Advanced Correspondence Checking in Answer-Set Programming: Preliminary Experimental Results. WLP 2006: 200-205
65EEThomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits: dlvhex: A System for Integrating Multiple Semantics in an Answer-Set Programming Framework. WLP 2006: 206-210
64EEThomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits: dlvhex: A Prover for Semantic-Web Reasoning under the Answer-Set Semantics. Web Intelligence 2006: 1073-1074
63EEThomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits, Kewen Wang: Forgetting in Managing Rules and Ontologies. Web Intelligence 2006: 411-419
62EEThomas Eiter, Michael Fink, Hans Tompits: A Knowledge-Based Approach for Selecting Information Sources CoRR abs/cs/0604086: (2006)
2005
61 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
60EEHans Tompits, Stefan Woltran: Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming. Answer Set Programming 2005
59EEHans Tompits, Stefan Woltran: Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming. ICLP 2005: 189-203
58EEThomas 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
57EEThomas Eiter, Hans Tompits, Stefan Woltran: On Solution Correspondences in Answer-Set Programming. IJCAI 2005: 97-102
56EEPhilippe Besnard, Torsten Schaub, Hans Tompits, Stefan Woltran: Representing Paraconsistent Reasoning via Quantified Propositional Logic. Inconsistency Tolerance 2005: 84-118
55EEThomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits: Reasoning about evolving nonmonotonic knowledge bases. ACM Trans. Comput. Log. 6(2): 389-440 (2005)
2004
54 James P. Delgrande, Torsten Schaub, Hans Tompits: Domain-Specific Preferences for Causal Reasoning and Planning. ICAPS 2004: 63-72
53EEThomas Linke, Hans Tompits, Stefan Woltran: On Acyclic and Head-Cycle Free Nested Logic Programs. ICLP 2004: 225-239
52 Thomas Eiter, Thomas Lukasiewicz, Roman Schindlauer, Hans Tompits: Combining Answer Set Programming with Description Logics for the Semantic Web. KR 2004: 141-151
51 Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran: On Eliminating Disjunctions in Stable Logic Programming. KR 2004: 447-458
50 James P. Delgrande, Torsten Schaub, Hans Tompits: Domain-Specific Preferences for Causal Reasoning and Planning. KR 2004: 673-682
49EEThomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits: Nonmonotonic Description Logic Programs: Implementation and Experiments. LPAR 2004: 511-527
48EEVladimir Sarsakov, Torsten Schaub, Hans Tompits, Stefan Woltran: nlp: A Compiler for Nested Logic Programming. LPNMR 2004: 361-364
47EEThomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran: Simplifying Logic Programs Under Uniform and Strong Equivalence. LPNMR 2004: 87-99
46EEThomas Linke, Hans Tompits, Stefan Woltran: On acyclic and head-cycle free nested logic programs. NMR 2004: 267-275
45EEThomas Eiter, Thomas Lukasiewicz, Roman Schindlauer, Hans Tompits: Well-Founded Semantics for Description Logic Programs in the Semantic Web. RuleML 2004: 81-97
44EEJames 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)
2003
43EEThomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran: Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation. Answer Set Programming 2003
42EEPhilippe Besnard, Torsten Schaub, Hans Tompits, Stefan Woltran: Paraconsistent Logics for Reasoning via Quantified Boolean Formulas, II: Circumscribing Inconsistent Theories. ECSQARU 2003: 528-539
41 Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits: Declarative Update Policies for Nonmonotonic Knowledge Bases. Logics for Emerging Applications of Databases 2003: 85-129
40EEUwe Egly, Martina Seidl, Hans Tompits, Stefan Woltran, Michael Zolda: Comparing Different Prenexing Strategies for Quantified Boolean Formulas. SAT 2003: 214-228
39EEHans Tompits: Expressing default abduction problems as quantified Boolean formulas. AI Commun. 16(2): 89-105 (2003)
38 Uwe Egly, Hans Tompits: On Different Proof-Search Strategies for Orthologic. Studia Logica 73(1): 131-152 (2003)
37 James P. Delgrande, Torsten Schaub, Hans Tompits: A Framework for Compiling Preferences in Logic Programs. TPLP 3(2): 129-187 (2003)
2002
36EEDavid Pearce, Vladimir Sarsakov, Torsten Schaub, Hans Tompits, Stefan Woltran: A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report. ICLP 2002: 405-420
35EEPhilippe Besnard, Torsten Schaub, Hans Tompits, Stefan Woltran: Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems. JELIA 2002: 320-331
34 Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits: A Generic Approach for Knowledge-Based Information-Site Selection. KR 2002: 459-469
33 David Pearce, Vladimir Sarsakov, Torsten Schaub, Hans Tompits, Stefan Woltran: A polynomial translation of logic programs with nested expressions into disjunctive logic programs: preliminary report. NMR 2002: 57-66
32EEPhilippe Besnard, Torsten Schaub, Hans Tompits, Stefan Woltran: Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems. Paraconsistent Computational Logic 2002: 1-15
31EEThomas Eiter, Volker Klotz, Hans Tompits, Stefan Woltran: Modal Nonmonotonic Logics Revisited: Efficient Encodings for the Basic Reasoning Tasks. TABLEAUX 2002: 100-114
30EEJames P. Delgrande, Torsten Schaub, Hans Tompits: A Framework for Compiling Preferences in Logic Programs CoRR cs.AI/0203005: (2002)
29EEDavid Pearce, Vladimir Sarsakov, Torsten Schaub, Hans Tompits, Stefan Woltran: A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report CoRR cs.AI/0207071: (2002)
28EEThomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits: Reasoning about Evolving Nonmonotonic Knowledge Bases CoRR cs.AI/0209019: (2002)
27 Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits: Using Methods of Declarative Logic Programming for Intelligent Information Agents. TPLP 2(6): 645-709 (2002)
26 Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits: On Properties of Update Sequences Based on Causal Rejection. TPLP 2(6): 711-767 (2002)
2001
25EEUwe Egly, Thomas Eiter, Volker Klotz, Hans Tompits, Stefan Woltran: Computing Stable Models with Quantified Boolean Formulas: Some Experimental Results. Answer Set Programming 2001
24EEJames P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran: On Computing Solutions to Belief Change Scenarios. ECSQARU 2001: 510-521
23EEDavid Pearce, Hans Tompits, Stefan Woltran: Encodings for Equilibrium Logic and Logic Programs with Nested Expressions. EPIA 2001: 306-320
22 Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits: A Framework for Declarative Update Specifications in Logic Programs. IJCAI 2001: 649-654
21EEThomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits: Reasoning about Evolving Nonmonotonic Knowledge Bases. LPAR 2001: 407-421
20EEThomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits: An Update Front-End for Extended Logic Programs. LPNMR 2001: 397-401
19EEJames P. Delgrande, Torsten Schaub, Hans Tompits: plp: A Generic Compiler for Ordered Logic Programs. LPNMR 2001: 411-415
18EEUwe Egly, Hans Tompits: Proof-complexity results for nonmonotonic reasoning. ACM Trans. Comput. Log. 2(3): 340-387 (2001)
17EEThomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits: On Properties of Update Sequences Based on Causal Rejection CoRR cs.AI/0109006: (2001)
16EEThomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits: Using Methods of Declarative Logic Programming for Intelligent Information Agents CoRR cs.MA/0108008: (2001)
2000
15 Uwe Egly, Thomas Eiter, Volker Klotz, Hans Tompits, Stefan Woltran: Experimental Evaluation of the Disjunctive Logic Programming Module of the System QUIP. 15. WLP 2000: 113-122
14 Uwe Egly, Thomas Eiter, Hans Tompits, Stefan Woltran: Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas. AAAI/IAAI 2000: 417-422
13 James P. Delgrande, Torsten Schaub, Hans Tompits: Logic Programs with Compiled Preferences. ECAI 2000: 464-468
12 Uwe Egly, Hans Tompits: Some Strengths of Nonmonotonic Reasoning. Intellectics and Computational Logic 2000: 125-141
11EEThomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits: Considerations on Updates of Logic Programs. JELIA 2000: 2-20
10EEJames P. Delgrande, Torsten Schaub, Hans Tompits: A Compilation of Brewka and Eiter's Approach to Prioritization. JELIA 2000: 376-390
9 Uwe Egly, Thomas Eiter, Hans Tompits, Stefan Woltran: Implementing Default Reasoning Using Quantified Boolean Formulae. WLP 2000: 223-228
8EEJames P. Delgrande, Torsten Schaub, Hans Tompits: A Compiler for Ordered Logic Programs CoRR cs.AI/0003024: (2000)
7EEJames P. Delgrande, Torsten Schaub, Hans Tompits: Logic Programs with Compiled Preferences CoRR cs.AI/0003028: (2000)
6EEUwe Egly, Thomas Eiter, Hans Tompits, Stefan Woltran: QUIP - A Tool for Computing Nonmonotonic Reasoning Tasks CoRR cs.AI/0003037: (2000)
1999
5 Uwe Egly, Michael Fink, Axel Polleres, Hans Tompits: A Web-based Tutoring Tool for Calculating Default Logic Extensions. WebNet 1999: 1251-1252
1998
4EEUwe Egly, Hans Tompits: On Proof Complexity of Circumscription. TABLEAUX 1998: 141-155
1997
3 Uwe Egly, Hans Tompits: Non-elementary Speed-Ups in Default Reasoning. ECSQARU-FAPR 1997: 237-251
2 Uwe Egly, Hans Tompits: Is Non-Monotonic Reasoning Always Harder? LPNMR 1997: 60-75
1 Uwe Egly, Hans Tompits: A Sequent Calculus for Intuitionistic Default Logic. WLP 1997: 0-

Coauthor Index

1Philippe Besnard [32] [35] [42] [56]
2Martin Brain [77]
3Jos de Bruijn [69] [83] [87] [89]
4James P. Delgrande [7] [8] [10] [13] [19] [24] [30] [37] [44] [50] [54] [75] [76] [91] [99]
5Uwe Egly [1] [2] [3] [4] [5] [6] [9] [12] [14] [15] [18] [25] [38] [40]
6Thomas Eiter [6] [9] [11] [14] [15] [16] [17] [20] [21] [22] [25] [26] [27] [28] [31] [34] [41] [43] [45] [47] [49] [51] [52] [55] [57] [58] [61] [62] [63] [64] [65] [67] [68] [69] [70] [72] [74] [82] [83] [87] [88] [89]
7Wolfgang Faber [90]
8Michael Fink [5] [11] [16] [17] [20] [21] [22] [26] [27] [28] [34] [41] [43] [47] [51] [55] [61] [62] [67] [70] [73] [74] [79] [82]
9Martin Gebser [77] [80] [85] [94] [95]
10Giovambattista Ianni [49] [58] [63] [64] [65] [68] [72] [88]
11Tomi Janhunen [78]
12Volker Klotz [15] [25] [31]
13Thomas Linke [46] [53]
14Thomas Lukasiewicz [45] [52] [88]
15Johannes Oetsch [66] [71] [81] [86] [92] [97]
16Emilia Oikarinen [78]
17David Pearce [23] [29] [33] [36] [84] [96]
18Reinhard Pichler [79]
19Axel Polleres [5] [68] [69] [83] [87]
20Jörg Pührer [77] [80] [93] [95] [98]
21Giuliana Sabbatini [11] [16] [17] [20] [21] [22] [26] [27] [28] [34] [41] [55]
22Vladimir Sarsakov [29] [33] [36] [48]
23Torsten Schaub [7] [8] [10] [13] [19] [24] [29] [30] [32] [33] [35] [36] [37] [42] [44] [48] [50] [54] [56] [75] [76] [77] [80] [85] [91] [94] [95] [99]
24Roman Schindlauer [45] [49] [52] [58] [63] [64] [65] [68] [72] [88]
25Martina Seidl [40] [66] [71] [81] [97]
26Patrick Traxler [67] [70]
27Kewen Wang [63]
28Stefan Woltran [6] [9] [14] [15] [23] [24] [25] [29] [31] [32] [33] [35] [36] [40] [42] [43] [44] [46] [47] [48] [51] [53] [56] [57] [59] [60] [61] [66] [67] [70] [71] [73] [77] [78] [79] [80] [81] [82] [84] [85] [86] [90] [91] [93] [94] [96] [97] [99]
29Michael Zolda [40]

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)