Reinhard Pichler

Orcid: 0000-0002-1760-122X

Affiliations:
  • TU Wien, Vienna, Autria


According to our database1, Reinhard Pichler authored at least 140 papers between 1998 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Minimal solutions of fuzzy relation equations via maximal independent elements.
Inf. Sci., 2025

2024
Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth.
ACM Trans. Database Syst., March, 2024

Towards Tractability of the Diversity of Query Answers: Ultrametrics to the Rescue.
CoRR, 2024

Avoiding Materialisation for Guarded Aggregate Queries.
CoRR, 2024

Consistent Query Answering over SHACL Constraints.
CoRR, 2024

2023
Fractional covers of hypergraphs with bounded multi-intersection.
Theor. Comput. Sci., November, 2023

Convergence of Datalog over (Pre-) Semirings.
SIGMOD Rec., 2023

SparqLog: A System for Efficient Evaluation of SPARQL 1.1 Queries via Datalog.
Proc. VLDB Endow., 2023

SparqLog: A System for Efficient Evaluation of SPARQL 1.1 Queries via Datalog [Experiment, Analysis and Benchmark].
CoRR, 2023

Structure-Guided Query Evaluation: Towards Bridging the Gap from Theory to Practice.
CoRR, 2023

Diversity of Answers to Conjunctive Queries.
Proceedings of the 26th International Conference on Database Theory, 2023

Integration of Skyline Queries into Spark SQL.
Proceedings of the Proceedings 26th International Conference on Extending Database Technology, 2023

Diversity of Answers to Conjunctive Queries (short paper).
Proceedings of the 15th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW 2023), 2023

Reaching Back to Move Forward: Using Old Ideas to Achieve a New Level of Query Optimization (short paper).
Proceedings of the 15th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW 2023), 2023

2022
Datalog in Wonderland.
SIGMOD Rec., 2022

Optimizing Recursive Queries with Program Synthesis.
CoRR, 2022

Fast and parallel decomposition of constraint satisfaction problems.
Constraints An Int. J., 2022

Optimizing Recursive Queries with Progam Synthesis.
Proceedings of the SIGMOD '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

Novel Techniques in Datalog Optimization (Abstract).
Proceedings of the 4th International Workshop on the Resurgence of Datalog in Academia and Industry (Datalog-2.0 2022) co-located with the 16th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2022), 2022

2021
Database Theory Column Report on PODS 2021.
SIGACT News, 2021

HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings.
ACM J. Exp. Algorithmics, 2021

Complexity Analysis of Generalized and Fractional Hypertree Decompositions.
J. ACM, 2021

2020
On the Language of Nested Tuple Generating Dependencies.
ACM Trans. Database Syst., 2020

Technical Perspective: Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation.
SIGMOD Rec., 2020

Complexity Analysis of General and Fractional Hypertree Decompositions.
CoRR, 2020

Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

The HyperTrac Project: Recent Progress and Future Research Directions on Hypergraph Decompositions.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2020

2019
A complexity theory for hard enumeration problems.
Discret. Appl. Math., 2019

Enumeration in Data Management (Dagstuhl Seminar 19211).
Dagstuhl Reports, 2019

Datalog: Bag Semantics via Set Semantics.
Proceedings of the 22nd International Conference on Database Theory, 2019

Parallel Computation of Generalized Hypertree Decompositions.
Proceedings of the 13th Alberto Mendelzon International Workshop on Foundations of Data Management, 2019

Semantic Width Revisited (Extended Abstract).
Proceedings of the 13th Alberto Mendelzon International Workshop on Foundations of Data Management, 2019

2018
Efficient Evaluation and Static Analysis for Well-Designed Pattern Trees with Projection.
ACM Trans. Database Syst., 2018

Limits of Schema Mappings.
Theory Comput. Syst., 2018

Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment?
Log. Methods Comput. Sci., 2018

