Year: 1994
Type: conference-paper
Abstract: The clausal discovery engine claudien is presented.claudien discovers regularities in data and is a representative of the inductive logic programming paradigm.As such, it represents data and regularities by means of rst order clausal theories.Because the search space of clausal theories is larger than that of attribute value representation, claudien also accepts as input a declarative speci cation of the language bias, which determines the set of syntactically well-formed regularities.Whereas other papers on claudien focus on the semantics or logical problem speci cation of claudien, on the discovery algorithm, or the PAC-learning aspects, this paper wants to illustrate the power of the resulting technique.In order to achieve this aim, we show how claudien can be used to learn 1) integrity constraints in databases, 2) functional dependencies and determinations, 3) properties of sequences, 4) mixed quantitative and qualitative laws, 5) reverse engineering, and 6) classi cation rules.
Source: Lirias
Authors: Wim Van Laer, Luc De Raedt
Institution: KU Leuven
Language: English
Subfield: Information Systems
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W175605978