Search Results - Computer Science - Logic in Computer Science

Superposition for Lambda-Free Higher-Order Logic by Bentkamp, Alexander, Blanchette, Jasmin, Cruanes, Simon, Waldmann, Uwe

“…$-free higher-order logic, two formalisms that allow partial application and applied variables…”
Get full text

text{TT}^{\Box}_{\mathcal C}$: a Family of Extensional Type Theories with Effectful Realizers of Continuity by Cohen, Liron, Rahli, Vincent

“…$\text{TT}^{\Box}_{{\mathcal C}}$ is a generic family of effectful, extensional type theories with a forcing interpretation parameterized by modalities. This…”
Get full text

Semiring Provenance for B\"uchi Games: Strategy Analysis with Absorptive Polynomials by Grädel, Erich, Lücking, Niels, Naaf, Matthias

“…This paper presents a case study for the application of semiring semantics for fixed-point formulae to the analysis of strategies in B\"uchi games. Semiring…”
Get full text

Modalities in homotopy type theory by Rijke, Egbert, Shulman, Michael, Spitters, Bas

“…Univalent homotopy type theory (HoTT) may be seen as a language for the category of $\infty$-groupoids. It is being developed as a new foundation for…”
Get full text

Checkpoint-based rollback recovery in session programming by Mezzina, Claudio Antares, Tiezzi, Francesco, Yoshida, Nobuko

“…To react to unforeseen circumstances or amend abnormal situations in communication-centric systems, programmers are in charge of "undoing" the interactions…”
Get full text

SAT-Inspired Higher-Order Eliminations by Blanchette, Jasmin, Vukmirović, Petar

“…We generalize several propositional preprocessing techniques to higher-order logic, building on existing first-order generalizations…”
Get full text

A System of Interaction and Structure III: The Complexity of BV and Pomset Logic by Nguyên, Lê Thành Dũng, Straßburger, Lutz

“…Pomset logic and BV are both logics that extend multiplicative linear logic (with Mix) with a third connective that is self-dual and non-commutative…”
Get full text

Modularity and Combination of Associative Commutative Congruence Closure Algorithms enriched with Semantic Properties by Kapur, Deepak

“…Algorithms for computing congruence closure of ground equations over uninterpreted symbols and interpreted symbols satisfying associativity and commutativity…”
Get full text

Quadratic Word Equations with Length Constraints, Counter Systems, and Presburger Arithmetic with Divisibility by Lin, Anthony W., Majumdar, Rupak

“…Word equations are a crucial element in the theoretical foundation of constraint solving over strings. A word equation relates two words over string variables…”
Get full text

Proceedings Twentieth International Symposium on Logical and Semantic Frameworks with Applications by Barbosa, Haniel, Ringeissen, Christophe

“…This volume contains the proceedings of the 20th Workshop on Logical and Semantic Frameworks with Applications (LSFA 2025), which was held in Brasilia, the…”
Get full text

Matching Logic by Rosu, Grigore

“…This paper presents matching logic, a first-order logic (FOL) variant for specifying and reasoning about structure by means of patterns and pattern matching…”
Get full text

Shrub-depth: Capturing Height of Dense Graphs by Ganian, Robert, Hliněný, Petr, Nešetřil, Jaroslav, Obdržálek, Jan, de Mendez, Patrice Ossona

“…The recent increase of interest in the graph invariant called tree-depth and in its applications in algorithms and logic on graphs led to a natural question…”
Get full text

On Tools for Completeness of Kleene Algebra with Hypotheses by Pous, Damien, Rot, Jurriaan, Wagemaker, Jana

“…In the literature on Kleene algebra, a number of variants have been proposed which impose additional structure specified by a theory, such as Kleene algebra…”
Get full text

Games Where You Can Play Optimally with Arena-Independent Finite Memory by Bouyer, Patricia, Roux, Stéphane Le, Oualhadj, Youssouf, Randour, Mickael, Vandenhove, Pierre

“…For decades, two-player (antagonistic) games on graphs have been a framework of choice for many important problems in theoretical computer science…”
Get full text

Integration in Cones by Ehrhard, Thomas, Geoffroy, Guillaume

“…Measurable cones, with linear and measurable functions as morphisms, are a model of intuitionistic linear logic and of call-by-name probabilistic PCF which accommodates "continuous data types" such as the real line…”
Get full text

Dynamic Cantor Derivative Logic by Fernández-Duque, David, Montacute, Yoàv

“…Topological semantics for modal logic based on the Cantor derivative operator gives rise to derivative logics, also referred to as $d$-logics…”
Get full text

A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct by Guha, Shibashis, Jecker, Ismaël, Lehtinen, Karoliina, Zimmermann, Martin

“…We study the expressiveness and succinctness of history-deterministic pushdown automata (HD-PDA) over finite words, that is, pushdown automata whose…”
Get full text

A Logic for Monitoring Dynamic Networks of Spatially-distributed Cyber-Physical Systems by Nenzi, L., Bartocci, E., Bortolussi, L., Loreti, M.

“… We revisit here the Spatio-Temporal Reach and Escape Logic (STREL), a logic-based formal language designed to express and monitor spatio-temporal requirements over the execution of mobile and spatially distributed CPS…”
Get full text

The Many-Worlds Calculus by Chardonnet, Kostia, de Visme, Marc, Valiron, Benoît, Vilmart, Renaud

“…In this paper, we explore the interaction between two monoidal structures: a multiplicative one, for the encoding of pairing, and an additive one, for the…”
Get full text

Automata theory in nominal sets by Bojańczyk, Mikołaj, Klin, Bartek, Lasota, Sławomir

“…We study languages over infinite alphabets equipped with some structure that can be tested by recognizing automata. We develop a framework for studying such…”
Get full text