Towards Efficient Exact Synthesis for Linear Hybrid Systems
Towards Normal Forms for GHZ/W Calculus
Towards Parameterized Regular Type Inference Using Set Constraints
Towards reduction of Paradigm coordination models
Towards Theory of Massive-Parallel Proofs. Cellular Automata Approach
Tracing the Man in the Middle in Monoidal Categories
Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough
Transfer of semantics from argumentation frameworks to logic programming A preliminary report
Transformation-Based Bottom-Up Computation of the Well-Founded Model
Transforming Outermost into Context-Sensitive Rewriting
Transforming structures by set interpretations
Translating a first-order modal language to relational algebra
Transport of finiteness structures and applications
Tree-Automatic Well-Founded Trees
Tree-width for first order formulae
Trees over Infinite Structures and Path Logics with Synchronization
Trichotomy and Dichotomy Results on the Complexity of Reasoning with Disjunctive Logic Programs
Truly On-The-Fly LTL Model Checking
TRX: A Formally Verified Parser Interpreter
Tuplix Calculus