Chapter PDF
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(1997). Subsumption theorem and refutation completeness. In: Foundations of Inductive Logic Programming. Lecture Notes in Computer Science, vol 1228. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62927-0_5
Download citation
DOI: https://doi.org/10.1007/3-540-62927-0_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62927-6
Online ISBN: 978-3-540-69049-8
eBook Packages: Springer Book Archive