Enumerating graphs with claspD-2.0 via Emscripten

This small demo invokes claspD-2.0 (compiled into JavaScript with Emscripten) to solve the problem of enumerating all directed graphs (including self-loops) with three nodes that are unique up to isomorphism, a problem encoded with disjunctive rules.

Each time "solve" is pressed, a separate Web Worker is started with a copy of the solver. Several parallel solving processes are possible while still interacting with the rest of the page.

To try this driver on other applications, paste the output of gringo (or any other ASP grounder producing smodels-compatible outputs) into the textarea below and customize the solver arguments. Including "--outf=2" yields results encoded in JSON.

Input






Output