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

• 2000
• 
  Elvira Albert, Sergio Antoy, Germán Vidal:
  Measuring the Effectiveness of Partial Evaluation. LOPSTR 2000
• 
  Alessandro Avellone, Mauro Ferrari, Camillo Fiorentini:
  A formal framework for synthesis and verification of logic programs. LOPSTR 2000
• 
  Francisco Bueno, Maria J. García de la Banda, Manuel V. Hermenegildo, Kim Marriott, Germán Puebla, Peter J. Stuckey:
  A model for inter-module analysis and optimizing compilation. LOPSTR 2000
• 
  Robert Colvin, Ian J. Hayes, Paul A. Strooper:
  Modular Logic Program Refinement. LOPSTR 2000
• 
  Bart Demoen:
  Prolog and abduction 4 writing garbage collectors. LOPSTR 2000
• 
  Sandro Etalle, Jon Mountjoy:
  The lazy functional side of logic programming. LOPSTR 2000
• 
  Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
  Automated strategies for specializing constraint logic programs. LOPSTR 2000
• 
  Erwan Jahier, Mireille Ducassé, Olivier Ridoux:
  Specifying Prolog trace models with a continuation semantics. LOPSTR 2000
• 
  Alessandra Di Pierro, Herbert Wiklicky:
  On the precision of abstract interpretations. LOPSTR 2000
• 
  Iman Poernomo, John N. Crossley:
  Protocols between programs and proofs. LOPSTR 2000
• 
  Alexander Serebrenik, Danny De Schreye:
  Non-tranformational termination analysis of logic programs, based on general term-orderings. LOPSTR 2000
• 
  Silvija Seres, J. Michael Spivey:
  Higher-order transformation of logic programs. LOPSTR 2000
• 
  Wim Vanhoof, Maurice Bruynooghe:
  Towards a modular binding-time analysis for higher-order Mercury. LOPSTR 2000
• 
  Walter W. Wilson:
  A minimal specification language. LOPSTR 2000
• 
  Kung-Kiu Lau:
  Extended Abstracts of the 10th International Workshop on Logic-based Program Synthesis and Transformation, LOPSTR 2000, London, UK, July 24-28, 2000. Technical Report UMCS-00-6-1, Department of Computer Science, University of Manchester 2000 [contents]