1 research outputs found
Structured Traversal of Search Trees in Constraint-logic Object-oriented Programming
In this paper, we propose an explicit, non-strict representation of search
trees in constraint-logic object-oriented programming. Our search tree
representation includes both the non-deterministic and deterministic behaviour
during execution of an application. Introducing such a representation
facilitates the use of various search strategies. In order to demonstrate the
applicability of our approach, we incorporate explicit search trees into the
virtual machine of the constraint-logic object-oriented programming language
Muli. We then exemplarily implement three search algorithms that traverse the
search tree on-demand: depth-first search, breadth-first search, and iterative
deepening depth-first search. In particular, the last two strategies allow for
a complete search, which is novel in constraint-logic object-oriented
programming and highlights our main contribution. Finally, we compare the
implemented strategies using several benchmarks.Comment: Part of DECLARE 19 proceeding