Tight, Consistent and Computable Completions for Unrestricted Logic Programs

Mark Wallace. Tight, Consistent and Computable Completions for Unrestricted Logic Programs. Journal of Logic and Algebraic Programming, 15(3):243-273, 1993.

Abstract

Abstract is missing.