MinisatID is a complete, combinatorial search algorithm for the ground fragment of FO(·)-IDP. The solver is used, among others, as search backend of the IDP Knowledge Base system. Features: Accepts input in the languages CNF, ECNF (native format), OPB (pseudo-boolean) QBF, FlatZinc and ground Lparse. Can transform the input theory into CNF or FlatZinc. Extensible, open-source research solver. High performance: 4th place of 16 in the 2nd ASP competition, eye-to-eye with clasp (winner) in the NP category in the 3rd ASP competition.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 1 article )

Showing result 1 of 1.
Sorted by year (citations)

  1. Shishmarev, Maxim; Mears, Christopher; Tack, Guido; Garcia de la Banda, Maria: Visual search tree profiling (2016)