On the Complexity of H-Subsumption. - Reinhard Pichler (CSL, 1998)

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

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

Algorithms on Atomic Representations of Herbrand Models. - Reinhard Pichler (JELIA, 1998)

Solving Equational Problems Efficiently. - Reinhard Pichler (CADE, 1999)

Negation Elimination from Simple Equational Formulae. - Reinhard Pichler (ICALP, 2000)

The Explicit Representability of Implicit Generalizations. - Reinhard Pichler (RTA, 2000)

Speeding up Algorithms on Atomic Representations of Herbrand Models via New Redundancy Criteria. - Reinhard Pichler (J. Symb. Comput., 2000)

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

Algorithmic Aspects of Herbrand Models Represented by Ground Atoms with Ground Equations. - Bernhard Gramlich; Reinhard Pichler (CADE, 2002)

XPath Query Evaluation: Improving Time and Space Efficiency. - Georg Gottlob; Christoph Koch 001; Reinhard Pichler (ICDE, 2003)

The complexity of XPath query evaluation. - Georg Gottlob; Christoph Koch 001; Reinhard Pichler (PODS, 2003)

On the complexity of equational problems in CNF. - Reinhard Pichler (J. Symb. Comput., 2003)

XPath Processing in a Nutshell. - Georg Gottlob; Christoph Koch 001; Reinhard Pichler (SIGMOD Rec., 2003)

Explicit versus implicit representations of subsets of the Herbrand universe. - Reinhard Pichler (Theor. Comput. Sci., 2003)

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

Model Representation via Contexts and Implicit Generalizations. - Christian G. Fermüller; Reinhard Pichler (CADE, 2005)

On deciding subsumption problems. - Uwe Egly; Reinhard Pichler; Stefan Woltran (Ann. Math. Artif. Intell., 2005)

The complexity of XPath query evaluation and XML typing. - Georg Gottlob; Christoph Koch 001; Reinhard Pichler; Luc Segoufin (J. ACM, 2005)

Efficient algorithms for processing XPath queries. - Georg Gottlob; Christoph Koch 001; Reinhard Pichler (ACM Trans. Database Syst., 2005)

Tractable database design through bounded treewidth. - Georg Gottlob; Reinhard Pichler; Fang Wei 001 (PODS, 2006)

Algorithmic Aspects of Model Representations. - Reinhard Pichler (WLP, 2006)

Efficient Datalog Abduction through Bounded Treewidth. - Georg Gottlob; Reinhard Pichler; Fang Wei 001 (AAAI, 2007)

Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains. - Michael Fink 001; Reinhard Pichler; Hans Tompits; Stefan Woltran (LPNMR, 2007)

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 001 (Reasoning Web, 2007)

Model Representation over Finite and Infinite Signatures. - Christian G. Fermüller; Reinhard Pichler (J. Log. Comput., 2007)

Abduction with Bounded Treewidth: From Theoretical Tractability to Practically Efficient Computation. - Georg Gottlob; Reinhard Pichler; Fang Wei 001 (AAAI, 2008)

dRDF: Entailment for Domain-Restricted RDF. - Reinhard Pichler; Axel Polleres; Fang Wei 001; Stefan Woltran (ESWC, 2008)

Counting Complexity of Minimal Cardinality and Minimal Weight Abduction. - Miki Hermann; Reinhard Pichler (JELIA, 2008)

Fast Counting with Bounded Treewidth. - Michael Jakl; Reinhard Pichler; Stefan Rümmele; Stefan Woltran (LPAR, 2008)

DeXIN: An Extensible Framework for Distributed XQuery over Heterogeneous Data Sources . - Muhammad Intizar Ali; Reinhard Pichler; Hong Linh Truong 001; Schahram Dustdar (ICEIS, 2009)

On Using Distributed Extended XQuery for Web Data Sources as Services. - Muhammad Intizar Ali; Reinhard Pichler; Hong Linh Truong 001; Schahram Dustdar (ICWE, 2009)

Answer-Set Programming with Bounded Treewidth. - Michael Jakl; Reinhard Pichler; Stefan Woltran (IJCAI, 2009)

Belief Revision with Bounded Treewidth. - Reinhard Pichler; Stefan Rümmele; Stefan Woltran (LPNMR, 2009)

Alternation as a programming paradigm. - Wolfgang Dvorák; Georg Gottlob; Reinhard Pichler; Stefan Woltran (PPDP, 2009)

Normalization and Optimization of Schema Mappings. - Georg Gottlob; Reinhard Pichler; Vadim Savenkov (Proc. VLDB Endow., 2009)

