default search action
5. GWAI 1981: Baf Honnef
- Jörg H. Siekmann:
GWAI-81, German Workshop on Artificial Intelligence, Bad Honnef, Germany, January 26-31, 1981, Proceedings. Informatik-Fachberichte 47, Springer 1981, ISBN 3-540-10859-9
Computersehen und Roboterforschung
- W. Radig:
Models and Structures in Image Processing. 1-17 - Leonie Dreschler, Hans-Hellmut Nagel:
On the Frame-to-Frame Correspondence between Grey Value Characteristics in the Images of Moving Objects. 18-29 - Jörgen P. Foith:
Robotics Research: From Toy Worlds to Industrial Applications. 30-49
Natürlichsprachliche KI-Systeme
- Wolfgang Wahlster:
Natürlichsprachliche KI-Systeme: Entwicklungsstand und Forschungsperspektive. 50-68 - Peter Schefe, Bernd Pretschner:
SWISS - A Natural Language Question Answering System for Scene Analysis. 69-78 - Heinz Marburger, Bernd Neumann, Hans-Joachim Novak:
Natural Language Inquiries abouth Motion in an Automatically Analyzed Traffic Scene. 79-87 - Christopher Habel, Claus-Rainer Rollinger:
Aspekte der rechnergestützten Generierung von Inferenzregeln durch Regelschemata. 88-97
Expertensysteme/Verarbeitung natürlicher Sprache
- Peter Raulefs:
Expert Systems: State of the Art and Future Prospects. 98-111 - Ulrich Bartels, Walter G. Olthoff, Peter Raulefs:
An Expert System for Implementing Abstract Sorting Algorithms on Parameterized Abstract Data Types. 112-123 - Werner Dilger:
Context Directed Translation. 124-134 - Günther Görz:
GLP: A Linguistic Processor. 135
KI-Sprachen und deren Anwendungen
- Harold Boley:
AI Languages and AI Machines: An Overview. 136-155 - Peter Raulefs, Hans Siebenbach:
A Concurrent Chart Parser. 156-159 - Günter Hornung, Anfried Knapp, Ulrike Knapp:
A Parallel Connection Graph Proof Procedure. 160-167 - Heinz-Dieter Böcker, Gerhard Fischer:
Integrated Knowledge-Based Information Manipulation Systems. 168-170
Automatisches Beweisen und Connectiongraphverfahren
- Wolfgang Bibel:
Mating in Matrices. 171-187 - Norbert Eisinger:
Subsumption and Connectionsgraphs. 188-198 - Jörg H. Siekmann, Gert Smolka:
Selection Heuristics, Deletion Strategies and N-Level Terminator Configurations for the Connection Graph Proof Procedure. 199-200 - Christoph Walther:
Elimination of Redundant Links in Extended Connection Graphs. 201-213
Termersetzungssysteme und automatisches Beweisen
- Rüdiger Loos:
Term Reduction Systems and Algebraic Algorithms. 214-234 - Jörg H. Siekmann, Peter Szabó:
A Noetherian Rewrite System for Idempotent Semigroups. 235-245 - Wolfgang Bibel:
On the Completeness of Connection Graph Resolution. 246-247 - K. M. Hörnig:
Generating small Models of First Order Axioms. 248-255
Programmverifikation/Sprache/Spiele
- Wolfgang Polak:
Programmverification at Stanford: Past, Present Future. 256-276 - Hans-Werner Hein:
A System for Understanding Continuous German Speech. 277-286 - Katharina Morik:
Verarbeitung von externer und interner Situation in Überzeugungssystemen. 287-296 - Kai von Luck, Bernd Owsnicki-Klewe:
Structures for Knowledge-Based Chess Programs. 297-306 - Sven Müller:
Informationsgewinnung durch automatisches Erzeugen zielbezogener Fragen. 307-317
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.