1998 search results - page 153 / 400 » Basic Association Rules |
102
click to vote
ENTCS
2008
15 years 2 months ago
2008
There are several proposals for extending Prolog with functional capabilities. The basic idea is to enlarge the language with function definitions that are translated (or expanded...
153
Voted
IGPL
2011
14 years 6 months ago
2011
A residuated algebra (RA) is a generalization of a residuated groupoid; instead of one basic binary operation · with residual operations \, /, it admits finitely many basic oper...
125
Voted
RTA
2005
Springer
15 years 8 months ago
2005
Springer
Proof-carrying code provides a mechanism for insuring that a host, or code consumer, can safely run code delivered by a code producer. The host specifies a safety policy as a set ...
118
Voted
ICLP
1993
Springer
15 years 6 months ago
1993
Springer
A basic requirement of declarative programming is to free the programmer from the need to manually insert control annotations into the program. Here we study the execution of logi...
123
Voted
CSL
2006
Springer
15 years 6 months ago
2006
Springer
Based on natural deduction, Pure Type Systems (PTS) can express a wide range of type theories. In order to express proof-search in such theories, we introduce the Pure Type Sequent...