DEMo: Data Exchange Modeling Tool. - Reinhard Pichler; Vadim Savenkov (Proc. VLDB Endow., 2009)

Complexity of counting the optimal solutions. - Miki Hermann; Reinhard Pichler (Theor. Comput. Sci., 2009)

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

Multicut Algorithms via Tree Decompositions. - Reinhard Pichler; Stefan Rümmele; Stefan Woltran (CIAC, 2010)

Exploiting Bounded Treewidth with Datalog (A Survey). - Reinhard Pichler (Datalog, 2010)

The Complexity of Handling Minimal Solutions in Logic-Based Abduction. - Reinhard Pichler; Stefan Woltran (ECAI, 2010)

A Dynamic-Programming Based ASP-Solver. - Michael Morak; Reinhard Pichler; Stefan Rümmele; Stefan Woltran (JELIA, 2010)

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

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

Uncertain Databases in Collaborative Data Management. - Reinhard Pichler; Vadim Savenkov; Sebastian Skritek; Hong Linh Truong 001 (MUD, 2010)

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

Bounded treewidth as a key to tractability of knowledge representation and reasoning. - Georg Gottlob; Reinhard Pichler; Fang Wei 001 (Artif. Intell., 2010)

Tractable database design and datalog abduction through bounded treewidth. - Georg Gottlob; Reinhard Pichler; Fang Wei 001 (Inf. Syst., 2010)

Counting complexity of propositional abduction. - Miki Hermann; Reinhard Pichler (J. Comput. Syst. Sci., 2010)

Towards practical feasibility of core computation in data exchange. - Reinhard Pichler; Vadim Savenkov (Theor. Comput. Sci., 2010)

Monadic datalog over finite structures of bounded treewidth. - Georg Gottlob; Reinhard Pichler; Fang Wei 001 (ACM Trans. Comput. Log., 2010)

On Integrating Data Services Using Data Mashups. - Muhammad Intizar Ali; Reinhard Pichler; Hong Linh Truong 001; Schahram Dustdar (BNCOD, 2011)

The complexity of evaluating tuple generating dependencies. - Reinhard Pichler; Sebastian Skritek (ICDT, 2011)

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

Incorporating Data Concerns into Query Languages for Data Services. - Muhammad Intizar Ali; Reinhard Pichler; Hong Linh Truong 001; Schahram Dustdar (ICEIS, 2011)

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

Union and Intersection of Schema Mappings. - Jorge Pérez 001; Reinhard Pichler; Emanuel Sallinger; Vadim Savenkov (AMW, 2012)

Multicut on Graphs of Bounded Clique-Width. - Martin Lackner; Reinhard Pichler; Stefan Rümmele; Stefan Woltran (COCOA, 2012)

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

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

SPAM: A SPARQL Analysis and Manipulation Tool. - Andrés Letelier; Jorge Pérez 001; Reinhard Pichler; Sebastian Skritek (Proc. VLDB Endow., 2012)

Quality-aware service-oriented data integration: requirements, state of the art and open challenges. - Schahram Dustdar; Reinhard Pichler; Vadim Savenkov; Hong Linh Truong 001 (SIGMOD Rec., 2012)

Enhancing the Updatability of Projective Views. - Paolo Guagliardo; Reinhard Pichler; Emanuel Sallinger (AMW, 2013)

Efficient Updates of Uncertain Databases. - Andreas Hubmer; Reinhard Pichler; Vadim Savenkov; Sebastian Skritek (AMW, 2013)

Loop Elimination for Database Updates. - Vadim Savenkov; Reinhard Pichler; Christoph Koch 001 (BNCOD, 2013)

Parameterized Complexity of Optimal Planning: A Detailed Map. - Martin Kronegger; Andreas Pfandler; Reinhard Pichler (IJCAI, 2013)

Declarative Dynamic Programming as an Alternative Realization of Courcelle's Theorem. - Bernhard Bliem; Reinhard Pichler; Stefan Woltran (IPEC, 2013)

Tractable counting of the answers to conjunctive queries. - Reinhard Pichler; Sebastian Skritek (J. Comput. Syst. Sci., 2013)

Relaxed Notions of Schema Mapping Equivalence Revisited. - Reinhard Pichler; Emanuel Sallinger; Vadim Savenkov (Theory Comput. Syst., 2013)

Complexity of redundancy detection on RDF graphs in the presence of rules, constraints, and queries. - Reinhard Pichler; Axel Polleres; Sebastian Skritek; Stefan Woltran (Semantic Web, 2013)

