Logic programming with graph automorphism: integrating with Prolog (tool description). This paper presents the pl-nauty library, a Prolog interface to the graph-automorphism tool. Adding the capabilities of nauty to Prolog combines the strength of the “generate and prune” approach that is commonly used in logic programming and constraint solving, with the ability to reduce symmetries while reasoning over graph objects. Moreover, it enables the integration of nauty in existing tool-chains, such as SAT-solvers or finite domain constraints compilers which exist for Prolog. The implementation consists of two components: pl-nauty, an interface connecting nauty’s C library with Prolog, and pl-gtools, a Prolog framework integrating the software component of nauty, called gtools, with Prolog. The complete tool is available as a SWI-Prolog module. We provide a series of usage examples including two that apply to generate Ramsey graphs.
References in zbMATH (referenced in 1 article , 1 standard article )
Showing result 1 of 1.
- Frank, Michael; Codish, Michael: Logic programming with graph automorphism: integrating with Prolog (tool description) (2016)