2026-07-22T06:50:12Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:8455 2024-03-06T10:30:10Z ddc:004 open_access

Logic Programming with Max-Clique and its Application to Graph Coloring (Tool Description) Codish, Michael Frank, Michael Metodi, Amit Muslimany, Morad Logic Programming Constraints Maximum Clique 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Michael Codish and Michael Frank and Amit Metodi and Morad Muslimany 2018 Is Part Of OASIcs, Volume 58, Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.ICLP.2017.5 urn:nbn:de:0030-drops-84559 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2017.5 eng https://creativecommons.org/licenses/by/3.0/legalcode