Boolean Matrix Logic Programming
<|reference_start|>Boolean Matrix Logic Programming: We describe a datalog query evaluation approach based on efficient and composable boolean matrix manipulation modules. We first define an overarching problem, Boolean Matrix Logic Programming (BMLP), which uses boolean matrices as an alternative computation to evaluate datalog programs. We develop two novel BMLP modules for bottom-up inferences on linear dyadic recursive datalog programs, and show how additional modules can extend this capability to compute both linear and non-linear recursive datalog programs of arity two. Our empirical results demonstrate that these modules outperform general-purpose and specialised systems by factors of 30x and 9x, respectively, when evaluating large programs with millions of facts. This boolean matrix approach significantly enhances the efficiency of datalog querying to support logic programming techniques.<|reference_end|>
@article{ai2024boolean,
    title={Boolean Matrix Logic Programming},
    author={Lun Ai and Stephen H. Muggleton},
    journal={arXiv preprint arXiv:2408.10369},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.10369},
    primaryClass={cs.SC cs.AI cs.LO}
}