Semantic Width of Conjunctive Queries and Constraint Satisfaction Problems.
CoRR, 2018

General and Fractional Hypertree Decompositions: Hard and Easy Cases.
Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2018

Computing the Schulze Method for Large-Scale Preference Data Sets.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

General and Fractional Hypertree Decompositions: Hard and Easy Cases (extended abstract).
Proceedings of the 12th Alberto Mendelzon International Workshop on Foundations of Data Management, 2018

2017
Implementing Courcelle's Theorem in a declarative framework for dynamic programming.
J. Log. Comput., 2017

On the Complexity of Hard Enumeration Problems.
Proceedings of the Language and Automata Theory and Applications, 2017

On the Complexity of Enumerating the Extensions of Abstract Argumentation Frameworks.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Computational Social Choice in the Clouds.
Proceedings of the Datenbanksysteme für Business, 2017

Function Symbols in Tuple-Generating Dependencies: Expressive Power and Computability.
Proceedings of the 11th Alberto Mendelzon International Workshop on Foundations of Data Management and the Web, 2017

Winner Determination in Huge Elections with MapReduce.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Fuzzy data exchange.
Fuzzy Sets Syst., 2016

Universities and computer science in the European crisis of refugees.
Commun. ACM, 2016

On the Complexity of Enumerating the Answers to Well-designed Pattern Trees.
Proceedings of the 19th International Conference on Database Theory, 2016

Complexity of Repair Checking and Consistent Query Answering.
Proceedings of the 19th International Conference on Database Theory, 2016

The Challenge of Optional Matching in SPARQL.
Proceedings of the Foundations of Information and Knowledge Systems, 2016

2015
The complexity of handling minimal solutions in logic-based abduction.
J. Log. Comput., 2015

On the undecidability of the equivalence of second-order tuple generating dependencies.
Inf. Syst., 2015

Towards Reconciling SPARQL and Certain Answers.
Proceedings of the 24th International Conference on World Wide Web, 2015

Efficient Evaluation and Approximation of Well-designed Pattern Trees.
Proceedings of the 34th ACM Symposium on Principles of Database Systems, 2015

DL-Lite and Conjunctive Queries Extended by Optional Matching.
Proceedings of the 28th International Workshop on Description Logics, 2015

Using Statistics for Computing Joins with MapReduce.
Proceedings of the 9th Alberto Mendelzon International Workshop on Foundations of Data Management, Lima, Peru, May 6, 2015

Efficient Evaluation of Well-designed Pattern Trees (Extended Abstract).
Proceedings of the 9th Alberto Mendelzon International Workshop on Foundations of Data Management, Lima, Peru, May 6, 2015

Towards Reconciling SPARQL and Certain Answers (Extended Abstract).
Proceedings of the 9th Alberto Mendelzon International Workshop on Foundations of Data Management, Lima, Peru, May 6, 2015

2014
Tractable answer-set programming with weight constraints: bounded treewidth is not enough.
Theory Pract. Log. Program., 2014

Belief revision within fragments of propositional logic.
J. Comput. Syst. Sci., 2014

Containment and equivalence of well-designed SPARQL.
Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2014

Nested dependencies: structure and reasoning.
Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2014

A Fuzzy Extension of Data Exchange.
Proceedings of the Information Processing and Management of Uncertainty in Knowledge-Based Systems, 2014

Expressive Identification Constraints to Capture Functional Dependencies in Description Logics.
Proceedings of the Informal Proceedings of the 27th International Workshop on Description Logics, 2014

On the Hardness of Counting the Solutions of SPARQL Queries.
Proceedings of the 8th Alberto Mendelzon Workshop on Foundations of Data Management, 2014

Combined Complexity of Repair Checking and Consistent Query Answering.
Proceedings of the 8th Alberto Mendelzon Workshop on Foundations of Data Management, 2014

A Parameterized Complexity Analysis of Generalized CP-Nets.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

