Sciweavers

3573 search results - page 273 / 715
» Reasoning about Codata
Sort
View
118
Voted
NIPS
1996
15 years 6 months ago
Second-order Learning Algorithm with Squared Penalty Term
This paper compares three penalty terms with respect to the efficiency of supervised learning, by using first- and second-order learning algorithms. Our experiments showed that fo...
Kazumi Saito, Ryohei Nakano
ECAI
2008
Springer
15 years 5 months ago
Regression for Classical and Nondeterministic Planning
Many forms of reasoning about actions and planning can be reduced to regression, the computation of the weakest precondition a state has to satisfy to guarantee the satisfaction of...
Jussi Rintanen
ENTCS
2008
99views more  ENTCS 2008»
15 years 4 months ago
Specifying Properties of Concurrent Computations in CLF
CLF (the Concurrent Logical Framework) is a language for specifying and reasoning about concurrent systems. Its most significant feature is the first-class representation of concu...
Kevin Watkins, Iliano Cervesato, Frank Pfenning, D...
ENTCS
2008
132views more  ENTCS 2008»
15 years 4 months ago
A Meta Linear Logical Framework
Logical frameworks serve as meta-languages to represent deductive systems, sometimes requiring special purpose meta logics to reason about the representations. In this work, we de...
Andrew McCreight, Carsten Schürmann
120
Voted
ENTCS
2008
102views more  ENTCS 2008»
15 years 4 months ago
A Monotonicity Principle for Information Theory
We establish a monotonicity principle for convex functions that enables high-level reasoning about capacity in information theory. Despite its simplicity, this single idea is rema...
Konstantinos Chatzikokolakis, Keye Martin