Suchergebnisse - "Computer Science - Logic in Computer Science"

text{TT}^{\Box}_{\mathcal C}$ : a Family of Extensional Type Theories with Effectful Realizers of Continuity von 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 …”
Volltext

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

“… We generalize several propositional preprocessing techniques to higher-order logic, building on existing first-order generalizations. These techniques …”
Volltext

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

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

Checkpoint-based rollback recovery in session programming von 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 …”
Volltext

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

“… 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 …”
Volltext

The completeness of reasoning algorithms for clause sets in description logic <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si4.svg" display="inline" id="d1e76"><mml:mi mathvariant="script">ALC</mml:mi></mml:math> von Ken Kaneiwa, Daiki Takahashi

Volltext

Fixed Points Theorems for Non-Transitive Relations von Dubut, Jérémy, Yamada, Akihisa

“… In this paper, we develop an Isabelle/HOL library of order-theoretic fixed-point theorems. We keep our formalization as general as possible: we reprove several …”
Volltext

Parametricity for Nested Types and GADTs von Johann, Patricia, Ghiorzi, Enrico

“… This paper considers parametricity and its consequent free theorems for nested data types. Rather than representing nested types via their Church encodings in …”
Volltext

On The Axioms Of $\ cal{N}$-Adhesive Categories von Davide Castelnovo, Marino Miculan

“… Adhesive and quasiadhesive categories provide a general framework for the study of algebraic graph rewriting systems. In a quasiadhesive category any two …”
Volltext

Modalities in homotopy type theory von 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 …”
Volltext

Multimodal Dependent Type Theory von Gratzer, Daniel, Kavvos, G. A., Nuyts, Andreas, Birkedal, Lars

“… We introduce MTT, a dependent type theory which supports multiple modalities. MTT is parametrized by a mode theory which specifies a collection of modes, …”
Volltext

Proceedings Twentieth International Symposium on Logical and Semantic Frameworks with Applications von 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 …”
Volltext

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

“… We generalize several propositional preprocessing techniques to higher-order logic, building on existing first-order generalizations. These techniques …”
Volltext

A categorical semantics for causal structure von Kissinger, Aleks, Uijlen, Sander

“… We present a categorical construction for modelling causal structures within a general class of process theories that include the theory of classical …”
Volltext

Shrub-depth: Capturing Height of Dense Graphs von 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: …”
Volltext

Coalgebraic Behavioral Metrics von Baldan, Paolo, Bonchi, Filippo, Kerstan, Henning, König, Barbara

“… We study different behavioral metrics, such as those arising from both branching and linear-time semantics, in a coalgebraic setting. Given a …”
Volltext

Decision problems for linear recurrences involving arbitrary real numbers von Neumann, Eike

“… We study the decidability of the Skolem Problem, the Positivity Problem, and the Ultimate Positivity Problem for linear recurrences with real number initial …”
Volltext

Extensional and Intensional Semantics of Bounded and Unbounded Nondeterminism von Laird, James

“… We give extensional and intensional characterizations of functional programs with nondeterminism: as structure preserving functions between biorders, and as …”
Volltext

Two-variable logics with some betweenness relations: Expressiveness, satisfiability and membership von Krebs, Andreas, Lodaya, Kamal, Pandya, Paritosh K., Straubing, Howard

“… We study two extensions of FO2[<], first-order logic interpreted in finite words, in which formulas are restricted to use only two variables. We adjoin to this …”
Volltext

HyperLTL Satisfiability Is Highly Undecidable, HyperCTL $^$is Even Harder von Fortin, Marie, Kuijer, Louwe B., Totzke, Patrick, Zimmermann, Martin

“… Temporal logics for the specification of information-flow properties are able to express relations between multiple executions of a system. The two most …”
Volltext