Reinhard Pichler

2007
34		Georg Gottlob, Reinhard Pichler, Fang Wei: Efficient Datalog Abduction through Bounded Treewidth. AAAI 2007: 1626-1631
33	EE	Miki Hermann, Reinhard Pichler: Counting Complexity of Propositional Abduction. IJCAI 2007: 417-422
32	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
31	EE	Georg Gottlob, Reinhard Pichler, Fang Wei: Monadic datalog over finite structures with bounded treewidth. PODS 2007: 165-174
30	EE	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	EE	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	EE	Christian G. Fermüller, Reinhard Pichler: Model Representation over Finite and Infinite Signatures. JELIA 2006: 164-176
26	EE	Georg Gottlob, Reinhard Pichler, Fang Wei: Tractable database design through bounded treewidth. PODS 2006: 124-133
25	EE	Reinhard Pichler: Algorithmic Aspects of Model Representations. WLP 2006: 12-20
2005
24	EE	Christian G. Fermüller, Reinhard Pichler: Model Representation via Contexts and Implicit Generalizations. CADE 2005: 409-423
23	EE	Georg Gottlob, Christoph Koch, Reinhard Pichler: Efficient algorithms for processing XPath queries. ACM Trans. Database Syst. 30(2): 444-491 (2005)
22	EE	Uwe Egly, Reinhard Pichler, Stefan Woltran: On deciding subsumption problems. Ann. Math. Artif. Intell. 43(1): 255-294 (2005)
21	EE	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	EE	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	EE	Georg Gottlob, Christoph Koch, Reinhard Pichler: XPath Query Evaluation: Improving Time and Space Efficiency. ICDE 2003: 379-390
18	EE	Georg Gottlob, Christoph Koch, Reinhard Pichler: The complexity of XPath query evaluation. PODS 2003: 179-190
17	EE	Reinhard Pichler: On the complexity of equational problems in CNF. J. Symb. Comput. 36(1-2): 235-269 (2003)
16	EE	Georg Gottlob, Christoph Koch, Reinhard Pichler: XPath Processing in a Nutshell. SIGMOD Record 32(1): 12-19 (2003)
15	EE	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	EE	Bernhard Gramlich, Reinhard Pichler: Algorithmic Aspects of Herbrand Models Represented by Ground Atoms with Ground Equations. CADE 2002: 241-259
12	EE	Georg Gottlob, Christoph Koch, Reinhard Pichler: Efficient Algorithms for Processing XPath Queries. VLDB 2002: 95-106
2001
11	EE	Georg Gottlob, Reinhard Pichler: Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width. ICALP 2001: 708-719
10	EE	Georg Gottlob, Reinhard Pichler: Working with ARMs: Complexity Results on Atomic Representations of Herbrand Models. Inf. Comput. 165(2): 183-207 (2001)
2000
9	EE	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	EE	Reinhard Pichler: Solving Equational Problems Efficiently. CADE 1999: 97-111
5	EE	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	EE	Reinhard Pichler: Extending Decidable Clause Classes via Constraints. FTP (LNCS Selection) 1998: 206-220
2	EE	Reinhard Pichler: Completeness and Redundancy in Constrained Clause Logic. FTP (LNCS Selection) 1998: 221-235
1	EE	Reinhard Pichler: Algorithms on Atomic Representations of Herbrand Models. JELIA 1998: 199-215

Coauthor Index

1	François Bry (François Bry-Haußer)	[30]
2	Uwe Egly	[22]
3	Norbert Eisinger	[30]
4	Thomas Eiter	[30]
5	Christian G. Fermüller	[24] [27] [29]
6	Michael Fink	[32]
7	Tim Furche	[30]
8	Georg Gottlob	[5] [10] [11] [12] [15] [16] [18] [19] [20] [21] [23] [26] [28] [30] [31] [34]
9	Bernhard Gramlich	[13]
10	Miki Hermann	[33]
11	Christoph Koch	[12] [15] [16] [18] [19] [21] [23]
12	Clemens Ley	[30]
13	Benedikt Linse	[30]
14	Luc Segoufin	[21]
15	Hans Tompits	[32]
16	Fang Wei	[26] [28] [30] [31] [34]
17	Stefan Woltran	[22] [32]

Colors in the list of coauthors