Sciweavers

1581 search results - page 113 / 317
» Mechanizing Inductive Reasoning
Sort
View
CSL
2008
Springer
15 years 8 months ago
Type-Based Termination with Sized Products
Type-based termination is a semantically intuitive method that ensures termination of recursive definitions by tracking the size of datatype elements, and by checking that recursiv...
Gilles Barthe, Benjamin Grégoire, Colin Rib...
IDA
2000
Springer
15 years 6 months ago
From machine learning to knowledge discovery: Survey of preprocessing and postprocessing
Knowledge Discovery in Databases (KDD) has become a very attractive discipline both for research and industry within last few years. Its goal is to extract pieces of knowledge or `...
Ivan Bruha
ML
2000
ACM
244views Machine Learning» more  ML 2000»
15 years 6 months ago
Learnable Evolution Model: Evolutionary Processes Guided by Machine Learning
A new class of evolutionary computation processes is presented, called Learnable Evolution Model or LEM. In contrast to Darwinian-type evolution that relies on mutation, recombinat...
Ryszard S. Michalski
JAIR
2010
111views more  JAIR 2010»
15 years 4 months ago
Grounding FO and FO(ID) with Bounds
Grounding is the task of reducing a first-order theory and finite domain to an equivalent propositional theory. It is used as preprocessing phase in many logic-based reasoning s...
Johan Wittocx, Maarten Mariën, Marc Denecker
LICS
2012
IEEE
13 years 8 months ago
Logics of Dynamical Systems
—We study the logic of dynamical systems, that is, logics and proof principles for properties of dynamical systems. Dynamical systems are mathematical models describing how the s...
André Platzer