| 2011 |
|---|
| 72 | Tractable Counting of the Answers to Conjunctive Queries. Reinhard Pichler, Sebastian Skritek. AMW 2011. Web SearchBibTeXDownload |
| 71 | On the Undecidability of the Equivalence of Second-Order Tuple Generating Dependencies. Ingo Feinerer, Reinhard Pichler, Emanuel Sallinger, Vadim Savenkov. AMW 2011. Web SearchBibTeXDownload |
| 70 | On Integrating Data Services Using Data Mashups. Muhammad Intizar Ali, Reinhard Pichler, Hong Linh Truong, Schahram Dustdar. BNCOD 2011, 132-135. Web SearchBibTeXDownload |
| 69 | The complexity of evaluating tuple generating dependencies. Reinhard Pichler, Sebastian Skritek. ICDT 2011, 244-255. Web SearchBibTeXDownload |
| 68 | Relaxed notions of schema mapping equivalence revisited. Reinhard Pichler, Emanuel Sallinger, Vadim Savenkov. ICDT 2011, 90-101. Web SearchBibTeXDownload |
| 67 | Data Concern Aware Querying for the Integration of Data Services. Muhammad Intizar Ali, Reinhard Pichler, Hong Linh Truong, Schahram Dustdar. ICEIS (1) 2011, 111-119. Web SearchBibTeX |
| 66 | A 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 |
| 65 | Normalization and optimization of schema mappings. Georg Gottlob, Reinhard Pichler, Vadim Savenkov. VLDB J. (20): 277-302 (2011). Web SearchBibTeXDownload |
| 2010 |
|---|
| 64 | Monadic datalog over finite structures of bounded treewidth. Georg Gottlob, Reinhard Pichler, Fang Wei. ACM Trans. Comput. Log. (12): 3 (2010). Web SearchBibTeXDownload |
| 63 | Minimising RDF Graphs under Rules and Constraints Revisited. Reinhard Pichler, Axel Polleres, Sebastian Skritek, Stefan Woltran. AMW 2010. Web SearchBibTeXDownload |
| 62 | Bounded treewidth as a key to tractability of knowledge representation and reasoning. Georg Gottlob, Reinhard Pichler, Fang Wei. Artif. Intell. (174): 105-132 (2010). Web SearchBibTeXDownload |
| 61 | Multicut Algorithms via Tree Decompositions. Reinhard Pichler, Stefan Rümmele, Stefan Woltran. CIAC 2010, 167-179. Web SearchBibTeXDownload |
| 60 | Exploiting Bounded Treewidth with Datalog (A Survey). Reinhard Pichler. Datalog 2010, 88-105. Web SearchBibTeXDownload |
| 59 | The Complexity of Handling Minimal Solutions in Logic-Based Abduction. Reinhard Pichler, Stefan Woltran. ECAI 2010, 895-900. Web SearchBibTeXDownload |
| 58 | Tractable database design and datalog abduction through bounded treewidth. Georg Gottlob, Reinhard Pichler, Fang Wei. Inf. Syst. (35): 278-298 (2010). Web SearchBibTeXDownload |
| 57 | Counting complexity of propositional abduction. Miki Hermann, Reinhard Pichler. J. Comput. Syst. Sci. (76): 634-649 (2010). Web SearchBibTeXDownload |
| 56 | A Dynamic-Programming Based ASP-Solver. Michael Morak, Reinhard Pichler, Stefan Rümmele, Stefan Woltran. JELIA 2010, 369-372. Web SearchBibTeXDownload |
| 55 | Towards Fixed-Parameter Tractable Algorithms for Argumentation. Wolfgang Dvorák, Reinhard Pichler, Stefan Woltran. KR 2010. Web SearchBibTeXDownload |
| 54 | Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough. Reinhard Pichler, Stefan Rümmele, Stefan Szeider, Stefan Woltran. KR 2010. Web SearchBibTeXDownload |
| 53 | Counting and Enumeration Problems with Bounded Treewidth. Reinhard Pichler, Stefan Rümmele, Stefan Woltran. LPAR (Dakar) 2010, 387-404. Web SearchBibTeXDownload |
| 52 | Uncertain Databases in Collaborative Data Management. Reinhard Pichler, Vadim Savenkov, Sebastian Skritek, Hong Linh Truong. MUD 2010, 129-143. Web SearchBibTeXDownload |
| 51 | Redundancy 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 |
| 50 | Towards practical feasibility of core computation in data exchange. Reinhard Pichler, Vadim Savenkov. Theor. Comput. Sci. (411): 935-957 (2010). Web SearchBibTeXDownload |
| 2009 |
|---|
| 49 | DeXIN: An Extensible Framework for Distributed XQuery over Heterogeneous Data Sources . Muhammad Intizar Ali, Reinhard Pichler, Hong Linh Truong, Schahram Dustdar. ICEIS 2009, 172-183. Web SearchBibTeXDownload |
| 48 | On Using Distributed Extended XQuery for Web Data Sources as Services. Muhammad Intizar Ali, Reinhard Pichler, Hong Linh Truong, Schahram Dustdar. ICWE 2009, 497-500. Web SearchBibTeXDownload |
| 47 | Answer-Set Programming with Bounded Treewidth. Michael Jakl, Reinhard Pichler, Stefan Woltran. IJCAI 2009, 816-822. Web SearchBibTeXDownload |
| 46 | Belief Revision with Bounded Treewidth. Reinhard Pichler, Stefan Rümmele, Stefan Woltran. LPNMR 2009, 250-263. Web SearchBibTeXDownload |
| 45 | Alternation as a programming paradigm. Wolfgang Dvorák, Georg Gottlob, Reinhard Pichler, Stefan Woltran. PPDP 2009, 61-72. Web SearchBibTeXDownload |
| 44 | DEMo: Data Exchange Modeling Tool. Reinhard Pichler, Vadim Savenkov. PVLDB (2): 1606-1609 (2009). Web SearchBibTeXDownload |
| 43 | Normalization and Optimization of Schema Mappings. Georg Gottlob, Reinhard Pichler, Vadim Savenkov. PVLDB (2): 1102-1113 (2009). Web SearchBibTeXDownload |
| 42 | Complexity of counting the optimal solutions. Miki Hermann, Reinhard Pichler. Theor. Comput. Sci. (410): 3814-3825 (2009). Web SearchBibTeXDownload |
| 2008 |
|---|
| 41 | Abduction with Bounded Treewidth: From Theoretical Tractability to Practically Efficient Computation. Georg Gottlob, Reinhard Pichler, Fang Wei. AAAI 2008, 1541-1546. Web SearchBibTeX |
| 40 | Complexity of Counting the Optimal Solutions. Miki Hermann, Reinhard Pichler. COCOON 2008, 149-159. Web SearchBibTeXDownload |
| 39 | Monadic Datalog over Finite Structures with Bounded Treewidth. Georg Gottlob, Reinhard Pichler, Fang Wei. CoRR (abs/0809.3140) (2008). Web SearchBibTeXDownload |
| 38 | dRDF: Entailment for Domain-Restricted RDF. Reinhard Pichler, Axel Polleres, Fang Wei, Stefan Woltran. ESWC 2008, 200-214. Web SearchBibTeXDownload |
| 37 | Counting Complexity of Minimal Cardinality and Minimal Weight Abduction. Miki Hermann, Reinhard Pichler. JELIA 2008, 206-218. Web SearchBibTeXDownload |
| 36 | Fast Counting with Bounded Treewidth. Michael Jakl, Reinhard Pichler, Stefan Rümmele, Stefan Woltran. LPAR 2008, 436-450. Web SearchBibTeXDownload |
| 35 | Towards Practical Feasibility of Core Computation in Data Exchange. Reinhard Pichler, Vadim Savenkov. LPAR 2008, 62-78. Web SearchBibTeXDownload |
| 2007 |
|---|
| 34 | Efficient Datalog Abduction through Bounded Treewidth. Georg Gottlob, Reinhard Pichler, Fang Wei. AAAI 2007, 1626-1631. Web SearchBibTeX |
| 33 | Counting Complexity of Propositional Abduction. Miki Hermann, Reinhard Pichler. IJCAI 2007, 417-422. Web SearchBibTeXDownload |
| 32 | Model Representation over Finite and Infinite Signatures. Christian G. Fermüller, Reinhard Pichler. J. Log. Comput. (17): 453-477 (2007). Web SearchBibTeXDownload |
| 31 | Complexity 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 |
| 30 | Monadic datalog over finite structures with bounded treewidth. Georg Gottlob, Reinhard Pichler, Fang Wei. PODS 2007, 165-174. Web SearchBibTeXDownload |
| 29 | Foundations of Rule-Based Query Answering. François Bry, Norbert Eisinger, Thomas Eiter, Tim Furche, Georg Gottlob, Clemens Ley, Benedikt Linse, Reinhard Pichler, Fang Wei. Reasoning Web 2007, 1-153. Web SearchBibTeXDownload |
| 2006 |
|---|
| 28 | Bounded Treewidth as a Key to Tractability of Knowledge Representation and Reasoning. Georg Gottlob, Reinhard Pichler, Fang Wei. AAAI 2006. Web SearchBibTeX |
| 27 | Model Representation over Finite and Infinite Signatures. Christian G. Fermüller, Reinhard Pichler. JELIA 2006, 164-176. Web SearchBibTeXDownload |
| 26 | Tractable database design through bounded treewidth. Georg Gottlob, Reinhard Pichler, Fang Wei. PODS 2006, 124-133. Web SearchBibTeXDownload |
| 25 | Algorithmic Aspects of Model Representations. Reinhard Pichler. WLP 2006, 12-20. Web SearchBibTeXDownload |
| 2005 |
|---|
| 24 | Efficient algorithms for processing XPath queries. Georg Gottlob, Christoph Koch, Reinhard Pichler. ACM Trans. Database Syst. (30): 444-491 (2005). Cited by 363Web SearchBibTeXDownload |
| 23 | On deciding subsumption problems. Uwe Egly, Reinhard Pichler, Stefan Woltran. Ann. Math. Artif. Intell. (43): 255-294 (2005). Web SearchBibTeXDownload |
| 22 | Model Representation via Contexts and Implicit Generalizations. Christian G. Fermüller, Reinhard Pichler. CADE 2005, 409-423. Web SearchBibTeXDownload |
| 21 | The complexity of XPath query evaluation and XML typing. Georg Gottlob, Christoph Koch, Reinhard Pichler, Luc Segoufin. J. ACM (52): 284-335 (2005). Cited by 43Web SearchBibTeXDownload |
| 2004 |
|---|
| 20 | Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width. Georg Gottlob, Reinhard Pichler. SIAM J. Comput. (33): 351-378 (2004). Web SearchBibTeXDownload |
| 2003 |
|---|
| 19 | XPath Query Evaluation: Improving Time and Space Efficiency. Georg Gottlob, Christoph Koch, Reinhard Pichler. ICDE 2003, 379-390. Cited by 81Web SearchBibTeXDownload |
| 18 | On the complexity of equational problems in CNF. Reinhard Pichler. J. Symb. Comput. (36): 235-269 (2003). Web SearchBibTeXDownload |
| 17 | The complexity of XPath query evaluation. Georg Gottlob, Christoph Koch, Reinhard Pichler. PODS 2003, 179-190. Cited by 130Web SearchBibTeXDownload |
| 16 | XPath processing in a nutshell. Georg Gottlob, Christoph Koch, Reinhard Pichler. SIGMOD Record (32): 21-27 (2003). Web SearchBibTeXDownload |
| 15 | XPath Processing in a Nutshell. Georg Gottlob, Christoph Koch, Reinhard Pichler. SIGMOD Record (32): 12-19 (2003). Cited by 30Web SearchBibTeXDownload |
| 14 | Explicit versus implicit representations of subsets of the Herbrand universe. Reinhard Pichler. Theor. Comput. Sci. (290): 1021-1056 (2003). Web SearchBibTeXDownload |
| 2002 |
|---|
| 13 | Algorithmic Aspects of Herbrand Models Represented by Ground Atoms with Ground Equations. Bernhard Gramlich, Reinhard Pichler. CADE 2002, 241-259. Web SearchBibTeXDownload |
| 12 | Efficient Algorithms for Processing XPath Queries. Georg Gottlob, Christoph Koch, Reinhard Pichler. VLDB 2002, 95-106. Cited by 2Web SearchBibTeXDownload |
| 2001 |
|---|
| 11 | Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width. Georg Gottlob, Reinhard Pichler. ICALP 2001, 708-719. Web SearchBibTeXDownload |
| 10 | Working with ARMs: Complexity Results on Atomic Representations of Herbrand Models. Georg Gottlob, Reinhard Pichler. Inf. Comput. (165): 183-207 (2001). Web SearchBibTeXDownload |
| 2000 |
|---|
| 9 | Negation Elimination from Simple Equational Formulae. Reinhard Pichler. ICALP 2000, 612-623. Web SearchBibTeXDownload |
| 8 | Speeding up Algorithms on Atomic Representations of Herbrand Models via New Redundancy Criteria. Reinhard Pichler. J. Symb. Comput. (29): 213-257 (2000). Web SearchBibTeXDownload |
| 7 | The Explicit Representability of Implicit Generalizations. Reinhard Pichler. RTA 2000, 187-202. Web SearchBibTeXDownload |
| 1999 |
|---|
| 6 | Solving Equational Problems Efficiently. Reinhard Pichler. CADE 1999, 97-111. Web SearchBibTeXDownload |
| 5 | Working with Arms: Complexity Results on Atomic Representations of Herbrand Models. Georg Gottlob, Reinhard Pichler. LICS 1999, 306-315. Web SearchBibTeXDownload |
| 1998 |
|---|
| 4 | On the Complexity of H-Subsumption. Reinhard Pichler. CSL 1998, 355-371. Web SearchBibTeXDownload |
| 3 | Completeness and Redundancy in Constrained Clause Logic. Reinhard Pichler. FTP (LNCS Selection) 1998, 221-235. Web SearchBibTeXDownload |
| 2 | Extending Decidable Clause Classes via Constraints. Reinhard Pichler. FTP (LNCS Selection) 1998, 206-220. Web SearchBibTeXDownload |
| 1 | Algorithms on Atomic Representations of Herbrand Models. Reinhard Pichler. JELIA 1998, 199-215. Web SearchBibTeXDownload |
