GQR

GQR (Generic Qualitative Reasoner) is a solver for binary qualitative constraint networks. GQR takes a calculus description and one or more constraint networks as input, and tries to solve the networks using the path consistency method and backtracking. Both spatial calculi, e.g., RCC-5 and RCC-8, and temporal ones, like Allen’s interval algebra, are supported. New logics can be added to the system using a simple text format; no programming is necessary.
Find GQR at: https://sfbtr8.informatik.uni-freiburg.de/R4LogoSpace/Resources/GQR