Sciweavers

7289 search results - page 296 / 1458
» A Dependent Set Theory
Sort
View
AUTOMATICA
2000
71views more  AUTOMATICA 2000»
15 years 6 months ago
Linear quadratic bumpless transfer
The use of linear quadratic theory in bumpless transfer is discussed and a modification to a similar scheme proposed in [9] is suggested. Formulae are given for a feedback element...
Matthew C. Turner, Daniel J. Walker
ICTIR
2009
Springer
16 years 1 months ago
The Quantum Probability Ranking Principle for Information Retrieval
Abstract. While the Probability Ranking Principle for Information Retrieval provides the basis for formal models, it makes a very strong assumption regarding the dependence between...
Guido Zuccon, Leif Azzopardi, Keith van Rijsbergen
TPHOL
2008
IEEE
16 years 1 months ago
First-Class Type Classes
Abstract. Type Classes have met a large success in Haskell and Isabelle, as a solution for sharing notations by overloading and for specith abstract structures by quantification o...
Matthieu Sozeau, Nicolas Oury
ICFP
2005
ACM
16 years 6 months ago
A computational approach to reflective meta-reasoning about languages with bindings
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...
Aleksey Nogin, Alexei Kopylov, Xin Yu, Jason Hicke...
170
Voted
AIML
1998
15 years 8 months ago
Propositions, Propositional Attitudes and Belief Revision
In this paper I will propose a new approach to certain semantic puzzles due to Frege, Kripke and others, and the question of propositional attitudes, via the notion of belief revi...
Rohit Parikh