11 research outputs found

    Nutzung externer Datenbanken durch die Hochschulen in den neuen Bundeslaendern Erfolgskontrollbericht. Schlussbericht

    No full text
    SIGLEAvailable from TIB Hannover: DtF QN1(33,43) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekBundesministerium fuer Bildung, Wissenschaft, Forschung und Technologie, Bonn (Germany)DEGerman

    WISCON. Teilthema: Wissensverarbeitung in dynamischen Prozessumgebungen Abschlussbericht

    No full text
    The concept of knowledge-based process supervision and control is aimed at extending conventional process control systems by knowledge-based components. In case of a disturbance, the underlying complex dynamic process shall be brought back to its working regime by means of knowledge-based control measures. Compared to the current state of the art, the implementation of these ideas leads to a proper progress. The Leipzig project group of the joint project WICSON had focussed its investigations and development on five areas: (1) knowledge acquisition, (2) knowledge representation, (3) diagnosis, (4) simulation, and (5) therapy. The results have been partially integrated in the overall research and development project. Particular emphasis has been put on a knowledge-based approach to therapy control and its implementation. Therapy control is understood as an interacting team of modules for: (1) plan generation, (2) plan execution, and (3) constraint monitoring. The approach is based on innovative graph-theoretic concepts for plan generation by context-free graph gewriting and on a refined modal temporal logic for constraint checking and monitoring. There are several implementations ranging from knowledge acquisition and representation via simulation on a cluster of transputers to planning. The underlying languages are C++, Occam, Lisp (CLOS), and Quintus Prolog. (orig.)SIGLEAvailable from TIB Hannover: F95B2221+a / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekBundesministerium fuer Forschung und Technologie (BMFT), Bonn (Germany)DEGerman

    Integration von modell- und fallbasierten Entwicklungsansaetzen fuer wissensbasierte Systeme Abschlussbericht

    No full text
    The report is presenting a collection of related approaches to algorithmic learning from incomplete information. This presentation aims at exemplifying a collection of efforts to exploit learning theoretic results for the benefit of application-oriented research projects. There is an introduction motivating the overall approach and relating the 5 following papers of the collection. The papers contained in this report may be classified resp. grouped together with respect to several criteria. The resulting different classifications overlap and, thus, exhibit the interplay of the research activities described. From the view point of theories, the first 3 papers belong together. Their common subject is inductive learning of formal languages. In contrast, the last two papers refer to different application-oriented projects, the joint project Fabel and the joint project Wiscon, respectively. From the view point of research methodologies, the first 2 papers are more or less theoretical in spirit, whereas the last 3 papers are based on prototypical system developments and experiments. From the view point of inference paradigms, the 3rd and the 4th paper are closely related, as they investigate phenomena of case-based reasoning. The 5th paper deals with planning problems, whereas the reasoning underlying the first 2 papers is essentially recursion theoretic. The clue of relating the papers of the present collection is learning from incomplete information, i.e. inductive inference. (orig.)SIGLEAvailable from TIB Hannover: DtF QN1(56,43) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekBundesministerium fuer Bildung, Wissenschaft, Forschung und Technologie, Bonn (Germany)DEGerman

    Dynamische Kompression von LIDAR-Signalen Abschlussbericht

    No full text
    SIGLEAvailable from TIB Hannover: F01B1212 / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekBundesministerium fuer Bildung und Forschung, Berlin (Germany)DEGerman

    The learnability of recursive languages in dependence on the hypothesis space

    No full text
    We study the learnability of indexed families of uniformly recursive languages under certain monotonicity constraints. Thereby we distinguish between exact learnability (L has to be learnt with respect to the space L of hypotheses), class preserving learning (L has to be inferred with respect to some space G of hypotheses having the same range as L), and class comprising inference (L has to be learnt with respect to some space G of hypotheses that has a range comprising range (L)). In particular, it is proved that, whenever monotonicity requirements are involved, then exact learning is almost always weaker than class preserving inference which itself turns out to be almost always weaker than class comprising learning. Next, we provide additionally insight into the problem under what conditions, for example, exact and class preserving learning procedures are of equal power. Finally, we deal with the question what kind of languages has to be added to the space of hypotheses in order to obtain superior learning algorithms. (orig.)SIGLEAvailable from TIB Hannover: RR 1345(1993,20)+a / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekBundesministerium fuer Forschung und Technologie (BMFT), Bonn (Germany)DEGerman

    ACTION: Ein Modul zur Extraktion von Aufgabenstrukturen aus Benutzer-Traces

    No full text
    SIGLEAvailable from TIB Hannover: RR 3215(32) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekBundesministerium fuer Forschung und Technologie (BMFT), Bonn (Germany)DEGerman

    Algorithmic learning for knowledge-based systems. Pt. 1 Final report

    No full text
    The investigations within the joint research project GOSLER have been focussed on theoretical problems of learning from usually incomplete information (so-called inductive inference). This research has been motivated by the underlying assumption that knowledge-based systems' applications in complex domains are normally faced to the problem of vagueness and incompleteness of information both about the system or installation considered and the dynamic processes maintained. Among the main inference mechanisms of knowledge-based systems, inductive inference will usually play some key role. The joined project yields some considerable contribution to the theory of inductive inference. The research focussed mainly on theoretical results and prototypical implementations. The main emphasis of the research efforts was put on special effects in inductive inference (like inconsistent hypothesis formation, for instance) which are not yet taken into consideration and implemented in most of the recent knowledge-based systems in use. The theoretical results have been validated and applied by building prototypical systems like T_LP"S and GOSLERP. T_LP"S is an interactive system for design and testing of rewrite systems. GOSLERP is based on the logic programming paradigm with the emphasis on certain metaprogramming features (backtracking of assert and retract). GOSLERP is particularly taylored towards the creation of learning modules for knowledge-based systems. (orig.)Available from TIB Hannover: F95B1492+a / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekSIGLEBundesministerium fuer Forschung und Technologie (BMFT), Bonn (Germany)DEGerman

    Lernszenarien im fallbasierten Schliessen

    No full text
    Available from TIB Hannover: RR 3215(14) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekSIGLEBundesministerium fuer Forschung und Technologie (BMFT), Bonn (Germany)DEGerman

    Classifying recursive predicates and languages

    No full text
    We study the classification of recursive predicates and languages. In particular, we compare the classification of predicates and languages with the classification of arbitrary recursive functions and with learning. Moreover, we refine our investigations by introducing classification with a bounded number of mine changes and establish a new hierarchy. Furthermore, we introduce multi-classification and characterize it. Finally, we study the classification of families of languages that have attracted a lot of attention in learning theory. (orig.)SIGLEAvailable from TIB Hannover: RR 1345(1993,21)+a / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekBundesministerium fuer Forschung und Technologie (BMFT), Bonn (Germany)DEGerman
    corecore