gp-rcc8: a reasoner for real-world RCC-8 networks

Description

The gp-rcc8 project implements a reasoner for the RCC-8 calculus. Reasoner gp-rcc8 employs graph partitioning to reduce the initial size of the network and exploits the degree of parallelism offered by current computer architectures by checking consistency of these smaller subnetworks in a parallel fashion.

Technical and algorithmic details about gp-rcc8 may be found in the following publication:

Charalampos Nikolaou and Manolis Koubarakis: Fast consistency checking of very large real-world RCC-8 constraint networks using graph partitioning. In proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI '14), Québec, Canada, July 27–31, 2014.
Networks used for the empirical evaluation of the reasoners: download (tar.bz2, ~80MB)

Downloads

The latest version of gp-rcc8 is 0.2-alpha. In the following you may find information related to the development of the project, as well as download the source code.

License

gp-rcc8 is subject to the terms of the Mozilla Public License, v. 2.0.

Copyright (C) 2013, 2014 Department of Informatics and
Telecommunications, National and Kapodistrian University of Athens
Author: Charalampos Nikolaou

Charalampos Nikolaou homepage