Formal Logics of Discovery and Hypothesis Formation by Machine.
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F03%3A06020165" target="_blank" >RIV/67985807:_____/03:06020165 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Formal Logics of Discovery and Hypothesis Formation by Machine.
Original language description
The aims of the paper include: (1) To call the attention of the community of Discovery Science (DS) to certain existing formal systems for DS developed in Prague in the 1960s through the 1980s suitable for DS and unfortunately largely unknown. (2) To illustrate the use of the calculi in question by the example of the GUHA method of hypothesis generation by computer, subjecting this method to a critical evaluation in the context of contemporary data mining.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2003
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Theoretical Computer Science
ISSN
0304-3975
e-ISSN
—
Volume of the periodical
292
Issue of the periodical within the volume
N/A
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
13
Pages from-to
345-357
UT code for WoS article
—
EID of the result in the Scopus database
—