| Publication | Date of Publication | Type |
|---|
| 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 | 2024-02-05 | Paper |
| Quantum string matching unfolded and extended | 2024-01-11 | Paper |
| An Optimized KE-Tableau-Based System for Reasoning in the Description Logic $${\mathcal {DL}}_{{\mathbf {D}}}^{4,\!\times }$$ | 2023-06-28 | Paper |
| Reconciling transparency, low Δ0-complexity and axiomatic weakness in undecidability proofs | 2023-06-15 | Paper |
| A decidable theory involving addition of differentiable real functions | 2023-04-20 | Paper |
| Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages | 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 |
| https://portal.mardi4nfdi.de/entity/Q5087788 | 2022-07-01 | Paper |
| A Set-Theoretic Approach to ABox Reasoning Services | 2022-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5087790 | 2022-07-01 | Paper |
| The quest for Diophantine finite-fold-ness | 2021-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3384163 | 2021-12-14 | Paper |
| Resolutions of convex geometries | 2021-11-22 | Paper |
| Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case* | 2021-10-25 | Paper |
| Choice resolutions | 2021-10-20 | Paper |
| An Improved Set-based Reasoner for the Description Logic 𝒟ℒD4,׆ | 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,× | 2021-05-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4986517 | 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 | 2020-12-15 | Paper |
| Yet Another Proof Without Words of the Pythagorean Theorem | 2020-12-01 | Paper |
| Banishing Ultrafilters from Our Consciousness | 2020-08-06 | Paper |
| The order-preserving pattern matching problem in practice | 2020-02-14 | Paper |
| Congruence relations on a choice space | 2019-06-12 | Paper |
| Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition | 2019-03-27 | Paper |
| A fast saturation strategy for set-theoretic tableaux | 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* | 2017-11-10 | Paper |
| Web ontology representation and reasoning via fragments of set theory | 2017-06-26 | Paper |
| Two Dichotomy Theorems | 2017-03-14 | Paper |
| \((m, n)\)-rationalizable choices | 2016-09-09 | Paper |
| The decision problem for a three-sorted fragment of set theory with restricted quantification and finite enumerations | 2016-08-05 | Paper |
| Text searching allowing for inversions and translocations of factors | 2015-09-22 | Paper |
| A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions | 2014-12-02 | Paper |
| A combinedgreedy-walkheuristic and simulated annealing approach for the closest string problem | 2014-10-29 | Paper |
| Improved and self-tuned occurrence heuristics | 2014-09-05 | Paper |
| Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs | 2014-08-13 | Paper |
| Formative processes with applications to the decision problem in set theory. II. Powerset and singleton operators, finiteness predicate | 2014-07-18 | Paper |
| Further analysis of the remedian algorithm | 2014-01-10 | Paper |
| Efficient string-matching allowing for non-overlapping inversions | 2014-01-09 | Paper |
| On the satisfiability problem for a 4-level quantified syllogistic and some applications to modal logic | 2013-07-30 | Paper |
| A Decision Procedure for a Sublanguage of Set Theory Involving Monotone, Additive, and Multiplicative Functions1 1This research has been partially supported by MURST Grant prot. 2001017741 under project “Ragionamento su aggregati e numeri a supporto della programmazione e relative verifiche”. | 2013-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4913613 | 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 | 2012-08-30 | Paper |
| Pattern matching with swaps in practice | 2012-08-30 | Paper |
| Dual tableau-based decision procedures for relational logics with restricted composition operator | 2012-07-17 | Paper |
| A graphical representation of relational formulae with complementation | 2012-06-04 | Paper |
| A compact representation of nondeterministic (suffix) automata for the bit-parallel approach | 2012-05-24 | Paper |
| On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns | 2012-05-11 | Paper |
| Computational Logic and Set Theory | 2011-08-08 | Paper |
| Efficient Matching of Biological Sequences Allowing for Non-overlapping Inversions | 2011-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002400 | 2011-05-20 | Paper |
| A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach | 2010-07-26 | Paper |
| Verification: Theory and Practice | 2010-03-23 | Paper |
| New efficient bit-parallel algorithms for the \((\delta , \alpha )\)-matching problem with applications in music information retrieval | 2010-01-08 | Paper |
| A new algorithm for efficient pattern matching with swaps | 2009-12-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3645585 | 2009-11-18 | Paper |
| Pattern Matching for Control Chart Monitoring | 2009-03-31 | Paper |
| Pattern Matching with Swaps for Short Patterns in Linear Time | 2009-02-03 | Paper |
| A Decision Procedure for Monotone Functions over Bounded and Complete Lattices | 2009-01-20 | Paper |
| ON SOME COMBINATORIAL PROBLEMS CONCERNING THE HARMONIC STRUCTURE OF MUSICAL CHORD SEQUENCES | 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 | 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 | 2007-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3437734 | 2007-05-09 | Paper |
| A sound framework for \(\delta\)-rule variants in free-variable semantic tableaux | 2007-05-04 | Paper |
| A SPACE EFFICIENT BIT-PARALLEL ALGORITHM FOR THE MULTIPLE STRING MATCHING PROBLEM | 2007-02-08 | Paper |
| Automated Reasoning with Analytic Tableaux and Related Methods | 2006-07-07 | Paper |
| An Efficient Approximate Algorithm for the 1-Median Problem in Metric Spaces | 2006-05-30 | Paper |
| A tableau-based decision procedure for a fragment of set theory with iterated membership | 2006-01-23 | Paper |
| Experimental and Efficient Algorithms | 2005-11-30 | Paper |
| Experimental and Efficient Algorithms | 2005-11-30 | Paper |
| A decision procedure for a sublanguage of set theory involving monotone, additive, and multiplicative functions. I: The two-level case | 2005-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4426344 | 2003-09-16 | Paper |
| Compiling dyadic first-order specifications into map algebra | 2003-05-14 | Paper |
| Formative processes with applications to the decision problem in set theory. I: Powerset and singleton operators | 2003-01-14 | Paper |
| QuickHeapsort, an efficient mix of classical sorting algorithms | 2002-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2728898 | 2001-11-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2728905 | 2001-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2740887 | 2001-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721193 | 2001-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4503905 | 2000-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4503906 | 2000-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4268492 | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263009 | 1999-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234182 | 1999-07-20 | Paper |
| Techniques of computable set theory with applications to proof verification | 1996-12-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4867922 | 1996-06-06 | Paper |
| Decision algorithms for elementary topology I. Topological syllogistics with set and map constructs, connectedness, and cardinality comparison | 1995-05-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281682 | 1994-04-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3999861 | 1993-01-23 | Paper |
| The automation of syllogistic. II: Optimization and complexity issues | 1992-06-25 | Paper |
| Decision procedures for elementary sublanguages of set theory: XI. Multilevel syllogistic extended by some elementary map constructs | 1991-01-01 | Paper |
| Decision procedures for elementary sublanguages of set theory: X. Multilevel syllogistic extended by the singleton and powerset operators | 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_ <\) | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3475242 | 1989-01-01 | Paper |
| Topological syllogistic with continuous and closed functions | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3491017 | 1989-01-01 | Paper |
| Decision procedures for elementary sublanguages of set theory VIII. A semidecision procedure for finite satisfiability of unqualified set-theoretic formulae | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3489978 | 1988-01-01 | Paper |
| The automation of syllogistic. I: Syllogistic normal forms | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5749278 | 1988-01-01 | Paper |
| Decision procedures for elementary sublanguages of set theory. V. Multilevel syllogistic extended by the general union operator | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3819041 | 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} | 1987-01-01 | Paper |
| Decision algorithms for some fragments of analysis and related areas | 1987-01-01 | Paper |
| Decision procedures for elementary sublanguages of set theory. VI. Multi-level syllogistic extended by the powerset operator | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3342579 | 1984-01-01 | Paper |
