| Publication | Date of Publication | Type |
|---|
Convergence of datalog over (pre-) semirings
Journal of the ACM | 2025-02-06 | Paper |
Diversity of answers to conjunctive queries
Logical Methods in Computer Science | 2025-01-31 | Paper |
Minimal solutions of fuzzy relation equations via maximal independent elements
Information Sciences | 2024-11-28 | Paper |
| Diversity of answers to conjunctive queries | 2024-10-08 | Paper |
Fast parallel hypertree decompositions in logarithmic recursion depth
ACM Transactions on Database Systems | 2024-04-30 | Paper |
Fractional covers of hypergraphs with bounded multi-intersection
Theoretical Computer Science | 2023-10-26 | Paper |
The HyperTrac project: recent progress and future research directions on hypergraph decompositions
(available as arXiv preprint) | 2022-12-21 | Paper |
Complexity Analysis of Generalized and Fractional Hypertree Decompositions
Journal of the ACM | 2022-12-08 | Paper |
Fast and parallel decomposition of constraint satisfaction problems
Constraints | 2022-09-29 | Paper |
HyperBench. A benchmark and tool for hypergraphs and empirical findings
ACM Journal of Experimental Algorithmics | 2022-09-06 | Paper |
Datalog: Bag Semantics via Set Semantics
(available as arXiv preprint) | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7559412 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
A complexity theory for hard enumeration problems
Discrete Applied Mathematics | 2019-09-19 | Paper |
A fuzzy extension of data exchange
Information Processing and Management of Uncertainty in Knowledge-Based Systems | 2019-08-20 | Paper |
scientific article; zbMATH DE number 6970794 (Why is no real title available?)
(available as arXiv preprint) | 2018-11-02 | Paper |
Limits of schema mappings
Theory of Computing Systems | 2018-07-16 | Paper |
Implementing Courcelle's theorem in a declarative framework for dynamic programming
Journal Of Logic And Computation | 2018-02-13 | Paper |
Fuzzy data exchange
Fuzzy Sets and Systems | 2018-01-22 | Paper |
| Complexity of repair checking and consistent query answering | 2017-07-14 | Paper |
| On the complexity of enumerating the answers to well-designed pattern trees | 2017-07-14 | Paper |
| Limits of schema mappings | 2017-07-14 | Paper |
On the complexity of hard enumeration problems
Lecture Notes in Computer Science | 2017-06-01 | Paper |
The challenge of optional matching in SPARQL
Lecture Notes in Computer Science | 2016-05-19 | Paper |
Monadic Datalog over finite structures of bounded treewidth
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
The complexity of handling minimal solutions in logic-based abduction
Journal Of Logic And Computation | 2015-07-15 | Paper |
Tractable answer-set programming with weight constraints: bounded treewidth is not enough
Theory and Practice of Logic Programming | 2014-04-17 | Paper |
Tractable counting of the answers to conjunctive queries
Journal of Computer and System Sciences | 2014-01-20 | Paper |
Belief revision within fragments of propositional logic
Journal of Computer and System Sciences | 2013-12-13 | Paper |
Declarative dynamic programming as an alternative realization of Courcelle's theorem
Parameterized and Exact Computation | 2013-12-10 | Paper |
Relaxed notions of schema mapping equivalence revisited
Theory of Computing Systems | 2013-08-23 | Paper |
Towards fixed-parameter tractable algorithms for abstract argumentation
Artificial Intelligence | 2012-11-15 | Paper |
Multicut on graphs of bounded clique-width
Combinatorial Optimization and Applications | 2012-11-02 | Paper |
| The complexity of handling minimal solutions in logic-based abduction | 2011-05-11 | Paper |
Counting and Enumeration Problems with Bounded Treewidth
Logic for Programming, Artificial Intelligence, and Reasoning | 2011-01-07 | Paper |
A dynamic-programming based ASP-solver
Logics in Artificial Intelligence | 2010-10-01 | Paper |
Counting complexity of propositional abduction
Journal of Computer and System Sciences | 2010-08-18 | Paper |
Multicut algorithms via tree decompositions
Lecture Notes in Computer Science | 2010-05-28 | Paper |
Bounded treewidth as a key to tractability of knowledge representation and reasoning
Artificial Intelligence | 2010-03-16 | Paper |
Towards practical feasibility of core computation in data exchange
Theoretical Computer Science | 2010-03-09 | Paper |
Belief Revision with Bounded Treewidth
Logic Programming and Nonmonotonic Reasoning | 2009-11-10 | Paper |
Complexity of counting the optimal solutions
Theoretical Computer Science | 2009-09-10 | Paper |
Foundations of Rule-Based Query Answering
Reasoning Web | 2009-02-17 | Paper |
Fast Counting with Bounded Treewidth
Logic for Programming, Artificial Intelligence, and Reasoning | 2009-01-27 | Paper |
Towards Practical Feasibility of Core Computation in Data Exchange
Logic for Programming, Artificial Intelligence, and Reasoning | 2009-01-27 | Paper |
The complexity of XPath query evaluation and XML typing
Journal of the ACM | 2008-12-21 | Paper |
Model Representation over Finite and Infinite Signatures
Logics in Artificial Intelligence | 2008-10-30 | Paper |
Counting Complexity of Minimal Cardinality and Minimal Weight Abduction
Logics in Artificial Intelligence | 2008-10-27 | Paper |
Complexity of Counting the Optimal Solutions
Lecture Notes in Computer Science | 2008-07-10 | Paper |
Model Representation over Finite and Infinite Signatures
Journal Of Logic And Computation | 2007-12-12 | Paper |
Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains
Logic Programming and Nonmonotonic Reasoning | 2007-11-13 | Paper |
Automated Deduction – CADE-20
Lecture Notes in Computer Science | 2006-11-01 | Paper |
On deciding subsumption problems
Annals of Mathematics and Artificial Intelligence | 2005-05-13 | Paper |
Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width
SIAM Journal on Computing | 2005-02-21 | Paper |
| scientific article; zbMATH DE number 2090303 (Why is no real title available?) | 2004-08-12 | Paper |
On the complexity of equational problems in CNF
Journal of Symbolic Computation | 2003-08-25 | Paper |
Explicit versus implicit representations of subsets of the Herbrand universe.
Theoretical Computer Science | 2003-01-21 | Paper |
Working with ARMs: Complexity results on atomic representations of Herbrand models
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1756016 (Why is no real title available?) | 2002-06-16 | Paper |
| scientific article; zbMATH DE number 1670857 (Why is no real title available?) | 2001-12-06 | Paper |
| scientific article; zbMATH DE number 1615238 (Why is no real title available?) | 2001-07-08 | Paper |
Speeding up algorithms on atomic representations of Herbrand models via new redundancy criteria
Journal of Symbolic Computation | 2001-03-19 | Paper |
| scientific article; zbMATH DE number 1507193 (Why is no real title available?) | 2001-02-27 | Paper |
| scientific article; zbMATH DE number 1507192 (Why is no real title available?) | 2000-09-14 | Paper |
| scientific article; zbMATH DE number 1341610 (Why is no real title available?) | 2000-02-17 | Paper |
| scientific article; zbMATH DE number 1301755 (Why is no real title available?) | 2000-01-25 | Paper |
| scientific article; zbMATH DE number 1342223 (Why is no real title available?) | 1999-09-22 | Paper |
