Skip Navigation

The Computer Journal 1986 29(1):17-19; doi:10.1093/comjnl/29.1.17
© 1986 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Foo, N. Y.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Dewey Indexing of Prolog Traces

N. Y. Foo *

Basser Department of Computer Science, University of Sydney, Sydney, Australia 2006

Dewey decimal indexing is introduced to label the nodes of a Prolog proof tree. The indices are exploited to linearise the conventional preorder search sequence. The scheme is shown to be very simple and convenient way to diplay traces, and is used to annotate and simulate backtracking and variable binding in Prolog. Independent traces can also be merged easily.

Received October 1984.

* Basser Department of Computer Science, University of Sydney, Sydney, Australia 2006


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.