default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Computational Logic, Volume 23
Volume 23, Number 1, January 2022
- Sandra Kiefer
, Pascal Schweitzer, Erkal Selman:
Graphs Identified by Logics with Counting. 1:1-1:31 - Ferruccio Guidi:
A Formal System for the Universal Quantification of Schematic Variables. 2:1-2:37 - Arnaud Durand, Juha Kontinen, Nicolas de Rugy-Altherre, Jouko Väänänen:
Tractability Frontier of Data Complexity in Team Semantics. 3:1-3:21 - Fabio R. Gallo, Gerardo I. Simari, Maria Vanina Martinez, Natalia Abad Santos, Marcelo A. Falappa:
Local Belief Dynamics in Network Knowledge Bases. 4:1-4:36 - Gilles Barthe, Charlie Jacomme, Steve Kremer:
Universal Equivalence and Majority of Probabilistic Programs over Finite Fields. 5:1-5:42 - Anuj Dawar, Gregory Wilsenach:
Symmetric Circuits for Rank Logic. 6:1-6:35 - Manuel Bodirsky, Marcello Mamino, Caterina Viola:
Piecewise Linear Valued CSPs Solvable by Linear Programming Relaxation. 7:1-7:35
Volume 23, Number 2, April 2022
- Tzanis Anevlavis, Matthew Philippe, Daniel Neider, Paulo Tabuada:
Being Correct Is Not Enough: Efficient Verification Using Robust Linear Temporal Logic. 8:1-8:39 - Shaull Almagor, Dmitry Chistikov, Joël Ouaknine, James Worrell:
O-Minimal Invariants for Discrete-Time Dynamical Systems. 9:1-9:20 - Philippe Balbiani, Hans van Ditmarsch, Saúl Fernández González:
Asynchronous Announcements. 10:1-10:38 - Clemens Kupke, Dirk Pattinson, Lutz Schröder:
Coalgebraic Reasoning with Global Assumptions in Arithmetic Modal Logics. 11:1-11:34 - Moumanti Podder, Maksim Zhukovskii:
Zero-One Laws for Existential First-Order Sentences of Bounded Quantifier Depth. 12:1-12:27 - Erich Grädel, Richard Wilke:
Logics with Multiteam Semantics. 13:1-13:30
Volume 23, Number 3, July 2022
- Benoît Larose, Barnaby Martin, Petar Markovic, Daniël Paulusma, Siani Smith, Stanislav Zivný:
QCSP on Reflexive Tournaments. 14:1-14:22 - Ilya Shapirovsky:
Satisfiability Problems on Sums of Kripke Frames. 15:1-15:25 - Erfan Khaniki:
On Proof Complexity of Resolution over Polynomial Calculus. 16:1-16:24 - Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Parameterized Complexity of Elimination Distance to First-Order Logic Properties. 17:1-17:35 - Daniel Gratzer, Evan Cavallo, G. A. Kavvos, Adrien Guatto, Lars Birkedal:
Modalities and Parametric Adjoints. 18:1-18:29 - Yuan Feng, Sanjiang Li, Mingsheng Ying:
Verification of Distributed Quantum Programs. 19:1-19:40 - Francesco Dagnino:
A Meta-theory for Big-step Semantics. 20:1-20:50
Volume 23, Number 4, October 2022
- Sebastian Enqvist, Valentin Goranko:
The Temporal Logic of Coalitional Goal Assignments in Concurrent Multiplayer Games. 21:1-21:58 - Luca Aceto, Valentina Castiglioni, Wan J. Fokkink, Anna Ingólfsdóttir, Bas Luttik:
Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition? 22:1-22:56 - Jinsheng Chen, Giuseppe Greco, Alessandra Palmigiano, Apostolos Tzimoulis:
Syntactic Completeness of Proper Display Calculi. 23:1-23:46 - Adam Case, Christopher P. Porter:
The Intersection of Algorithmically Random Closed Sets and Effective Dimension. 24:1-24:19 - Jason Z. S. Hu, Brigitte Pientka, Ulrich Schöpp:
A Category Theoretic View of Contextual Types: From Simple Types to Dependent Types. 25:1-25:36 - Chris Barrett, Alessio Guglielmi:
A Subatomic Proof System for Decision Trees. 26:1-26:25 - Simon Doherty, Sadegh Dalvandi, Brijesh Dongol, Heike Wehrheim:
Unifying Operational Weak Memory Verification: An Axiomatic Approach. 27:1-27:39
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-01-15 23:39 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
