Reinhard Pichler

Reinhard Pichler, Emanuel Sallinger, Vadim Savenkov: Relaxed Notions of Schema Mapping Equivalence Revisited. Theory Comput. Syst. 52(3): 483-541 (2013)

Wolfgang Dvorák, Reinhard Pichler, Stefan Woltran: Towards fixed-parameter tractable algorithms for abstract argumentation. Artif. Intell. 186: 1-37 (2012)

Andrés Letelier, Jorge Pérez, Reinhard Pichler, Sebastian Skritek: SPAM: A SPARQL Analysis and Manipulation Tool. PVLDB 5(12): 1958-1961 (2012)

Schahram Dustdar, Reinhard Pichler, Vadim Savenkov, Hong Linh Truong: Quality-aware service-oriented data integration: requirements, state of the art and open challenges. SIGMOD Record 41(1): 11-19 (2012)

Jorge Pérez, Reinhard Pichler, Emanuel Sallinger, Vadim Savenkov: Union and Intersection of Schema Mappings. AMW 2012: 129-141

Martin Lackner, Reinhard Pichler, Stefan Rümmele, Stefan Woltran: Multicut on Graphs of Bounded Clique-Width. COCOA 2012: 115-126

Nadia Creignou, Odile Papini, Reinhard Pichler, Stefan Woltran: Belief Revision within Fragments of Propositional Logic. KR 2012

Michael Morak, Nysret Musliu, Reinhard Pichler, Stefan Rümmele, Stefan Woltran: Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming. LION 2012: 130-144

Andrés Letelier, Jorge Pérez, Reinhard Pichler, Sebastian Skritek: Static analysis and optimization of semantic web queries. PODS 2012: 89-100

Pablo Barceló, Reinhard Pichler (Eds.): Datalog in Academia and Industry - Second International Workshop, Datalog 2.0, Vienna, Austria, September 11-13, 2012. Proceedings. Lecture Notes in Computer Science 7494, Springer 2012, isbn 978-3-642-32924-1

Reinhard Pichler, Stefan Rümmele, Stefan Szeider, Stefan Woltran: Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough. CoRR abs/1204.3040 (2012)

Georg Gottlob, Reinhard Pichler, Vadim Savenkov: Normalization and optimization of schema mappings. VLDB J. 20(2): 277-302 (2011)

Ingo Feinerer, Reinhard Pichler, Emanuel Sallinger, Vadim Savenkov: On the Undecidability of the Equivalence of Second-Order Tuple Generating Dependencies. AMW 2011

Reinhard Pichler, Sebastian Skritek: Tractable Counting of the Answers to Conjunctive Queries. AMW 2011

Muhammad Intizar Ali, Reinhard Pichler, Hong Linh Truong, Schahram Dustdar: On Integrating Data Services Using Data Mashups. BNCOD 2011: 132-135

Reinhard Pichler, Emanuel Sallinger, Vadim Savenkov: Relaxed notions of schema mapping equivalence revisited. ICDT 2011: 90-101

Reinhard Pichler, Sebastian Skritek: The complexity of evaluating tuple generating dependencies. ICDT 2011: 244-255

Muhammad Intizar Ali, Reinhard Pichler, Hong Linh Truong, Schahram Dustdar: Data Concern Aware Querying for the Integration of Data Services. ICEIS (1) 2011: 111-119

Muhammad Intizar Ali, Reinhard Pichler, Hong Linh Truong, Schahram Dustdar: Incorporating Data Concerns into Query Languages for Data Services. ICEIS 2011: 132-145

Michael Morak, Nysret Musliu, Reinhard Pichler, Stefan Rümmele, Stefan Woltran: A New Tree-Decomposition Based Algorithm for Answer Set Programming. ICTAI 2011: 916-918

Georg Gottlob, Reinhard Pichler, Fang Wei: Bounded treewidth as a key to tractability of knowledge representation and reasoning. Artif. Intell. 174(1): 105-132 (2010)

Georg Gottlob, Reinhard Pichler, Fang Wei: Tractable database design and datalog abduction through bounded treewidth. Inf. Syst. 35(3): 278-298 (2010)

Miki Hermann, Reinhard Pichler: Counting complexity of propositional abduction. J. Comput. Syst. Sci. 76(7): 634-649 (2010)

Reinhard Pichler, Vadim Savenkov: Towards practical feasibility of core computation in data exchange. Theor. Comput. Sci. 411(7-9): 935-957 (2010)

