| Publication | Date of Publication | Type |
|---|
| On the power of automata minimization in reactive synthesis | 2024-12-06 | Paper |
| Logical algorithmics: from theory to practice (invited talk) | 2024-10-08 | Paper |
| Singly exponential translation of alternating weak Büchi automata to unambiguous Büchi automata | 2024-06-26 | Paper |
| An automata-theoretic approach to linear temporal logic | 2024-06-21 | Paper |
| Finite-trace and generalized-reactivity specifications in temporal synthesis | 2024-03-11 | Paper |
| Safety and co-safety comparator automata for discounted-sum inclusion | 2024-02-16 | Paper |
| Satisfiability checking for mission-time LTL | 2024-02-16 | Paper |
| ZDD Boolean synthesis | 2024-01-23 | Paper |
| Towards a grand unification of Büchi complementation constructions | 2023-08-10 | Paper |
| A space-efficient on-the-fly algorithm for real-time model checking | 2023-06-28 | Paper |
| From linear temporal logics to Büchi automata: the early and simple principle | 2023-05-26 | Paper |
| On the power of finite ambiguity in Büchi complementation | 2023-05-19 | Paper |
| On the complexity of verifying concurrent transition systems | 2023-05-17 | Paper |
| Functional synthesis via input-output separation | 2023-05-08 | Paper |
| Automata vs linear-programming discounted-sum inclusion | 2023-05-05 | Paper |
| Congruence Relations for Büchi Automata | 2023-04-21 | Paper |
| Solving Quantum-Inspired Perfect Matching Problems via Tutte's Theorem-Based Hybrid Boolean Constraints | 2023-01-24 | Paper |
| Satisfiability checking for mission-time \textsf{LTL} (MLTL) | 2022-12-08 | Paper |
| Divide-and-Conquer Determinization of Büchi Automata Based on SCC Decomposition | 2022-12-07 | Paper |
| Quantum-Inspired Perfect Matching under Vertex-Color Constraints | 2022-09-26 | Paper |
| A nonstandard approach to the logical omniscience problem | 2022-09-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5101346 | 2022-08-30 | Paper |
| Sequential Relational Decomposition | 2022-08-02 | Paper |
| Linear temporal logic -- from infinite to finite horizon | 2022-06-22 | Paper |
| Adapting behaviors via reactive synthesis | 2022-03-25 | Paper |
| ProCount: weighted projected model counting with graded project-join trees | 2022-03-22 | Paper |
| On the Unreasonable Effectiveness of SAT Solvers | 2022-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5020996 | 2022-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5021010 | 2022-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5021011 | 2022-01-11 | Paper |
| Verification | 2021-11-12 | Paper |
| Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions | 2021-11-02 | Paper |
| SAT-based explicit \(\mathsf{LTL}_f\) satisfiability checking | 2021-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009412 | 2021-08-04 | Paper |
| On satisficing in quantitative games | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4992510 | 2021-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4964712 | 2021-03-03 | Paper |
| Sequential Relational Decomposition | 2021-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5144653 | 2021-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5144683 | 2021-01-19 | Paper |
| Knowledge-based programs | 2020-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136330 | 2020-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136333 | 2020-11-25 | Paper |
| Infinitary logic for computer science | 2019-12-04 | Paper |
| Not all FPRASs are equal: demystifying FPRASs for DNF-counting | 2019-11-27 | Paper |
| SAT-based explicit LTL reasoning and its application to satisfiability checking | 2019-11-18 | Paper |
| First-order vs. second-order encodings for \textsc{ltl}\(_f\)-to-automata translation | 2019-10-15 | Paper |
| Alternating automata: Unifying truth and validity checking for temporal logics | 2019-10-01 | Paper |
| In memoriam Paris C. Kanellakis | 2019-08-09 | Paper |
| Random Models for Evaluating Efficient Büchi Universality Checking | 2019-07-24 | Paper |
| BDD-Based Boolean Functional Synthesis | 2019-05-03 | Paper |
| Accelerating LTL satisfiability checking by SAT solvers | 2019-01-31 | Paper |
| Solving parity games: explicit vs symbolic | 2018-11-07 | Paper |
| Comparator automata in quantitative verification | 2018-07-17 | Paper |
| Mode-Target Games: Reactive Synthesis for Control Applications | 2018-06-27 | Paper |
| An explicit transition system construction approach to LTL satisfiability checking | 2018-03-29 | Paper |
| Supervisory control and reactive synthesis: a comparative introduction | 2018-01-31 | Paper |
| Knowledge-based programs | 2017-09-29 | Paper |
| Regular queries on graph databases | 2017-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5283016 | 2017-07-18 | Paper |
| From linear time to branching time | 2017-07-12 | Paper |
| Solving Partial-Information Stochastic Parity Games | 2017-07-03 | Paper |
| Regular Real Analysis | 2017-07-03 | Paper |
| Regular Queries on Graph Databases. | 2017-06-13 | Paper |
| Iterative temporal motion planning for hybrid systems in partially unknown environments | 2017-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2980973 | 2017-05-08 | Paper |
| Relentful strategic reasoning in alternating-time temporal logic | 2017-01-31 | Paper |
| Solving Parity Games Using an Automata-Based Algorithm | 2016-11-09 | Paper |
| Synthesis with rational environments | 2016-09-16 | Paper |
| Semantic Acyclicity on Graph Databases | 2016-08-16 | Paper |
| On computing minimal independent support and its applications to sampling and counting | 2016-04-12 | Paper |
| Profile trees for Büchi word automata, with application to determinization | 2015-12-07 | Paper |
| The Complexity of Synthesis from Probabilistic Components | 2015-11-04 | Paper |
| Reasoning About Strategies | 2015-09-17 | Paper |
| Parametric real-time reasoning | 2015-05-07 | Paper |
| Monotone monadic SNP and constraint satisfaction | 2015-05-07 | Paper |
| From Löwenheim to PSL and SVA | 2015-02-10 | Paper |
| State of B\"uchi Complementation | 2015-01-15 | Paper |
| Proving that programs eventually do something good | 2014-09-12 | Paper |
| Synthesis from Probabilistic Components | 2014-07-31 | Paper |
| The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies | 2014-04-16 | Paper |
| Temporal property verification as a program analysis task | 2014-03-28 | Paper |
| Optimized temporal monitors for SystemcC | 2014-03-28 | Paper |
| On simplification of schema mappings | 2014-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2849589 | 2013-09-20 | Paper |
| Verification of Open Systems | 2013-06-18 | Paper |
| Pushdown module checking with imperfect information | 2013-06-06 | Paper |
| Unifying B\"uchi Complementation Constructions | 2013-04-09 | Paper |
| What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic | 2012-09-25 | Paper |
| Unifying Büchi Complementation Constructions. | 2012-09-18 | Paper |
| Synthesis from Probabilistic Components. | 2012-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2908844 | 2012-08-29 | Paper |
| \textit{Once} and \textit{for all} | 2012-08-17 | Paper |
| Synthesizing Probabilistic Composers | 2012-06-22 | Paper |
| B\"uchi Complementation and Size-Change Termination | 2012-04-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113724 | 2012-01-23 | Paper |
| Dynamic Reactive Modules | 2011-09-02 | Paper |
| On Bounded Specifications | 2011-05-06 | Paper |
| The Complexity of Integer Bound Propagation | 2011-05-04 | Paper |
| Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics | 2011-04-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3086936 | 2011-03-30 | Paper |
| State of Büchi Complementation | 2011-02-11 | Paper |
| Synthesis of Trigger Properties | 2011-01-07 | Paper |
| Relentful Strategic Reasoning in Alternating-Time Temporal Logic | 2011-01-07 | Paper |
| An Automata-Theoretic Approach to Infinite-State Systems | 2010-09-07 | Paper |
| Efficient Büchi Universality Checking | 2010-04-27 | Paper |
| Computer Aided Verification | 2010-04-20 | Paper |
| Automated Deduction – CADE-19 | 2010-04-20 | Paper |
| Verification: Theory and Practice | 2010-03-23 | Paper |
| Correct Hardware Design and Verification Methods | 2010-02-05 | Paper |
| Correct Hardware Design and Verification Methods | 2010-02-05 | Paper |
| BDD-based decision procedures for the modal logic K ★ | 2009-11-30 | Paper |
| Hybrid systems: From verification to falsification by combining motion planning and discrete search | 2009-11-23 | Paper |
| From liveness to promptness | 2009-11-23 | Paper |
| Multi-Objective Model Checking of Markov Decision Processes | 2009-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3624089 | 2009-04-28 | Paper |
| Synthesis from Component Libraries | 2009-03-31 | Paper |
| Büchi Complementation and Size-Change Termination | 2009-03-31 | Paper |
| Falsification of LTL Safety Properties in Hybrid Systems | 2009-03-31 | Paper |
| From Philosophical to Industrial Logics | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3597155 | 2009-02-09 | Paper |
| A Logical Approach to Constraint Satisfaction | 2009-01-22 | Paper |
| On the expressive power of Datalog: tools and a case study. | 2008-12-21 | Paper |
| Weak alternating automata are not that weak | 2008-12-21 | Paper |
| The Complexity of Enriched Mu-Calculi | 2008-11-13 | Paper |
| Pushdown Module Checking with Imperfect Information | 2008-09-18 | Paper |
| Principles and Practice of Constraint Programming – CP 2004 | 2008-09-09 | Paper |
| Principles and Practice of Constraint Programming – CP 2004 | 2008-09-09 | Paper |
| An Analysis of Slow Convergence in Interval Propagation | 2008-09-02 | Paper |
| Open Implication | 2008-08-19 | Paper |
| From Church and Prior to PSL | 2008-07-15 | Paper |
| Branching vs. Linear Time: Semantical Perspective | 2008-07-03 | Paper |
| Linear-Time Model Checking: Automata Theory in Practice | 2008-06-10 | Paper |
| Experimental Evaluation of Classical Automata Constructions | 2008-05-27 | Paper |
| Treewidth in Verification: Local vs. Global | 2008-05-27 | Paper |
| On Locally Checkable Properties | 2008-05-27 | Paper |
| An automata-theoretic approach to branching-time model checking | 2008-05-05 | Paper |
| Automata-Theoretic Model Checking Revisited | 2008-04-04 | Paper |
| From Monadic Logic to PSL | 2008-03-25 | Paper |
| Aggregating disparate estimates of chance | 2008-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5435639 | 2008-01-14 | Paper |
| A continuous–discontinuous second‐order transition in the satisfiability of random Horn‐SAT formulas | 2008-01-08 | Paper |
| From Liveness to Promptness | 2007-11-29 | Paper |
| Hybrid Systems: From Verification to Falsification | 2007-11-29 | Paper |
| GSTE is partitioned model checking | 2007-10-11 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| Tools and Algorithms for the Construction and Analysis of Systems | 2007-09-28 | Paper |
| The Complexity of Enriched μ-Calculi | 2007-09-11 | Paper |
| Safraless Compositional Synthesis | 2007-09-05 | Paper |
| Multi-objective Model Checking of Markov Decision Processes | 2007-09-03 | Paper |
| Property-Driven Partitioning for Abstraction Refinement | 2007-09-03 | Paper |
| The Büchi Complementation Saga | 2007-09-03 | Paper |
| View-based query processing: on the relationship between rewriting, answering and losslessness | 2007-03-12 | Paper |
| Symbolic techniques in satisfiability solving | 2007-01-24 | Paper |
| Coverage metrics for temporal logic model checking | 2006-11-17 | Paper |
| Automated Technology for Verification and Analysis | 2006-10-25 | Paper |
| Correct Hardware Design and Verification Methods | 2006-10-20 | Paper |
| First-order logic with two variables and unary temporal logic | 2006-10-10 | Paper |
| BÜCHI COMPLEMENTATION MADE TIGHTER | 2006-08-21 | Paper |
| Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques | 2006-07-07 | Paper |
| Computer Aided Verification | 2006-01-10 | Paper |
| Computer Aided Verification | 2006-01-10 | Paper |
| Relating word and tree automata | 2005-12-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5714249 | 2005-12-28 | Paper |
| Theory and Applications of Satisfiability Testing | 2005-12-16 | Paper |
| From complementation to certification | 2005-12-06 | Paper |
| Tools and Algorithms for the Construction and Analysis of Systems | 2005-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5692280 | 2005-09-28 | Paper |
| Database Theory - ICDT 2005 | 2005-09-13 | Paper |
| Database Theory - ICDT 2005 | 2005-09-13 | Paper |
| Computer Aided Verification | 2005-08-25 | Paper |
| Computer Aided Verification | 2005-08-25 | Paper |
| Computer Aided Verification | 2005-08-25 | Paper |
| Decidable containment of recursive queries | 2005-06-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4661971 | 2005-03-30 | Paper |
| Complete Axiomatizations for Reasoning about Knowledge and Time | 2005-02-21 | Paper |
| Finite model theory and its applications. | 2005-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4817542 | 2004-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4817549 | 2004-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4809040 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4809076 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4475626 | 2004-08-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472249 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472441 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473023 | 2004-08-04 | Paper |
| Random 3-SAT: The plot thickens | 2004-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449164 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449213 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4807832 | 2003-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4428305 | 2003-09-15 | Paper |
| From bidirectionality to alternation. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4417914 | 2003-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4417922 | 2003-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414545 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708958 | 2003-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4804910 | 2003-05-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542592 | 2003-02-19 | Paper |
| A nonstandard approach to the logical omniscience problem | 2003-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4791853 | 2003-02-03 | Paper |
| Module checking | 2003-01-14 | Paper |
| On the complexity of verifying concurrent transition systems | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536596 | 2002-11-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779176 | 2002-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536345 | 2002-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536385 | 2002-11-04 | Paper |
| Bisimulation minimization and symbolic model checking | 2002-09-18 | Paper |
| Rewriting of regular expressions and regular path queries | 2002-09-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551135 | 2002-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4539599 | 2002-07-10 | Paper |
| Verification by augmented abstraction: The automata-theoretic view | 2002-04-28 | Paper |
| Model checking of safety properties | 2002-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2771059 | 2002-02-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2771062 | 2002-02-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2769435 | 2002-02-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2769612 | 2002-02-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754072 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754101 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2741533 | 2001-09-24 | Paper |
| On the Unusual Effectiveness of Logic in Computer Science | 2001-09-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4494388 | 2001-05-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525271 | 2001-01-22 | Paper |
| Conjunctive-query containment and constraint satisfaction | 2000-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4490750 | 2000-07-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952307 | 2000-05-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942015 | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4936139 | 2000-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4936149 | 2000-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4251911 | 2000-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4270071 | 1999-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4251063 | 1999-11-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4267798 | 1999-10-20 | Paper |
| Church's Problem Revisited | 1999-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4259985 | 1999-09-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4259992 | 1999-09-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4255562 | 1999-08-17 | Paper |
| Common knowledge revisited | 1999-06-24 | Paper |
| Computational model theory: an overview | 1999-04-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4219045 | 1999-03-25 | Paper |
| The hierarchical approach to modeling knowledge and common knowledge | 1999-01-01 | Paper |
| The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory | 1998-09-21 | Paper |
| Fixpoint logics, relational machines, and computational complexity | 1998-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4353561 | 1997-09-10 | Paper |
| On the Decision Problem for Two-Variable First-Order Logic | 1997-06-30 | Paper |
| Undecidable boundedness problems for datalog programs | 1997-04-17 | Paper |
| On the equivalence of recursive and nonrecursive Datalog programs | 1997-03-18 | Paper |
| Computing with infinitary logic | 1997-02-28 | Paper |
| IN MEMORIAM Paris C. Kanellakis (1953–1995) | 1996-06-04 | Paper |
| Reasoning about infinite computations | 1995-12-13 | Paper |
| On monadic NP vs monadic co-NP | 1995-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4845472 | 1995-09-11 | Paper |
| On the complexity of queries in the logical data model | 1994-11-06 | Paper |
| What can machines know? | 1994-08-21 | Paper |
| A model-theoretic analysis of knowledge | 1994-08-21 | Paper |
| Undecidable optimization problems for database logic programs | 1993-12-06 | Paper |
| Logical query optimization by proof-tree transformation | 1993-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035346 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037099 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037388 | 1993-05-18 | Paper |
| What is an inference rule? | 1993-04-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028804 | 1993-03-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4016548 | 1993-01-16 | Paper |
| Infinitary logics and 0-1 laws | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4010359 | 1992-09-27 | Paper |
| Verification of concurrent programs: The automata-theoretic framework | 1991-01-01 | Paper |
| Endmarkers can make a difference | 1990-01-01 | Paper |
| 0-1 laws and decision problems for fragments of second-order logic | 1990-01-01 | Paper |
| Polynomial-time implication problems for unary inclusion dependencies | 1990-01-01 | Paper |
| A note on the reduction of two-way automata to one-way automata | 1989-01-01 | Paper |
| The complexity of reasoning about knowledge and time. I: Lower bounds | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3204443 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3798297 | 1988-01-01 | Paper |
| Querying logical databases | 1986-01-01 | Paper |
| Automata-theoretic techniques for modal logics of programs | 1986-01-01 | Paper |
| On the expressive power of data dependencies | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4728289 | 1986-01-01 | Paper |
| Formal systems for join dependencies | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3740223 | 1985-01-01 | Paper |
| The Implication Problem for Functional and Inclusion Dependencies is Undecidable | 1985-01-01 | Paper |
| A note on lossless database decompositions | 1984-01-01 | Paper |
| The implication and finite implication problems for typed template dependencies | 1984-01-01 | Paper |
| Formal Systems for Tuple and Equality Generating Dependencies | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3341881 | 1984-01-01 | Paper |
| On the foundations of the universal relation model | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3677203 | 1984-01-01 | Paper |
| On acyclic database decompositions | 1984-01-01 | Paper |
| A Proof Procedure for Data Dependencies | 1984-01-01 | Paper |
| Inferring multivalued dependencies from functional and join dependencies | 1983-01-01 | Paper |
| Armstrong databases for functional and inclusion dependencies | 1983-01-01 | Paper |
| The decision problem for database dependencies | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3912018 | 1981-01-01 | Paper |
