swMATH ID: 9892
Software Authors: Martin Gebser; Max Ostrowski; Torsten Schaub
Description: Clingcon is a hybrid solver combining the monolithic answer set solver Clingo and the CSP solver Gecode. Clingcon is an answer set solver for (extended) constraint normal logic programs. It combines the high-level modeling capacities of Answer Set Programming (ASP) with constraint solving. Constraints over non-linear finite integers can be used in the logic programs. The primary clingcon algorithm adopts state-of-the-art techniques from SMT and uses conflict-driven learning and theory propagation for the CSP solver.
Homepage: http://www.cs.uni-potsdam.de/clingcon/
Related Software: Clingo; clasp; Gringo; WASP; ezcsp; Potassco; MiniSat; DLV-EX; Lparse; ASSAT; Chaff; GASP; Smodels; ROSoClingo; DLV2; ASPMT2SMT; Datalog; Sugar; sCASP; PDDL
Cited in: 39 Publications

Citations by Year