| Publication | Date of Publication | Type |
|---|
Stable Andrews-Curtis trivialization of \(\mathrm{AK}(3)\) revisited. A case study using automated deduction
Journal of Computational Algebra | 2026-01-20 | Paper |
Machine learning discovers invariants of braids and flat braids
Advances in Applied Clifford Algebras | 2024-10-18 | Paper |
Semigroups, keis and groups induced by knot diagrams: an experimental investigation with automated reasoning
Semigroup Forum | 2024-08-22 | Paper |
Describing realizable Gauss diagrams using the concepts of parity or bipartite graphs
Journal of Knot Theory and Its Ramifications | 2023-12-11 | Paper |
| Automated reasoning for proving non-orderability of groups | 2023-10-09 | Paper |
| Machine learning discovers invariants of braids and flat braids | 2023-07-22 | Paper |
Representation and processing of instantaneous and durative temporal phenomena
Logic-Based Program Synthesis and Transformation | 2023-05-08 | Paper |
Correction to: ``Parameterized verification of leader/follower systems via first-order temporal logic
Formal Methods in System Design | 2023-05-08 | Paper |
Visual Algebraic Proofs for Unknot Detection
Diagrammatic Representation and Inference | 2023-02-23 | Paper |
Abstract State Machines and System Theoretic Process Analysis for Safety-Critical Systems
Lecture Notes in Computer Science | 2022-11-04 | Paper |
| An application of neural networks to a problem in knot theory and group theory (untangling braids) | 2022-06-10 | Paper |
| \texttt{Gauss-lintel}, an algorithm suite for exploring chord diagrams | 2022-04-22 | Paper |
| Untangling Braids with Multi-agent Q-Learning | 2021-09-29 | Paper |
| Circle graphs (chord interlacement graphs) of Gauss diagrams: Descriptions of realizable Gauss diagrams, algorithms, enumeration | 2021-08-05 | Paper |
| Experimental Mathematics Approach to Gauss Diagrams Realizability | 2021-03-02 | Paper |
Finite Models vs Tree Automata in Safety Verification
(available as arXiv preprint) | 2020-05-27 | Paper |
Automated reasoning for knot semigroups and \(\pi\)-orbifold groups of knots
Mathematical Aspects of Computer and Information Sciences | 2019-03-14 | Paper |
| Revisiting MU puzzle: a case study in finite countermodels verification | 2018-10-23 | Paper |
Dihedral semigroups, their defining relations and an application to describing knot semigroups of rational links
Semigroup Forum | 2018-09-14 | Paper |
| The Andrews-Curtis conjecture, term rewriting and first-order proofs | 2018-08-17 | Paper |
Efficient knot discrimination via quandle coloring with SAT and \#-SAT
Mathematical Software – ICMS 2016 | 2016-09-28 | Paper |
Computer-aided proof of Erdős discrepancy properties
Artificial Intelligence | 2015-11-18 | Paper |
Finite reasons for safety. Parameterized verification by finite model finding
Journal of Automated Reasoning | 2015-06-23 | Paper |
| A combinatorial approach to knot recognition | 2015-05-25 | Paper |
A SAT attack on the Erdős discrepancy conjecture
Lecture Notes in Computer Science | 2014-09-26 | Paper |
Detecting Unknots via Equational Reasoning, I: Exploration
Lecture Notes in Computer Science | 2014-08-07 | Paper |
On one application of computations with oracle
Programming and Computer Software | 2012-11-16 | Paper |
Planarity of Knots, Register Automata and LogSpace Computability
Language and Automata Theory and Applications | 2011-06-03 | Paper |
Reachability as derivability, finite countermodels and verification
Automated Technology for Verification and Analysis | 2010-10-04 | Paper |
On the Computational Power of Querying the History
Fundamenta Informaticae | 2009-06-23 | Paper |
Automata on Gauss Words
Language and Automata Theory and Applications | 2009-04-02 | Paper |
REACHABILITY ANALYSIS IN VERIFICATION VIA SUPERCOMPILATION
International Journal of Foundations of Computer Science | 2008-09-25 | Paper |
Verification as a parameterized testing (experiments with the SCP4 supercompiler)
Programming and Computer Software | 2007-07-05 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Linear ordering on graphs, anti-founded sets and polynomial time computability
Theoretical Computer Science | 2000-01-12 | Paper |
\(\Delta\)-languages for sets and LOGSPACE computable graph transformers
Theoretical Computer Science | 1998-07-23 | Paper |
| scientific article; zbMATH DE number 1114341 (Why is no real title available?) | 1998-02-08 | Paper |
COMPLEXITY OF UNIVERSAL CIRCUMSCRIPTION
International Journal of Foundations of Computer Science | 1994-04-27 | Paper |
