| Publication | Date of Publication | Type |
|---|
Towards an efficient implementation of a tableau method for reactive safety specifications
Journal of Logical and Algebraic Methods in Programming | 2024-11-26 | Paper |
Towards the exact complexity of realizability for safety LTL
Journal of Logical and Algebraic Methods in Programming | 2024-10-08 | Paper |
| One-pass Context-based Tableaux Systems for CTL and ECTL | 2023-11-02 | Paper |
Tableaux for realizability of safety specifications
Formal Methods | 2023-08-17 | Paper |
| Towards certified model checking for PLTL using one-pass tableaux | 2023-02-03 | Paper |
Exact learning: on the boundary between Horn and CNF
ACM Transactions on Computation Theory | 2022-12-05 | Paper |
Tableaux and sequent calculi for \textsf{CTL} and \textsf{ECTL}: satisfiability test with certifying proofs and models
Journal of Logical and Algebraic Methods in Programming | 2022-11-16 | Paper |
Degrees and reducibilities of easy tally sets
Mathematical Foundations of Computer Science 1994 | 2022-08-18 | Paper |
| Extending fairness expressibility of ECTL\(^+\): a tree-style one-pass tableau approach | 2022-05-28 | Paper |
Branching-time logic \(\mathsf{ECTL}^{\#}\) and its tree-style one-pass tableau: extending fairness expressibility of \(\mathsf{ECTL}^+\)
Theoretical Computer Science | 2020-04-21 | Paper |
Automatic white-box testing of first-order logic ontologies
Journal Of Logic And Computation | 2020-02-03 | Paper |
Exact learning of multivalued dependency formulas
Theoretical Computer Science | 2018-03-12 | Paper |
On the sparse set conjecture for sets with low density
STACS 95 | 2017-12-04 | Paper |
Exact Learning of Multivalued Dependencies
Lecture Notes in Computer Science | 2016-11-30 | Paper |
Compressibility and uniform complexity
Information Processing Letters | 2016-05-26 | Paper |
| Systematic semantic tableaux for PLTL | 2014-01-10 | Paper |
Invariant-free clausal temporal resolution
Journal of Automated Reasoning | 2013-07-05 | Paper |
Negative results on learning multivalued dependencies with queries
Information Processing Letters | 2013-04-04 | Paper |
Translating propositional extended conjunctions of Horn clauses into Boolean circuits
Theoretical Computer Science | 2010-04-15 | Paper |
Dual systems of tableaux and sequents for PLTL
The Journal of Logic and Algebraic Programming | 2009-11-04 | Paper |
A Cut-Free and Invariant-Free Sequent Calculus for PLTL
Computer Science Logic | 2009-03-05 | Paper |
| scientific article; zbMATH DE number 1453046 (Why is no real title available?) | 2000-07-24 | Paper |
The structure of logarithmic advice complexity classes
Theoretical Computer Science | 1999-01-12 | Paper |
| scientific article; zbMATH DE number 1048038 (Why is no real title available?) | 1997-09-22 | Paper |
A Note on polynomial-size circuits with low resource-bounded Kolmogorov complexity
Mathematical Systems Theory | 1994-08-10 | Paper |
