| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6159912 | 2023-06-23 | Paper |
| Meta-rule synthesis from crossed rewrite systems | 2023-03-09 | Paper |
| On proving properties of completion strategies | 2022-12-09 | Paper |
| Chain properties of rule closures | 2022-08-16 | Paper |
| MCP: capturing big data by satisfiability (tool description) | 2022-03-22 | Paper |
| The complexity of counting problems in equational matching | 2020-01-21 | Paper |
| Minimal distance of propositional models | 2019-09-05 | Paper |
| Unification algorithms cannot be combined in polynomial time | 2019-01-15 | Paper |
| On the complexity of generalized chromatic polynomials | 2018-01-11 | Paper |
| The Next Whisky Bar | 2016-07-25 | Paper |
| As Close as It Gets | 2016-05-03 | Paper |
| Give Me Another One! | 2016-01-11 | Paper |
| Complexity of existential positive first-order logic | 2013-08-27 | Paper |
| Counting Partitions of Graphs | 2013-03-21 | Paper |
| Trichotomies in the complexity of minimal inference | 2012-12-06 | Paper |
| Counting complexity of propositional abduction | 2010-08-18 | Paper |
| Complexity of existential positive first-order logic | 2010-07-28 | Paper |
| Computational complexity of simultaneous elementary matching problems | 2010-06-17 | Paper |
| The Helly property and satisfiability of Boolean formulas defined on set families | 2010-04-27 | Paper |
| On the counting complexity of propositional circumscription | 2010-04-19 | Paper |
| Complexity of counting the optimal solutions | 2009-09-10 | Paper |
| Efficient Algorithms for Description Problems over Finite Totally Ordered Domains | 2009-06-22 | Paper |
| On the Computational Complexity of Monotone Constraint Satisfaction Problems | 2009-02-24 | Paper |
| Counting Complexity of Minimal Cardinality and Minimal Weight Abduction | 2008-10-27 | Paper |
| On Boolean primitive positive clones | 2008-07-11 | Paper |
| Complexity of Counting the Optimal Solutions | 2008-07-10 | Paper |
| Complexity of clausal constraints over chains | 2008-04-03 | Paper |
| On the Complexity of Computing Generators of Closed Sets | 2008-03-04 | Paper |
| Complexity of Default Logic on Generalized Conjunctive Queries | 2007-11-13 | Paper |
| Automated Reasoning | 2007-09-25 | Paper |
| Theory and Applications of Satisfiability Testing | 2005-12-16 | Paper |
| Subtractive reductions and complete problems for counting complexity classes | 2005-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418672 | 2003-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941892 | 2003-05-19 | Paper |
| Unification algorithms cannot be combined in polynomial time. | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536368 | 2002-11-04 | Paper |
| On the complexity of recognizing the Hilbert basis of a linear Diophantine system | 2002-03-03 | Paper |
| Computational complexity of simultaneous elementary matching problems | 2000-05-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4246728 | 1999-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938414 | 1999-01-01 | Paper |
| Unification of infinite sets of terms schematized by primal grammars | 1998-07-23 | Paper |
| Complexity of generalized satisfiability counting problems | 1997-01-02 | Paper |
| The complexity of counting problems in equational matching | 1996-08-13 | Paper |
| Chain properties of rule closures | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3725541 | 1986-01-01 | Paper |
