2962 search results - page 423 / 593 » Reasoning on Association Rules |
176
click to vote
CSL
2004
Springer
15 years 12 months ago
2004
Springer
We consider the problem of providing formal support for working tract syntax involving variable binders. Gabbay and Pitts have shown in their work on Fraenkel-Mostowski (FM) set th...
173
click to vote
ERCIMDL
2003
Springer
15 years 11 months ago
2003
Springer
A digital library typically includes a set of keywords (or subject terms) for each document in its collection(s). For some applications, including natural resource management, geog...
172
click to vote
ICLP
2001
Springer
15 years 11 months ago
2001
Springer
We formally characterize alternating fixed points of boolean equation systems as models of (propositional) normal logic programs. To this end, we introduce the notion of a preferr...
140
click to vote
VTS
1999
IEEE
15 years 10 months ago
1999
IEEE
1 While multichip module technology has been developed for high performance IC applications, the technology is not widely adopted due to economical reasons. One of the reasons that...
129
click to vote
LICS
1997
IEEE
15 years 10 months ago
1997
IEEE
Abstract. We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the emptiness problem for the intersection of recognizab...