Reinhard Pichler

SIGACT News, 2021

HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2021

Complexity Analysis of Generalized and Fractional Hypertree Decompositions.

[BibT_eX]

[DOI]

J. ACM, 2021

2020

On the Language of Nested Tuple Generating Dependencies.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2020

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

[BibT_eX]

[DOI]

SIGMOD Rec., 2020

Complexity Analysis of General and Fractional Hypertree Decompositions.

[BibT_eX]

[DOI]

CoRR, 2020

Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

The HyperTrac Project: Recent Progress and Future Research Directions on Hypergraph Decompositions.

[BibT_eX]

[DOI]

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2020

2019

A complexity theory for hard enumeration problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Enumeration in Data Management (Dagstuhl Seminar 19211).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2019

Datalog: Bag Semantics via Set Semantics.

[BibT_eX]

[DOI]

Leopoldo E. Bertossi

Proceedings of the 22nd International Conference on Database Theory, 2019

Parallel Computation of Generalized Hypertree Decompositions.

[BibT_eX]

[DOI]

Cem Okulmus

Proceedings of the 13th Alberto Mendelzon International Workshop on Foundations of Data Management, 2019

Semantic Width Revisited (Extended Abstract).

[BibT_eX]

[DOI]

Matthias Lanzinger

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.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2018

Limits of Schema Mappings.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2018

Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment?

[BibT_eX]

[DOI]

Nadia Creignou

Log. Methods Comput. Sci., 2018

Semantic Width of Conjunctive Queries and Constraint Satisfaction Problems.

[BibT_eX]

[DOI]

Matthias Lanzinger

CoRR, 2018

General and Fractional Hypertree Decompositions: Hard and Easy Cases.

[BibT_eX]

[DOI]

Wolfgang Fischl

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.

[BibT_eX]

[DOI]

Theresa Csar

Martin Lackner

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

General and Fractional Hypertree Decompositions: Hard and Easy Cases (extended abstract).

[BibT_eX]

[DOI]

Wolfgang Fischl

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.

[BibT_eX]

[DOI]

Bernhard Bliem

J. Log. Comput., 2017

On the Complexity of Hard Enumeration Problems.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2017

On the Complexity of Enumerating the Extensions of Abstract Argumentation Frameworks.

[BibT_eX]

[DOI]

Markus Kröll

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Computational Social Choice in the Clouds.

[BibT_eX]

[DOI]

Proceedings of the Datenbanksysteme für Business, 2017

Function Symbols in Tuple-Generating Dependencies: Expressive Power and Computability.

[BibT_eX]

[DOI]

Proceedings of the 11th Alberto Mendelzon International Workshop on Foundations of Data Management and the Web, 2017

Winner Determination in Huge Elections with MapReduce.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Fuzzy data exchange.

[BibT_eX]

[DOI]

Jesús Medina

Fuzzy Sets Syst., 2016

Universities and computer science in the European crisis of refugees.

[BibT_eX]

[DOI]

Commun. ACM, 2016

On the Complexity of Enumerating the Answers to Well-designed Pattern Trees.

[BibT_eX]

[DOI]

Markus Kröll

Proceedings of the 19th International Conference on Database Theory, 2016

Complexity of Repair Checking and Consistent Query Answering.

[BibT_eX]

[DOI]

Sebastian Arming

Proceedings of the 19th International Conference on Database Theory, 2016

The Challenge of Optional Matching in SPARQL.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Information and Knowledge Systems, 2016

2015

The complexity of handling minimal solutions in logic-based abduction.

[BibT_eX]

[DOI]

Andreas Pfandler

J. Log. Comput., 2015

On the undecidability of the equivalence of second-order tuple generating dependencies.

[BibT_eX]

[DOI]

Inf. Syst., 2015

Towards Reconciling SPARQL and Certain Answers.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on World Wide Web, 2015

Efficient Evaluation and Approximation of Well-designed Pattern Trees.

[BibT_eX]

[DOI]

Pablo Barceló

Proceedings of the 34th ACM Symposium on Principles of Database Systems, 2015

DL-Lite and Conjunctive Queries Extended by Optional Matching.

[BibT_eX]

[DOI]

Proceedings of the 28th International Workshop on Description Logics, 2015

Using Statistics for Computing Joins with MapReduce.

[BibT_eX]

[DOI]

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).

[BibT_eX]

[DOI]

Pablo Barceló

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).

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2014

Belief revision within fragments of propositional logic.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2014

Containment and equivalence of well-designed SPARQL.

[BibT_eX]

[DOI]

Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2014

Nested dependencies: structure and reasoning.

[BibT_eX]

[DOI]

Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2014

A Fuzzy Extension of Data Exchange.

