Stefan Woltran

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2011
51Strong Equivalence of Qualitative Optimization Problems. Wolfgang Faber, Miroslaw Truszczynski, Stefan Woltran. CoRR (abs/1112.0791) (2011). Web SearchBibTeXDownload
50A New Tree-Decomposition Based Algorithm for Answer Set Programming. Michael Morak, Nysret Musliu, Reinhard Pichler, Stefan Rümmele, Stefan Woltran. ICTAI 2011, 916-918. Web SearchBibTeXDownload
49Parametric Properties of Ideal Semantics. Wolfgang Dvorák, Paul E. Dunne, Stefan Woltran. IJCAI 2011, 851-856. Web SearchBibTeXDownload
48Relating the Semantics of Abstract Dialectical Frameworks and Standard AFs. Gerhard Brewka, Paul E. Dunne, Stefan Woltran. IJCAI 2011, 780-785. Web SearchBibTeXDownload
47Manifold Answer-Set Programs and Their Applications. Wolfgang Faber, Stefan Woltran. Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning 2011, 44-63. Web SearchBibTeXDownload
2010
46Representing Preferences Among Sets. Gerhard Brewka, Miroslaw Truszczynski, Stefan Woltran. AAAI 2010. Web SearchBibTeXDownload
45Minimising RDF Graphs under Rules and Constraints Revisited. Reinhard Pichler, Axel Polleres, Sebastian Skritek, Stefan Woltran. AMW 2010. Web SearchBibTeXDownload
44Multicut Algorithms via Tree Decompositions. Reinhard Pichler, Stefan Rümmele, Stefan Woltran. CIAC 2010, 167-179. Web SearchBibTeXDownload
43The Complexity of Handling Minimal Solutions in Logic-Based Abduction. Reinhard Pichler, Stefan Woltran. ECAI 2010, 895-900. Web SearchBibTeXDownload
42A Dynamic-Programming Based ASP-Solver. Michael Morak, Reinhard Pichler, Stefan Rümmele, Stefan Woltran. JELIA 2010, 369-372. Web SearchBibTeXDownload
41Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough. Reinhard Pichler, Stefan Rümmele, Stefan Szeider, Stefan Woltran. KR 2010. Web SearchBibTeXDownload
40Towards Fixed-Parameter Tractable Algorithms for Argumentation. Wolfgang Dvorák, Reinhard Pichler, Stefan Woltran. KR 2010. Web SearchBibTeXDownload
39Counting and Enumeration Problems with Bounded Treewidth. Reinhard Pichler, Stefan Rümmele, Stefan Woltran. LPAR (Dakar) 2010, 387-404. Web SearchBibTeXDownload
38Redundancy Elimination on RDF Graphs in the Presence of Rules, Constraints, and Queries. Reinhard Pichler, Axel Polleres, Sebastian Skritek, Stefan Woltran. RR 2010, 133-148. Web SearchBibTeXDownload
2009
37A general approach to belief change in answer set programming. James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran. CoRR (abs/0912.5511) (2009). Web SearchBibTeXDownload
36Relativized hyperequivalence of logic programs for modular programming. Miroslaw Truszczynski, Stefan Woltran. CoRR (abs/0907.4128) (2009). Web SearchBibTeXDownload
35Merging Logic Programs under Answer Set Semantics. James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran. ICLP 2009, 160-174. Cited by 2Web SearchBibTeXDownload
34Answer-Set Programming with Bounded Treewidth. Michael Jakl, Reinhard Pichler, Stefan Woltran. IJCAI 2009, 816-822. Web SearchBibTeXDownload
33Manifold Answer-Set Programs for Meta-reasoning. Wolfgang Faber, Stefan Woltran. LPNMR 2009, 115-128. Web SearchBibTeXDownload
32Belief Revision with Bounded Treewidth. Reinhard Pichler, Stefan Rümmele, Stefan Woltran. LPNMR 2009, 250-263. Web SearchBibTeXDownload
31Alternation as a programming paradigm. Wolfgang Dvorák, Georg Gottlob, Reinhard Pichler, Stefan Woltran. PPDP 2009, 61-72. Web SearchBibTeXDownload
2008
30Hyperequivalence of Logic Programs with Respect to Supported Models. Miroslaw Truszczynski, Stefan Woltran. AAAI 2008, 560-565. Web SearchBibTeX
29Hyperequivalence of logic programs with respect to supported models. Miroslaw Truszczynski, Stefan Woltran. Ann. Math. Artif. Intell. (53): 331-365 (2008). Web SearchBibTeXDownload
28dRDF: Entailment for Domain-Restricted RDF. Reinhard Pichler, Axel Polleres, Fang Wei, Stefan Woltran. ESWC 2008, 200-214. Web SearchBibTeXDownload
27Relativized Hyperequivalence of Logic Programs for Modular Programming. Miroslaw Truszczynski, Stefan Woltran. ICLP 2008, 576-590. Web SearchBibTeXDownload
26Notions of Strong Equivalence for Logic Programs with Ordered Disjunction. Wolfgang Faber, Hans Tompits, Stefan Woltran. KR 2008, 433-443. Cited by 1Web SearchBibTeX
25Belief Revision of Logic Programs under Answer Set Semantics. James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran. KR 2008, 411-421. Cited by 1Web SearchBibTeX
24Fast Counting with Bounded Treewidth. Michael Jakl, Reinhard Pichler, Stefan Rümmele, Stefan Woltran. LPAR 2008, 436-450. Web SearchBibTeXDownload
2007
23Semantical characterizations and complexity of equivalences in answer set programming. Thomas Eiter, Michael Fink, Stefan Woltran. ACM Trans. Comput. Log. (8) (2007). Web SearchBibTeXDownload
22Complexity results for answer set programming with bounded predicate arities and implications. Thomas Eiter, Wolfgang Faber, Michael Fink, Stefan Woltran. Ann. Math. Artif. Intell. (51): 123-165 (2007). Web SearchBibTeXDownload
21Complexity Results for Checking Equivalence of Stratified Logic Programs. Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran. IJCAI 2007, 330-335. Cited by 3Web SearchBibTeXDownload
20Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains. Michael Fink, Reinhard Pichler, Hans Tompits, Stefan Woltran. LPNMR 2007, 123-135. Cited by 5Web SearchBibTeXDownload
2006
19An Implementation for Recognizing Rule Replacements in Non-ground Answer-Set Programs. Thomas Eiter, Patrick Traxler, Stefan Woltran. JELIA 2006, 477-480. Web SearchBibTeXDownload
18Replacements in Non-Ground Answer-Set Programming. Thomas Eiter, Michael Fink, Hans Tompits, Patrick Traxler, Stefan Woltran. WLP 2006, 145-153. Cited by 12Web SearchBibTeXDownload
2005
17Strong and Uniform Equivalence in Answer-Set Programming: Characterizations and Complexity Results for the Non-Ground Case. Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran. AAAI 2005, 695-700. Web SearchBibTeX
16On deciding subsumption problems. Uwe Egly, Reinhard Pichler, Stefan Woltran. Ann. Math. Artif. Intell. (43): 255-294 (2005). Web SearchBibTeXDownload
15Semantical Characterizations and Complexity of Equivalences in Answer Set Programming. Thomas Eiter, Michael Fink, Stefan Woltran. CoRR (abs/cs/0502078) (2005). Web SearchBibTeXDownload
14On Solution Correspondences in Answer-Set Programming. Thomas Eiter, Hans Tompits, Stefan Woltran. IJCAI 2005, 97-102. Cited by 42Web SearchBibTeXDownload
2004
13On Computing Belief Change Operations using Quantified Boolean Formulas. James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran. J. Log. Comput. (14): 801-826 (2004). Cited by 5Web SearchBibTeXDownload
12Complexity of Model Checking and Bounded Predicate Arities for Non-ground Answer Set Programming. Thomas Eiter, Wolfgang Faber, Michael Fink, Gerald Pfeifer, Stefan Woltran. KR 2004, 377-387. Web SearchBibTeX
11On Eliminating Disjunctions in Stable Logic Programming. Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran. KR 2004, 447-458. Cited by 12Web SearchBibTeX
10Simplifying Logic Programs Under Uniform and Strong Equivalence. Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran. LPNMR 2004, 87-99. Cited by 60Web SearchBibTeXDownload
2003
9Complexity of Answer Set Checking and Bounded Predicate Arities for Non-ground Answer Set Programming. Thomas Eiter, Wolfgang Faber, Michael Fink, Gerald Pfeifer, Stefan Woltran. Answer Set Programming 2003. Web SearchBibTeXDownload
8Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation. Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran. Answer Set Programming 2003. Cited by 2Web SearchBibTeXDownload
2002
7Modal Nonmonotonic Logics Revisited: Efficient Encodings for the Basic Reasoning Tasks. Thomas Eiter, Volker Klotz, Hans Tompits, Stefan Woltran. TABLEAUX 2002, 100-114. Cited by 16Web SearchBibTeXDownload
2001
6Computing Stable Models with Quantified Boolean Formulas: Some Experimental Results. Uwe Egly, Thomas Eiter, Volker Klotz, Hans Tompits, Stefan Woltran. Answer Set Programming 2001. Cited by 13Web SearchBibTeXDownload
5On Computing Solutions to Belief Change Scenarios. James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran. ECSQARU 2001, 510-521. Cited by 18Web SearchBibTeXDownload
2000
4Experimental Evaluation of the Disjunctive Logic Programming Module of the System QUIP. Uwe Egly, Thomas Eiter, Volker Klotz, Hans Tompits, Stefan Woltran. 15. WLP 2000, 113-122. Cited by 2Web SearchBibTeX
3Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas. Uwe Egly, Thomas Eiter, Hans Tompits, Stefan Woltran. AAAI/IAAI 2000, 417-422. Cited by 102Web SearchBibTeX
2QUIP - A Tool for Computing Nonmonotonic Reasoning Tasks. Uwe Egly, Thomas Eiter, Hans Tompits, Stefan Woltran. CoRR (cs.AI/0003037) (2000). Cited by 3Web SearchBibTeXDownload
1Implementing Default Reasoning Using Quantified Boolean Formulae. Uwe Egly, Thomas Eiter, Hans Tompits, Stefan Woltran. WLP 2000, 223-228. Cited by 2Web SearchBibTeX
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research