Derek H. Sleeman: Proceedings of AISB/GI Conference (Proceedings of the 4th European Conference on Artificial Intelligence), Hamburg, Germany, 18-20 July 1978. Leeds University

• 
  Yuichiro Anzai: How to Learn Strategies: Processes and Representation of Strategy Acquisition. 1-14
• 
  David R. Barstow: Experience with a Refinement Paradigm in a Knowledge-Based Automatic Programming System. 15-21
• 
  Wolfgang Bibel: On Strategies for the Systhesis of Algorithms. 22-27
• 
  F. Birch: A (self-adapting) Network for Recognition of Visual Structures. 28-32
• 
  H. P. Böhm, Hans Ludwig Fischer, Peter Raulefs: Dialogues in Actor Nets. 33-34
• 
  Harold Boley: The Fit Approach to AI Languages. 35-41
• 
  Michael Brady: Dangerous Behaviour. 42-45
• 
  Pavel Brazdil: Experimental Learning Model. 46-50
• 
  Michael J. Brooks: Understanding the Image Forming Process. 51-55
• 
  Frank M. Brown: A Sequent Calculus for Modal Quantificational Logic. 56-65
• 
  Frank M. Brown, Camilla Schwind: Analysing and Representing Natural Language in Logic. 66-70
• 
  Alan Bundy, George F. Luger, Chris Mellish, Martha Stone Palmer: Knowledge about Knowledge: Making Decisions in Mechanics Probleme Solving. 71-81
• 
  Dennis de Champeaux: A Theorem Prover Dating a Semantic Network. 82-92
• 
  W. F. Clocksin: Determinig the Orientation of Surfaces from Optical Flow. 93-102
• 
  Christoph F. Eick, Peter Raulefs: Problem Solving by Hyper Planning. 103-104
• 
  Norbert Eisinger, Jörg H. Siekmann, Graham Wrightson: Paramodulated Connection Graphs. 105-109
• 
  Daniel Goossens: A System for Visual-like Understanding. 110-114
• 
  Giovanni Guida, Marco Somalvico: A Method for Computing Heuristics in Problem-Solving. 115-121
• 
  Walther von Hahn, Wolfgang Hoeppner, Anthony Jameson, Wolfgang Wahlster: HAM-RPM: Natural Dialogues with an Artificial Partner. 122-131
• 
  F. Keith Hanna, W. T. Harwood: A Multiprocessor System for Knowledge Representation and Manipulation. 132-137
• 
  Christopher J. Hogger: Program Synthesis in Predicate Logic. 138-146
• 
  Berthold K. P. Horn: Vision. 147-163
• 
  Kenneth M. Kahn: Ani: An Example of Computational Creativity. 164-168
• 
  Yves Kodratoff, Jean Fargues: A sane Algorithme for the Synthesis of LISP Functions from Example Problems: The ``Boyer and Moore Algorithm''. 169-175
• 
  David C. Luckham, Jorge J. Morales, Joachim F. Schreiber: A Study in the Application of Theorem Proving. 176-188
• 
  László Méro: A Quasi-Parallel Contour Following Algorithm. 189-193
• 
  Donald Michie, Ivan Bratko: Advice Table Representations of Chess End-Game Knowledge. 194-200
• 
  Renato de Mori, Pietro Laface: Representation of Phonetic and Phonemic Knowledge in a Speech Understanding System. 201-205
• 
  Drew V. McDermott: The Last Survey of Representation of Knowledge. 206-221
• 
  Bernd Neumann: Best-First Interpretation of Imperfect Object Contours. 222-228
• 
  Tim O'Shea, Richard M. Young: A Production Rule Account of Errors in Children's Subtraction. 229-237
• 
  Derek Partridge: A Philosophy of ``Wicked'' Problem Implementation. 238-247
• 
  Dominique Pastre: A Humanlike Approach for Automatic Theorem Proving. 248-252
• 
  Brian Phillips: A Network representation for Procedural Knowledge. 253-257
• 
  K. Prazdny: A Computational Study of a Period of Infant Development. 258-262
• 
  Bernd Radig: Parametrized Region Extraction for the Description of Moving Objects. 263-272
• 
  Graeme D. Ritchie: Predictions and Procedures in Semantically-Based Grammar. 273-282
• 
  Mike Rosner: What's in a Social Action for U? 283-292
• 
  Gérard Sabah: A Conversational System which Understands Short Stories. 293-297
• 
  Erik Sandewall: What Structure does a LISP Program have - besides being a set of Procedures? 298-303
• 
  Camilla Schwind: Representing Actions by State Logic. 304-308
• 
  Aaron Sloman, David Owen, Geoffrey E. Hinton, Frank Birch, Frank O'Gorman: Representation and Control in Vision. 309-314
• 
  N. S. Sridharan, D. Smith: Design for a Plan Hypothesizer. 315-324
• 
  Luc Steels: The Frame Shift Mechanism in Natural Language. 325-329
• 
  Olga Stepánková: Planning in Uncertain Environments through Situation Calculus. 330-339
• 
  Werner Stephan, Jörg H. Siekmann: Completeness and Soundness of the Connection Graph Proof. 340-344
• 
  P. L. Suzman: Common-Sense Representation. 345-350
• 
  Leonard Uhr, Manfred Kochen: Toward a greater Generality in Artificial Intelligence. 351-354
• 
  Bob J. Wielinga: AI Programming Methodology. 355-374
• 
  J. Gerard Wolff: Grammar Discovery as Data Compression. 375-379