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

• 2018
• 
  Ricardo Rocha, Tran Cao Son, Christopher Mears, Neda Saeedloei:
  Technical Communications of the 33rd International Conference on Logic Programming, ICLP 2017, August 28 to September 1, 2017, Melbourne, Australia. OASIcs 58, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-058-3 [contents]
• 2017
• 
  Weronika T. Adrian, Marco Manna, Nicola Leone, Giovanni Amendola, Marek Adrian:
  Entity set expansion from the Web via ASP. ICLP (Technical Communications) 2017: 1:1-1:5
• 
  Mario Alviano:
  The Pyglaf Argumentation Reasoner. ICLP (Technical Communications) 2017: 2:1-2:3
• 
  Giovanni Amendola, Nicola Leone, Marco Manna, Pierfrancesco Veltri:
  Reasoning on anonymity in Datalog+/-. ICLP (Technical Communications) 2017: 3:1-3:5
• 
  Bernhard Bliem:
  Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs. ICLP (Technical Communications) 2017: 12:1-12:12
• 
  Melisachew Wudage Chekol, Heiner Stuckenschmidt:
  Rule Based Temporal Inference. ICLP (Technical Communications) 2017: 4:1-4:14
• 
  Michael Codish, Michael Frank, Amit Metodi, Morad Muslimany:
  Logic Programming with Max-Clique and its Application to Graph Coloring (Tool Description). ICLP (Technical Communications) 2017: 5:1-5:18
• 
  Tiantian Gao:
  Achieving High Quality Knowledge Acquisition using Controlled Natural Language. ICLP (Technical Communications) 2017: 13:1-13:10
• 
  Michael Hanus:
  Semantic Versioning Checking in a Declarative Package Manager. ICLP (Technical Communications) 2017: 6:1-6:16
• 
  Jason Hemann, Daniel P. Friedman, William E. Byrd, Matthew Might:
  A Simple Complete Search for Logic Programming. ICLP (Technical Communications) 2017: 14:1-14:8
• 
  Daniela Inclezan, Qinglin Zhang, Marcello Balduccini, Ankush Israney:
  Understanding Restaurant Stories Using an ASP Theory of Intentions. ICLP (Technical Communications) 2017: 7:1-7:4
• 
  Rolf Schwitter:
  Learning Effect Axioms via Probabilistic Logic Programming. ICLP (Technical Communications) 2017: 8:1-8:15
• 
  Nataliia Stulova:
  On Improving Run-time Checking in Dynamic Languages. ICLP (Technical Communications) 2017: 15:1-15:10
• 
  Nataliia Stulova, José F. Morales, Manuel V. Hermenegildo:
  Towards Run-time Checks Simplification via Term Hiding. ICLP (Technical Communications) 2017: 9:1-9:3
• 
  Paul Tarau:
  A Hitchhiker's Guide to Reinventing a Prolog Machine. ICLP (Technical Communications) 2017: 10:1-10:16
• 
  Front Matter, Table of Contents, Preface, Conference Organization. ICLP (Technical Communications) 2017: 0:i-0:xii
• 
  Neng-Fa Zhou, Roman Barták:
  // Efficient Declarative Solutions in Picat for Optimal Multi-Agent Pathfinding. ICLP (Technical Communications) 2017: 11:1-11:2