Static analysis and optimization of semantic web queries. - Andrés Letelier; Jorge Pérez 001; Reinhard Pichler; Sebastian Skritek (ACM Trans. Database Syst., 2013)

Capturing Relational Schemas and Functional Dependencies in RDFS. - Diego Calvanese; Wolfgang Fischl; Reinhard Pichler; Emanuel Sallinger; Mantas Simkus (AAAI, 2014)

A Parameterized Complexity Analysis of Generalized CP-Nets. - Martin Kronegger; Martin Lackner; Andreas Pfandler; Reinhard Pichler (AAAI, 2014)

Combined Complexity of Repair Checking and Consistent Query Answering. - Sebastian Arming; Reinhard Pichler; Emanuel Sallinger (AMW, 2014)

On the Hardness of Counting the Solutions of SPARQL Queries. - Reinhard Pichler; Sebastian Skritek (AMW, 2014)

Expressive Identification Constraints to Capture Functional Dependencies in Description Logics. - Diego Calvanese; Wolfgang Fischl; Reinhard Pichler; Emanuel Sallinger; Mantas Simkus (Description Logics, 2014)

A Fuzzy Extension of Data Exchange. - Jesús Medina 001; Reinhard Pichler (IPMU (2), 2014)

Nested dependencies: structure and reasoning. - Phokion G. Kolaitis; Reinhard Pichler; Emanuel Sallinger; Vadim Savenkov (PODS, 2014)

Containment and equivalence of well-designed SPARQL. - Reinhard Pichler; Sebastian Skritek (PODS, 2014)

Belief revision within fragments of propositional logic. - Nadia Creignou; Odile Papini; Reinhard Pichler; Stefan Woltran (J. Comput. Syst. Sci., 2014)

Tractable answer-set programming with weight constraints: bounded treewidth is not enough. - Reinhard Pichler; Stefan Rümmele; Stefan Szeider; Stefan Woltran (Theory Pract. Log. Program., 2014)

Towards Reconciling SPARQL and Certain Answers (Extended Abstract). - Shqiponja Ahmetaj; Wolfgang Fischl; Reinhard Pichler; Mantas Simkus; Sebastian Skritek (AMW, 2015)

Efficient Evaluation of Well-designed Pattern Trees (Extended Abstract). - Pablo Barceló; Reinhard Pichler; Sebastian Skritek (AMW, 2015)

Using Statistics for Computing Joins with MapReduce. - Theresa Csar; Reinhard Pichler; Emanuel Sallinger; Vadim Savenkov (AMW, 2015)

DL-Lite and Conjunctive Queries Extended by Optional Matching. - Shqiponja Ahmetaj; Wolfgang Fischl; Reinhard Pichler; Mantas Simkus; Sebastian Skritek (Description Logics, 2015)

Efficient Evaluation and Approximation of Well-designed Pattern Trees. - Pablo Barceló; Reinhard Pichler; Sebastian Skritek (PODS, 2015)

Towards Reconciling SPARQL and Certain Answers. - Shqiponja Ahmetaj; Wolfgang Fischl; Reinhard Pichler; Mantas Simkus; Sebastian Skritek (WWW, 2015)

On the undecidability of the equivalence of second-order tuple generating dependencies. - Ingo Feinerer; Reinhard Pichler; Emanuel Sallinger; Vadim Savenkov (Inf. Syst., 2015)

The complexity of handling minimal solutions in logic-based abduction. - Andreas Pfandler; Reinhard Pichler; Stefan Woltran (J. Log. Comput., 2015)

The Challenge of Optional Matching in SPARQL. - Shqiponja Ahmetaj; Wolfgang Fischl; Markus Kröll; Reinhard Pichler; Mantas Simkus; Sebastian Skritek (FoIKS, 2016)

Complexity of Repair Checking and Consistent Query Answering. - Sebastian Arming; Reinhard Pichler; Emanuel Sallinger (ICDT, 2016)

On the Complexity of Enumerating the Answers to Well-designed Pattern Trees. - Markus Kröll; Reinhard Pichler; Sebastian Skritek (ICDT, 2016)

Universities and computer science in the European crisis of refugees. - Kathrin Conrad; Nysret Musliu; Reinhard Pichler; Hannes Werthner (Commun. ACM, 2016)

Fuzzy data exchange. - Jesús Medina 001; Reinhard Pichler (Fuzzy Sets Syst., 2016)

Winner Determination in Huge Elections with MapReduce. - Theresa Csar; Martin Lackner; Reinhard Pichler; Emanuel Sallinger (AAAI, 2017)

