• 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 25 matches

• 2019
• 
  Bahar Aameri, Michael Grüninger:
  A Representation Theorem for Change through Composition of Activities. ACM Trans. Comput. Log. 20(4): 20:1-20:31 (2019)
• 
  Jirí Adámek, Stefan Milius, Robert S. R. Myers, Henning Urbat:
  Generalized Eilenberg Theorem: Varieties of Languages in a Category. ACM Trans. Comput. Log. 20(1): 3:1-3:47 (2019)
• 
  Albert Atserias, Joanna Ochremiak:
  Proof Complexity Meets Algebra. ACM Trans. Comput. Log. 20(1): 1:1-1:46 (2019)
• 
  Giorgio Audrito, Mirko Viroli, Ferruccio Damiani, Danilo Pianini, Jacob Beal:
  A Higher-Order Calculus of Computational Fields. ACM Trans. Comput. Log. 20(1): 5:1-5:55 (2019)
• 
  Cristina Borralleras, Daniel Larraz, Enric Rodríguez-Carbonell, Albert Oliveras, Albert Rubio:
  Incomplete SMT Techniques for Solving Non-Linear Formulas over the Integers. ACM Trans. Comput. Log. 20(4): 25:1-25:36 (2019)
• 
  Luca Bortolussi, Luca Cardelli, Marta Kwiatkowska, Luca Laurenti:
  Central Limit Model Checking. ACM Trans. Comput. Log. 20(4): 19:1-19:35 (2019)
• 
  Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala:
  Interval vs. Point Temporal Logic Model Checking: An Expressiveness Comparison. ACM Trans. Comput. Log. 20(1): 4:1-4:31 (2019)
• 
  Nils Bulling, Wojciech Jamroga, Matei Popovici:
  Reasoning about Strategic Abilities: Agents with Truly Perfect Recall. ACM Trans. Comput. Log. 20(2): 10:1-10:46 (2019)
• 
  Leonardo Manuel Cabrer, Benjamin Freisberg, George Metcalfe, Hilary A. Priestley:
  Checking Admissibility Using Natural Dualities. ACM Trans. Comput. Log. 20(1): 2:1-2:19 (2019)
• 
  Jérémie Chalopin, Victor Chepoi:
  1-Safe Petri Nets and Special Cube Complexes: Equivalence and Applications. ACM Trans. Comput. Log. 20(3): 17:1-17:49 (2019)
• 
  Lorenzo Clemente, Slawomir Lasota, Ranko Lazic, Filip Mazowiecki:
  Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems. ACM Trans. Comput. Log. 20(3): 14:1-14:31 (2019)
• 
  Willem Conradie, Sabine Frittella, Alessandra Palmigiano, Apostolos Tzimoulis, Nachoem Wijnberg:
  Probabilistic Epistemic Updates on Algebras. ACM Trans. Comput. Log. 20(4): 24:1-24:75 (2019)
• 
  Gaetano Geck, Bas Ketsman, Frank Neven, Thomas Schwentick:
  Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation. ACM Trans. Comput. Log. 20(3): 18:1-18:24 (2019)
• 
  Ross Horne, Alwen Tiu, Bogdan Aman, Gabriel Ciobanu:
  De Morgan Dual Nominal Quantifiers Modelling Private Names in Non-Commutative Logic. ACM Trans. Comput. Log. 20(4): 22:1-22:44 (2019)
• 
  Xiaowei Huang, Marta Kwiatkowska, Maciej Olejnik:
  Reasoning about Cognitive Trust in Stochastic Multiagent Systems. ACM Trans. Comput. Log. 20(4): 21:1-21:64 (2019)
• 
  Alex P. Klinkhamer, Ali Ebnenasir:
  On the Verification of Livelock-Freedom and Self-Stabilization on Parameterized Rings. ACM Trans. Comput. Log. 20(3): 16:1-16:36 (2019)
• 
  Ori Lahav, Yoni Zohar:
  Pure Sequent Calculi: Analyticity and Decision Procedure. ACM Trans. Comput. Log. 20(3): 13:1-13:38 (2019)
• 
  Björn Lellmann, Elaine Pimentel:
  Modularisation of Sequent Calculi for Normal and Non-normal Modalities. ACM Trans. Comput. Log. 20(2): 7:1-7:46 (2019)
• 
  Nicola Leone, Marco Manna, Giorgio Terracina, Pierfrancesco Veltri:
  Fast Query Answering over Existential Rules. ACM Trans. Comput. Log. 20(2): 12:1-12:48 (2019)
• 
  Neha Lodha, Sebastian Ordyniak, Stefan Szeider:
  A SAT Approach to Branchwidth. ACM Trans. Comput. Log. 20(3): 15:1-15:24 (2019)
• 
  Cláudia Nalon, Clare Dixon, Ullrich Hustadt:
  Modal Resolution: Proofs, Layers, and Refinements. ACM Trans. Comput. Log. 20(4): 23:1-23:38 (2019)
• 
  Jim E. Newton, Didier Verna:
  A Theoretical and Numerical Analysis of the Worst-Case Size of Reduced Ordered Binary Decision Diagrams. ACM Trans. Comput. Log. 20(1): 6:1-6:36 (2019)
• 
  Karin Quaas, Mahsa Shirmohammadi:
  Synchronizing Data Words for Register Automata. ACM Trans. Comput. Log. 20(2): 11:1-11:27 (2019)
• 
  Oleg Verbitsky, Maksim Zhukovskii:
  Tight Bounds on the Asymptotic Descriptive Complexity of Subgraph Isomorphism. ACM Trans. Comput. Log. 20(2): 9:1-9:18 (2019)
• 
  Michal Wrona:
  The Complexity of Minimal Inference Problem for Conservative Constraint Languages. ACM Trans. Comput. Log. 20(2): 8:1-8:35 (2019)