Logic programming with max-clique and its application to graph coloring (tool description)

Michael Codish, Michael Frank, Amit Metodi, Morad Muslimany

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

This paper presents pl-cliquer, a Prolog interface to the cliquer tool for the maximum clique problem. Using pl-cliquer facilitates a programming style that allows logic programs to integrate with other tools such as: Boolean satisfiability solvers, finite domain constraint solvers, and graph isomorphism tools. We illustrate this programming style to solve the Graph Coloring problem, applying a symmetry break that derives from finding a maximum clique in the input graph. We present an experimentation of the resulting Graph Coloring solver on two benchmarks, one from the graph coloring community and the other from the examination timetabling community. The implementation of pl-cliquer consists of two components: A lightweight C interface, connecting cliquer’s C library and Prolog, and a Prolog module which loads the library. The complete tool is available as a SWI-Prolog module.

Original languageEnglish
Title of host publicationTechnical Communications of the 33rd International Conference on Logic Programming, ICLP 2017
EditorsTran Cao Son, Christopher Mears, Ricardo Rocha, Neda Saeedloei
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959770583
DOIs
StatePublished - 1 Feb 2018
EventTechnical Communications of the 33rd International Conference on Logic Programming, ICLP 2017 - Melbourne, Australia
Duration: 28 Aug 20171 Sep 2017

Publication series

NameOpenAccess Series in Informatics
Volume58
ISSN (Print)2190-6807

Conference

ConferenceTechnical Communications of the 33rd International Conference on Logic Programming, ICLP 2017
Country/TerritoryAustralia
CityMelbourne
Period28/08/171/09/17

Keywords

  • Constraints
  • Logic Programming
  • Maximum Clique

Fingerprint

Dive into the research topics of 'Logic programming with max-clique and its application to graph coloring (tool description)'. Together they form a unique fingerprint.

Cite this