113
click to vote
WLP
2000
Springer
15 years 4 months ago
2000
Springer
In this paper, a dynamic approach to deductive query evaluation is presented which combines the e ects of di erent SIP strategies used for the magic set rewriting technique. Given...
93
Voted
ADBIS
1995
Springer
15 years 4 months ago
1995
Springer
It is by now folklore that the bottom-up evaluation of a program after the “magic set” transformation is “as efficient as” top-down evaluation. There are a number of forma...
123
Voted
ICLP
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Answer set programming (ASP) is a powerful formalism for knowledge representation and common sense reasoning that allows disjunction in rule heads and nonmonotonic negati...
105
Voted
SIGMOD
1996
ACM
15 years 5 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...