| Software | Contact/Additional Information |
|---|---|
Backbone-guided local search algorithm for SAT and Max-SAT. |
Wayne Zhang WWW |
| Teknowledge Visualizer ANTs agents are deployed in a distributed setting where no single agent has complete knowledge of the overall system state and activities. The Teknowledge Visualizer thus provides a mechanism for displaying global system state including sensors, targets, trackers, and network traffic. Various statistical summaries exist also. |
|
| Java implementation of the ADOPT algorithm for Distributed Constraint Optimization Problems (DCOP). ADOPT is an efficient algorithm for DCOP that is guaranteed to find globally optimal solutions using asynchronous peer-to-peer communication. |
|
OPARIS solves optimization problems expressed as a set of linear pseudo-boolean contraints and an objective function; that is, the 0/1 integer programming problem from operations research. However, instead of relying on linear relaxations, OPARIS exploits methods from SAT solvers including DPLL search, fast unit propagation and clause learning. |
|
Oz-base Maintenance Scheduling Engine The solver uses the Oz language to implement a scheduling engine based on constraint propagation and distribution. It is a simplified version of the scheduling engine used in the MAPLANT tool. |