• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 27 matches

• 2022
• 
  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? ACM Trans. Comput. Log. 23(4): 22:1-22:56 (2022)
• 
  Shaull Almagor, Dmitry Chistikov, Joël Ouaknine, James Worrell:
  O-Minimal Invariants for Discrete-Time Dynamical Systems. ACM Trans. Comput. Log. 23(2): 9:1-9:20 (2022)
• 
  Tzanis Anevlavis, Matthew Philippe, Daniel Neider, Paulo Tabuada:
  Being Correct Is Not Enough: Efficient Verification Using Robust Linear Temporal Logic. ACM Trans. Comput. Log. 23(2): 8:1-8:39 (2022)
• 
  Philippe Balbiani, Hans van Ditmarsch, Saúl Fernández González:
  Asynchronous Announcements. ACM Trans. Comput. Log. 23(2): 10:1-10:38 (2022)
• 
  Chris Barrett, Alessio Guglielmi:
  A Subatomic Proof System for Decision Trees. ACM Trans. Comput. Log. 23(4): 26:1-26:25 (2022)
• 
  Gilles Barthe, Charlie Jacomme, Steve Kremer:
  Universal Equivalence and Majority of Probabilistic Programs over Finite Fields. ACM Trans. Comput. Log. 23(1): 5:1-5:42 (2022)
• 
  Manuel Bodirsky, Marcello Mamino, Caterina Viola:
  Piecewise Linear Valued CSPs Solvable by Linear Programming Relaxation. ACM Trans. Comput. Log. 23(1): 7:1-7:35 (2022)
• 
  Adam Case, Christopher P. Porter:
  The Intersection of Algorithmically Random Closed Sets and Effective Dimension. ACM Trans. Comput. Log. 23(4): 24:1-24:19 (2022)
• 
  Jinsheng Chen, Giuseppe Greco, Alessandra Palmigiano, Apostolos Tzimoulis:
  Syntactic Completeness of Proper Display Calculi. ACM Trans. Comput. Log. 23(4): 23:1-23:46 (2022)
• 
  Francesco Dagnino:
  A Meta-theory for Big-step Semantics. ACM Trans. Comput. Log. 23(3): 20:1-20:50 (2022)
• 
  Anuj Dawar, Gregory Wilsenach:
  Symmetric Circuits for Rank Logic. ACM Trans. Comput. Log. 23(1): 6:1-6:35 (2022)
• 
  Simon Doherty, Sadegh Dalvandi, Brijesh Dongol, Heike Wehrheim:
  Unifying Operational Weak Memory Verification: An Axiomatic Approach. ACM Trans. Comput. Log. 23(4): 27:1-27:39 (2022)
• 
  Arnaud Durand, Juha Kontinen, Nicolas de Rugy-Altherre, Jouko Väänänen:
  Tractability Frontier of Data Complexity in Team Semantics. ACM Trans. Comput. Log. 23(1): 3:1-3:21 (2022)
• 
  Sebastian Enqvist, Valentin Goranko:
  The Temporal Logic of Coalitional Goal Assignments in Concurrent Multiplayer Games. ACM Trans. Comput. Log. 23(4): 21:1-21:58 (2022)
• 
  Yuan Feng, Sanjiang Li, Mingsheng Ying:
  Verification of Distributed Quantum Programs. ACM Trans. Comput. Log. 23(3): 19:1-19:40 (2022)
• 
  Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
  Parameterized Complexity of Elimination Distance to First-Order Logic Properties. ACM Trans. Comput. Log. 23(3): 17:1-17:35 (2022)
• 
  Fabio R. Gallo, Gerardo I. Simari, Maria Vanina Martinez, Natalia Abad Santos, Marcelo A. Falappa:
  Local Belief Dynamics in Network Knowledge Bases. ACM Trans. Comput. Log. 23(1): 4:1-4:36 (2022)
• 
  Erich Grädel, Richard Wilke:
  Logics with Multiteam Semantics. ACM Trans. Comput. Log. 23(2): 13:1-13:30 (2022)
• 
  Daniel Gratzer, Evan Cavallo, G. A. Kavvos, Adrien Guatto, Lars Birkedal:
  Modalities and Parametric Adjoints. ACM Trans. Comput. Log. 23(3): 18:1-18:29 (2022)
• 
  Ferruccio Guidi:
  A Formal System for the Universal Quantification of Schematic Variables. ACM Trans. Comput. Log. 23(1): 2:1-2:37 (2022)
• 
  Jason Z. S. Hu, Brigitte Pientka, Ulrich Schöpp:
  A Category Theoretic View of Contextual Types: From Simple Types to Dependent Types. ACM Trans. Comput. Log. 23(4): 25:1-25:36 (2022)
• 
  Erfan Khaniki:
  On Proof Complexity of Resolution over Polynomial Calculus. ACM Trans. Comput. Log. 23(3): 16:1-16:24 (2022)
• 
  Sandra Kiefer, Pascal Schweitzer, Erkal Selman:
  Graphs Identified by Logics with Counting. ACM Trans. Comput. Log. 23(1): 1:1-1:31 (2022)
• 
  Clemens Kupke, Dirk Pattinson, Lutz Schröder:
  Coalgebraic Reasoning with Global Assumptions in Arithmetic Modal Logics. ACM Trans. Comput. Log. 23(2): 11:1-11:34 (2022)
• 
  Benoît Larose, Barnaby Martin, Petar Markovic, Daniël Paulusma, Siani Smith, Stanislav Zivný:
  QCSP on Reflexive Tournaments. ACM Trans. Comput. Log. 23(3): 14:1-14:22 (2022)
• 
  Moumanti Podder, Maksim Zhukovskii:
  Zero-One Laws for Existential First-Order Sentences of Bounded Quantifier Depth. ACM Trans. Comput. Log. 23(2): 12:1-12:27 (2022)
• 
  Ilya Shapirovsky:
  Satisfiability Problems on Sums of Kripke Frames. ACM Trans. Comput. Log. 23(3): 15:1-15:25 (2022)