**all_min_cuts**- Curet et al, algorithm for generating all minimum-cost cuts
**all_min_cuts_eplex**- Mixed integer programming solution for generating all minimum-cost cuts
**anti_unify**- Computes the most specific generalization of two terms
**apply**- The apply/2 higher-order predicate
**apply_macros**- Utilities to apply a predicate to all elements of a list resp. all subterms of a term
**best_first_search**- Best first search
**bfs**- Best-first search library
**branch_and_bound**- Generic branch-and-bound optimization
**calendar**- Routines for calendar computations, based on modified julian dates (MJD).
**changeset**- Compute sets of modified variables
**colgen**- Column generation library
**edge_finder**- Quadratic edge-finder algorithm for disjunctive and cumulative constraints for FD
**edge_finder3**- Cubic edge-finder algorithm for disjunctive and cumulative constraints for FD
**fd_global_gac**- Library of global constraints which achieve generalized arc consistency
**graph_algorithms**- Collection of graph algorithms
**ic_global_gac**- Library of global constraints which achieve generalized arc consistency
**max_flow**- Ford-Fulkerson maximum flow algorithm
**max_flow_eplex**- Linear programming solution for maximum flow problem
**notinstance**- Constraints for structural equality and subsumption
**numbervars**- C-Prolog style numbervars predicate
**par_util**- Parallel versions of various predicates
**regex**- Interface to POSIX regular expression handling
**suspend**- Lazy-checking versions of arithmetic primitives, and the suspend-attribute
**tentative_constraints**- Tentative value implementations for some basic constraints

Generated 2019-05-29 18:57