[BibT_eX]

[DOI]

Jesús Medina

Proceedings of the Information Processing and Management of Uncertainty in Knowledge-Based Systems, 2014

Expressive Identification Constraints to Capture Functional Dependencies in Description Logics.

[BibT_eX]

[DOI]

Proceedings of the Informal Proceedings of the 27th International Workshop on Description Logics, 2014

On the Hardness of Counting the Solutions of SPARQL Queries.

[BibT_eX]

[DOI]

Proceedings of the 8th Alberto Mendelzon Workshop on Foundations of Data Management, 2014

Combined Complexity of Repair Checking and Consistent Query Answering.

[BibT_eX]

[DOI]

Sebastian Arming

Proceedings of the 8th Alberto Mendelzon Workshop on Foundations of Data Management, 2014

A Parameterized Complexity Analysis of Generalized CP-Nets.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

Capturing Relational Schemas and Functional Dependencies in RDFS.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013

Static analysis and optimization of semantic web queries.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2013

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

[BibT_eX]

[DOI]

Semantic Web, 2013

Relaxed Notions of Schema Mapping Equivalence Revisited.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2013

Tractable counting of the answers to conjunctive queries.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2013

Declarative Dynamic Programming as an Alternative Realization of Courcelle's Theorem.

[BibT_eX]

[DOI]

Bernhard Bliem

Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

Parameterized Complexity of Optimal Planning: A Detailed Map.

[BibT_eX]

[DOI]

Martin Kronegger

Andreas Pfandler

Proceedings of the IJCAI 2013, 2013

Loop Elimination for Database Updates.

[BibT_eX]

[DOI]

Proceedings of the Big Data - 29th British National Conference on Databases, 2013

Efficient Updates of Uncertain Databases.

[BibT_eX]

[DOI]

Proceedings of the 7th Alberto Mendelzon International Workshop on Foundations of Data Management, 2013

Enhancing the Updatability of Projective Views.

[BibT_eX]

[DOI]

Paolo Guagliardo

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.

[BibT_eX]

[DOI]

SIGMOD Rec., 2012

SPAM: A SPARQL Analysis and Manipulation Tool.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2012

Towards fixed-parameter tractable algorithms for abstract argumentation.

[BibT_eX]

[DOI]

Wolfgang Dvorák

Artif. Intell., 2012

Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming.

[BibT_eX]

[DOI]

Proceedings of the Learning and Intelligent Optimization - 6th International Conference, 2012

Multicut on Graphs of Bounded Clique-Width.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2012

Union and Intersection of Schema Mappings.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the IEEE 23rd International Conference on Tools with Artificial Intelligence, 2011

Incorporating Data Concerns into Query Languages for Data Services.

[BibT_eX]

[DOI]

Proceedings of the Enterprise Information Systems - 13th International Conference, 2011

Data Concern Aware Querying for the Integration of Data Services.

[BibT_eX]

Proceedings of the ICEIS 2011, 2011

The complexity of evaluating tuple generating dependencies.

[BibT_eX]

[DOI]

Proceedings of the Database Theory, 2011

On Integrating Data Services Using Data Mashups.

[BibT_eX]

[DOI]

Proceedings of the Advances in Databases - 28th British National Conference on Databases, 2011

2010

Monadic datalog over finite structures of bounded treewidth.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2010

Towards practical feasibility of core computation in data exchange.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Counting complexity of propositional abduction.

[BibT_eX]

[DOI]

Miki Hermann

J. Comput. Syst. Sci., 2010

Tractable database design and datalog abduction through bounded treewidth.

[BibT_eX]

[DOI]

Inf. Syst., 2010

Bounded treewidth as a key to tractability of knowledge representation and reasoning.

[BibT_eX]

[DOI]

Artif. Intell., 2010

Redundancy Elimination on RDF Graphs in the Presence of Rules, Constraints, and Queries.

[BibT_eX]

[DOI]

Proceedings of the Web Reasoning and Rule Systems - Fourth International Conference, 2010

Uncertain Databases in Collaborative Data Management.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Stefan Rümmele

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

Towards Fixed-Parameter Tractable Algorithms for Argumentation.

[BibT_eX]

[DOI]

Wolfgang Dvorák

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Conference, 2010

A Dynamic-Programming Based ASP-Solver.

[BibT_eX]

[DOI]

Proceedings of the Logics in Artificial Intelligence - 12th European Conference, 2010

The Complexity of Handling Minimal Solutions in Logic-Based Abduction.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2010, 2010

Exploiting Bounded Treewidth with Datalog (A Survey).

[BibT_eX]

[DOI]

Proceedings of the Datalog Reloaded - First International Workshop, 2010

