| Publication | Date of Publication | Type |
|---|
Cascade products and Wheeler automata
Theoretical Computer Science | 2024-10-01 | Paper |
In memory of Martin Davis
Notices of the American Mathematical Society | 2024-09-26 | Paper |
| Reasoning on relations, modalities, and sets | 2024-09-06 | Paper |
Incremental NFA minimization
Theoretical Computer Science | 2024-06-19 | Paper |
| Optimal Wheeler language recognition | 2024-05-29 | Paper |
Ordering regular languages and automata: complexity
Theoretical Computer Science | 2023-02-24 | Paper |
Solving string problems on graphs using the labeled direct product
Algorithmica | 2022-10-06 | Paper |
| scientific article; zbMATH DE number 7552285 (Why is no real title available?) | 2022-07-01 | Paper |
Wheeler languages
Information and Computation | 2021-11-25 | Paper |
scientific article; zbMATH DE number 7378722 (Why is no real title available?)
(available as arXiv preprint) | 2021-08-04 | Paper |
Regular Languages meet Prefix Sorting
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Banishing ultrafilters from our consciousness
Outstanding Contributions to Logic | 2020-08-06 | Paper |
From LZ77 to the run-length encoded Burrows-Wheeler transform, and back
(available as arXiv preprint) | 2020-05-25 | Paper |
Adding the power-set to description logics
Theoretical Computer Science | 2020-04-21 | Paper |
| Extending \(\mathcal{ALC}\) with the power-set construct | 2020-02-18 | Paper |
Logic-based multi-objective design of chemical reaction networks
Hybrid Systems Biology | 2019-12-04 | Paper |
LZ77 computation based on the run-length encoded BWT
Algorithmica | 2018-07-25 | Paper |
A set-theoretic translation method for (poly)modal logics
STACS 95 | 2017-12-04 | Paper |
| On sets and graphs. Perspectives on logic and combinatorics | 2017-09-26 | Paper |
Set-syllogistics meet combinatorics
Mathematical Structures in Computer Science | 2017-04-04 | Paper |
Mapping Sets and Hypersets into Numbers
Fundamenta Informaticae | 2016-08-15 | Paper |
| Is hyper-extensionality preservable under deletions of graph elements? | 2016-08-05 | Paper |
Average linear time and compressed space construction of the Burrows-Wheeler transform
Language and Automata Theory and Applications | 2016-04-08 | Paper |
Rank and simulation: the well-founded case
Journal Of Logic And Computation | 2015-12-28 | Paper |
Hashing and indexing: succinct data structures and smoothed analysis
Algorithms and Computation | 2015-09-11 | Paper |
Markov chain algorithms for generating sets uniformly at random
Ars Mathematica Contemporanea | 2014-10-22 | Paper |
The Importance of Being (A Little Bit) Discrete
Electronic Notes in Theoretical Computer Science | 2014-03-21 | Paper |
Stochastic concurrent constraint programming and differential equations
Electronic Notes in Theoretical Computer Science | 2014-01-17 | Paper |
Well-quasi-ordering hereditarily finite sets
International Journal of Computer Mathematics | 2013-10-22 | Paper |
(Hybrid) automata and (stochastic) programs. The hybrid automata lattice of a stochastic program
Journal of Logic and Computation | 2013-08-27 | Paper |
Modeling concurrent systems specified in a temporal concurrent constraint language. I
Electronic Notes in Theoretical Computer Science | 2013-05-24 | Paper |
Rank-based symbolic bisimulation: (and model checking)
Electronic Notes in Theoretical Computer Science | 2013-04-19 | Paper |
Counting extensional acyclic digraphs
Information Processing Letters | 2013-04-04 | Paper |
Infinity, in short
Journal Of Logic And Computation | 2013-01-14 | Paper |
A randomized numerical aligner (rNA)
Journal of Computer and System Sciences | 2012-11-06 | Paper |
The Bernays-Schönfinkel-Ramsey class for set theory: decidability
The Journal of Symbolic Logic | 2012-09-19 | Paper |
| Statements of ill-founded infinity in set theory | 2011-10-05 | Paper |
Well-quasi-ordering hereditarily finite sets
Language and Automata Theory and Applications | 2011-06-03 | Paper |
| Stating infinity in set/hyperset theory | 2011-05-20 | Paper |
Hybrid dynamics of stochastic \(\pi \)-calculus
Mathematics in Computer Science | 2011-02-19 | Paper |
Stochastic programs and hybrid automata for (biological) modeling
Mathematical Theory and Computational Practice | 2010-07-28 | Paper |
The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability
Journal of Symbolic Logic | 2010-06-24 | Paper |
A randomized numerical aligner (rNA)
Language and Automata Theory and Applications | 2010-05-26 | Paper |
Hybrid dynamics of stochastic programs
Theoretical Computer Science | 2010-05-11 | Paper |
Binary extensions of S1S and the composition method
Lecture Notes in Computer Science | 2010-03-23 | Paper |
Discrete semantics for hybrid automata. Avoiding misleading assumptions in systems biology
Discrete Event Dynamic Systems | 2010-01-18 | Paper |
Dynamical Systems and Stochastic Programming: To Ordinary Differential Equations and Back
Lecture Notes in Computer Science | 2009-11-10 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
Inclusion dynamics hybrid automata
Information and Computation | 2009-02-03 | Paper |
Hybrid Semantics for Stochastic π-Calculus
Algebraic Biology | 2009-02-03 | Paper |
A Complete Axiomatic System for a Process-Based Spatial Logic
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Modeling biological systems in stochastic concurrent constraint programming
Constraints | 2008-09-02 | Paper |
An Algorithmic Account of Ehrenfeucht Games on Labeled Successor Structures
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-27 | Paper |
Symbolic graphs: Linear solutions to connectivity related problems
Algorithmica | 2008-02-18 | Paper |
The axiom of elementary sets on the edge of Peircean expressibility
Journal of Symbolic Logic | 2006-01-16 | Paper |
Relational and Kleene-Algebraic Methods in Computer Science
Lecture Notes in Computer Science | 2005-12-23 | Paper |
| scientific article; zbMATH DE number 2159049 (Why is no real title available?) | 2005-04-19 | Paper |
Ackermann encoding, bisimulations and OBDDs
Theory and Practice of Logic Programming | 2005-04-15 | Paper |
An efficient algorithm for computing bisimulation equivalence
Theoretical Computer Science | 2004-10-27 | Paper |
Three-variable statements of set-pairing
Theoretical Computer Science | 2004-10-27 | Paper |
| scientific article; zbMATH DE number 2080064 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2079387 (Why is no real title available?) | 2004-07-28 | Paper |
From bisimulation to simulation: Coarsest partition problems
Journal of Automated Reasoning | 2004-05-27 | Paper |
| scientific article; zbMATH DE number 1955850 (Why is no real title available?) | 2003-07-29 | Paper |
| scientific article; zbMATH DE number 1950549 (Why is no real title available?) | 2003-07-17 | Paper |
Extending Kamp's Theorem to Model Time Granularity
Journal Of Logic And Computation | 2003-03-13 | Paper |
| scientific article; zbMATH DE number 1841959 (Why is no real title available?) | 2002-12-04 | Paper |
| scientific article; zbMATH DE number 1759442 (Why is no real title available?) | 2002-11-04 | Paper |
| scientific article; zbMATH DE number 1796125 (Why is no real title available?) | 2002-09-04 | Paper |
Alternative translation techniques for propositional and first-order modal logics
Journal of Automated Reasoning | 2002-08-20 | Paper |
| scientific article; zbMATH DE number 1641581 (Why is no real title available?) | 2001-09-05 | Paper |
The taming (timing) of the states
Logic Journal of the IGPL | 2001-07-09 | Paper |
| scientific article; zbMATH DE number 1612563 (Why is no real title available?) | 2001-07-01 | Paper |
| scientific article; zbMATH DE number 1538020 (Why is no real title available?) | 2000-12-03 | Paper |
Modal deduction in second-order logic and set theory. II
Studia Logica | 2000-11-21 | Paper |
| scientific article; zbMATH DE number 1444726 (Why is no real title available?) | 2000-05-09 | Paper |
| scientific article; zbMATH DE number 1407682 (Why is no real title available?) | 2000-02-28 | Paper |
\(T\)-resolution: Refinements and model elimination
Journal of Automated Reasoning | 2000-01-25 | Paper |
| scientific article; zbMATH DE number 1354177 (Why is no real title available?) | 1999-10-28 | Paper |
| scientific article; zbMATH DE number 1337735 (Why is no real title available?) | 1999-09-16 | Paper |
Solvable set/hyperset contexts. II: A goal-driven unification algorithm for the blended case
Applicable Algebra in Engineering, Communication and Computing | 1999-06-02 | Paper |
Theories of -layered metric temporal structures: expressiveness and decidability
Logic Journal of the IGPL | 1999-03-30 | Paper |
Finite families with few symmetric differences
Proceedings of the American Mathematical Society | 1999-01-25 | Paper |
| scientific article; zbMATH DE number 1140684 (Why is no real title available?) | 1998-04-13 | Paper |
Modal deduction in second-order logic and set theory - I
Journal Of Logic And Computation | 1997-06-10 | Paper |
Decidability results for metric and layered temporal logics
Notre Dame Journal of Formal Logic | 1997-03-19 | Paper |
Witnessing differences without redundancies
Proceedings of the American Mathematical Society | 1997-02-19 | Paper |
Complementation in the lattice of equivalence relations
Discrete Mathematics | 1996-12-08 | Paper |
Solvable set/hyperset contexts: I. Some decision procedures for the pure, finite case
Communications on Pure and Applied Mathematics | 1996-11-04 | Paper |
\(T\)-theorem proving. I
Journal of Symbolic Computation | 1996-06-04 | Paper |
Decidability of ∀*∀‐Sentences in Membership Theories
Mathematical Logic Quarterly | 1996-05-02 | Paper |
A set-theoretic translation method for polymodal logics
Journal of Automated Reasoning | 1995-12-20 | Paper |
Undecidability results for restricted universally quantified formulae of set theory
Communications on Pure and Applied Mathematics | 1994-10-17 | Paper |
A derived algorithm for evaluating \(\varepsilon\)-expressions over abstract sets
Journal of Symbolic Computation | 1994-09-26 | Paper |
THE DECISION PROBLEM FOR RESTRICTED UNIVERSAL QUANTIFICATION IN SET THEORY AND THE AXIOM OF FOUNDATION
Mathematical Logic Quarterly | 1994-07-11 | Paper |
Expressing infinity without foundation
Journal of Symbolic Logic | 1992-06-27 | 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: XIII. Model graphs, reflection and decidability
Journal of Automated Reasoning | 1991-01-01 | Paper |
Note on "The Logically Simplest Form of the Infinity Axiom"
Proceedings of the American Mathematical Society | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4162853 (Why is no real title available?) | 1988-01-01 | Paper |
Decision procedures for elementary sublanguages of set theory IX. Unsolvability of the decision problem for a restricted subclass of the Δ0-formulas in set theory
Communications on Pure and Applied Mathematics | 1988-01-01 | Paper |
| The Logically Simplest Form of the Infinity Axiom | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4116495 (Why is no real title available?) | 1987-01-01 | Paper |
In Memory of Martin Davis
(available as arXiv preprint) | N/A | Paper |