Capturing Relational Schemas and Functional Dependencies in RDFS.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013
Static analysis and optimization of semantic web queries.
ACM Trans. Database Syst., 2013

Complexity of redundancy detection on RDF graphs in the presence of rules, constraints, and queries.
Semantic Web, 2013

Relaxed Notions of Schema Mapping Equivalence Revisited.
Theory Comput. Syst., 2013

Tractable counting of the answers to conjunctive queries.
J. Comput. Syst. Sci., 2013

Declarative Dynamic Programming as an Alternative Realization of Courcelle's Theorem.
Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

Parameterized Complexity of Optimal Planning: A Detailed Map.
Proceedings of the IJCAI 2013, 2013

Loop Elimination for Database Updates.
Proceedings of the Big Data - 29th British National Conference on Databases, 2013

Efficient Updates of Uncertain Databases.
Proceedings of the 7th Alberto Mendelzon International Workshop on Foundations of Data Management, 2013

Enhancing the Updatability of Projective Views.
Proceedings of the 7th Alberto Mendelzon International Workshop on Foundations of Data Management, 2013

2012
Quality-aware service-oriented data integration: requirements, state of the art and open challenges.
SIGMOD Rec., 2012

SPAM: A SPARQL Analysis and Manipulation Tool.
Proc. VLDB Endow., 2012

Towards fixed-parameter tractable algorithms for abstract argumentation.
Artif. Intell., 2012

Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming.
Proceedings of the Learning and Intelligent Optimization - 6th International Conference, 2012

Multicut on Graphs of Bounded Clique-Width.
Proceedings of the Combinatorial Optimization and Applications, 2012

Union and Intersection of Schema Mappings.
Proceedings of the 6th Alberto Mendelzon International Workshop on Foundations of Data Management, 2012

2011
A New Tree-Decomposition Based Algorithm for Answer Set Programming.
Proceedings of the IEEE 23rd International Conference on Tools with Artificial Intelligence, 2011

Incorporating Data Concerns into Query Languages for Data Services.
Proceedings of the Enterprise Information Systems - 13th International Conference, 2011

Data Concern Aware Querying for the Integration of Data Services.
Proceedings of the ICEIS 2011, 2011

The complexity of evaluating tuple generating dependencies.
Proceedings of the Database Theory, 2011

On Integrating Data Services Using Data Mashups.
Proceedings of the Advances in Databases - 28th British National Conference on Databases, 2011

2010
Monadic datalog over finite structures of bounded treewidth.
ACM Trans. Comput. Log., 2010

Towards practical feasibility of core computation in data exchange.
Theor. Comput. Sci., 2010

Counting complexity of propositional abduction.
J. Comput. Syst. Sci., 2010

Tractable database design and datalog abduction through bounded treewidth.
Inf. Syst., 2010

Bounded treewidth as a key to tractability of knowledge representation and reasoning.
Artif. Intell., 2010

Redundancy Elimination on RDF Graphs in the Presence of Rules, Constraints, and Queries.
Proceedings of the Web Reasoning and Rule Systems - Fourth International Conference, 2010

Uncertain Databases in Collaborative Data Management.
Proceedings of the Fourth International VLDB workshop on Management of Uncertain Data (MUD 2010) in conjunction with VLDB 2010, 2010

Counting and Enumeration Problems with Bounded Treewidth.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

Towards Fixed-Parameter Tractable Algorithms for Argumentation.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Conference, 2010

A Dynamic-Programming Based ASP-Solver.
Proceedings of the Logics in Artificial Intelligence - 12th European Conference, 2010

The Complexity of Handling Minimal Solutions in Logic-Based Abduction.
Proceedings of the ECAI 2010, 2010

Exploiting Bounded Treewidth with Datalog (A Survey).
Proceedings of the Datalog Reloaded - First International Workshop, 2010

Multicut Algorithms via Tree Decompositions.
Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

