1717 search results - page 211 / 344 » A Computable Spectral Theorem |
149
click to vote
BIRTHDAY
2007
Springer
16 years 4 days ago
2007
Springer
Abstract. In this paper we review some well-known theory about reduction strategies of various kinds: normalizing, outermost-fair, cofinal, Church-Rosser. A stumbling block in the...
185
click to vote
ACL2
2006
ACM
15 years 12 months ago
2006
ACM
We describe an embedding of the ACL2 logic into higherorder logic. An implementation of this embedding allows ACL2 to be used as an oracle for higher-order logic provers. Categori...
193
click to vote
ACL2
2006
ACM
15 years 12 months ago
2006
ACM
Several users have had problems using equivalence-based rewriting in ACL2 because the ACL2 rewriter caches its results. We describe this problem in some detail, together with a pa...
130
click to vote
ACMSE
2006
ACM
15 years 12 months ago
2006
ACM
Classic results in the theory of regular languages show that the problem of converting an NFA (nondeterministic finite automaton) into a minimal equivalent NFA is NP-hard, even f...
145
click to vote
IUI
2006
ACM
15 years 12 months ago
2006
ACM
In this paper we describe research on using eye-tracking data for on-line assessment of user meta-cognitive behavior during the interaction with an intelligent learning environmen...