Cs-Lo
First-order Fragments with Successor over Infinite Words
A Cut-Free ExpTime Tableau Decision Procedure for the Logic Extending Converse-PDL with Regular Inclusion Axioms
Rewriting Preserving Recognizability of Finite Tree Languages
Nonuniform Coercions via Unification Hints
Formal Derivation of Concurrent Garbage Collectors
Ludics with repetitions (Exponentials, Interactive types and Completeness)
A domain-theoretic investigation of posets of sub-sigma-algebras (extended abstract)
A Family of Encodings for Translating Pseudo-Boolean Constraints into SAT
Efficient Emptiness Check for Timed B"uchi Automata (Extended version)
Geometry of abstraction in quantum computation
Bridging the Gap between Reinforcement Learning and Knowledge Representation: A Logical Off- and On-Policy Framework
Does Treewidth Help in Modal Satisfiability?
Automated Symbolic Analysis of ARBAC-Policies (Extended Version)
Better Quality in Synthesis through Quantitative Objectives
Towards the Development of a Rule-based Drought Early Warning Expert Systems using Indigenous Knowledge
Relating toy models of quantum computation: comprehension, complementarity and dagger mix autonomous categories
Weighted Logics for Nested Words and Algebraic Formal Power Series
Infinite Time Cellular Automata: A Real Computation Model
Multiply-Recursive Upper Bounds with Higmans Lemma
Algebraic Notions of Termination
Classical and Intuitionistic Subexponential Logics are Equally Expressive
Computing with space: a tangle formalism for chora and difference
