Reinhard Pichler

	2009
50		Muhammad Intizar Ali, Reinhard Pichler, Hong Linh Truong, Schahram Dustdar: DeXIN: An Extensible Framework for Distributed XQuery over Heterogeneous Data Sources . ICEIS 2009: 172-183
49		Muhammad Intizar Ali, Reinhard Pichler, Hong Linh Truong, Schahram Dustdar: On Using Distributed Extended XQuery for Web Data Sources as Services. ICWE 2009: 497-500
48		Michael Jakl, Reinhard Pichler, Stefan Woltran: Answer-Set Programming with Bounded Treewidth. IJCAI 2009: 816-822
47		Reinhard Pichler, Stefan Rümmele, Stefan Woltran: Belief Revision with Bounded Treewidth. LPNMR 2009: 250-263
46		Wolfgang Dvorák, Georg Gottlob, Reinhard Pichler, Stefan Woltran: Alternation as a programming paradigm. PPDP 2009: 61-72
45		Georg Gottlob, Reinhard Pichler, Vadim Savenkov: Normalization and Optimization of Schema Mappings. PVLDB 2(1): 1102-1113 (2009)
44		Reinhard Pichler, Vadim Savenkov: DEMo: Data Exchange Modeling Tool. PVLDB 2(2): 1606-1609 (2009)
43		Miki Hermann, Reinhard Pichler: Complexity of counting the optimal solutions. Theor. Comput. Sci. 410(38-40): 3814-3825 (2009)
	2008
42		Georg Gottlob, Reinhard Pichler, Fang Wei: Abduction with Bounded Treewidth: From Theoretical Tractability to Practically Efficient Computation. AAAI 2008: 1541-1546
41		Miki Hermann, Reinhard Pichler: Complexity of Counting the Optimal Solutions. COCOON 2008: 149-159
40		Reinhard Pichler, Axel Polleres, Fang Wei, Stefan Woltran: dRDF: Entailment for Domain-Restricted RDF. ESWC 2008: 200-214
39		Miki Hermann, Reinhard Pichler: Counting Complexity of Minimal Cardinality and Minimal Weight Abduction. JELIA 2008: 206-218
38		Michael Jakl, Reinhard Pichler, Stefan Rümmele, Stefan Woltran: Fast Counting with Bounded Treewidth. LPAR 2008: 436-450
37		Reinhard Pichler, Vadim Savenkov: Towards Practical Feasibility of Core Computation in Data Exchange. LPAR 2008: 62-78
36		Georg Gottlob, Reinhard Pichler, Fang Wei: Monadic Datalog over Finite Structures with Bounded Treewidth CoRR abs/0809.3140: (2008)
35		Miki Hermann, Reinhard Pichler: Complexity of Counting the Optimal Solutions. Electronic Colloquium on Computational Complexity (ECCC) 15(044): (2008)
	2007
34		Georg Gottlob, Reinhard Pichler, Fang Wei: Efficient Datalog Abduction through Bounded Treewidth. AAAI 2007: 1626-1631
33		Miki Hermann, Reinhard Pichler: Counting Complexity of Propositional Abduction. IJCAI 2007: 417-422
32		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
31		Georg Gottlob, Reinhard Pichler, Fang Wei: Monadic datalog over finite structures with bounded treewidth. PODS 2007: 165-174
30		François Bry, Norbert Eisinger, Thomas Eiter, Tim Furche, Georg Gottlob, Clemens Ley, Benedikt Linse, Reinhard Pichler, Fang Wei: Foundations of Rule-Based Query Answering. Reasoning Web 2007: 1-153
29		Christian G. Fermüller, Reinhard Pichler: Model Representation over Finite and Infinite Signatures. J. Log. Comput. 17(3): 453-477 (2007)
	2006
28		Georg Gottlob, Reinhard Pichler, Fang Wei: Bounded Treewidth as a Key to Tractability of Knowledge Representation and Reasoning. AAAI 2006
27		Christian G. Fermüller, Reinhard Pichler: Model Representation over Finite and Infinite Signatures. JELIA 2006: 164-176
26		Georg Gottlob, Reinhard Pichler, Fang Wei: Tractable database design through bounded treewidth. PODS 2006: 124-133
25		Reinhard Pichler: Algorithmic Aspects of Model Representations. WLP 2006: 12-20
	2005
