{'fraction_non_alphanumeric': 0.015050167224080268, 'fraction_numerical': 0.0, 'mean_word_length': 4.650943396226415, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Solver An Oz Search Debugger

This paper shows the Oz Solver, a tool designed to support the development of constraint programs. The Solver allows the user to interactively solve a constraint problem. As the problem’s search tree is explored the Solver incrementally draws its graphical presentation. The user has access to the computation state at any node in the tree. Although search is controlled interactively by the user, implementing the Solver does not require any other primitives than those provided by Oz. It is planned to include the Oz Solver in the next release of the DFKI Oz system.