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

• 1994
• 
  Naoki Abe:
  Towards Realistic Theories of Learning. AII/ALT 1994: 187-209
• 
  Andris Ambainis, Juris Smotrovs:
  Enumerable Classes of Total Recursive Functions: Complexity of Inductive Inference. AII/ALT 1994: 10-25
• 
  Kalvis Apsitis:
  Derived Sets and Inductive Inference. AII/ALT 1994: 26-39
• 
  Oksana Arnold, Klaus P. Jantke:
  Therapy Plan Generation as Program Synthesis. AII/ALT 1994: 40-55
• 
  Peter Auer, Nicolò Cesa-Bianchi:
  On-line Learning with Malicious Noise and the Closure Algorithm. AII/ALT 1994: 229-247
• 
  Shuo Bai:
  A Calculus for Logical Clustering. AII/ALT 1994: 56-63
• 
  Ganesh Baliga, John Case:
  Learning with Higher Order Additional Information. AII/ALT 1994: 64-75
• 
  Janis Barzdins:
  Towards Efficient Inductive Synthesis from Input/Output Examples (Abstract). AII/ALT 1994: 1
• 
  Shai Ben-David, Eli Dichterman:
  Learnability with Restricted Focus of Attention guarantees Noise-Tolerance. AII/ALT 1994: 248-259
• 
  Wolfgang Bibel, Michael Thielscher:
  Deductive Plan Generation. AII/ALT 1994: 2-5
• 
  Alvis Brazma:
  Efficient Algorithm for Learning Simple Regular Expressions from Noisy Examples. AII/ALT 1994: 260-271
• 
  Alvis Brazma, Karlis Cerans:
  Efficient Learning of Regular Expressions from Good Examples. AII/ALT 1994: 76-90
• 
  Zhixiang Chen:
  A Note on Learning DNF Formulas Using Equivalence and Incomplete Membership Queries. AII/ALT 1994: 272-281
• 
  Nachum Dershowitz:
  From Specifications to Programs: Induction in the Service of Synthesis (Abstract). AII/ALT 1994: 6-7
• 
  Claudio Ferretti, Giancarlo Mauri:
  Identifying Regular Languages over Partially-Commutative Monoids. AII/ALT 1994: 282-289
• 
  Rusins Freivalds, Ognian Botuscharov, Rolf Wiehagen:
  Identifying Nearly Minimal Gödel Numbers From Additional Information. AII/ALT 1994: 91-99
• 
  Rusins Freivalds, Dace Gobleja, Marek Karpinski, Carl H. Smith:
  Co-learnability and FIN-identifiability of Enumerable Classes of Total Recursive Functions. AII/ALT 1994: 100-105
• 
  William I. Gasarch, Mark G. Pleszkoch, Mahendran Velauthapillai:
  Classification Using Information. AII/ALT 1994: 290-300
• 
  Christoph Globig, Steffen Lange:
  On Case-Based Representability and Learnability of Languages. AII/ALT 1994: 106-120
• 
  Kouichi Hirata:
  Rule-Generating Abduction for Recursive Prolog. AII/ALT 1994: 121-136
• 
  Akira Ishino, Akihiro Yamamoto:
  Learning from Examples with Typed Equational Programming. AII/ALT 1994: 301-316
• 
  Hiroki Ishizaka, Hiroki Arimura, Takeshi Shinohara:
  Finding Tree Patterns Consistent with Positive and Negative Examples Using Queries. AII/ALT 1994: 317-332
• 
  Toshiharu Iwatani, Shun'ichi Tano, Atsushi Inoue, Wataru Okamoto:
  Fuzzy Analogy Based Reasoning and Classification of Fuzzy Analogies. AII/ALT 1994: 137-148
• 
  Sanjay Jain:
  Program Synthesis in the Presence of Infinite Number of Inaccuracies. AII/ALT 1994: 333-348
• 
  Sanjay Jain, Arun Sharma:
  On Monotonic Strategies for Learning r.e. Languages. AII/ALT 1994: 349-364
• 
  Shyam Kapur:
  Language Learning under Various Types of Constraint Combinations. AII/ALT 1994: 365-378
• 
  Shigetomo Kimura, Atsushi Togashi, Norio Shiratori:
  Synthesis Algorithm for Recursive Process by µ-calculus (Extended Abstract). AII/ALT 1994: 379-394
• 
  Efim B. Kinber:
  Monotonicity versus Efficiency for Learning Languages from Texts. AII/ALT 1994: 395-406
• 
  Satoshi Kobayashi, Takashi Yokomori:
  Learning Concatenations of Locally Testable Languages from Positive Data. AII/ALT 1994: 407-422
• 
  Yasuyuki Koga, Eiju Hirowatari, Setsuo Arikawa:
  Explanation-Based Reuse of Prolog Programs. AII/ALT 1994: 149-160

skipping 16 more matches