Please use this identifier to cite or link to this item:
doi:10.22028/D291-24949 | Title: | How to win a game with features |
| Author(s): | Backofen, Rolf Treinen, Ralf |
| Language: | English |
| Year of Publication: | 1994 |
| OPUS Source: | Kaiserslautern ; Saarbrücken : DFKI, 1994 |
| SWD key words: | Künstliche Intelligenz |
| DDC notations: | 004 Computer science, internet |
| Publikation type: | Report |
| Abstract: | We show, that the axiomatization of rational trees in the language of features given elsewhere is complete. In contrast to other completeness proofs that have been given in this field, we employ the method of Ehrenfeucht-Fraïssé Games, which yields a much simpler proof. The result extends previous results on complete axiomatizations of rational trees in the language of constructor equations or in a weaker feature language. |
| Link to this record: | urn:nbn:de:bsz:291-scidok-37250 hdl:20.500.11880/25005 http://dx.doi.org/10.22028/D291-24949 |
| Series name: | Research report / Deutsches Forschungszentrum für Künstliche Intelligenz [ISSN 0946-008x] |
| Series volume: | 94-18 |
| Date of registration: | 29-Jun-2011 |
| Faculty: | SE - Sonstige Einrichtungen |
| Department: | SE - DFKI Deutsches Forschungszentrum für Künstliche Intelligenz |
| Collections: | SciDok - Der Wissenschaftsserver der Universität des Saarlandes |
Files for this record:
| File | Description | Size | Format | |
|---|---|---|---|---|
| RR_94_18.pdf | 270,43 kB | Adobe PDF | View/Open |
Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.