Georg Gottlob, Reinhard Pichler, Fang Wei: Monadic datalog over finite structures of bounded treewidth. ACM Trans. Comput. Log. 12(1): 3 (2010)

Reinhard Pichler, Axel Polleres, Sebastian Skritek, Stefan Woltran: Minimising RDF Graphs under Rules and Constraints Revisited. AMW 2010

Reinhard Pichler, Stefan Rümmele, Stefan Woltran: Multicut Algorithms via Tree Decompositions. CIAC 2010: 167-179

Reinhard Pichler: Exploiting Bounded Treewidth with Datalog (A Survey). Datalog 2010: 88-105

Reinhard Pichler, Stefan Woltran: The Complexity of Handling Minimal Solutions in Logic-Based Abduction. ECAI 2010: 895-900

Michael Morak, Reinhard Pichler, Stefan Rümmele, Stefan Woltran: A Dynamic-Programming Based ASP-Solver. JELIA 2010: 369-372

Wolfgang Dvorák, Reinhard Pichler, Stefan Woltran: Towards Fixed-Parameter Tractable Algorithms for Argumentation. KR 2010

Reinhard Pichler, Stefan Rümmele, Stefan Szeider, Stefan Woltran: Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough. KR 2010

Reinhard Pichler, Stefan Rümmele, Stefan Woltran: Counting and Enumeration Problems with Bounded Treewidth. LPAR (Dakar) 2010: 387-404

Reinhard Pichler, Vadim Savenkov, Sebastian Skritek, Hong Linh Truong: Uncertain Databases in Collaborative Data Management. MUD 2010: 129-143

Reinhard Pichler, Axel Polleres, Sebastian Skritek, Stefan Woltran: Redundancy Elimination on RDF Graphs in the Presence of Rules, Constraints, and Queries. RR 2010: 133-148

Georg Gottlob, Reinhard Pichler, Vadim Savenkov: Normalization and Optimization of Schema Mappings. PVLDB 2(1): 1102-1113 (2009)

Reinhard Pichler, Vadim Savenkov: DEMo: Data Exchange Modeling Tool. PVLDB 2(2): 1606-1609 (2009)

Miki Hermann, Reinhard Pichler: Complexity of counting the optimal solutions. Theor. Comput. Sci. 410(38-40): 3814-3825 (2009)

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

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

Michael Jakl, Reinhard Pichler, Stefan Woltran: Answer-Set Programming with Bounded Treewidth. IJCAI 2009: 816-822

Reinhard Pichler, Stefan Rümmele, Stefan Woltran: Belief Revision with Bounded Treewidth. LPNMR 2009: 250-263

Wolfgang Dvorák, Georg Gottlob, Reinhard Pichler, Stefan Woltran: Alternation as a programming paradigm. PPDP 2009: 61-72

Georg Gottlob, Reinhard Pichler, Fang Wei: Abduction with Bounded Treewidth: From Theoretical Tractability to Practically Efficient Computation. AAAI 2008: 1541-1546

Miki Hermann, Reinhard Pichler: Complexity of Counting the Optimal Solutions. COCOON 2008: 149-159

Reinhard Pichler, Axel Polleres, Fang Wei, Stefan Woltran: dRDF: Entailment for Domain-Restricted RDF. ESWC 2008: 200-214

Miki Hermann, Reinhard Pichler: Counting Complexity of Minimal Cardinality and Minimal Weight Abduction. JELIA 2008: 206-218

Reinhard Pichler, Vadim Savenkov: Towards Practical Feasibility of Core Computation in Data Exchange. LPAR 2008: 62-78

Michael Jakl, Reinhard Pichler, Stefan Rümmele, Stefan Woltran: Fast Counting with Bounded Treewidth. LPAR 2008: 436-450

Georg Gottlob, Reinhard Pichler, Fang Wei: Monadic Datalog over Finite Structures with Bounded Treewidth. CoRR abs/0809.3140 (2008)

Miki Hermann, Reinhard Pichler: Complexity of Counting the Optimal Solutions. Electronic Colloquium on Computational Complexity (ECCC) 15(044) (2008)

Christian G. Fermüller, Reinhard Pichler: Model Representation over Finite and Infinite Signatures. J. Log. Comput. 17(3): 453-477 (2007)

