Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Mark Wallace. Tight, Consistent and Computable Completions for Unrestricted Logic Programs. Journal of Logic and Algebraic Programming, 15(3):243-273, 1993.
No references recorded for this publication.
No citations of this publication recorded.