| Publication | Date of Publication | Type |
|---|
On a suggested logic for paraconsistent mathematics
The Australasian Journal of Logic | 2025-01-20 | Paper |
| Parallelizing the closure computation in automated deduction | 2023-04-28 | Paper |
Models of relevant arithmetic
The Australasian Journal of Logic | 2022-06-27 | Paper |
The crisis in finite mathematics: Automated reasoning as cause and cure
Automated Deduction — CADE-12 | 2020-01-21 | Paper |
\textsc{Minlog}: a minimal logic theorem prover
Automated Deduction—CADE-14 | 2019-10-01 | Paper |
Conflict resolution: a first-order resolution calculus with decision literals and conflict-driven clause learning
Journal of Automated Reasoning | 2018-02-02 | Paper |
Scavenger 0.1: a theorem prover based on conflict resolution
(available as arXiv preprint) | 2017-09-22 | Paper |
| A logic for vagueness | 2016-02-01 | Paper |
The one-variable fragment of \(\mathrm T_\to\)
Journal of Philosophical Logic | 2014-12-18 | Paper |
Visualising reasoning: what ATP can learn from CP
Electronic Notes in Theoretical Computer Science | 2014-07-22 | Paper |
On the ternary relation and conditionality
Journal of Philosophical Logic | 2012-09-20 | Paper |
| Counting loops with the inverse property. | 2008-08-12 | Paper |
| A finite fragment of S3 | 2008-06-18 | Paper |
Logic Programming
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Semipositive LTL with an Uninterpreted Past Operator
Logic Journal of the IGPL | 2005-09-28 | Paper |
Inconsistency Tolerance
Lecture Notes in Computer Science | 2005-08-17 | Paper |
| scientific article; zbMATH DE number 2019868 (Why is no real title available?) | 2004-03-08 | Paper |
More proofs of an axiom of Łukasiewicz
Journal of Automated Reasoning | 2003-04-28 | Paper |
| scientific article; zbMATH DE number 1809864 (Why is no real title available?) | 2002-09-30 | Paper |
| scientific article; zbMATH DE number 1765689 (Why is no real title available?) | 2002-07-10 | Paper |
Linear arithmetic desecsed
Logique et Analyse. Nouvelle Série | 2001-09-04 | Paper |
Blocks World revisited
Artificial Intelligence | 2001-08-20 | Paper |
| A Note on 'Most' | 2000-08-22 | Paper |
| scientific article; zbMATH DE number 1140676 (Why is no real title available?) | 1998-09-02 | Paper |
| scientific article; zbMATH DE number 823603 (Why is no real title available?) | 1995-12-05 | Paper |
| scientific article; zbMATH DE number 638618 (Why is no real title available?) | 1995-01-29 | Paper |
Sentential constants in systems near R
Studia Logica | 1994-09-28 | Paper |
A structurally complete fragment of relevant logic
Notre Dame Journal of Formal Logic | 1993-12-06 | Paper |
Correction to: ``Solution to a problem of Ono and Komori
Journal of Philosophical Logic | 1993-01-16 | Paper |
| scientific article; zbMATH DE number 67849 (Why is no real title available?) | 1992-09-27 | Paper |
The Ackermann constant theorem: A computer-assisted investigation
Journal of Automated Reasoning | 1992-06-27 | Paper |
Solution to a problem of Ono and Komori
Journal of Philosophical Logic | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4137752 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4135919 (Why is no real title available?) | 1989-01-01 | Paper |
Solution to a problem of Ono and Komori
Journal of Philosophical Logic | 1989-01-01 | Paper |
On the structure of De Morgan monoids with corollaries on relevant logic and theories
Notre Dame Journal of Formal Logic | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4039858 (Why is no real title available?) | 1987-01-01 | Paper |
3088 varieties: A solution to the Ackermann constant problem
Journal of Symbolic Logic | 1985-01-01 | Paper |
A metacompleteness theorem for contraction-free relevant logics
Studia Logica | 1984-01-01 | Paper |
