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

• 2004
• 
  David A. Basin, Yves Deville, Pierre Flener, Andreas Hamfelt, Jørgen Fischer Nilsson:
  Synthesis of Programs in Computational Logic. Program Development in Computational Logic 2004: 30-65
• 
  Annalisa Bossi, Nicoletta Cocco, Sandro Etalle, Sabina Rossi:
  Declarative Semantics of Input Consuming Logic Programs. Program Development in Computational Logic 2004: 90-114
• 
  Antonio Brogi:
  On the Semantics of Logic Program Composition. Program Development in Computational Logic 2004: 115-151
• 
  Robert Colvin, Lindsay Groves, Ian J. Hayes, David Hemer, Ray Nickson, Paul A. Strooper:
  Developing Logic Programs from Specifications Using Stepwise Refinement. Program Development in Computational Logic 2004: 66-89
• 
  Bart Demoen, Maria J. García de la Banda, Warwick Harvey, Kim Marriott, David Overton, Peter J. Stuckey:
  Herbrand Constraints in HAL. Program Development in Computational Logic 2004: 499-538
• 
  Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
  Transformation Rules for Locally Stratified Constraint Logic Programs. Program Development in Computational Logic 2004: 291-339
• 
  Jacob M. Howe, Andy King, Lunjin Lu:
  Analysing Logic Programs by Reasoning Backwards. Program Development in Computational Logic 2004: 152-188
• 
  Kung-Kiu Lau, Mario Ornaghi:
  Specifying Compositional Units for Correct Program Development in Computational Logic. Program Development in Computational Logic 2004: 1-29
• 
  Michael Leuschel, Stephen-John Craig, Maurice Bruynooghe, Wim Vanhoof:
  Specialising Interpreters Using Offline Partial Deduction. Program Development in Computational Logic 2004: 340-375
• 
  Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik:
  Proving Termination for Logic Programs by the Query-Mapping Pairs Approach. Program Development in Computational Logic 2004: 453-498
• 
  Jonathan C. Martin, Andy King:
  On the Inference of Natural Level Mappings. Program Development in Computational Logic 2004: 432-452
• 
  Dino Pedreschi, Salvatore Ruggieri, Jan-Georg Smaus:
  Characterisations of Termination in Logic Programming. Program Development in Computational Logic 2004: 376-431
• 
  Germán Puebla, Jesús Correas, Manuel V. Hermenegildo, Francisco Bueno, Maria J. García de la Banda, Kim Marriott, Peter J. Stuckey:
  A Generic Framework for Context-Sensitive Analysis of Modular Programs. Program Development in Computational Logic 2004: 233-260
• 
  Abhik Roychoudhury, C. R. Ramakrishnan:
  Unfold/Fold Transformations for Automated Verification of Parameterized Concurrent Systems. Program Development in Computational Logic 2004: 261-290
• 
  Wim Vanhoof, Maurice Bruynooghe, Michael Leuschel:
  Binding-Time Analysis for Mercury. Program Development in Computational Logic 2004: 189-232
• 
  Maurice Bruynooghe, Kung-Kiu Lau:
  Program Development in Computational Logic: A Decade of Research Advances in Logic-Based Program Development. Lecture Notes in Computer Science 3049, Springer 2004, ISBN 3-540-22152-2 [contents]