654 search results - page 47 / 131 » Ordered Sets and Complete Lattices |
JSYML
2008
13 years 7 months ago
2008
In this paper a method for the replacement, in formulas, of strong quantifiers by functions is introduced that can be considered as an alternative to Skolemization in the setting ...
ISCC
2002
IEEE
14 years 17 days ago
2002
IEEE
Generalized association rule mining is an extension of traditional association rule mining to discover more informative rules, given a taxonomy. In this paper, we describe a forma...
ICCAD
1996
IEEE
13 years 11 months ago
1996
IEEE
A scan-based BIST scheme is presented which guarantees complete fault coverage with very low hardware overhead. A probabilistic analysis shows that the output of an LFSR which fee...
JELIA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. A new logic is proposed for reasoning about quantum systems. The logic embodies the postulates of quantum physics and it was designed from the semantics upwards by identi...
AAAI
1990
13 years 8 months ago
1990
This work pertains to the Knuth-Bendix (KB) algorithm which tries to find a complete set of reductions from a given set of equations. In the KB algorithm a term ordering is employ...