| Modularisation of Sequent Calculi for Normal and Non-normal Modalities |
3 |
| Are Short Proofs Narrow? QBF Resolution Is Not So Simple |
3 |
| Checking Admissibility Using Natural Dualities |
3 |
| A Higher-Order Calculus of Computational Fields |
3 |
| Interval vs. Point Temporal Logic Model Checking: An Expressiveness Comparison |
2 |
| Path Categories and Propositional Identity Types |
2 |
| An Epistemic Strategy Logic |
2 |
| Some Subsystems of Constant-Depth Frege with Parity |
2 |
| Fast Query Answering over Existential Rules |
2 |
| Reasoning about Cognitive Trust in Stochastic Multiagent Systems |
1 |
| Minkowski Games |
1 |
| Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus |
1 |
| Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation |
1 |
| 1-Safe Petri Nets and Special Cube Complexes: Equivalence and Applications |
1 |
| Proof Complexity Meets Algebra |
1 |
| Complexity of Propositional Logics in Team Semantic |
1 |
| Subatomic Proof Systems: Splittable Systems |
1 |
| Compositional Synthesis of Piece-Wise Functions by Learning Classifiers |
1 |
| Hypersequents and Systems of Rules: Embeddings and Applications |
1 |
| Syntax-Preserving Belief Change Operators for Logic Programs |
0 |
| Modular Labelled Sequent Calculi for Abstract Separation Logics |
0 |
| Finite-State Map-Reduce Computation and Relational Algebra Queries |
0 |
| Finite Satisfiability of the Two-Variable Guarded Fragment with Transitive Guards and Related Variants |
0 |
| Definability of Cai-Furer-Immerman Problems in Choiceless Polynomial Time |
0 |
| Quantitative Aspects of Linear and Affine Closed Lambda Terms |
0 |
| Completeness of Flat Coalgebraic Fixpoint Logics |
0 |
| Characterisation of Normalisation Properties form lambda mu using Strict Negated Intersection Types |
0 |
| Typed Nominal Rewriting |
0 |
| A Theoretical and Numerical Analysis of the Worst-Case Size of Reduced Ordered Binary Decision Diagrams |
0 |
| Generalized Eilenberg Theorem: Varieties of Languages in a Category |
0 |
| On the Verification of Livelock-Freedom and Self-Stabilization on Parameterized Rings |
0 |
| Pure Sequent Calculi: Analyticity and Decision Procedure |
0 |
| Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems |
0 |
| A SAT Approach to Branchwidth |
0 |
| An Operational Semantics for the Cognitive Architecture ACT-R and Its Translation to Constraint Handling Rules |
0 |
| Interaction Graphs: Non-Deterministic Automata |
0 |
| Incremental Linearization for Satisfiability and Verification Modulo Nonlinear Arithmetic and Transcendental Functions |
0 |
| Hierarchies in Inclusion Logic with Lax Semantics |
0 |
| Game-Theoretic Semantics for Alternating-Time Temporal Logic |
0 |
| Automated Deduction in Godel Logic |
0 |
| Synchronizing Data Words for Register Automata |
0 |
| Tight Bounds on the Asymptotic Descriptive Complexity of Subgraph Isomorphism |
0 |
| Reasoning about Strategic Abilities: Agents wit h Truly Perfect Recall |
0 |
| The Complexity of Minimal Inference Problem for Conservative Constraint Languages |
0 |
| De Morgan Dual Nominal Quantifiers Modelling Private Names in Non-Commutative Logic |
0 |
| Modal Resolution: Proofs, Layers, and Refinements |
0 |
| Incomplete SMT Techniques for Solving Non-Linear Formulas over the Integers |
0 |
| Probabilistic Epistemic Updates on Algebras |
0 |
| Central Limit Model Checking |
0 |
| A Representation Theorem for Change through Composition of Activities |
0 |
