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

• 1984
• 
  Harvey Abramson:
  Definite Clause Translation Grammars and the Logical Specification of Data Types as Unambiguous Context Free Grammars. FGCS 1984: 678-685
• 
  Lubomir Bic:
  A Data-Driven Model for Parallel Interpretation of Logic Programs. FGCS 1984: 517-523
• 
  Daniel G. Bobrow:
  If Prolog is the Answer, what is the Question? FGCS 1984: 138-145
• 
  Derek R. Brough, Adrian Walker:
  Some Practical Properties of Logic Programming Interpreters. FGCS 1984: 149-156
• 
  Alan Bundy:
  Incidence Calculus: A Mechanism for Probabilistic Reasoning. FGCS 1984: 166-174
• 
  Rod M. Burstall:
  Programming with Modules as Typed Functional Programming. FGCS 1984: 103-112
• 
  Luis Fariñas del Cerro, Ewa Orlowska:
  DAL - A Logic for Data Analysis. FGCS 1984: 254-261
• 
  Takashi Chikayama:
  Unique Features of ESP. FGCS 1984: 292-298
• 
  Andrzej Ciepielewski, Seif Haridi:
  Execution of Bagof on the Or-Parallel Token Machine. FGCS 1984: 551-560
• 
  Keith L. Clark, Steve Gregory:
  Notes on System Programming in Parlog. FGCS 1984: 299-306
• 
  Shimon Cohen:
  Multi-Version Structures in Prolog. FGCS 1984: 265-274
• 
  Alain Colmerauer:
  Equations and Inequations on Finite and Infinite Trees. FGCS 1984: 85-99
• 
  Verónica Dahl:
  More on Gapping Grammars. FGCS 1984: 669-677
• 
  Doug DeGroot:
  Restricted AND-Parallelism. FGCS 1984: 471-478
• 
  Hans Diel:
  Concurrent Data Access Architecture. FGCS 1984: 373-382
• 
  Werner Dilger, Hans-Albert Schneider:
  ASSIP-T: A Theorem Proving Machine. FGCS 1984: 497-506
• 
  Mehmet Dincbas, Jean-Pierre Le Pape:
  Metacontrol of Logic Programs in Metalog. FGCS 1984: 361-370
• 
  Kazuhiro Fuchi:
  Revisiting Original Philosophy of Fifth Generation Computer Systems Project. FGCS 1984: 1-2
• 
  Kazuhiro Fuchi:
  Logical Derivation of a Prolog Interpreter. FGCS 1984: 229-234
• 
  Masahiro Fujita, Hidehiko Tanaka, Tohru Moto-Oka:
  Specifying Hardware in temporal Logic & Efficient Synthesis of State-Diagrams Using Prolog. FGCS 1984: 572-581
• 
  Koichi Furukawa, Akikazu Takeuchi, Susumu Kunifuji, Hideki Yasukawa, Masaru Ohki, Kazunori Ueda:
  MANDELA: A LogicBased Knowledge Programming System. FGCS 1984: 613-622
• 
  Koichi Furukawa, Toshio Yokoi:
  Basic Software System. FGCS 1984: 37-57
• 
  Brigitte Grau:
  Stalking "Coherence" in the Topical Jungle. FGCS 1984: 652-659
• 
  Ryuzo Hasegawa, Makoto Amamiya:
  Parallel Execution of Logic Programs based on Dataflow Concept. FGCS 1984: 507-516
• 
  Norbert Heck, Jürgen Avenhaus:
  Automatic Implementation of Abstract Data Types Specified by the Logic Programming Language. FGCS 1984: 210-219
• 
  C. A. R. Hoare, A. W. Roscoe:
  Programs as Executable Predicates. FGCS 1984: 220-228
• 
  Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher:
  A Theory of Complete Logic Programs with Equality. FGCS 1984: 175-184
• 
  Kenneth M. Kahn, Mats Carlsson:
  The Compilation of Prolog Programs without the Use of a Prolog Compiler. FGCS 1984: 348-355
• 
  Kazukiyo Kawanobe:
  Current Status and Future Plans of the Fifth Generation Computer Systems Project. FGCS 1984: 3-17
• 
  J. I. Kim, Seungryul Maeng, Jung Wan Cho:
  A Relational Dataflow Database Machine Based on Hierarchical Ring Network. FGCS 1984: 489-496

skipping 43 more matches