| Publication | Date of Publication | Type |
|---|
A Wos Challenge Met
Journal of Automated Reasoning | 2022-12-12 | Paper |
Paraconsistent constructive logic with strong negation as a contraction-free relevant logic
Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science | 2018-09-13 | Paper |
| Formalizing a fragment of combinatorics on words | 2017-08-04 | Paper |
| Discriminator logics (research announcement) | 2016-02-01 | Paper |
| scientific article; zbMATH DE number 6287631 (Why is no real title available?) | 2014-04-23 | Paper |
Loops with abelian inner mapping groups: an application of automated deduction
Automated Reasoning and Mathematics | 2013-04-16 | Paper |
A Geometric Procedure with Prover9
Automated Reasoning and Mathematics | 2013-04-16 | Paper |
Constructive logic with strong negation is a substructural logic. II
Studia Logica | 2009-03-17 | Paper |
Abelian logic and the logics of pointed lattice-ordered varieties
Logica Universalis | 2009-02-17 | Paper |
| Characterisations of Nelson algebras | 2009-01-28 | Paper |
Constructive logic with strong negation is a substructural logic. I
Studia Logica | 2008-06-25 | Paper |
| scientific article; zbMATH DE number 5170267 (Why is no real title available?) | 2007-07-09 | Paper |
Axiomatizing the skew Boolean propositional calculus
Journal of Automated Reasoning | 2007-05-03 | Paper |
| On a homomorphism property of hoops | 2007-04-27 | Paper |
Yet another single law for lattices
Algebra Universalis | 2006-07-12 | Paper |
Levi's commutator theorems for cancellative semigroups.
Semigroup Forum | 2006-03-22 | Paper |
Double-negation elimination in some propositional logics
Studia Logica | 2006-01-30 | Paper |
Automated discovery of single axioms for ortholattices
Algebra Universalis | 2006-01-06 | Paper |
A shortest 2-basis for Boolean algebra in terms of the Sheffer stroke
Journal of Automated Reasoning | 2004-05-27 | Paper |
Short single axioms for Boolean algebra
Journal of Automated Reasoning | 2003-04-28 | Paper |
The application of automated reasoning to formal models of combinatorial optimization
Applied Mathematics and Computation | 2003-01-28 | Paper |
Solving open questions and other challenge problems using proof sketches
Journal of Automated Reasoning | 2002-01-07 | Paper |
Finding shortest proofs: An application of linked inference rules
Journal of Automated Reasoning | 2002-01-07 | Paper |
Using hints to increase the effectiveness of an automated reasoning program: Case studies
Journal of Automated Reasoning | 1996-10-13 | Paper |
The linked inference principle. I: The formal treatment
Journal of Automated Reasoning | 1992-09-27 | Paper |
Designing deductive databases
Journal of Automated Reasoning | 1988-01-01 | Paper |
