Cs-Lo
Probabilistic modal {mu}-calculus with independent product
Reasoning over Ontologies with Hidden Content: The Import-by-Query Approach
Rewrite Closure and CF Hedge Automata
Satisfiability and Model Checking of CTL* with Graded Path Modalities
Sequence encoding without induction
Standardization in resource lambda-calculus
Sublogarithmic uniform Boolean proof nets
Taming Past LTL and Flat Counter Systems
The DL-Lite Family and Relations
The Geometry of Types (Long Version)
The Logical Difference for the Lightweight Description Logic EL
The mu-Calculus Alternation Hierarchy Collapses over Structures with Restricted Connectivity
Unfounded Sets and Well-Founded Semantics of Answer Set Programs with Aggregates
Relaxed Operational Semantics of Concurrent Programming Languages
