Magic for Filter Optimization in Dynamic Bottom-up Processing
<|reference_start|>Magic for Filter Optimization in Dynamic Bottom-up Processing: Off-line compilation of logic grammars using Magic allows an incorporation of filtering into the logic underlying the grammar. The explicit definite clause characterization of filtering resulting from Magic compilation allows processor independent and logically clean optimizations of dynamic bottom-up processing with respect to goal-directedness. Two filter optimizations based on the program transformation technique of Unfolding are discussed which are of practical and theoretical interest.<|reference_end|>
@article{minnen1996magic,
    title={Magic for Filter Optimization in Dynamic Bottom-up Processing},
    author={Guido Minnen (SFB 340, Univ. of Tuebingen)},
    journal={Proceedings of ACL 96, Santa Cruz, USA, June 23-28},
    year={1996},
    archivePrefix={arXiv},
    eprint={cmp-lg/9604019},
    primaryClass={cmp-lg cs.CL}
}