Tobias Scheffer, Ralf Herbrich, Fritz Wysotzki. Efficient Theta-Subsumption Based on Graph Algorithms. In Stephen Muggleton, editor, Inductive Logic Programming, 6th International Workshop, ILP-96, Stockholm, Sweden, August 26-28, 1996, Selected Papers. Volume 1314 of Lecture Notes in Computer Science, pages 212-228, Springer, 1996.
@inproceedings{SchefferHW96,
title = {Efficient Theta-Subsumption Based on Graph Algorithms},
author = {Tobias Scheffer and Ralf Herbrich and Fritz Wysotzki},
year = {1996},
tags = {rule-based, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/SchefferHW96},
cites = {0},
citedby = {0},
pages = {212-228},
booktitle = {Inductive Logic Programming, 6th International Workshop, ILP-96, Stockholm, Sweden, August 26-28, 1996, Selected Papers},
editor = {Stephen Muggleton},
volume = {1314},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-63494-0},
}