| Publication | Date of Publication | Type |
|---|
Classes of propositional UMU formulas and their extensions to minimal unsatisfiable formulas
Theoretical Computer Science | 2024-04-17 | Paper |
NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability
Mathematical Structures in Computer Science | 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
Logic and Its Applications | 2019-07-24 | Paper |
Finding read-once resolution refutations in systems of 2CNF clauses
Theoretical Computer Science | 2018-05-17 | Paper |
On the computational complexity of read once resolution decidability in 2CNF formulas
Lecture Notes in Computer Science | 2017-05-19 | Paper |
Encoding nested Boolean functions as quantified Boolean formulas
Journal of Satisfiability, Boolean Modeling and Computation | 2016-02-23 | Paper |
Learning Boolean specifications
Artificial Intelligence | 2015-12-22 | Paper |
Nested Boolean functions as models for quantified Boolean formulas
Theory and Applications of Satisfiability Testing – SAT 2013 | 2013-08-05 | Paper |
Transformations into normal forms for quantified circuits
Theory and Applications of Satisfiability Testing - SAT 2011 | 2011-06-17 | Paper |
Rewriting (dependency-)quantified 2-CNF with arbitrary free literals into existential 2-HORN
Theory and Applications of Satisfiability Testing – SAT 2010 | 2010-09-29 | Paper |
An upper bound for the circuit complexity of existentially quantified Boolean formulas
Theoretical Computer Science | 2010-07-07 | Paper |
A new 3-CNF transformation by parallel-serial graphs
Information Processing Letters | 2010-06-16 | Paper |
Learning a representation for optimizable formulas
Lecture Notes in Computer Science | 2010-04-27 | Paper |
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science | 2009-07-24 | Paper |
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science | 2009-07-24 | Paper |
Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits
Lecture Notes in Computer Science | 2009-07-07 | Paper |
Bounded Universal Expansion for Preprocessing QBF
Theory and Applications of Satisfiability Testing – SAT 2007 | 2009-03-10 | Paper |
Computational complexity of quantified Boolean formulas with fixed maximal deficiency
Theoretical Computer Science | 2008-11-18 | Paper |
Models and quantifier elimination for quantified Horn formulas
Discrete Applied Mathematics | 2008-09-10 | Paper |
| An extension of deficiency and minimal unsatisfiability of quantified Boolean formulas | 2008-06-11 | Paper |
| The complexity of some subclasses of minimal unsatisfiable formulas. | 2007-10-09 | Paper |
Dependency Quantified Horn Formulas: Models and Complexity
Lecture Notes in Computer Science | 2007-09-04 | Paper |
Minimal False Quantified Boolean Formulas
Lecture Notes in Computer Science | 2007-09-04 | Paper |
Boolean functions as models for quantified Boolean formulas
Journal of Automated Reasoning | 2007-08-17 | Paper |
Logic versus Approximation
Lecture Notes in Computer Science | 2005-12-23 | Paper |
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science | 2005-12-16 | Paper |
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science | 2005-12-15 | Paper |
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science | 2005-12-15 | Paper |
The complexity of homomorphisms and renamings for minimal unsatisfiable formulas
Annals of Mathematics and Artificial Intelligence | 2005-05-13 | Paper |
Extension and equivalence problems for clause minimal formulae
Annals of Mathematics and Artificial Intelligence | 2005-05-13 | Paper |
| scientific article; zbMATH DE number 1995157 (Why is no real title available?) | 2003-10-22 | Paper |
On the structure of some classes of minimal unsatisfiable formulas
Discrete Applied Mathematics | 2003-09-15 | Paper |
Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency.
Information Processing Letters | 2003-01-21 | Paper |
The complexity of read-once resolution
Annals of Mathematics and Artificial Intelligence | 2002-08-20 | Paper |
| Satisfiable formulas closed under replacement | 2001-09-24 | Paper |
On subclasses of minimal unsatisfiable formulas
Discrete Applied Mathematics | 2001-07-04 | Paper |
Complexity results for restricted credulous default reasoning
AI Communications | 2001-03-19 | Paper |
| scientific article; zbMATH DE number 1470716 (Why is no real title available?) | 2000-07-05 | Paper |
Resolution remains hard under equivalence
Discrete Applied Mathematics | 2000-01-17 | Paper |
| scientific article; zbMATH DE number 1342212 (Why is no real title available?) | 1999-09-22 | Paper |
An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF
Annals of Mathematics and Artificial Intelligence | 1999-06-07 | Paper |
On resolution with short clauses
Annals of Mathematics and Artificial Intelligence | 1998-05-11 | Paper |
SAT-Problems and Reductions with Respect to the Number of Variables
Journal Of Logic And Computation | 1997-08-28 | Paper |
Resolution for quantified Boolean formulas
Information and Computation | 1995-05-28 | Paper |
| scientific article; zbMATH DE number 702472 (Why is no real title available?) | 1994-12-12 | Paper |
On generalized Horn formulas and \(k\)-resolution
Theoretical Computer Science | 1994-05-05 | Paper |
On the restricted equivalence for subclasses of propositional logic
RAIRO - Theoretical Informatics and Applications | 1993-11-15 | Paper |
On the restricted equivalence for subclasses of propositional logic
RAIRO - Theoretical Informatics and Applications | 1993-11-15 | Paper |
| scientific article; zbMATH DE number 64179 (Why is no real title available?) | 1992-09-27 | Paper |
Existence of simple propositional formulas
Information Processing Letters | 1990-01-01 | Paper |
Equivalence of propositional Prolog programs
Journal of Automated Reasoning | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4178773 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4182856 (Why is no real title available?) | 1989-01-01 | Paper |
Optimizing propositional calculus formulas with regard to questions of deducibility
Information and Computation | 1989-01-01 | Paper |
Projections of vector addition system reachability sets are semilinear
Theoretical Computer Science | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4085614 (Why is no real title available?) | 1988-01-01 | Paper |
First-Order Formulas in Conjunctive Quantificational Form
Zeitschrift für Mathematische Logik und Grundlagen der Mathematik | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4110071 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4033146 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3963170 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4029504 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3881886 (Why is no real title available?) | 1984-01-01 | Paper |
A classification of an iterative hierarchy
Archiv für Mathematische Logik und Grundlagenforschung | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3833304 (Why is no real title available?) | 1983-01-01 | Paper |
DURCH SYNTAKTISCHE REKURSION DEFINIERTE KLASSEN
Mathematical Logic Quarterly | 1983-01-01 | Paper |
Note on theE1*-E2* Problem
Zeitschrift für Mathematische Logik und Grundlagen der Mathematik | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3731338 (Why is no real title available?) | 1981-01-01 | Paper |
Some undecidable theories with monadic predicates and without equality
Archiv für Mathematische Logik und Grundlagenforschung | 1981-01-01 | Paper |
Universal asynchronous iterative arrays of Mealy automata
Acta Informatica | 1980-01-01 | Paper |
The reachability problem for Petri nets and decision problems for Skolem arithmetic
Theoretical Computer Science | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3708344 (Why is no real title available?) | 1980-01-01 | Paper |
The R. E. Complexity of Decision Problems for Commutative Semi‐Thue Systems With Recursive Rule Set
Mathematical Logic Quarterly | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3650542 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3708346 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3564949 (Why is no real title available?) | 1977-01-01 | Paper |
