Jerzy Marcinkowski. The 3 Frenchmen Method Proves Undecidability of the Uniform Boundedness for Single Recursive Rule Ternary DATALOG Programs. In Claude Puech, Rüdiger Reischuk, editors, STACS 96, 13th Annual Symposium on Theoretical Aspects of Computer Science, Grenoble, France, February 22-24, 1996, Proceedings. Volume 1046 of Lecture Notes in Computer Science, pages 427-438, Springer, 1996.
@inproceedings{Marcinkowski96:0,
title = {The 3 Frenchmen Method Proves Undecidability of the Uniform Boundedness for Single Recursive Rule Ternary DATALOG Programs},
author = {Jerzy Marcinkowski},
year = {1996},
tags = {rule-based, rules, Datalog},
researchr = {https://researchr.org/publication/Marcinkowski96%3A0},
cites = {0},
citedby = {0},
pages = {427-438},
booktitle = {STACS 96, 13th Annual Symposium on Theoretical Aspects of Computer Science, Grenoble, France, February 22-24, 1996, Proceedings},
editor = {Claude Puech and Rüdiger Reischuk},
volume = {1046},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-60922-9},
}