Generalizing completeness results for loop checks in logic programming

1992

Theoretical Computer Science , Volume 104 - Issue 1 p. 3- 28

Presented at the Theoretical Issues of Design and Implementation of Symbolic Computation Systems, Capri

Additional Metadata
MSC	Logic programming (msc 68N17), Artificial intelligence (msc 68Txx)
Publisher	elsevier
Journal	Theoretical Computer Science
Conference	Theoretical Issues of Design and Implementation of Symbolic Computation Systems
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Bol, R. N. (1992). Generalizing completeness results for loop checks in logic programming. In Theoretical Computer Science (Vol. 104, pp. 3–28). elsevier.

Additional Files
Publisher Version
2295D.pdf Final Version , 3mb

Publication