|
" GWAI-86 und 2. Österreichische Artificial-Intelligence-Tagung : "
edited by Claus-Rainer Rollinger, Werner Horn.
| Document Type
|
:
|
BL
|
| Record Number
|
:
|
753036
|
| Doc. No
|
:
|
b572997
|
| Main Entry
|
:
|
edited by Claus-Rainer Rollinger, Werner Horn.
|
| Title & Author
|
:
|
GWAI-86 und 2. Österreichische Artificial-Intelligence-Tagung : : Ottenstein/Niederösterreich, September 22-26, 1986\ edited by Claus-Rainer Rollinger, Werner Horn.
|
| Publication Statement
|
:
|
Berlin, Heidelberg : Springer Berlin Heidelberg, 1986
|
| Series Statement
|
:
|
Subreihe Künstliche Intelligenz, 124.
|
| Page. NO
|
:
|
(volumes)
|
| ISBN
|
:
|
3642713858
|
|
|
:
|
: 9783642713859
|
| Contents
|
:
|
AI --; NIE! Versuch über eine wahrscheinliche zukünftige Reaktion der Öffentlichkeit (Eingeladener Vortrag) --; Suchen, Problemlösen --; Decision Making in Unclear Situations --; State Space Algorithms for Searching Game Trees --; Repräsentatiorn von Wissern --; Explicit and Implicit Beliefs --; Facetten-Logik: eine untypische Logik zum prototypischen Schließen --; Semantic Networks with Number Restricted Roles or Another Story about Clyde --; Data Models in Knowledge Representation Systems: A Case Study --; NIGEL Gets to Know Logic: An Experiment in Natural Language Generation Taking a Logical, Knowledge-Based View --; Natürlichsprachliche Systeme --; Syntaktische und semantische Generalisierungen im strukturierten Lexikon (Eingeladener Vortrag) --; The Choice of Words in the Generation Process of a Natural Language Interface --; Generierung mit Lexical-Functional Grammar (LFG) --; Processing Descriptions Containing Words and Gestures --; A System Architecture --; Wortorientiertes Parsing mit erweiterter ChartRepräsentation --; An Efficient Parser for Lexical Functional Grammar --; Kognitive Prozesse --; Wissenspsychologie: Forschungsfragen, Anwendungsperspektiven, Bezüge zur KI (Eingeladener Vortrag) --; The Construction of Programming Knowledge from System Explorations and Explanatory Text: A Cognitive Model --; Maschinelles Lernen --; Learning Expert Knowledge and Theorem Proving (Eingeladener Vortrag) --; Machine Learning as a Tool for Building a Deterministic Parser --; Generierung struktureller Konzepte im Version-Space --; Bildverstehen --; Über die Repräsentation von dreidimensionalen natürlichen Objekten (Eingeladener Vortrag) --; Hierarchien über Relationengebilden --; Architektur und Anwendung des bildverstehenden Expertensystems VES --; Theorembeweisen --; The Semantic Clause Graph Procedure --; A First Overview --; Against the 'Anti Waltz Effect' in Equality Reasoning --; Effiziente Reduktionsstrategien in Termersetzungssystemen --; Topologische Multisetordnungen --; Using Resolution and Paramodulation for Induction Proofs --; Lazy Theory Unification in Prolog: An Extension of the Warren Abstract Machine --; Programmsynthese --; Knuth-Bendix Completion Versus Fold/Unfold: A Comparative Study in Program Synthesis --; KI-Programmierung --; Controlled Prolog: A Front-End to Prolog Incorporating Meta Knowledge --; FORK: Ein System zur objekt-und regelorientierten Programmierung --; Expertensysteme --; A Framework for the Multiple Representation of Structure and Function in Expert Systems --; Hybride Diagnosebewertung --; Hybrid Knowledge Acquisition --; COMODEL: ein Repräsentationsformalismus für technische Expertensysteme.
|
| Abstract
|
:
|
Decision makinq in larqe domains very often involves the necessity to handle unclear situations. So the ability to base ones decisions on estimates is important in real life as well as in complicated qames. Siqnificantly, even the analysis of chess positions by qrandmasters often results in the conclusion "unclear". The conventional methods in two-person qames (which are by far the most successful ones up to now) use point-values and depth-first (alpha-beta) minimax search (mostly in a brute-force manner). Unfortunately, this approach has a fundamental drawback in unclear situations: it iqnores the uncertainty of the values. Even refinements like quiescence search [4] or extendinq the horizon of the fUll-width search (e.q. by not-countinq certain moves as a ply of depth) [5] cannot completely resolve this defect. Another method proposed by Pearl [7] treats estimated values as probabilities and uses a product propaqation rule. This way the uncertainty of values is qiven too much emphasis and it seems not to be used in practical proqrams. Additionally, this method requires searchinq of the whole tree unlike alpha-beta minimax. Much more convenient for our problem are methods usinq ranqes U, 8] or even probability distributions [6] as values. Unfortunately, they are impracticable for a larqe domain up to now, because of the qreat difficulty in findinq valid bounds (parameters of the distribution). consequently, the converqence of such searches is very hard to quarantee.
|
| Subject
|
:
|
Artificial intelligence.
|
| Subject
|
:
|
Computer science.
|
| Added Entry
|
:
|
Claus-Rainer Rollinger
|
|
|
:
|
Werner Horn
|
| |