Function Symbols in Tuple-Generating Dependencies: Expressive Power and Computability. - Georg Gottlob; Reinhard Pichler; Emanuel Sallinger (AMW, 2017)

Computational Social Choice in the Clouds. - Theresa Csar; Martin Lackner; Reinhard Pichler; Emanuel Sallinger (BTW (Workshops), 2017)

On the Complexity of Enumerating the Extensions of Abstract Argumentation Frameworks. - Markus Kröll; Reinhard Pichler; Stefan Woltran (IJCAI, 2017)

On the Complexity of Hard Enumeration Problems. - Nadia Creignou; Markus Kröll; Reinhard Pichler; Sebastian Skritek; Heribert Vollmer (LATA, 2017)

Implementing Courcelle's Theorem in a declarative framework for dynamic programming. - Bernhard Bliem; Reinhard Pichler; Stefan Woltran (J. Log. Comput., 2017)

General and Fractional Hypertree Decompositions: Hard and Easy Cases (extended abstract). - Wolfgang Fischl; Georg Gottlob; Reinhard Pichler (AMW, 2018)

Computing the Schulze Method for Large-Scale Preference Data Sets. - Theresa Csar; Martin Lackner; Reinhard Pichler (IJCAI, 2018)

General and Fractional Hypertree Decompositions: Hard and Easy Cases. - Wolfgang Fischl; Georg Gottlob; Reinhard Pichler (PODS, 2018)

Semantic Width of Conjunctive Queries and Constraint Satisfaction Problems. - Georg Gottlob; Matthias Lanzinger; Reinhard Pichler (CoRR, 2018)

Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? - Nadia Creignou; Reinhard Pichler; Stefan Woltran (Log. Methods Comput. Sci., 2018)

Limits of Schema Mappings. - Phokion G. Kolaitis; Reinhard Pichler; Emanuel Sallinger; Vadim Savenkov (Theory Comput. Syst., 2018)

Efficient Evaluation and Static Analysis for Well-Designed Pattern Trees with Projection. - Pablo Barceló; Markus Kröll; Reinhard Pichler; Sebastian Skritek (ACM Trans. Database Syst., 2018)

Semantic Width Revisited (Extended Abstract). - Georg Gottlob; Matthias Lanzinger; Reinhard Pichler (AMW, 2019)

Parallel Computation of Generalized Hypertree Decompositions. - Georg Gottlob; Cem Okulmus; Reinhard Pichler (AMW, 2019)

Datalog: Bag Semantics via Set Semantics. - Leopoldo E. Bertossi; Georg Gottlob; Reinhard Pichler (ICDT, 2019)

Enumeration in Data Management (Dagstuhl Seminar 19211). - Endre Boros; Benny Kimelfeld; Reinhard Pichler; Nicole Schweikardt (Dagstuhl Reports, 2019)

A complexity theory for hard enumeration problems. - Nadia Creignou; Markus Kröll; Reinhard Pichler; Sebastian Skritek; Heribert Vollmer (Discret. Appl. Math., 2019)

The HyperTrac Project: Recent Progress and Future Research Directions on Hypergraph Decompositions. - Georg Gottlob; Matthias Lanzinger; Davide Mario Longo; Cem Okulmus; Reinhard Pichler (CPAIOR, 2020)

Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems. - Hubie Chen; Georg Gottlob; Matthias Lanzinger; Reinhard Pichler (IJCAI, 2020)

Complexity Analysis of General and Fractional Hypertree Decompositions. - Georg Gottlob; Matthias Lanzinger; Reinhard Pichler; Igor Razgon (CoRR, 2020)

Technical Perspective: Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation. - Reinhard Pichler (SIGMOD Rec., 2020)

On the Language of Nested Tuple Generating Dependencies. - Phokion G. Kolaitis; Reinhard Pichler; Emanuel Sallinger; Vadim Savenkov (ACM Trans. Database Syst., 2020)

Complexity Analysis of Generalized and Fractional Hypertree Decompositions. - Georg Gottlob; Matthias Lanzinger; Reinhard Pichler; Igor Razgon (J. ACM, 2021)

HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings. - Wolfgang Fischl; Georg Gottlob; Davide Mario Longo; Reinhard Pichler (ACM J. Exp. Algorithmics, 2021)

Database Theory Column Report on PODS 2021. - Reinhard Pichler (SIGACT News, 2021)

Novel Techniques in Datalog Optimization (Abstract). - Reinhard Pichler (Datalog, 2022)

