@Inproceedings{Mar-Son-Dar:ilps90,
  author	= {K. Marriott and H. S{\o}ndergaard and P. Dart},
  title		= {A Characterization of Non-floundering Logic Programs},
  editor	= {S. Debray and M. Hermenegildo},
  booktitle	= {Logic Programming: Proc.\ 1990 North American Conf.},
  pages		= {661--680},
  publisher	= { MIT Press}, 
  year		= {1990},
  abstract      = {SLDNF resolution provides an operational semantics which
		(unlike many Prolog implementations of negation) is both 
		computationally tractable and sound with respect to a 
		declarative semantics.  However, SLDNF is not complete, and 
		it achieves soundness only by discarding certain queries to 
		programs because they ``flounder.''

		We present dataflow analyses that for a given normal logic 
		program detects (1) whether naive Prolog-style handling of 
		negation is sound and (2) whether SLDNF resolution avoids 
		floundering.  The analyses are presented in a 
		language-independent framework of abstract interpretation based
		on denotational definitions.  To our knowledge they are more 
		precise than any of their kind.  In particular we obtain a 
		characterization of a class of non-floundering programs larger
		than any other that we know of.  },
}