| Publication | Date of Publication | Type |
|---|
| Computationally hard problems for logic programs under answer set semantics | 2024-11-12 | Paper |
| Capturing the polynomial hierarchy by second-order revised Krom logic | 2023-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5150982 | 2021-02-16 | Paper |
| A Logic that Captures $\beta$P on Ordered Structures | 2019-12-08 | Paper |
| Reasoning about actions with loops via Hoare logic | 2019-01-22 | Paper |
| Unsatisfiable hitting clause-sets with three more clauses than variables | 2016-04-05 | Paper |
| Proof systems for planning under 0-approximation semantics | 2015-11-20 | Paper |
| Parameters for minimal unsatisfiability: Smarandache primitive numbers and full clauses | 2015-05-09 | Paper |
| Bounds for variables with few occurrences in conjunctive normal forms | 2014-08-04 | Paper |
| On Davis-Putnam reductions for minimally unsatisfiable clause-sets | 2014-01-10 | Paper |
| On Davis-Putnam reductions for minimally unsatisfiable clause-sets | 2013-08-12 | Paper |
| Jordan Areas and Grids | 2013-05-03 | Paper |
| Complexity of Operators on Compact Sets | 2013-05-03 | Paper |
| Complexity and expressive power of second‐order extended Horn logic | 2013-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3169503 | 2011-09-29 | Paper |
| On Variables with Few Occurrences in Conjunctive Normal Forms | 2011-06-17 | Paper |
| Transformations into Normal Forms for Quantified Circuits | 2011-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3006475 | 2011-06-14 | Paper |
| Theory and Applications of Satisfiability Testing | 2009-07-24 | Paper |
| Theory and Applications of Satisfiability Testing | 2009-07-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5318862 | 2009-07-22 | Paper |
| Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits | 2009-07-07 | Paper |
| Linear CNF formulas and satisfiability | 2009-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3609151 | 2009-03-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3609624 | 2009-03-06 | Paper |
| Computational complexity of quantified Boolean formulas with fixed maximal deficiency | 2008-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3506043 | 2008-06-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5435790 | 2008-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5309031 | 2007-10-09 | Paper |
| Minimal False Quantified Boolean Formulas | 2007-09-04 | Paper |
| Boolean functions as models for quantified Boolean formulas | 2007-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3434502 | 2007-05-02 | Paper |
| Logic versus Approximation | 2005-12-23 | Paper |
| Theory and Applications of Satisfiability Testing | 2005-12-16 | Paper |
| Theory and Applications of Satisfiability Testing | 2005-12-15 | Paper |
| Theory and Applications of Satisfiability Testing | 2005-12-15 | Paper |
| Extension and equivalence problems for clause minimal formulae | 2005-05-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4813892 | 2004-09-07 | Paper |
| On the structure of some classes of minimal unsatisfiable formulas | 2003-09-15 | Paper |
| Fixed-parameter tractability of disjunction-free default reasoning | 2003-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796540 | 2003-06-02 | Paper |
| Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4446263 | 2003-01-01 | Paper |
| The complexity of read-once resolution | 2002-08-20 | Paper |
| Consistency argument and classification problem in \(\lambda\)-calculus | 2002-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4329006 | 2002-04-29 | Paper |
| \(Y_C \Omega_{2n}\) are easy terms | 2002-02-18 | Paper |
| Satisfiable formulas closed under replacement | 2001-09-24 | Paper |
| Complexity results for 2CNF default theories | 2001-07-23 | Paper |
| Complexity results for restricted credulous default reasoning | 2001-03-19 | Paper |
| More on bounding introspection in modal nonmonotonic logics | 2001-03-12 | Paper |
| Two tractable subclasses of minimal unsatisfiable formulas | 2000-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4245013 | 1999-06-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3129098 | 1997-09-02 | Paper |
| Axiom of choice in the model \(C\) | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3982417 | 1992-06-26 | Paper |
| A consistency result of the system Z \(+\) the replacement axiom schema of \(\Sigma_ n\)-formulas | 1990-01-01 | Paper |
| The consistencies ofMA, SOCA, OCA andISA withKT(ω2) | 1990-01-01 | Paper |