Minimising RDF Graphs under Rules and Constraints Revisited.
Proceedings of the 4th Alberto Mendelzon International Workshop on Foundations of Data Management, 2010

2009
Complexity of counting the optimal solutions.
Theor. Comput. Sci., 2009

DEMo: Data Exchange Modeling Tool.
Proc. VLDB Endow., 2009

Normalization and Optimization of Schema Mappings.
Proc. VLDB Endow., 2009

Alternation as a programming paradigm.
Proceedings of the 11th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2009

Belief Revision with Bounded Treewidth.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2009

Answer-Set Programming with Bounded Treewidth.
Proceedings of the IJCAI 2009, 2009

On Using Distributed Extended XQuery for Web Data Sources as Services.
Proceedings of the Web Engineering, 9th International Conference, 2009

DeXIN: An Extensible Framework for Distributed XQuery over Heterogeneous Data Sources .
Proceedings of the Enterprise Information Systems, 11th International Conference, 2009

2008
Fast Counting with Bounded Treewidth.
Proceedings of the Logic for Programming, 2008

Counting Complexity of Minimal Cardinality and Minimal Weight Abduction.
Proceedings of the Logics in Artificial Intelligence, 11th European Conference, 2008

dRDF: Entailment for Domain-Restricted RDF.
Proceedings of the Semantic Web: Research and Applications, 2008

Abduction with Bounded Treewidth: From Theoretical Tractability to Practically Efficient Computation.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007
Model Representation over Finite and Infinite Signatures.
J. Log. Comput., 2007

Foundations of Rule-Based Query Answering.
Proceedings of the Reasoning Web, 2007

Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2007

Efficient Datalog Abduction through Bounded Treewidth.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
Algorithmic Aspects of Model Representations.
Proceedings of the 20th Workshop on Logic Programming, 2006

Tractable database design through bounded treewidth.
Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2006

2005
Efficient algorithms for processing XPath queries.
ACM Trans. Database Syst., 2005

The complexity of XPath query evaluation and XML typing.
J. ACM, 2005

On deciding subsumption problems.
Ann. Math. Artif. Intell., 2005

Model Representation via Contexts and Implicit Generalizations.
Proceedings of the Automated Deduction, 2005

2004
Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width.
SIAM J. Comput., 2004

2003
Explicit versus implicit representations of subsets of the Herbrand universe.
Theor. Comput. Sci., 2003

XPath Processing in a Nutshell.
SIGMOD Rec., 2003

On the complexity of equational problems in CNF.
J. Symb. Comput., 2003

The complexity of XPath query evaluation.
Proceedings of the Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2003

XPath Query Evaluation: Improving Time and Space Efficiency.
Proceedings of the 19th International Conference on Data Engineering, 2003

2002
Algorithmic Aspects of Herbrand Models Represented by Ground Atoms with Ground Equations.
Proceedings of the Automated Deduction, 2002

2001
Working with ARMs: Complexity Results on Atomic Representations of Herbrand Models.
Inf. Comput., 2001

2000
Speeding up Algorithms on Atomic Representations of Herbrand Models via New Redundancy Criteria.
J. Symb. Comput., 2000

The Explicit Representability of Implicit Generalizations.
Proceedings of the Rewriting Techniques and Applications, 11th International Conference, 2000

Negation Elimination from Simple Equational Formulae.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

1999
Solving Equational Problems Efficiently.
Proceedings of the Automated Deduction, 1999

1998
Algorithms on Atomic Representations of Herbrand Models.
Proceedings of the Logics in Artificial Intelligence, European Workshop, 1998

Completeness and Redundancy in Constrained Clause Logic.
Proceedings of the Automated Deduction in Classical and Non-Classical Logics, 1998

Extending Decidable Clause Classes via Constraints.
Proceedings of the Automated Deduction in Classical and Non-Classical Logics, 1998

On the Complexity of H-Subsumption.
Proceedings of the Computer Science Logic, 12th International Workshop, 1998


  Loading...