Last update: Thu Sep 27 02:46:46 MDT 2018
@Article{Cox:1984:CNA,
author = "P. T. Cox and T. Pietrzykowski",
title = "A complete, nonredundant algorithm for reversed
Skolemization",
journal = j-THEOR-COMP-SCI,
volume = "28",
number = "3",
pages = "239--261",
month = feb,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Univ. of Auckland, Auckland, New Zealand",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algorithm theory; closed quantified literals; complete
nonredundant algorithm; Completeness; Nonredundancy;
predicate logic; reversed Skolemization; Skolem
functions; Soundness",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}