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

• 2020
• 
  Antoine Amarilli, Michael Benedikt:
  Finite Open-world Query Answering with Number Restrictions. ACM Trans. Comput. Log. 21(4): 27:1-27:73 (2020)
• 
  Franz Baader, Stefan Borgwardt, Patrick Koopmann, Ana Ozaki, Veronika Thost:
  Metric Temporal Description Logics with Interval-Rigid Names. ACM Trans. Comput. Log. 21(4): 30:1-30:46 (2020)
• 
  Philippe Balbiani, Joseph Boudou, Martín Diéguez, David Fernández-Duque:
  Intuitionistic Linear Temporal Logics. ACM Trans. Comput. Log. 21(2): 14:1-14:32 (2020)
• 
  Paolo Baldan, Tommaso Padoan:
  Model Checking a Logic for True Concurrency. ACM Trans. Comput. Log. 21(4): 34:1-34:49 (2020)
• 
  Gergei Bana, Rohit Chadha, Ajay Kumar Eeralla, Mitsuhiro Okada:
  Verification Methods for the Computationally Complete Symbolic Attacker Based on Indistinguishability. ACM Trans. Comput. Log. 21(1): 2:1-2:44 (2020)
• 
  David A. Basin, Felix Klaedtke, Eugen Zalinescu:
  Runtime Verification over Out-of-order Streams. ACM Trans. Comput. Log. 21(1): 5:1-5:43 (2020)
• 
  Michael Benedikt, Pierre Bourhis, Georg Gottlob, Pierre Senellart:
  Monadic Datalog, Tree Validity, and Limited Access Containment. ACM Trans. Comput. Log. 21(1): 6:1-6:45 (2020)
• 
  Olaf Beyersdorff, Joshua Blinkhorn:
  Dynamic QBF Dependencies in Reduction and Expansion. ACM Trans. Comput. Log. 21(2): 8:1-8:27 (2020)
• 
  Jori Bomanson, Tomi Janhunen, Ilkka Niemelä:
  Applying Visible Strong Equivalence in Answer-Set Program Transformations. ACM Trans. Comput. Log. 21(4): 33:1-33:41 (2020)
• 
  Guillaume Burel:
  Linking Focusing and Resolution with Selection. ACM Trans. Comput. Log. 21(3): 18:1-18:30 (2020)
• 
  Arnaud Carayol, Olivier Serre:
  How Good Is a Strategy in a Game with Nature? ACM Trans. Comput. Log. 21(3): 21:1-21:39 (2020)
• 
  Facundo Carreiro, Alessandro Facchini, Yde Venema, Fabio Zanasi:
  The Power of the Weak. ACM Trans. Comput. Log. 21(2): 15:1-15:47 (2020)
• 
  Ana Cavalcanti, Robert M. Hierons, Sidney C. Nogueira:
  Inputs and Outputs in CSP: A Model and a Testing Theory. ACM Trans. Comput. Log. 21(3): 24:1-24:53 (2020)
• 
  David M. Cerna, Temur Kutsia:
  Idempotent Anti-unification. ACM Trans. Comput. Log. 21(2): 10:1-10:32 (2020)
• 
  Rémy Chrétien, Véronique Cortier, Antoine Dallon, Stéphanie Delaune:
  Typing Messages for Free in Security Protocols. ACM Trans. Comput. Log. 21(1): 1:1-1:52 (2020)
• 
  Liron Cohen, Reuben N. S. Rowe:
  Non-well-founded Proof Theory of Transitive Closure Logic. ACM Trans. Comput. Log. 21(4): 31:1-31:31 (2020)
• 
  Mnacho Echenim, Radu Iosif, Nicolas Peltier:
  The Bernays-Schönfinkel-Ramsey Class of Separation Logic with Uninterpreted Predicates. ACM Trans. Comput. Log. 21(3): 19:1-19:46 (2020)
• 
  Kord Eickmeyer, Jan van den Heuvel, Ken-ichi Kawarabayashi, Stephan Kreutzer, Patrice Ossona de Mendez, Michal Pilipczuk, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz:
  Model-Checking on Ordered Structures. ACM Trans. Comput. Log. 21(2): 11:1-11:28 (2020)
• 
  Tuan-Fang Fan, Churn-Jung Liau:
  Reason-maintenance Belief Logic with Uncertain Information. ACM Trans. Comput. Log. 21(1): 3:1-3:32 (2020)
• 
  Shiguang Feng, Claudia Carapelle, Oliver Fernández Gil, Karin Quaas:
  MTL and TPTL for One-Counter Machines: Expressiveness, Model Checking, and Satisfiability. ACM Trans. Comput. Log. 21(2): 12:1-12:34 (2020)
• 
  Camillo Fiorentini, Mauro Ferrari:
  Duality between Unprovability and Provability in Forward Refutation-search for Intuitionistic Propositional Logic. ACM Trans. Comput. Log. 21(3): 22:1-22:47 (2020)
• 
  Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Daniel Lokshtanov, M. S. Ramanujan:
  A New Perspective on FO Model Checking of Dense Graph Classes. ACM Trans. Comput. Log. 21(4): 28:1-28:23 (2020)
• 
  Jakub Gajarský, Stephan Kreutzer, Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk:
  First-Order Interpretations of Bounded Expansion Classes. ACM Trans. Comput. Log. 21(4): 29:1-29:41 (2020)
• 
  Silvio Ghilardi, Maria João Gouveia, Luigi Santocanale:
  Fixed-point Elimination in the Intuitionistic Propositional Calculus. ACM Trans. Comput. Log. 21(1): 4:1-4:37 (2020)
• 
  Sergey Goncharov, Stefan Milius, Alexandra Silva:
  Toward a Uniform Theory of Effectful State Machines. ACM Trans. Comput. Log. 21(3): 23:1-23:63 (2020)
• 
  Lauri Hella, Antti Kuusisto, Arne Meier, Heribert Vollmer:
  Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics. ACM Trans. Comput. Log. 21(1): 7:1-7:18 (2020)
• 
  Frédéric Herbreteau, B. Srivathsan, Thanh-Tung Tran, Igor Walukiewicz:
  Why Liveness for Timed Automata Is Hard, and What We Can Do About It. ACM Trans. Comput. Log. 21(3): 17:1-17:28 (2020)
• 
  André Hernich, Carsten Lutz, Fabio Papacchini, Frank Wolter:
  Dichotomies in Ontology-Mediated Querying with the Guarded Fragment. ACM Trans. Comput. Log. 21(3): 20:1-20:47 (2020)
• 
  Claudio Menghi, Marcello M. Bersani, Matteo Rossi, Pierluigi San Pietro:
  Model Checking MITL Formulae on Timed Automata: A Logic-based Approach. ACM Trans. Comput. Log. 21(3): 26:1-26:44 (2020)
• 
  Ron van der Meyden, Manas K. Patra:
  Undecidable Cases of Model Checking Probabilistic Temporal-Epistemic Logic. ACM Trans. Comput. Log. 21(4): 32:1-32:26 (2020)

skipping 4 more matches