Top-down Zooming Diagnosis of Logic Programs

Abstract

This paper presents a new diagnosis algorithm for Prolog proglams. Bugs are located by tracing either proof trees or search trees in a top-down Human programmers just need to answer “Yes” or “No” for queries issued durin the to -d queries about atoms with the same pIedicates are issued contirrually so that not onl $g$ $e$ op- own tracing. Moreover, containing bugs ar identified more quickly but also queries are easier for hu no on $y$ segments to answer. An outline of an implementation of the diagnosis algorithm is shown as $we \mathbb{I}$ .