Optimizing Recursive Queries with Progam Synthesis. - Yisu Remy Wang; Mahmoud Abo Khamis; Hung Q. Ngo 001; Reinhard Pichler; Dan Suciu (SIGMOD Conference, 2022)

Fast and parallel decomposition of constraint satisfaction problems. - Georg Gottlob; Cem Okulmus; Reinhard Pichler (Constraints An Int. J., 2022)

Optimizing Recursive Queries with Program Synthesis. - Yisu Remy Wang; Mahmoud Abo Khamis; Hung Q. Ngo 001; Reinhard Pichler; Dan Suciu (CoRR, 2022)

Datalog in Wonderland. - Mahmoud Abo Khamis; Hung Q. Ngo 001; Reinhard Pichler; Dan Suciu; Yisu Remy Wang (SIGMOD Rec., 2022)

Reaching Back to Move Forward: Using Old Ideas to Achieve a New Level of Query Optimization (short paper). - Georg Gottlob; Matthias Lanzinger; Davide Mario Longo; Cem Okulmus; Reinhard Pichler; Alexander Selzer (AMW, 2023)

Diversity of Answers to Conjunctive Queries (short paper). - Timo Camillo Merkl; Reinhard Pichler; Sebastian Skritek (AMW, 2023)

Integration of Skyline Queries into Spark SQL. - Lukas Grasmann; Reinhard Pichler; Alexander Selzer (EDBT, 2023)

Structure-Guided Query Evaluation: Towards Bridging the Gap from Theory to Practice. - Georg Gottlob; Matthias Lanzinger; Davide Mario Longo; Cem Okulmus; Reinhard Pichler; Alexander Selzer (CoRR, 2023)

SparqLog: A System for Efficient Evaluation of SPARQL 1.1 Queries via Datalog [Experiment, Analysis and Benchmark]. - Renzo Angles; Georg Gottlob; Aleksandar Pavlovic 002; Reinhard Pichler; Emanuel Sallinger (CoRR, 2023)

SparqLog: A System for Efficient Evaluation of SPARQL 1.1 Queries via Datalog. - Renzo Angles; Georg Gottlob; Aleksandar Pavlovic 002; Reinhard Pichler; Emanuel Sallinger (Proc. VLDB Endow., 2023)

Convergence of Datalog over (Pre-) Semirings. - Mahmoud Abo Khamis; Hung Q. Ngo 001; Reinhard Pichler; Dan Suciu; Yisu Remy Wang (SIGMOD Rec., 2023)

Fractional covers of hypergraphs with bounded multi-intersection. - Georg Gottlob; Matthias Lanzinger; Reinhard Pichler; Igor Razgon (Theor. Comput. Sci., 2023)

Consistent Query Answering over SHACL Constraints (Extended Abstract). - Shqiponja Ahmetaj; Timo Camillo Merkl; Reinhard Pichler (AMW, 2024)

Consistent Query Answering over SHACL Constraints. - Shqiponja Ahmetaj; Timo Camillo Merkl; Reinhard Pichler (KR, 2024)

Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth. - Georg Gottlob; Matthias Lanzinger; Cem Okulmus; Reinhard Pichler (ACM Trans. Database Syst., 2024)

Towards Tractability of the Diversity of Query Answers: Ultrametrics to the Rescue. - Marcelo Arenas; Timo Camillo Merkl; Reinhard Pichler; Cristian Riveros (Proc. ACM Manag. Data, 2024)

Minimal solutions of fuzzy relation equations via maximal independent elements. - David Lobo; Jesús Medina 001; Timo Camillo Merkl; Reinhard Pichler (Inf. Sci., 2025)

Diversity of Answers to Conjunctive Queries. - Timo Camillo Merkl; Reinhard Pichler; Sebastian Skritek (Log. Methods Comput. Sci., 2025)

Avoiding Materialisation for Guarded Aggregate Queries. - Matthias Lanzinger; Reinhard Pichler; Alexander Selzer (Proc. VLDB Endow., 2025)

Selective Use of Yannakakis' Algorithm to Improve Query Performance: Machine Learning to the Rescue. - Daniela Böhm; Georg Gottlob; Matthias Lanzinger; Davide M. Longo; Cem Okulmus; Reinhard Pichler; Alexander Selzer (CoRR, 2025)

Soft and Constrained Hypertree Width. - Matthias Lanzinger; Cem Okulmus; Reinhard Pichler; Alexander Selzer; Georg Gottlob (Proc. ACM Manag. Data, 2025)