Drawing Prolog Search Trees: A Manual for Teachers and Students of Logic Programming

01/22/2020
by   Johan Bos, et al.
0

Programming in Prolog is hard for programmers that are used to procedural coding. In this manual the method of drawing search trees is introduced with the aim to get a better understanding of how Prolog works. After giving a first example of a Prolog database, query and search tree, the art of drawing search trees is systematically introduced giving guidelines for queries with variables, conjunction, disjunction, and negation. Further examples are provided by giving the complete search trees that are shown in Learn Prolog Now!

READ FULL TEXT

page 6

page 7

page 12

page 13

page 15

page 18

page 19

page 20

research
05/14/2021

Generalized LR-drawings of trees

The LR-drawing-method is a method of drawing an ordered rooted binary tr...
research
09/05/2017

Improved Bounds for Drawing Trees on Fixed Points with L-shaped Edges

Let T be an n-node tree of maximum degree 4, and let P be a set of n poi...
research
08/09/2018

Low Ply Drawings of Trees and 2-Trees

Ply number is a recently developed graph drawing metric inspired by stud...
research
08/09/2018

Low Ply Drawings of Tree and 2-Trees

Ply number is a recently developed graph drawing metric inspired by stud...
research
08/27/2019

Structured Traversal of Search Trees in Constraint-logic Object-oriented Programming

In this paper, we propose an explicit, non-strict representation of sear...
research
10/13/2022

Visualizing Multispecies Coalescent Trees: Drawing Gene Trees Inside Species Trees

We consider the problem of drawing multiple gene trees inside a single s...
research
09/04/2023

Mutual Witness Proximity Drawings of Isomorphic Trees

A pair ⟨ G_0, G_1 ⟩ of graphs admits a mutual witness proximity drawing ...

Please sign up or login with your details

Forgot password? Click here to reset