Clingcon

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.


References in zbMATH (referenced in 18 articles )

Showing results 1 to 18 of 18.
Sorted by year (citations)

  1. Eiter, Thomas; Fink, Michael; Ianni, Giovambattista; Krennwallner, Thomas; Redl, Christoph; Schüller, Peter: A model building framework for answer set programming with external computations (2016)
  2. Eiter, Thomas; Fink, Michael; Krennwallner, Thomas; Redl, Christoph: Domain expansion for ASP-programs with external sources (2016)
  3. Lierler, Yuliya; Truszczynski, Miroslaw: On abstract modular inference systems and solvers (2016)
  4. Banbara, Mutsunori; Gebser, Martin; Inoue, Katsumi; Ostrowski, Max; Peano, Andrea; Schaub, Torsten; Soh, Takehide; Tamura, Naoyuki; Weise, Matthias: aspartame: solving constraint satisfaction problems with answer set programming (2015)
  5. Lierler, Yuliya: Relating constraint answer set programming languages and algorithms (2014)
  6. Aziz, Rehan Abdul; Chu, Geoffrey; Stuckey, Peter J.: Stable model semantics for founded bounds (2013)
  7. De Cat, Broes; Bruynooghe, Maurice: Detection and exploitation of functional dependencies for model generation (2013)
  8. Giordano, Laura; Martelli, Alberto; Spiotta, Matteo; Dupré, Daniele Theseider: Business process verification with constraint temporal answer set programming (2013)
  9. Liu, Xudong; Truszczynski, Miroslaw: Aggregating conditionally lexicographic preferences using answer set programming solvers (2013)
  10. Balduccini, Marcello: A “conservative” approach to extending answer set programming with non-Herbrand functions (2012)
  11. Balduccini, Marcello: An answer set solver for non-Herbrand programs: progress report (2012)
  12. Drescher, Christian; Walsh, Toby: Answer set solving with lazy nogood generation (2012)
  13. Gebser, Martin; Kaufmann, Benjamin; Schaub, Torsten: Conflict-driven answer set solving: from theory to practice (2012)
  14. Drescher, Christian: Constraint answer set programming systems (2010)
  15. Drescher, Christian; Walsh, Toby: A translational approach to constraint answer set solving (2010)
  16. Wang, Yisong; You, Jia-Huai; Lin, Fangzhen; Yuan, Li Yan; Zhang, Mingyi: Weight constraint programs with evaluable functions (2010)
  17. Balduccini, Marcello: CR-Prolog as a specification language for constraint satisfaction problems (2009)
  18. Gebser, Martin; Ostrowski, Max; Schaub, Torsten: Constraint answer set solving (2009)