Sciweavers

922 search results - page 34 / 185
» A generalization of the Lin-Zhao theorem
Sort
View
ICML
1989
IEEE
13 years 11 months ago
Higher-Order and Modal Logic as a Framework for Explanation-Based Generalization
Logic programming provides a uniform framework in which all aspects of explanation-based generalization and learning may be defined and carried out, but first-order Horn logic i...
Scott Dietzen, Frank Pfenning
JMLR
2008
83views more  JMLR 2008»
13 years 7 months ago
Generalization from Observed to Unobserved Features by Clustering
We argue that when objects are characterized by many attributes, clustering them on the basis of a random subset of these attributes can capture information on the unobserved attr...
Eyal Krupka, Naftali Tishby
CORR
2010
Springer
84views Education» more  CORR 2010»
13 years 5 months ago
Termination Casts: A Flexible Approach to Termination with General Recursion
This paper proposes a type-and-effect system called Teq, which distinguishes terminating terms and total functions from possibly diverging terms and partial functions, for a lambd...
Aaron Stump, Vilhelm Sjöberg, Stephanie Weiri...
PLPV
2010
ACM
14 years 4 months ago
Free theorems for functional logic programs
Type-based reasoning is popular in functional programming. In particular, parametric polymorphism constrains functions in such a way that statements about their behavior can be de...
Jan Christiansen, Daniel Seidel, Janis Voigtlä...
CDC
2008
IEEE
152views Control Systems» more  CDC 2008»
14 years 2 months ago
Non-uniform small-gain theorems for systems with unstable invariant sets
— We consider the problem of small-gain analysis of asymptotic behavior in interconnected nonlinear dynamic systems. Mathematical models of these systems are allowed to be uncert...
Ivan Tyukin, Erik Steur, Henk Nijmeijer, Cees van ...