School of Computing

A Revised Textual Tree Trace Notation for Prolog

C. Taylor, J.B.H. du Boulay, and M.J. Patel

In Paul Brna, Benedict du Boulay, and Helen Pain, editors, Learning to Build and Comprehend Complex Information Structures: Prolog as a Case Study, volume 3, pages 182-196. Ablex Publishing Corporation, August 1999.

Abstract

This paper describes a "textual tree trace" (TTT) notation for representing the execution of Prolog programs. Compact, textual and non-linear, it provides detailed information about variable binding and execution history, and distinguishes several modes of goal failure. The revised form given here, yet to be empirically tested, is partly informed by Paul Mulholland's empirical comparisons of Prolog trace notations, in which an earlier version of the TTT notation was amongst those studied and criticised. The work presented here is an updated version of a previous workshop paper (Taylor, du Boulay, & Patel, 1994).

Download publication 160 kbytes (PostScript)

Bibtex Record

@incollection{1002,
author = {C. Taylor and J.B.H. du Boulay and M.J. Patel},
title = {{A Revised Textual Tree Trace Notation for Prolog}},
month = {August},
year = {1999},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/1999/1002},
    booktitle = {Learning to Build and Comprehend Complex Information Structures: Prolog as a Case Study},
    editor = {Paul Brna and Benedict du Boulay and Helen Pain},
    publication_type = {incollection},
    publisher = {Ablex Publishing Corporation},
    submission_id = {24863_951744244},
    volume = {3},
}

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 21/03/2014