| Publication | Date of Publication | Type |
|---|
The Ackermann encoding and its siblings
Journal of Logic and Computation | 2026-03-05 | Paper |
Quantum algorithms for longest common and palindromic substrings in the circuit model
Theoretical Computer Science | 2026-02-04 | Paper |
| The decision problem for undirected graphs with reachability and acyclicity | 2025-02-07 | Paper |
On Diophantine singlefold specifications
Le Matematiche | 2025-02-03 | Paper |
| On the convexity of a fragment of pure set theory with applications within a Nelson-Oppen framework | 2024-12-06 | Paper |
| Dual tableau-based decision procedures for fragments of the logic of binary relations | 2024-09-06 | Paper |
Rationalization of indecisive choice behavior by pluralist ballots
Journal of Mathematical Economics | 2024-02-05 | Paper |
Quantum string matching unfolded and extended
Reversible Computation | 2024-01-11 | Paper |
An Optimized KE-Tableau-Based System for Reasoning in the Description Logic $${\mathcal {DL}}_{{\mathbf {D}}}^{4,\!\times }$$
Rules and Reasoning | 2023-06-28 | Paper |
Reconciling transparency, low <i>Δ</i>0-complexity and axiomatic weakness in undecidability proofs
Journal Of Logic And Computation | 2023-06-15 | Paper |
A decidable theory involving addition of differentiable real functions
Theoretical Computer Science | 2023-04-20 | Paper |
Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages
Theoretical Computer Science | 2023-04-12 | Paper |
| Six equations in search of a finite-fold-ness proof | 2023-03-03 | Paper |
| Sequence searching allowing for non-overlapping adjacent unbalanced translocations | 2023-02-07 | Paper |
| scientific article; zbMATH DE number 7552287 (Why is no real title available?) | 2022-07-01 | Paper |
| scientific article; zbMATH DE number 7552285 (Why is no real title available?) | 2022-07-01 | Paper |
A set-theoretic approach to ABox reasoning services
Rules and Reasoning | 2022-07-01 | Paper |
| The quest for Diophantine finite-fold-ness | 2021-12-16 | Paper |
| The satisfiability problem for Boolean set theory with a choice correspondence | 2021-12-14 | Paper |
The satisfiability problem for Boolean set theory with a choice correspondence
(available as arXiv preprint) | 2021-12-14 | Paper |
Resolutions of convex geometries
The Electronic Journal of Combinatorics | 2021-11-22 | Paper |
Complexity assessments for decidable fragments of set theory. I: A taxonomy for the Boolean case
Fundamenta Informaticae | 2021-10-25 | Paper |
Choice resolutions
Social Choice and Welfare | 2021-10-20 | Paper |
An improved set-based reasoner for the description logic \(\mathcal{DL}_\mathrm{D}^{4,\times\dagger}\)
Fundamenta Informaticae | 2021-06-04 | Paper |
| Decidability of the satisfiability problem for Boolean set theory with the unordered Cartesian product operator | 2021-06-02 | Paper |
A Set-theoretic Approach to Reasoning Services for the Description Logic 𝒟 ℒ D 4,×
Fundamenta Informaticae | 2021-05-20 | Paper |
| scientific article; zbMATH DE number 7340151 (Why is no real title available?) | 2021-04-27 | Paper |
scientific article; zbMATH DE number 7340151 (Why is no real title available?)
(available as arXiv preprint) | 2021-04-27 | Paper |
| Hilbert's Tenth problem and NP-completeness of Boolean Syllogistic with unordered cartesian product | 2021-01-01 | Paper |
Complexity assessments for decidable fragments of set theory. II: A taxonomy for `small' languages involving membership
Theoretical Computer Science | 2020-12-15 | Paper |
Yet Another Proof Without Words of the Pythagorean Theorem
Mathematics Magazine | 2020-12-01 | Paper |
Banishing ultrafilters from our consciousness
Outstanding Contributions to Logic | 2020-08-06 | Paper |
The order-preserving pattern matching problem in practice
Discrete Applied Mathematics | 2020-02-14 | Paper |
Congruence relations on a choice space
Social Choice and Welfare | 2019-06-12 | Paper |
Linear and efficient string matching algorithms based on weak factor recognition
ACM Journal of Experimental Algorithmics | 2019-03-27 | Paper |
A fast saturation strategy for set-theoretic tableaux
Lecture Notes in Computer Science | 2019-01-15 | Paper |
| An introduction to the technique of formative processes in set theory | 2018-07-03 | Paper |
Herbrand-satisfiability of a quantified set-theoretic fragment
Fundamenta Informaticae | 2017-11-10 | Paper |
Web ontology representation and reasoning via fragments of set theory
(available as arXiv preprint) | 2017-06-26 | Paper |
| Two Dichotomy Theorems | 2017-03-14 | Paper |
(m, n)-rationalizable choices
Journal of Mathematical Psychology | 2016-09-09 | Paper |
The decision problem for a three-sorted fragment of set theory with restricted quantification and finite enumerations
(available as arXiv preprint) | 2016-08-05 | Paper |
Text searching allowing for inversions and translocations of factors
Discrete Applied Mathematics | 2015-09-22 | Paper |
A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions
Theoretical Computer Science | 2014-12-02 | Paper |
A combined greedy-walk heuristic and simulated annealing approach for the closest string problem
Optimization Methods & Software | 2014-10-29 | Paper |
Improved and self-tuned occurrence heuristics
Journal of Discrete Algorithms | 2014-09-05 | Paper |
Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs
Journal of Discrete Algorithms | 2014-08-13 | Paper |
Formative processes with applications to the decision problem in set theory. II. Powerset and singleton operators, finiteness predicate
Information and Computation | 2014-07-18 | Paper |
Further analysis of the remedian algorithm
Theoretical Computer Science | 2014-01-10 | Paper |
Efficient string-matching allowing for non-overlapping inversions
Theoretical Computer Science | 2014-01-09 | Paper |
On the satisfiability problem for a 4-level quantified syllogistic and some applications to modal logic
Fundamenta Informaticae | 2013-07-30 | Paper |
A decision procedure for a sublanguage of set theory involving monotone, additive, and multiplicative functions
Electronic Notes in Theoretical Computer Science | 2013-04-19 | Paper |
| Solvable (and unsolvable) cases of the decision problem for fragments of analysis | 2013-04-08 | Paper |
| A decidable quantified fragment of set theory involving ordered pairs with applications to description logics | 2012-09-18 | Paper |
Adapting Boyer-Moore-like algorithms for searching Huffman encoded texts
International Journal of Foundations of Computer Science | 2012-08-30 | Paper |
Pattern matching with swaps in practice
International Journal of Foundations of Computer Science | 2012-08-30 | Paper |
Dual tableau-based decision procedures for relational logics with restricted composition operator
Journal of Applied Non-Classical Logics | 2012-07-17 | Paper |
A graphical representation of relational formulae with complementation
RAIRO. Theoretical Informatics and Applications | 2012-06-04 | Paper |
A graphical representation of relational formulae with complementation
RAIRO. Theoretical Informatics and Applications | 2012-06-04 | Paper |
A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
Information and Computation | 2012-05-24 | Paper |
On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns
Journal of Discrete Algorithms | 2012-05-11 | Paper |
| Computational logic and set theory. Applying formalized logic to analysis. Foreword by Martin Davis | 2011-08-08 | Paper |
Efficient matching of biological sequences allowing for non-overlapping inversions
Combinatorial Pattern Matching | 2011-06-29 | Paper |
| scientific article; zbMATH DE number 5898609 (Why is no real title available?) | 2011-05-20 | Paper |
A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
Combinatorial Pattern Matching | 2010-07-26 | Paper |
Notes from the logbook of a proof-checker's project
Lecture Notes in Computer Science | 2010-03-23 | Paper |
New efficient bit-parallel algorithms for the ( , )-matching problem with applications in music information retrieval
International Journal of Foundations of Computer Science | 2010-01-08 | Paper |
A new algorithm for efficient pattern matching with swaps
Lecture Notes in Computer Science | 2009-12-11 | Paper |
| scientific article; zbMATH DE number 5635093 (Why is no real title available?) | 2009-11-18 | Paper |
Pattern Matching for Control Chart Monitoring
Progress in Industrial Mathematics at ECMI 2006 | 2009-03-31 | Paper |
Pattern Matching with Swaps for Short Patterns in Linear Time
Lecture Notes in Computer Science | 2009-02-03 | Paper |
A Decision Procedure for Monotone Functions over Bounded and Complete Lattices
Theory and Applications of Relational Structures as Knowledge Instruments II | 2009-01-20 | Paper |
ON SOME COMBINATORIAL PROBLEMS CONCERNING THE HARMONIC STRUCTURE OF MUSICAL CHORD SEQUENCES
International Journal of Foundations of Computer Science | 2008-11-03 | Paper |
| Fast-search algorithms: new efficient variants of the Boyer-Moore pattern-matching algorithm | 2008-03-06 | Paper |
Decision algorithms for fragments of real analysis. I: Continuous functions with strict convexity and concavity predicates
Journal of Symbolic Computation | 2007-10-23 | Paper |
| Applications of formative process to the decision problem in set theory | 2007-08-07 | Paper |
Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
| scientific article; zbMATH DE number 5151001 (Why is no real title available?) | 2007-05-09 | Paper |
A sound framework for \(\delta\)-rule variants in free-variable semantic tableaux
Journal of Automated Reasoning | 2007-05-04 | Paper |
A SPACE EFFICIENT BIT-PARALLEL ALGORITHM FOR THE MULTIPLE STRING MATCHING PROBLEM
International Journal of Foundations of Computer Science | 2007-02-08 | Paper |
Automated Reasoning with Analytic Tableaux and Related Methods
Lecture Notes in Computer Science | 2006-07-07 | Paper |
An Efficient Approximate Algorithm for the 1-Median Problem in Metric Spaces
SIAM Journal on Optimization | 2006-05-30 | Paper |
A tableau-based decision procedure for a fragment of set theory with iterated membership
Journal of Automated Reasoning | 2006-01-23 | Paper |
Experimental and Efficient Algorithms
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Experimental and Efficient Algorithms
Lecture Notes in Computer Science | 2005-11-30 | Paper |
A decision procedure for a sublanguage of set theory involving monotone, additive, and multiplicative functions. I: The two-level case
Journal of Automated Reasoning | 2005-06-22 | Paper |
| scientific article; zbMATH DE number 1982175 (Why is no real title available?) | 2003-09-16 | Paper |
Compiling dyadic first-order specifications into map algebra
Theoretical Computer Science | 2003-05-14 | Paper |
Formative processes with applications to the decision problem in set theory. I: Powerset and singleton operators
Information and Computation | 2003-01-14 | Paper |
QuickHeapsort, an efficient mix of classical sorting algorithms
Theoretical Computer Science | 2002-08-05 | Paper |
| scientific article; zbMATH DE number 1629853 (Why is no real title available?) | 2001-11-06 | Paper |
| scientific article; zbMATH DE number 1629859 (Why is no real title available?) | 2001-11-04 | Paper |
| scientific article; zbMATH DE number 1641581 (Why is no real title available?) | 2001-09-05 | Paper |
| scientific article; zbMATH DE number 1612548 (Why is no real title available?) | 2001-07-01 | Paper |
| scientific article; zbMATH DE number 1507185 (Why is no real title available?) | 2000-09-14 | Paper |
| scientific article; zbMATH DE number 1507186 (Why is no real title available?) | 2000-09-14 | Paper |
| scientific article; zbMATH DE number 1354177 (Why is no real title available?) | 1999-10-28 | Paper |
| scientific article; zbMATH DE number 1341470 (Why is no real title available?) | 1999-09-22 | Paper |
| scientific article; zbMATH DE number 1263308 (Why is no real title available?) | 1999-07-20 | Paper |
Techniques of computable set theory with applications to proof verification
Communications on Pure and Applied Mathematics | 1996-12-05 | Paper |
| scientific article; zbMATH DE number 851448 (Why is no real title available?) | 1996-06-06 | Paper |
Decision algorithms for elementary topology I. Topological syllogistics with set and map constructs, connectedness, and cardinality comparison
Communications on Pure and Applied Mathematics | 1995-05-01 | Paper |
| scientific article; zbMATH DE number 512972 (Why is no real title available?) | 1994-04-07 | Paper |
| scientific article; zbMATH DE number 50150 (Why is no real title available?) | 1993-01-23 | Paper |
The automation of syllogistic. II: Optimization and complexity issues
Journal of Automated Reasoning | 1992-06-25 | Paper |
Decision procedures for elementary sublanguages of set theory: XI. Multilevel syllogistic extended by some elementary map constructs
Journal of Automated Reasoning | 1991-01-01 | Paper |
Decision procedures for elementary sublanguages of set theory: X. Multilevel syllogistic extended by the singleton and powerset operators
Journal of Automated Reasoning | 1991-01-01 | Paper |
Decision procedures for elementary sublanguages of set theory. XV: Multilevel syllogistic extended by the predicate Finite and the operators singleton and \(pred_ <\)
Journal of Automated Reasoning | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4143941 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4164193 (Why is no real title available?) | 1989-01-01 | Paper |
Topological syllogistic with continuous and closed functions
Communications on Pure and Applied Mathematics | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4162853 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4183384 (Why is no real title available?) | 1988-01-01 | Paper |
Decision procedures for elementary sublanguages of set theory VIII. A semidecision procedure for finite satisfiability of unqualified set-theoretic formulae
Communications on Pure and Applied Mathematics | 1988-01-01 | Paper |
The automation of syllogistic. I: Syllogistic normal forms
Journal of Symbolic Computation | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4091462 (Why is no real title available?) | 1987-01-01 | Paper |
Decision procedures for elementary sublanguages of set theory. V. Multilevel syllogistic extended by the general union operator
Journal of Computer and System Sciences | 1987-01-01 | Paper |
Decision procedures for elementary sublanguages of set theory. IV. Formulae involving a rank operator or one occurrence of Σ(x)={{y}|y εx}
Communications on Pure and Applied Mathematics | 1987-01-01 | Paper |
Decision algorithms for some fragments of analysis and related areas
Communications on Pure and Applied Mathematics | 1987-01-01 | Paper |
Decision procedures for elementary sublanguages of set theory. VI. Multi-level syllogistic extended by the powerset operator
Communications on Pure and Applied Mathematics | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3875286 (Why is no real title available?) | 1984-01-01 | Paper |
