M. Eisenstadt and M. Brayshaw. The Transparent Prolog Machine TPM: an execution model and graphical debugger for Logic Programming. Journal of Logic Programming, 5(4):277342, 1988.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....issue as Elision control making the observation that irrelevant information may need to be suppressed and that the problem grows with the size of the project. Jeliot [6] allows the user to allow program variables to be present ( or not ) on a stage on which the visualisation is enacted. TPM [5] allows the user to choose between a Long Distance View (LDV) or a close up view of the And Or Tree Augmented (AORTA) The PVML stream so far proposed could be described as complete including all aspects of program execution down to a level that represents the most fine grained visualisation that ....

)Eisenstadt, M. and Brayshaw, M., "The Transparent Prolog Machine (TPM); an execution model and graphical debugger for logic programming ", in Journal of Logic Programming(5) 4 pp. 1-66 (1988)

....Opium programs, tracing at the proper level of abstraction without modifying their application source code. Several examples of abstract tracing with Opium can be found in [Ducass#, 1999] We give here an example of what can be done on a simple expert system taken from an article of [Brayshaw Eisenstadt, 1988]. The source code follows. op(900, xfx, op(870, fx, if) op(880, xfx, then) op(550, xfy, or) op(540, xfy, and) op(100, xfx, gives,eats,has,isa] solve(Goal) fact:Goal. solve(Goal) Rule:if Cond then Goal,solve(Cond) solve(Goal1 and Goal2) solve(Goal1) ....

....1983, Eisenstadt, 1985, Moroshita Numao, 1986, Lloyd, 1987, Yalcinalp, 1991] To achieve this most of them run a dedicated Prolog interpreter, thus they can hardly provide users with dioeerent points of view. Goal views are provided by graphical tracers (such as the Transparent Prolog Machine of [Eisenstadt Brayshaw, 1988]) and visualization tools (such as Pictorial Janus of [Kahn Saraswat, 1990] Neufeld et al. 1997] proposes a colouring of the search tree which illuminates the unication process. Graphical tools usually display the whole execution which can easily be overwhelming. Furthermore, Mulholland, ....

M. Eisenstadt and M. Brayshaw. (1988). The Transparent Prolog MachineTPM: an execution model and graphical debugger for Logic Programming. Journal of Logic Programming, 5(4):277342.

....system control One of the forms of interaction suggested in the questionnaire was for the user to have control over the algorithm s execution and visualization. This is a common feature of many visualization systems which enables the user to monitor the effect of each program step (e.g. TPM [7] , Balsa II [2] Tango [10] Typical Responses: The respondents comments associated with this type of control mechanism were favourable: very useful like an omniscient, but impotent viewer. Excellent. All of those options (bar one) are catered for in GAmeter, so I think they are ....

M. Eisenstadt and M. Brayshaw, "The Transparent Prolog Machine (TPM): An Execution Model and Graphical Debugger for Logic Programming," The Open University, Human Cognition Research Laboratory, Technical Report 21A, October 1987.

....typically provides information in low bandwidth textual form. This results in confusion, dissatisfaction, and inefficiency for users, especially novices. A tree is a natural way to represent and understand Prolog computations. Most systems for graphically visualizing Prolog [Boja89, DeCl86, EiBr88] utilize either a proof tree or search tree as their basic framework. Most focus on portraying success or failure of clauses and backtracking. Although they typically show unification of a subgoal and a clause head, these systems provide little visual information about the effect of unification ....

M. Eisenstadt and M. Brayshaw, "The Transparent Prolog Machine (TPM): An execution model and graphical debugger for logic programming", in Journal of Logic Programming, Vol. 5, No. 4, 1988, pp. 277--342.

No context found.

M. Eisenstadt and M. Brayshaw. The Transparent Prolog Machine TPM: an execution model and graphical debugger for Logic Programming. Journal of Logic Programming, 5(4):277342, 1988.

No context found.

Eisenstadt M, Brayshaw M, `The Transparent Prolog Machine (TPM): An Execution Model and Graphical Debugger for Logic Programming', Human Cognition Research Laboratory, The Open University, Technical Report, N 21a, 1987

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC