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

• 2004
• 
  Slim Abdennadher, Christophe Rigotti:
  Automatic generation of rule-based constraint solvers over finite domains. ACM Trans. Comput. Log. 5(2): 177-205 (2004)
• 
  Rajeev Alur, Salvatore La Torre:
  Deterministic generators and games for Ltl fragments. ACM Trans. Comput. Log. 5(1): 1-25 (2004)
• 
  David A. Basin, Manuel Clavel, José Meseguer:
  Reflective metalogical frameworks. ACM Trans. Comput. Log. 5(3): 528-576 (2004)
• 
  Frédéric Benhamou, Frédéric Goualard, Éric Languénou, Marc Christie:
  Interval constraint solving for camera control and motion planning. ACM Trans. Comput. Log. 5(4): 732-767 (2004)
• 
  Marco Bernardo:
  Symbolic semantic rules for producing compact STGLAs from value passing process descriptions. ACM Trans. Comput. Log. 5(3): 436-469 (2004)
• 
  Bard Bloom, Wan J. Fokkink, Rob J. van Glabbeek:
  Precongruence formats for decorated trace semantics. ACM Trans. Comput. Log. 5(1): 26-78 (2004)
• 
  Frank S. de Boer, Maurizio Gabbrielli, Maria Chiara Meo:
  Proving correctness of timed concurrent constraint programs. ACM Trans. Comput. Log. 5(4): 706-731 (2004)
• 
  Annalisa Bossi, Sandro Etalle, Sabina Rossi, Jan-Georg Smaus:
  Termination of simply moded logic programs with dynamic scheduling. ACM Trans. Comput. Log. 5(3): 470-507 (2004)
• 
  Stefan Brass, Jürgen Dix, Teodor C. Przymusinski:
  Super logic programs. ACM Trans. Comput. Log. 5(1): 129-176 (2004)
• 
  Anuj Dawar, Erich Grädel, Stephan Kreutzer:
  Inflationary fixed points in modal logic. ACM Trans. Comput. Log. 5(2): 282-315 (2004)
• 
  Thomas Eiter, Wolfgang Faber, Nicola Leone, Gerald Pfeifer, Axel Polleres:
  A logic programming approach to knowledge-state planning: Semantics and complexity. ACM Trans. Comput. Log. 5(2): 206-263 (2004)
• 
  Guillem Godoy, Robert Nieuwenhuis, Ashish Tiwari:
  Classes of term rewrite systems with polynomial confluence problems. ACM Trans. Comput. Log. 5(2): 321-331 (2004)
• 
  W. O. David Griffioen, Frits W. Vaandrager:
  A theory of normed simulations. ACM Trans. Comput. Log. 5(4): 577-610 (2004)
• 
  Aleksandar Ignjatovic, Arun Sharma:
  Some applications of logic to feasibility in higher types. ACM Trans. Comput. Log. 5(2): 332-350 (2004)
• 
  Yann Loyer, Nicolas Spyratos, Daniel Stamate:
  Hypothesis-based semantics of logic programs in multivalued logics. ACM Trans. Comput. Log. 5(3): 508-527 (2004)
• 
  Carsten Lutz:
  NEXP TIME-complete description logics with concrete domains. ACM Trans. Comput. Log. 5(4): 669-705 (2004)
• 
  Laurent Michel, Pascal Van Hentenryck:
  A decomposition-based implementation of search strategies. ACM Trans. Comput. Log. 5(2): 351-383 (2004)
• 
  Pawel Mielniczuk:
  Basic theory of feature trees. ACM Trans. Comput. Log. 5(3): 385-402 (2004)
• 
  Frank Neven, Thomas Schwentick, Victor Vianu:
  Finite state machines for strings over infinite alphabets. ACM Trans. Comput. Log. 5(3): 403-435 (2004)
• 
  Rocco De Nicola, Michele Loreti:
  A modal logic for mobile agents. ACM Trans. Comput. Log. 5(1): 79-128 (2004)
• 
  Stefan Ratschan:
  Convergent approximate solving of first-order constraints by approximate quantifiers. ACM Trans. Comput. Log. 5(2): 264-281 (2004)
• 
  K. Subramani:
  Optimal length tree-like resolution refutations for 2SAT formulas. ACM Trans. Comput. Log. 5(2): 316-320 (2004)
• 
  John V. Tucker, Jeffery I. Zucker:
  Abstract versus concrete computation on metric partial algebras. ACM Trans. Comput. Log. 5(4): 611-668 (2004)