| Publication | Date of Publication | Type |
|---|
On finite representations of infinite sequences of terms
Conditional and Typed Rewriting Systems | 2023-03-09 | Paper |
Completion procedures as semidecision procedures
Conditional and Typed Rewriting Systems | 2023-03-09 | Paper |
On fairness of completion-based theorem proving strategies
Rewriting Techniques and Applications | 2022-12-09 | Paper |
Boolean Rings for Intersection-Based Satisfiability
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-27 | Paper |
On the hardness of counting problems of complete mappings.
Discrete Mathematics | 2004-03-14 | Paper |
| scientific article; zbMATH DE number 1901220 (Why is no real title available?) | 2003-04-27 | Paper |
On the enumeration of Abelian \(K\)-complete mappings
Congressus Numerantium | 2002-09-17 | Paper |
On the modelling of search in theorem proving -- towards a theory of strategy analysis
Information and Computation | 1999-03-22 | Paper |
| scientific article; zbMATH DE number 1114006 (Why is no real title available?) | 1998-02-08 | Paper |
| scientific article; zbMATH DE number 978243 (Why is no real title available?) | 1997-08-17 | Paper |
PSATO: A distributed propositional prover and its application to quasigroup problems
Journal of Symbolic Computation | 1997-06-16 | Paper |
Towards a foundation of completion procedures as semidecision procedures
Theoretical Computer Science | 1997-02-28 | Paper |
| scientific article; zbMATH DE number 794244 (Why is no real title available?) | 1996-05-28 | Paper |
Distributed deduction by clause-diffusion: Distributed contraction and the Aquarius prover
Journal of Symbolic Computation | 1996-04-11 | Paper |
Recurrence domains: Their unification and application to logic programming
Information and Computation | 1995-01-01 | Paper |
On subsumption in distributed derivations
Journal of Automated Reasoning | 1994-11-10 | Paper |
Proving refutational completeness of theorem-proving strategies
Journal of the ACM | 1994-08-21 | Paper |
| scientific article; zbMATH DE number 512823 (Why is no real title available?) | 1994-03-10 | Paper |
| scientific article; zbMATH DE number 176722 (Why is no real title available?) | 1993-05-18 | Paper |
The term rewriting approach to automated theorem proving
The Journal of Logic Programming | 1992-11-10 | Paper |
On rewrite programs: Semantics and relationship with prolog
The Journal of Logic Programming | 1992-11-10 | Paper |
Automated proofs of the Moufang identities in alternative rings
Journal of Automated Reasoning | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4074535 (Why is no real title available?) | 1988-01-01 | Paper |
Rewrite method for theorem proving in first order theory with equality
Journal of Symbolic Computation | 1987-01-01 | Paper |
Automatic inductive theorem proving using Prolog
Theoretical Computer Science | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4016226 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4049135 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3930371 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3965464 (Why is no real title available?) | 1985-01-01 | Paper |
Refutational theorem proving using term-rewriting systems
Artificial Intelligence | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3829296 (Why is no real title available?) | 1983-01-01 | Paper |