Multicut Algorithms via Tree Decompositions.

[BibT_eX]

[DOI]

Stefan Rümmele

Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

Minimising RDF Graphs under Rules and Constraints Revisited.

[BibT_eX]

[DOI]

Proceedings of the 4th Alberto Mendelzon International Workshop on Foundations of Data Management, 2010

2009

Complexity of counting the optimal solutions.

[BibT_eX]

[DOI]

Miki Hermann

Theor. Comput. Sci., 2009

DEMo: Data Exchange Modeling Tool.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2009

Normalization and Optimization of Schema Mappings.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2009

Alternation as a programming paradigm.

[BibT_eX]

[DOI]

Proceedings of the 11th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2009

Belief Revision with Bounded Treewidth.

[BibT_eX]

[DOI]

Stefan Rümmele

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2009

Answer-Set Programming with Bounded Treewidth.

[BibT_eX]

[DOI]

Michael Jakl

Proceedings of the IJCAI 2009, 2009

On Using Distributed Extended XQuery for Web Data Sources as Services.

[BibT_eX]

[DOI]

Proceedings of the Web Engineering, 9th International Conference, 2009

DeXIN: An Extensible Framework for Distributed XQuery over Heterogeneous Data Sources .

[BibT_eX]

[DOI]

Proceedings of the Enterprise Information Systems, 11th International Conference, 2009

2008

Fast Counting with Bounded Treewidth.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, 2008

Counting Complexity of Minimal Cardinality and Minimal Weight Abduction.

[BibT_eX]

[DOI]

Miki Hermann

Proceedings of the Logics in Artificial Intelligence, 11th European Conference, 2008

dRDF: Entailment for Domain-Restricted RDF.

[BibT_eX]

[DOI]

Proceedings of the Semantic Web: Research and Applications, 2008

Abduction with Bounded Treewidth: From Theoretical Tractability to Practically Efficient Computation.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007

Model Representation over Finite and Infinite Signatures.

[BibT_eX]

[DOI]

Christian G. Fermüller

J. Log. Comput., 2007

Foundations of Rule-Based Query Answering.

[BibT_eX]

[DOI]

Proceedings of the Reasoning Web, 2007

Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2007

Efficient Datalog Abduction through Bounded Treewidth.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006

Algorithmic Aspects of Model Representations.

[BibT_eX]

[DOI]

Proceedings of the 20th Workshop on Logic Programming, 2006

Tractable database design through bounded treewidth.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2006

2005

Efficient algorithms for processing XPath queries.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2005

The complexity of XPath query evaluation and XML typing.

[BibT_eX]

[DOI]

J. ACM, 2005

On deciding subsumption problems.

[BibT_eX]

[DOI]

Uwe Egly

Ann. Math. Artif. Intell., 2005

Model Representation via Contexts and Implicit Generalizations.

[BibT_eX]

[DOI]

Christian G. Fermüller

Proceedings of the Automated Deduction, 2005

2004

Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width.

[BibT_eX]

[DOI]

SIAM J. Comput., 2004

2003

Explicit versus implicit representations of subsets of the Herbrand universe.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

XPath Processing in a Nutshell.

[BibT_eX]

[DOI]

SIGMOD Rec., 2003

On the complexity of equational problems in CNF.

[BibT_eX]

[DOI]

J. Symb. Comput., 2003

The complexity of XPath query evaluation.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2003

XPath Query Evaluation: Improving Time and Space Efficiency.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Data Engineering, 2003

2002

Algorithmic Aspects of Herbrand Models Represented by Ground Atoms with Ground Equations.

[BibT_eX]

[DOI]

Bernhard Gramlich

Proceedings of the Automated Deduction, 2002

2001

Working with ARMs: Complexity Results on Atomic Representations of Herbrand Models.

[BibT_eX]

[DOI]

Inf. Comput., 2001

2000

Speeding up Algorithms on Atomic Representations of Herbrand Models via New Redundancy Criteria.

[BibT_eX]

[DOI]

J. Symb. Comput., 2000

The Explicit Representability of Implicit Generalizations.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 11th International Conference, 2000

Negation Elimination from Simple Equational Formulae.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

1999

Solving Equational Problems Efficiently.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction, 1999

1998

Algorithms on Atomic Representations of Herbrand Models.

[BibT_eX]

[DOI]

Proceedings of the Logics in Artificial Intelligence, European Workshop, 1998

Completeness and Redundancy in Constrained Clause Logic.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction in Classical and Non-Classical Logics, 1998

Extending Decidable Clause Classes via Constraints.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction in Classical and Non-Classical Logics, 1998

On the Complexity of H-Subsumption.

[BibT_eX]

[DOI]