2008 | ||
---|---|---|
93 | Martin Gebser, Jörg Pührer, Torsten Schaub, Hans Tompits: A Meta-Programming Technique for Debugging Answer-Set Programs. AAAI 2008: 448-453 | |
92 | EE | 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 |
91 | EE | Jörg Pührer, Hans Tompits, Stefan Woltran: Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence. ICLP 2008: 561-575 |
90 | EE | Johannes Oetsch, Hans Tompits: Program Correspondence under the Answer-Set Semantics: The Non-ground Case. ICLP 2008: 591-605 |
89 | James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran: Belief Revision of Logic Programs under Answer Set Semantics. KR 2008: 411-421 | |
88 | Wolfgang Faber, Hans Tompits, Stefan Woltran: Notions of Strong Equivalence for Logic Programs with Ordered Disjunction. KR 2008: 433-443 | |
87 | Jos de Bruijn, Thomas Eiter, Hans Tompits: Embedding Approaches to Combining Rules and Ontologies into Autoepistemic Logic. KR 2008: 485-495 | |
86 | EE | 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) |
85 | EE | 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 | ||
84 | 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 | |
83 | EE | Martin Gebser, Torsten Schaub, Hans Tompits, Stefan Woltran: Alternative Characterizations for Program Equivalence under Answer-Set Semantics: Preliminary Report. CENT 2007 |
82 | EE | David Pearce, Hans Tompits, Stefan Woltran: Relativised Equivalence in Equilibrium Logic and its Applications to Prediction and Explanation: Preliminary Report. CENT 2007 |
81 | EE | 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 |
80 | EE | Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran: Complexity Results for Checking Equivalence of Stratified Logic Programs. IJCAI 2007: 330-335 |
79 | EE | 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 |
78 | EE | Tomi Janhunen, Emilia Oikarinen, Hans Tompits, Stefan Woltran: Modularity Aspects of Disjunctive Stable Models. LPNMR 2007: 175-187 |
77 | EE | 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 |
76 | EE | James P. Delgrande, Torsten Schaub, Hans Tompits: A Preference-Based Framework for Updating Logic Programs. LPNMR 2007: 71-83 |
75 | EE | 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) |
74 | EE | Thomas Eiter, Michael Fink, Hans Tompits: A knowledge-based approach for selecting information sources. TPLP 7(3): 249-300 (2007) |
2006 | ||
73 | EE | Michael Fink, Hans Tompits, Stefan Woltran: 20th Workshop on Logic Programming, Vienna, Austria, February 22--24, 2006 Technische Universität Wien, Austria 2006 |
72 | EE | Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits: Effective Integration of Declarative Rules with External Evaluations for Semantic-Web Reasoning. ESWC 2006: 273-287 |
71 | EE | 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 |
70 | Thomas Eiter, Michael Fink, Hans Tompits, Patrick Traxler, Stefan Woltran: Replacements in Non-Ground Answer-Set Programming. KR 2006: 340-351 | |
69 | EE | Jos de Bruijn, Thomas Eiter, Axel Polleres, Hans Tompits: On Representational Issues About Combinations of Classical Theories with Nonmonotonic Rules. KSEM 2006: 1-22 |
68 | EE | Thomas Eiter, Giovambattista Ianni, Axel Polleres, Roman Schindlauer, Hans Tompits: Reasoning with Rules and Ontologies. Reasoning Web 2006: 93-127 |
67 | EE | Thomas Eiter, Michael Fink, Hans Tompits, Patrick Traxler, Stefan Woltran: Replacements in Non-Ground Answer-Set Programming. WLP 2006: 145-153 |
66 | EE | 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 |
65 | EE | 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 |
64 | EE | 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 |
63 | EE | Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits, Kewen Wang: Forgetting in Managing Rules and Ontologies. Web Intelligence 2006: 411-419 |
62 | EE | Thomas 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 | |
60 | EE | Hans Tompits, Stefan Woltran: Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming. Answer Set Programming 2005 |
59 | EE | Hans Tompits, Stefan Woltran: Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming. ICLP 2005: 189-203 |
58 | EE | 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 |
57 | EE | Thomas Eiter, Hans Tompits, Stefan Woltran: On Solution Correspondences in Answer-Set Programming. IJCAI 2005: 97-102 |
56 | EE | Philippe Besnard, Torsten Schaub, Hans Tompits, Stefan Woltran: Representing Paraconsistent Reasoning via Quantified Propositional Logic. Inconsistency Tolerance 2005: 84-118 |
55 | EE | Thomas 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 | |
53 | EE | Thomas 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 | |
49 | EE | Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits: Nonmonotonic Description Logic Programs: Implementation and Experiments. LPAR 2004: 511-527 |
48 | EE | Vladimir Sarsakov, Torsten Schaub, Hans Tompits, Stefan Woltran: nlp: A Compiler for Nested Logic Programming. LPNMR 2004: 361-364 |
47 | EE | Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran: Simplifying Logic Programs Under Uniform and Strong Equivalence. LPNMR 2004: 87-99 |
46 | EE | Thomas Linke, Hans Tompits, Stefan Woltran: On acyclic and head-cycle free nested logic programs. NMR 2004: 267-275 |
45 | EE | Thomas Eiter, Thomas Lukasiewicz, Roman Schindlauer, Hans Tompits: Well-Founded Semantics for Description Logic Programs in the Semantic Web. RuleML 2004: 81-97 |
44 | EE | 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) |
2003 | ||
43 | EE | Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran: Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation. Answer Set Programming 2003 |
42 | EE | Philippe 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 | |
40 | EE | Uwe Egly, Martina Seidl, Hans Tompits, Stefan Woltran, Michael Zolda: Comparing Different Prenexing Strategies for Quantified Boolean Formulas. SAT 2003: 214-228 |
39 | EE | Hans 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 | ||
36 | EE | 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. ICLP 2002: 405-420 |
35 | EE | Philippe 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 | |
32 | EE | Philippe Besnard, Torsten Schaub, Hans Tompits, Stefan Woltran: Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems. Paraconsistent Computational Logic 2002: 1-15 |
31 | EE | Thomas Eiter, Volker Klotz, Hans Tompits, Stefan Woltran: Modal Nonmonotonic Logics Revisited: Efficient Encodings for the Basic Reasoning Tasks. TABLEAUX 2002: 100-114 |
30 | EE | James P. Delgrande, Torsten Schaub, Hans Tompits: A Framework for Compiling Preferences in Logic Programs CoRR cs.AI/0203005: (2002) |
29 | EE | 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 CoRR cs.AI/0207071: (2002) |
28 | EE | Thomas 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 | ||
25 | EE | Uwe Egly, Thomas Eiter, Volker Klotz, Hans Tompits, Stefan Woltran: Computing Stable Models with Quantified Boolean Formulas: Some Experimental Results. Answer Set Programming 2001 |
24 | EE | James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran: On Computing Solutions to Belief Change Scenarios. ECSQARU 2001: 510-521 |
23 | EE | David 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 | |
21 | EE | Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits: Reasoning about Evolving Nonmonotonic Knowledge Bases. LPAR 2001: 407-421 |
20 | EE | Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits: An Update Front-End for Extended Logic Programs. LPNMR 2001: 397-401 |
19 | EE | James P. Delgrande, Torsten Schaub, Hans Tompits: plp: A Generic Compiler for Ordered Logic Programs. LPNMR 2001: 411-415 |
18 | EE | Uwe Egly, Hans Tompits: Proof-complexity results for nonmonotonic reasoning. ACM Trans. Comput. Log. 2(3): 340-387 (2001) |
17 | EE | Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits: On Properties of Update Sequences Based on Causal Rejection CoRR cs.AI/0109006: (2001) |
16 | EE | Thomas 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 | |
11 | EE | Thomas Eiter, Michael Fink, Giuliana Sabbatini, Hans Tompits: Considerations on Updates of Logic Programs. JELIA 2000: 2-20 |
10 | EE | James 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 | |
8 | EE | James P. Delgrande, Torsten Schaub, Hans Tompits: A Compiler for Ordered Logic Programs CoRR cs.AI/0003024: (2000) |
7 | EE | James P. Delgrande, Torsten Schaub, Hans Tompits: Logic Programs with Compiled Preferences CoRR cs.AI/0003028: (2000) |
6 | EE | Uwe 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 | ||
4 | EE | Uwe 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- |