Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
What stories should we tell novice PROLOG programmers?
Artificial intelligence programming environments
Tcl and the Tk toolkit
PROLOG Programming for Artificial Intelligence
PROLOG Programming for Artificial Intelligence
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Analysis and Visualization Tools for Constraint Programming, Constrain Debugging (DiSCiPl project)
Analysis and Visualization Tools for Constraint Programming, Constrain Debugging (DiSCiPl project)
Tools for Search-Tree Visualisation: The APT Tool
Analysis and Visualization Tools for Constraint Programming, Constrain Debugging (DiSCiPl project)
Visual Tools to Debug Prolog IV Programs
Analysis and Visualization Tools for Constraint Programming, Constrain Debugging (DiSCiPl project)
Analysis and Visualization Tools for Constraint Programming, Constrain Debugging (DiSCiPl project)
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
A Framework for Interpreting Traces of Functional Logic Computations
Electronic Notes in Theoretical Computer Science (ENTCS)
Declarative diagnosis of temporal concurrent constraint programs
ICLP'07 Proceedings of the 23rd international conference on Logic programming
An integrated framework for the diagnosis and correction of rule-based programs
Theoretical Computer Science
| Hi-index | 0.00 |
ViMer is a visual debugging environment for Mercury programs which has three main contributions. First, it employs a new execution tree representation, the layered AND-OR tree, which we believe provides a better way of visualizing backtracking in AND-OR-like trees. Second, it uses incremental constraint-solving to efficiently draw and incrementally update the visualization of the execution tree. And finally, it borrows techniques from standard tracers (such as the use of spy points to reduce the amount of tree nodes, and the placement of restrictions on the amount of information stored at each node) that help keep the tool efficient while still providing enough information for debugging.