Last update: Wed Sep 26 02:11:46 MDT 2018
@Article{Hein:1992:CPL,
author = "J. Hein",
title = "Completions of perpetual logic programs",
journal = j-THEOR-COMP-SCI,
volume = "99",
number = "1",
pages = "65--78",
day = "01",
month = jun,
year = "1992",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:24:22 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C6110L (Logic programming)",
corpsource = "Dept. of Comput. Sci., Portland State Univ., OR, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Herbrand based semantics; logic programming; logic
programs; perpetual logic programs; SLD-resolution",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}