Logic Programming with Graph Automorphism: Integratingnautywith Prolog (Tool Description)

DOI10.1017/S1471068416000223zbMath1379.68063arXiv1607.04829OpenAlexW2963869083MaRDI QIDQ4593050

Michael Frank, Michael Codish

Publication date: 9 November 2017

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1607.04829

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (1)

pl-nauty

Uses Software

• nauty
• Traces
• BEE
• SWI-Prolog
• bliss

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sorting nine inputs requires twenty-five comparisons
• Practical graph isomorphism. II.
• SWI-Prolog
• Compiling finite domain constraints to SAT withBEE
• Boolean Equi-propagation for Concise and Efficient SAT Encodings of Combinatorial Problems
• Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs
• Random Models and Analyses for Chemical Graphs

This page was built for publication: Logic Programming with Graph Automorphism: Integratingnautywith Prolog (Tool Description)