@proceedings {CominiLV95a,
	title = {Declarative Diagnosis Revisited},
	journal = {Proceedings of the 1995 Int{\textquoteright}l Symposium on Logic Programming},
	year = {1995},
	pages = {275{\textendash}287},
	publisher = {The MIT Press},
	abstract = {We extend the declarative diagnosis methods to the diagnosis w.r.t. computed answers. We show that absence of uncovered atoms implies completeness for a large class of programs. We then define a top-down diagnoser, which uses one oracle only, does not require to determine in advance the symptoms and is driven by a (finite) set of goals. Finally we tackle the problem of effectivity, by introducing (finite) partial specifications. We obtain an effective diagnosis method, which is weaker than the general one in the case of correctness, yet can efficiently be implemented in both a top-down and in a bottom-up style.},
	author = {Marco Comini and Giorgio Levi and Vitiello, G.},
	editor = {Lloyd, J.}
}
