Last update: Wed Sep 26 02:11:46 MDT 2018
@Article{Dowling:1990:FPL, author = "W. F. Dowling and R. Kline", title = "The fixed points of logic programs with {Herbrand} base {$N$}", journal = j-THEOR-COMP-SCI, volume = "77", number = "3", pages = "309--319", day = "15", month = dec, year = "1990", 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 = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math. and Comput. Sci., Drexel Univ., Philadelphia, PA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; fixed points; Herbrand base; logic programming; logic programs; recursion-theoretic complexity", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", }