Logichart — Intelligible Program Diagram for Prolog and its Processing System (original) (raw)
Related papers
AORTA Diagrams As An Aid To Visualising The Execution Of Prolog Programs
Logic programs have traditionally been described by means of 'AND/OR' trees. The AORTA diagram is an And/OR Tree, Augmented to include invocation history 'status boxes' at each node. This augmentation makes it possible to present a graphical view of Prolog execution which is very compact, yet which contains complete details of unification and control history, including multiple (backtracking) invocations and extra-logical features such as the cut. The notation described herein serves as the uniform basis for textbook diagrams, video-based animations, and an advanced tracing and debugging facility running on modern graphics workstations.
Two-dimensional visual programming and three-dimensional execution visualisation in Prolog
Real World Visualisation-Virtual World-Virtual …, 1991
A new, simple, expressively complete visual formalism for programming in Prolog is presented. The formalism is shown to be equivalent to the standard textual notation for Prolog. Some aspects of Prolog programs are identified that appear to be clearer for novices when presented in the graphic formalism, while other aspects of Prolog are noted that may be clearer in the standard textual notation. The design of an implemented computer environment dubbed VPP (short forVisual Programming in Prolog') is presented that ...
AORTA Diagrams As An Aid To Visualising The Execution Of Prolog Programs1
1988
Logic programs have traditionally been described by means of 'AND/OR' trees. The AORTA diagram is an And/OR Tree, Augmented to include invocation history 'status boxes' at each node. This augmentation makes it possible to present a graphical view of Prolog execution which is very compact, yet which contains complete details of unification and control history, including multiple (backtracking) invocations and extra-logical features such as the cut. The notation described herein serves as the uniform basis for textbook diagrams, video-based animations, and an advanced tracing and debugging facility running on modern graphics workstations.
Interim report on the Visualisation of Prolog execution in three dimensions
2009
A simple, expressively complete, prototype system is presented for visual programming in Prolog, and for the complete visualisation of the execution of Prolog programs in three spatial dimensions. The first part of this system, known as VPP (short for Visual Programming in Prolog) enables users to edit and create Prolog programs graphically by manipulating and connecting graphical symbols on screen. The resulting programs can be executed by constructing queries graphically in a similar manner. The ...
From Graphical Objects to Terms and Back: an Extended Application Framework for Prolog
We present a framework to build platform-independent, graphical applications in Prolog, implemented upon a C++-based commercial product. This framework is extended with an Introspection/Replication feature which can be seen as object serialization returning Prolog descriptions. Some experiments, especially the prototype of an Interface Builder, indicate that interesting results are obtained in terms of simplicity, generality and portability.
2018
Contemporary tools of graph data visualization do not allow to work with logic expressions completely. The purpose of our research is to develop a complete and convenient method for its visualization. The developed prototype is intended for realization in the Ontodia library. We analyze the tools of Ontodia with respect to description logic syntax and adopt required tools from Ch. S. Pierce’s existential graphs system. In addition, we propose to use schemes of expression for prompting to a user, optimizing data structure and explicating an ontology structure. We illustrate the developed method, named logic graphs, on a simple demo-ontology.
Visual Software Development Environment Based on Graph Grammars
IEICE Transactions on Information and Systems, 2009
In software design and development, program diagrams are often used for good visualization. Many kinds of program diagrams have been proposed and used. To process such diagrams automatically and efficiently, the program diagram structure needs to be formalized. We aim to construct a diagram processing system with an efficient parser for our program diagram Hichart. In this paper, we give a precedence graph grammar for Hichart that can parse in linear time. We also describe a parsing method and processing system incorporating the Hichart graphical editor that is based on the precedence graph grammar.
A new language for the visualization of logic and reasoning
2005
Many visual languages based on Euler diagrams have emerged for expressing relationships between sets. The expressive power of these languages varies, but the majority can only express statements involving unary relations and, sometimes, equality. We present a new visual language called Visual First Order Logic (VFOL) that was developed from work on constraint diagrams which are designed for software specification.
DelP Viewer: a Defeasible Logic Programming Visualization Tool
Defeasible Logic Programming (DeLP) is a knowledge representation formalism that combines results from Logic Programming and Defeasible Argumentation to provide reasoning based on contradictory and potentially incomplete information. DeLP allows information representation by using weak rules and provides an argumentation inference mechanism for warranting the entailed conclusions. It is necessary to comprehend the relationships between the arguments involved in DeLP derivation to understand the reasoning process and justify the replies provided by the DeLP system. In order to reach such a degree of understanding we present DeLP Viewer, a DeLP visualization tool for representing the inference process performed by a DeLP reasoner. Albeit there are many applications designed for argumentation visualization, our proposal provides a visual representation for the underlying logic and argumentative structure behind DeLP, allowing the interactive exploration of the entire reasoning process plus the internals of the involved arguments.