The Problem | Solutions to combinatorial search problems can benefit from custom-made constraint-based inference engines that go beyond depth-first search. The concurrent constraint language Oz provides support for programming inference engines. The Mozart system for Oz comes with several engines, extended in dimensions such as interaction, visualization, and optimization. However, these extensions are monolithic in their software design, not catering for systematic reuse of components. |
|||||||
SearchToolKit |
SearchToolKit provides an object-oriented modular architecture for building inference engines that achieves high reusability and supports rapid prototyping of search algorithms and their extensions. |
|||||||
Highlights |
|
|||||||
Download |
SearchToolKit comes as a toolkit for building search engines (STK), and as a tool for experimenting with engines and their components (ST).
For information on Oz/Mozart functors, applications and sources, look at Mozart and Oz and Mozart functors and applications. |
|||||||
Documentation |
|
|||||||
Using SearchToolKit |
The SearchToolKit can be used
In order to use ST, download st.oza and run it (using ozengine). You will get a selection window as shown below |
|||||||
To generate an engine, click on "Make Engine". If the engine specifies a GUI, for example if you use "Tracer" and "Standard Display", the GUI will pop up, which may look as follows. Problem script and optimization procedures can be loaded via URL. Example scripts are given in the demo directory. | ||||||||
Feedback |
SearchToolKit is distributed free of charge, including the sources. Please let us know if you are making or wanting improvements, found interesting applications, encountered problems and limitations in using and extending the software. | |||||||