2962 search results - page 494 / 593 » Reasoning on Association Rules |
211
click to vote
POPL
1997
ACM
15 years 11 months ago
1997
ACM
Type systems currently available for imperative languages are too weak to detect a significant class of programming errors. For example, they cannot express the property that a l...
164
click to vote
SIGMOD
1996
ACM
15 years 11 months ago
1996
ACM
Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which diffe...
203
click to vote
RSCTC
2000
Springer
15 years 10 months ago
2000
Springer
We discuss how Case Based Reasoning (CBR) (see e.g. [1], [4]) philosophy of adaptation of some known situations to new similar ones can be realized in rough set framework [5] for c...
182
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 simplifications. Computational systems are rewrite theories enriched by stra...
206
click to vote
BPM
2008
Springer
15 years 8 months ago
2008
Springer
A given business process may face a large number of regulatory obligations the process may or comply with. Providing tools and techniques through which an evaluation of the complia...