2911 search results - page 247 / 583 » A Theory of Expressiveness in Mechanisms |
181
click to vote
IJCAI
1989
15 years 7 months ago
1989
This paper considers the Valiant framework as it is applied to the task of learning logical concepts from random examples. It is argued that the current interpretation of this Val...
175
click to vote
CCS
2007
ACM
16 years 23 days ago
2007
ACM
In this paper, we study the maintenance of role-based access control (RBAC) models in database environments using transitive closure relations. In particular, the algorithms that ...
221
click to vote
MCMASTER
1993
15 years 10 months ago
1993
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...
175
click to vote
RTA
1995
Springer
15 years 10 months ago
1995
Springer
We use computational systems to express a completion with constraints procedure that gives priority to simpliļ¬cations. Computational systems are rewrite theories enriched by stra...
157
click to vote
ICFP
2004
ACM
16 years 6 months ago
2004
ACM
Even in statically typed languages it is useful to have certain invariants checked dynamically. Findler and Felleisen gave an algorithm for dynamically checking expressive higher-...