Paper Info
Title
Applying formal concepts to learning systems validation
Abstract
In the problem area of evaluating complex software systems, there are two distinguished areas of research, development, and application identified by the two buzzwords validation and verification, respectively. From the perspective adopted by the authors, verification is usually more formally based and, thus, can be supported by formal reasoning tools like theorem provers, for instance. The scope of verification approaches is limited by the difficulty of finding a sufficiently complete formalization to build upon. In paramount realistic problem domains, validation seems to be more appropriate, although it is less stringent in character and, therefore, validation results are often less definite. The aim of this paper is to exemplify a validation approach based on a clear and thoroughly formal theory. In this way, validation and verification should be brought closer to each other. To allow for precise and sufficiently clear results, the authors have selected the application domain of algorithms and systems for learning formal languages. By means of the validation toolkit TIC, some series of validation experiments have been performed. The results are presented for the sake of illustrating the underlying formal concepts in use. Comparing the validity of one learning approach to the invalidity of another one can be seen as an interesting result in its own right.
Year
DOI
Venue
2000
10.1080/095281300454810
JOURNAL OF EXPERIMENTAL & THEORETICAL ARTIFICIAL INTELLIGENCE
Keywords
Field
DocType
validation,learning systems,formal languages
Programming language,Theory,Verification and validation,Computer science,Software system,Grammar systems theory,Formal methods,Software verification and validation,Formal verification,Software verification
Journal
Volume
Issue
ISSN
12
SP4
0952-813X
Citations 
PageRank 
References 
0
0.34
13
Authors
3
Name
Order
Citations
PageRank
Volker Dötsch1182.98
Gunter Grieser217419.82
Steffen Lange320620.29