| Publication | Date of Publication | Type |
|---|
| Classes of propositional UMU formulas and their extensions to minimal unsatisfiable formulas | 2024-04-17 | Paper |
| NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability | 2021-01-07 | Paper |
| Restricted cutting plane proofs in Horn constraint systems | 2020-05-13 | Paper |
| Read-once resolutions in Horn formulas | 2019-10-11 | Paper |
| The Complexity of Finding Read-Once NAE-Resolution Refutations | 2019-07-24 | Paper |
| Finding read-once resolution refutations in systems of 2CNF clauses | 2018-05-17 | Paper |
| On the Computational Complexity of Read once Resolution Decidability in 2CNF Formulas | 2017-05-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2786912 | 2016-02-23 | Paper |
| Learning Boolean specifications | 2015-12-22 | Paper |
| Nested Boolean Functions as Models for Quantified Boolean Formulas | 2013-08-05 | Paper |
| Transformations into Normal Forms for Quantified Circuits | 2011-06-17 | Paper |
| Rewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN | 2010-09-29 | Paper |
| An upper bound for the circuit complexity of existentially quantified Boolean formulas | 2010-07-07 | Paper |
| A new 3-CNF transformation by parallel-serial graphs | 2010-06-16 | Paper |
| Learning a representation for optimizable formulas | 2010-04-27 | Paper |
| Theory and Applications of Satisfiability Testing | 2009-07-24 | Paper |
| Theory and Applications of Satisfiability Testing | 2009-07-24 | Paper |
| Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits | 2009-07-07 | Paper |
| Bounded Universal Expansion for Preprocessing QBF | 2009-03-10 | Paper |
| Computational complexity of quantified Boolean formulas with fixed maximal deficiency | 2008-11-18 | Paper |
| Models and quantifier elimination for quantified Horn formulas | 2008-09-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3506043 | 2008-06-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5309031 | 2007-10-09 | Paper |
| Minimal False Quantified Boolean Formulas | 2007-09-04 | Paper |
| Dependency Quantified Horn Formulas: Models and Complexity | 2007-09-04 | Paper |
| Boolean functions as models for quantified Boolean formulas | 2007-08-17 | 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 |
| The complexity of homomorphisms and renamings for minimal unsatisfiable formulas | 2005-05-13 | Paper |
| Extension and equivalence problems for clause minimal formulae | 2005-05-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4431379 | 2003-10-22 | Paper |
| On the structure of some classes of minimal unsatisfiable formulas | 2003-09-15 | Paper |
| Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency. | 2003-01-21 | Paper |
| The complexity of read-once resolution | 2002-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2741513 | 2001-09-24 | Paper |
| On subclasses of minimal unsatisfiable formulas | 2001-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2704408 | 2001-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4488342 | 2000-07-05 | Paper |
| Resolution remains hard under equivalence | 2000-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263797 | 1999-09-22 | Paper |
| An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF | 1999-06-07 | Paper |
| On resolution with short clauses | 1998-05-11 | Paper |
| SAT-Problems and Reductions with Respect to the Number of Variables | 1997-08-28 | Paper |
| Resolution for quantified Boolean formulas | 1995-05-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4315881 | 1994-12-12 | Paper |
| On generalized Horn formulas and \(k\)-resolution | 1994-05-05 | Paper |
| On the restricted equivalence for subclasses of propositional logic | 1993-11-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4013371 | 1992-09-27 | Paper |
| Equivalence of propositional Prolog programs | 1990-01-01 | Paper |
| Existence of simple propositional formulas | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3201760 | 1990-01-01 | Paper |
| Optimizing propositional calculus formulas with regard to questions of deducibility | 1989-01-01 | Paper |
| Projections of vector addition system reachability sets are semilinear | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5748901 | 1989-01-01 | Paper |
| First-Order Formulas in Conjunctive Quantificational Form | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3815282 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3833597 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3773405 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3731011 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3770495 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3216145 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3038623 | 1983-01-01 | Paper |
| A classification of an iterative hierarchy | 1983-01-01 | Paper |
| DURCH SYNTAKTISCHE REKURSION DEFINIERTE KLASSEN | 1983-01-01 | Paper |
| Note on theE1*-E2* Problem | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3919079 | 1981-01-01 | Paper |
| Some undecidable theories with monadic predicates and without equality | 1981-01-01 | Paper |
| Universal asynchronous iterative arrays of Mealy automata | 1980-01-01 | Paper |
| The reachability problem for Petri nets and decision problems for Skolem arithmetic | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3900016 | 1980-01-01 | Paper |
| The R. E. Complexity of Decision Problems for Commutative Semi‐Thue Systems With Recursive Rule Set | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3208643 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3900017 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4137150 | 1977-01-01 | Paper |
