Depth lower bounds in Stabbing Planes for combinatorial principles

Subjects: “…Computer Science & Information Science…”
Get full text

Robustness against Read Committed for Transaction Templates with Functional Constraints

Subjects: “…Computer Science & Information Science…”
Get full text

Efficient Evaluation of Arbitrary Relational Calculus Queries

Subjects: “…Computer Science & Information Science…”
Get full text

Decision Questions for Probabilistic Automata on Small Alphabets

Subjects: “…Computer Science & Information Science…”
Get full text

Existential Definability over the Subword Ordering

Subjects: “…Computer Science & Information Science…”
Get full text

Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets

Subjects: “…Computer Science & Information Science…”
Get full text

Finitary Simulation of Infinitary $beta$-Reduction via Taylor Expansion, and Applications

Subjects: “…Computer Science & Information Science…”
Get full text

Synchronizability of Communicating Finite State Machines is not Decidable

Subjects: “…Computer Science & Information Science…”
Get full text

Relational Models for the Lambek Calculus with Intersection and Constants

Subjects: “…Computer Science & Information Science…”
Get full text

Space-Fluid Adaptive Sampling by Self-Organisation

Subjects: “…Computer Science & Information Science…”
Get full text

Prioritise the Best Variation

Subjects: “…Computer Science & Information Science…”
Get full text

A System of Interaction and Structure III: The Complexity of BV and Pomset Logic

Subjects: “…Computer Science & Information Science…”
Get full text

The syntactic side of autonomous categories enriched over generalised metric spaces

Subjects: “…Computer Science & Information Science…”
Get full text

Dynamic Cantor Derivative Logic

Subjects: “…Computer Science & Information Science…”
Get full text

A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings

Subjects: “…Computer Science & Information Science…”
Get full text

Model Checking Temporal Properties of Recursive Probabilistic Programs

Subjects: “…Computer Science & Information Science…”
Get full text

Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic

Subjects: “…Computer Science & Information Science…”
Get full text

Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version)

Subjects: “…Computer Science & Information Science…”
Get full text

Overlap Algebras as Almost Discrete Locales

Subjects: “…Computer Science & Information Science…”
Get full text

A Trichotomy for Regular Trail Queries

Subjects: “…Computer Science & Information Science…”
Get full text