| Publication | Date of Publication | Type |
|---|
| Truth-value constants in multi-valued logics | 2024-10-01 | Paper |
| Minimum dominating sets of intervals on lines | 2023-12-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5869601 | 2022-09-28 | Paper |
| Extending the Lambek calculus with classical negation | 2022-03-23 | Paper |
| On sets of linear forms of maximal complexity | 2021-10-09 | Paper |
| Calculi for many-valued logics | 2021-08-11 | Paper |
| DE MORGAN INTERPRETATION OF THE LAMBEK–GRISHIN CALCULUS | 2021-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5212086 | 2020-01-24 | Paper |
| Extensions for open default theories via the domain closure assumption | 2019-10-08 | Paper |
| Structural rules for multi-valued logics | 2019-05-31 | Paper |
| Closure under reversal of languages over infinite alphabets | 2018-11-28 | Paper |
| A proof-theoretic semantics for exclusion | 2018-01-12 | Paper |
| Revisiting quantification in autoepistemic logic | 2017-06-13 | Paper |
| An Upper Bound on the Complexity of Multiplication of Polynomials Modulo a Power of an Irreducible Polynomial | 2017-06-08 | Paper |
| The Lambek calculus extended with intuitionistic propositional logic | 2016-10-27 | Paper |
| LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata | 2016-08-04 | Paper |
| LINEAR CONJUNCTIVE GRAMMARS AND ONE-TURN SYNCHRONIZED ALTERNATING PUSHDOWN AUTOMATA | 2015-01-21 | Paper |
| Relational semantics of the Lambek calculus extended with classical propositional logic | 2014-09-26 | Paper |
| A note on the emptiness problem for alternating finite-memory automata | 2014-03-13 | Paper |
| Conjunctive grammars and alternating pushdown automata | 2013-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3007253 | 2011-06-21 | Paper |
| LR(0) Conjunctive Grammars and Deterministic Synchronized Alternating Pushdown Automata | 2011-06-17 | Paper |
| Linear Conjunctive Grammars and One-Turn Synchronized Alternating Pushdown Automata | 2011-05-11 | Paper |
| FINITE-MEMORY AUTOMATA WITH NON-DETERMINISTIC REASSIGNMENT | 2010-11-11 | Paper |
| Extending free pregroups with lower bounds | 2010-09-20 | Paper |
| Mildly Context-Sensitive Languages via Buffer Augmented Pregroup Grammars | 2010-09-07 | Paper |
| A Note on Two-pebble Automata Over Infinite Alphabets | 2010-05-25 | Paper |
| A non-preferential semantics of non-monotonic modal logic | 2009-07-06 | Paper |
| Notions of sameness by default and their application to anaphora, vagueness, and uncertain reasoning | 2009-06-17 | Paper |
| The Power of Non-deterministic Reassignment in Infinite-Alphabet Pushdown Automata | 2009-06-03 | Paper |
| Commutation-augmented pregroup grammars and push-down automata with cancellation | 2008-10-08 | Paper |
| Conjunctive Grammars and Alternating Pushdown Automata | 2008-07-10 | Paper |
| First-order ground non-monotonic modal logic | 2008-06-20 | Paper |
| The modal logic of cluster-decomposable Kripke interpretations | 2008-04-29 | Paper |
| Tree Automata over Infinite Alphabets | 2008-03-25 | Paper |
| Commutation-augmented pregroup grammars and mildly context-sensitive languages | 2008-01-21 | Paper |
| Polynomial multiplication over finite fields: from quadratic to straight-line complexity | 2007-01-24 | Paper |
| Invariance under stuttering in a temporal logic of actions | 2007-01-22 | Paper |
| Default theories over monadic languages | 2007-01-09 | Paper |
| Regular expressions for languages over infinite alphabets | 2006-06-19 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| A Lower Bound on the Complexity of Polynomial Multiplication over Finite Fields | 2005-09-16 | Paper |
| Computing and Combinatorics | 2005-06-15 | Paper |
| A Real-time Semantics of Temporal Logic of Actions | 2004-09-07 | Paper |
| An algebraic characterization of deterministic regular languages over infinite alphabets. | 2004-03-14 | Paper |
| A comparative study of open default theories | 2003-02-04 | Paper |
| The Expressive Power of Temporal Logic of Actions | 2002-11-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4507867 | 2000-11-21 | Paper |
| Finite-memory automata | 2000-06-15 | Paper |
| Open default theories over closed domains | 2000-06-13 | Paper |
| Similarity preservation in default logic | 2000-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4270065 | 1999-11-10 | Paper |
| Extensions for open default theories via the domain closure assumption | 1998-11-19 | Paper |
| The expressive power of second-order propositional modal logic | 1998-09-02 | Paper |
| A note on the stable model semantics for logic programs | 1998-08-13 | Paper |
| Context-free languages over infinite alphabets | 1998-05-24 | Paper |
| The elimination of \textit{de re} formulas | 1997-11-20 | Paper |
| Interpretations of open default theories in non-monotonic logics | 1997-05-11 | Paper |
| The power of the ``always operator in first-order temporal logic | 1997-02-27 | Paper |
| Semantical Analysis of Logic of Actions | 1995-04-17 | Paper |
| Nonmonotonic default modal logics | 1994-11-13 | Paper |
| A branching time logic with past operators | 1994-11-06 | Paper |
| A classification of algorithms for multiplying polynomials of small degree over finite fields | 1993-01-12 | Paper |
| Finite automata on directed graphs | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3970695 | 1992-06-25 | Paper |
| Multiplication of Polynomials over Finite Fields | 1990-01-01 | Paper |
| Finite and Circular Path Models for Branching Time Logics | 1990-01-01 | Paper |
| Multiplicative complexity of polynomial multiplication over finite fields | 1989-01-01 | Paper |
| A note on probabilistically verifying integer and polynomial products | 1989-01-01 | Paper |
| cyclotomic polynomials and units in cyclotomic number fields | 1988-01-01 | Paper |
| Addition requirements for matrix and transposed matrix products | 1988-01-01 | Paper |
| Nonstandard connectives of intuitionistic propositional logic | 1988-01-01 | Paper |
| An algorithm for polynomial multiplication that does not depend on the ring constants | 1988-01-01 | Paper |
| A lower bound for polynomial multiplication | 1985-01-01 | Paper |
| A classification of \(\omega\)-regular languages | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3935472 | 1981-01-01 | Paper |
