The Discrete Event Calculus Reasoner allows a programmer to add common-sense reasoning capabilities to programs. It supports deduction/temporal projection, abduction/planning, postdiction, and model finding. It allows default reasoning about action, change, space, and mental states. It is based on the event calculus, a comprehensive and highly usable logic-based formalism. It helps applications understand the world, make inferences, adapt to unexpected situations, and be more flexible.
METSlib is an object-oriented metaheuristics framework in C++ designed to make implementing or adapting models easy. The model is modular: all the implemented search algorithms can be applied to the same model. METSlib implements the basics of some metaheuristics algorithms, such as Random Restart Local Search, Variable Neighborhood Search, Iterated Local Search, Simulated Annealing, and Tabu Search. For each algorithm, you must implement an objective function, a neighborhood (move manager), and some moves. Tabu Search is one of the fastest ways to generate near-optimal solutions to a wide range of hard combinatorial optimization problems.