Approximating the Success Set of Logic Programs Using Constrained Regular Types

Lee Naish. Approximating the Success Set of Logic Programs Using Constrained Regular Types. In Michael J. Oudshoorn, editor, Computer Science 2003, Twenty-Sixth Australasian Computer Science Conference (ACSC2003), Adelaide, South Australia, February 2003. Volume 16 of CRPIT, pages 61-67, Australian Computer Society, 2003. [doi]

Abstract

Abstract is missing.