24		Christian G. Fermüller, Reinhard Pichler: Model Representation via Contexts and Implicit Generalizations. CADE 2005: 409-423
23		Georg Gottlob, Christoph Koch, Reinhard Pichler: Efficient algorithms for processing XPath queries. ACM Trans. Database Syst. 30(2): 444-491 (2005)
22		Uwe Egly, Reinhard Pichler, Stefan Woltran: On deciding subsumption problems. Ann. Math. Artif. Intell. 43(1): 255-294 (2005)
21		Georg Gottlob, Christoph Koch, Reinhard Pichler, Luc Segoufin: The complexity of XPath query evaluation and XML typing. J. ACM 52(2): 284-335 (2005)
	2004
20		Georg Gottlob, Reinhard Pichler: Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width. SIAM J. Comput. 33(2): 351-378 (2004)
	2003
19		Georg Gottlob, Christoph Koch, Reinhard Pichler: XPath Query Evaluation: Improving Time and Space Efficiency. ICDE 2003: 379-390
18		Georg Gottlob, Christoph Koch, Reinhard Pichler: The complexity of XPath query evaluation. PODS 2003: 179-190
17		Reinhard Pichler: On the complexity of equational problems in CNF. J. Symb. Comput. 36(1-2): 235-269 (2003)
16		Georg Gottlob, Christoph Koch, Reinhard Pichler: XPath Processing in a Nutshell. SIGMOD Record 32(1): 12-19 (2003)
15		Georg Gottlob, Christoph Koch, Reinhard Pichler: XPath processing in a nutshell. SIGMOD Record 32(2): 21-27 (2003)
14		Reinhard Pichler: Explicit versus implicit representations of subsets of the Herbrand universe. Theor. Comput. Sci. 290(1): 1021-1056 (2003)
	2002
13		Bernhard Gramlich, Reinhard Pichler: Algorithmic Aspects of Herbrand Models Represented by Ground Atoms with Ground Equations. CADE 2002: 241-259
12		Georg Gottlob, Christoph Koch, Reinhard Pichler: Efficient Algorithms for Processing XPath Queries. VLDB 2002: 95-106
	2001
11		Georg Gottlob, Reinhard Pichler: Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width. ICALP 2001: 708-719
10		Georg Gottlob, Reinhard Pichler: Working with ARMs: Complexity Results on Atomic Representations of Herbrand Models. Inf. Comput. 165(2): 183-207 (2001)
	2000
9		Reinhard Pichler: Negation Elimination from Simple Equational Formulae. ICALP 2000: 612-623
8		Reinhard Pichler: The Explicit Representability of Implicit Generalizations. RTA 2000: 187-202
7		Reinhard Pichler: Speeding up Algorithms on Atomic Representations of Herbrand Models via New Redundancy Criteria. J. Symb. Comput. 29(2): 213-257 (2000)
	1999
6		Reinhard Pichler: Solving Equational Problems Efficiently. CADE 1999: 97-111
5		Georg Gottlob, Reinhard Pichler: Working with Arms: Complexity Results on Atomic Representations of Herbrand Models. LICS 1999: 306-315
	1998
4		Reinhard Pichler: On the Complexity of H-Subsumption. CSL 1998: 355-371
3		Reinhard Pichler: Extending Decidable Clause Classes via Constraints. FTP (LNCS Selection) 1998: 206-220
2		Reinhard Pichler: Completeness and Redundancy in Constrained Clause Logic. FTP (LNCS Selection) 1998: 221-235
1		Reinhard Pichler: Algorithms on Atomic Representations of Herbrand Models. JELIA 1998: 199-215

Coauthor Index

1	Muhammad Intizar Ali	[49] [50]
2	François Bry (François Bry-Haußer)	[30]
3	Schahram Dustdar	[49] [50]
4	Wolfgang Dvorák	[46]
5	Uwe Egly	[22]
6	Norbert Eisinger	[30]
7	Thomas Eiter	[30]
8	Christian G. Fermüller	[24] [27] [29]
9	Michael Fink	[32]
10	Tim Furche	[30]
11	Georg Gottlob	[5] [10] [11] [12] [15] [16] [18] [19] [20] [21] [23] [26] [28] [30] [31] [34] [36] [42] [45] [46]
12	Bernhard Gramlich	[13]
13	Miki Hermann	[33] [35] [39] [41] [43]
14	Michael Jakl	[38] [48]
15	Christoph Koch	[12] [15] [16] [18] [19] [21] [23]
16	Clemens Ley	[30]
17	Benedikt Linse	[30]
18	Axel Polleres	[40]
19	Stefan Rümmele	[38] [47]
20	Vadim Savenkov	[37] [44] [45]
21	Luc Segoufin	[21]
22	Hans Tompits	[32]
23	Hong Linh Truong	[49] [50]
24	Fang Wei	[26] [28] [30] [31] [34] [36] [40] [42]
25	Stefan Woltran	[22] [32] [38] [40] [46] [47] [48]

Colors in the list of coauthors