7. Österreichische Artificial-Intelligence-TagungHermann Kaindl |
Contents
Eingeladene Beiträge Invited Talks | 1 |
On the Complexity of Clause Condensing | 16 |
AI und Hypertext AI and Hypertext | 30 |
Copyright | |
2 other sections not shown
Other editions - View all
Common terms and phrases
agent application array production Artificial Intelligence assumptions attributed parallel array automated Automated Theorem Proving Beispiel belief function belief space C₁ cardinal directions clause set CLP(R co-NP co-NP-complete combination component Computer condensing algorithm constraints context corresponding debugging deduction default rule defined Definition denoted derived diagnoses environment Erklärung evidence function example expert system factorization rule fault location Generalisierung given goal grammar graphical user interface HESDE implemented information quadruplet instance introduced knowledge base Konjunkt Konzept Krankheitskonzepte layout linear literals logic programming Lt-Lücke Lücke M:treel:ldg MasPar MESICAR multimodal n-dimensional natural language network simulator neural networks nodes NP-complete p-goal parallel array performance presentation problem proof proposition R-strings refutation representation semantics simulator kernel situation semantics Skolem SNNS speech acts spezifische strongly condensed structure subset subsumption SWMC t₁ Technische Universität Wien Theorem Proving theory unification unifiers variables Wahlster wffs Wien