4451 search results - page 59 / 891 » On Random Ordering Constraints |
ESOP
2009
Springer
15 years 3 months ago
2009
Springer
This paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operatio...
100
click to vote
AAAI
1994
15 years 1 months ago
1994
We describe a method for learning formulas in firstorder logic using a brute-force, smallest-first search. The method is exceedingly simple. It generates all irreducible well-form...
CSCLP
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We propose to use bilattice as a constraint valuation structure in order to represent truth and belief at the same time. A bilattice is a set which owns two lattices orde...
100
click to vote
CCA
2009
Springer
15 years 6 months ago
2009
Springer
In the theory of algorithmic randomness, several notions of random sequence are defined via a game-theoretic approach, and the notions that received most attention are perhaps Mar...
132
click to vote
ITIIS
2010
14 years 6 months ago
2010
Anonymous hierarchical identity based encryption (HIBE) is an extension of identity based encryption (IBE) that can use an arbitrary string like an e-mail address for a public key...