Georg Gottlob, Reinhard Pichler, Fang Wei: Efficient Datalog Abduction through Bounded Treewidth. AAAI 2007: 1626-1631

Miki Hermann, Reinhard Pichler: Counting Complexity of Propositional Abduction. IJCAI 2007: 417-422

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

Georg Gottlob, Reinhard Pichler, Fang Wei: Monadic datalog over finite structures with bounded treewidth. PODS 2007: 165-174

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

Georg Gottlob, Reinhard Pichler, Fang Wei: Bounded Treewidth as a Key to Tractability of Knowledge Representation and Reasoning. AAAI 2006: 250-256

Christian G. Fermüller, Reinhard Pichler: Model Representation over Finite and Infinite Signatures. JELIA 2006: 164-176

Georg Gottlob, Reinhard Pichler, Fang Wei: Tractable database design through bounded treewidth. PODS 2006: 124-133

Reinhard Pichler: Algorithmic Aspects of Model Representations. WLP 2006: 12-20

Uwe Egly, Reinhard Pichler, Stefan Woltran: On deciding subsumption problems. Ann. Math. Artif. Intell. 43(1): 255-294 (2005)

Georg Gottlob, Christoph Koch, Reinhard Pichler, Luc Segoufin: The complexity of XPath query evaluation and XML typing. J. ACM 52(2): 284-335 (2005)

Georg Gottlob, Christoph Koch, Reinhard Pichler: Efficient algorithms for processing XPath queries. ACM Trans. Database Syst. 30(2): 444-491 (2005)

Christian G. Fermüller, Reinhard Pichler: Model Representation via Contexts and Implicit Generalizations. CADE 2005: 409-423

Georg Gottlob, Reinhard Pichler: Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width. SIAM J. Comput. 33(2): 351-378 (2004)

Reinhard Pichler: On the complexity of equational problems in CNF. J. Symb. Comput. 36(1-2): 235-269 (2003)

Georg Gottlob, Christoph Koch, Reinhard Pichler: XPath Processing in a Nutshell. SIGMOD Record 32(1): 12-19 (2003)

Georg Gottlob, Christoph Koch, Reinhard Pichler: XPath processing in a nutshell. SIGMOD Record 32(2): 21-27 (2003)

Reinhard Pichler: Explicit versus implicit representations of subsets of the Herbrand universe. Theor. Comput. Sci. 290(1): 1021-1056 (2003)

Georg Gottlob, Christoph Koch, Reinhard Pichler: XPath Query Evaluation: Improving Time and Space Efficiency. ICDE 2003: 379-390

Georg Gottlob, Christoph Koch, Reinhard Pichler: The complexity of XPath query evaluation. PODS 2003: 179-190

Bernhard Gramlich, Reinhard Pichler: Algorithmic Aspects of Herbrand Models Represented by Ground Atoms with Ground Equations. CADE 2002: 241-259

Georg Gottlob, Christoph Koch, Reinhard Pichler: Efficient Algorithms for Processing XPath Queries. VLDB 2002: 95-106

Georg Gottlob, Reinhard Pichler: Working with ARMs: Complexity Results on Atomic Representations of Herbrand Models. Inf. Comput. 165(2): 183-207 (2001)

Georg Gottlob, Reinhard Pichler: Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width. ICALP 2001: 708-719

Reinhard Pichler: Speeding up Algorithms on Atomic Representations of Herbrand Models via New Redundancy Criteria. J. Symb. Comput. 29(2): 213-257 (2000)

Reinhard Pichler: Negation Elimination from Simple Equational Formulae. ICALP 2000: 612-623

Reinhard Pichler: The Explicit Representability of Implicit Generalizations. RTA 2000: 187-202

Reinhard Pichler: Solving Equational Problems Efficiently. CADE 1999: 97-111

Georg Gottlob, Reinhard Pichler: Working with Arms: Complexity Results on Atomic Representations of Herbrand Models. LICS 1999: 306-315

Reinhard Pichler: On the Complexity of H-Subsumption. CSL 1998: 355-371

Reinhard Pichler: Extending Decidable Clause Classes via Constraints. FTP (LNCS Selection) 1998: 206-220

Reinhard Pichler: Completeness and Redundancy in Constrained Clause Logic. FTP (LNCS Selection) 1998: 221-235

Reinhard Pichler: Algorithms on Atomic Representations of Herbrand Models. JELIA 1998: 199-215