The purpose of this section is to describe a simple way to make it so that rule trees can be viewed using a graphical Java application program. There is, for example, no need to parse the literals from Prolog, since they can assumed to have been correctly generated and written. The tree expression operator. These programs are in visualize. P. Loading visualize.
P also loads npl.
As before, a normal rulebase is loaded via the know predicate. This version communicates with Java via the file tree.txt . The PC version for XSB Prolog uses the file communication method because the socket version does not work for Windows. We will discuss the socket version later in this section. P , visualize.