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 34 articles , 1 standard article )

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

1 2 next

  1. Bartholomew, Michael; Lee, Joohyung: First-order stable model semantics with intensional functions (2019)
  2. Cuteri, Bernardo; Dodaro, Carmine; Ricca, Francesco; Schüller, Peter: Partial compilation of ASP programs (2019)
  3. Alviano, Mario; Dodaro, Carmine; Maratea, Marco: Shared aggregate sets in answer set programming (2018)
  4. Arias, Joaquin; Carro, Manuel; Salazar, Elmer; Marple, Kyle; Gupta, Gopal: Constraint answer set programming without grounding (2018)
  5. Fangkai Yang, Daoming Lyu, Bo Liu, Steven Gustafson: PEORL: Integrating Symbolic Planning and Hierarchical Reinforcement Learning for Robust Decision-Making (2018) arXiv
  6. Frioux, Clémence; Schaub, Torsten; Schellhorn, Sebastian; Siegel, Anne; Wanko, Philipp: Hybrid metabolic network completion (2018)
  7. Gebser, Martin; Kaminski, Roland; Kaufmann, Benjamin; Schaub, Torsten: Multi-shot ASP solving with clingo (2018)
  8. Balduccini, Marcello; Magazzeni, Daniele; Maratea, Marco; Leblanc, Emily C.: CASP solutions for planning in hybrid domains (2017)
  9. Banbara, Mutsunori; Kaufmann, Benjamin; Ostrowski, Max; Schaub, Torsten: \textitclingcon: the next generation (2017)
  10. Janhunen, Tomi; Kaminski, Roland; Ostrowski, Max; Schellhorn, Sebastian; Wanko, Philipp; Schaub, Torsten: Clingo goes linear constraints over reals and integers (2017)
  11. Lefèvre, Claire; Béatrix, Christopher; Stéphan, Igor; Garcia, Laurent: \textscASPeRiX, a first-order forward chaining approach for answer set computing (2017)
  12. De Cat, Broes; Lierler, Yuliya: Constraint CNF: SAT and CSP language under one roof (2016)
  13. 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)
  14. Eiter, Thomas; Fink, Michael; Krennwallner, Thomas; Redl, Christoph: Domain expansion for ASP-programs with external sources (2016)
  15. Lierler, Yuliya; Truszczynski, Miroslaw: On abstract modular inference systems and solvers (2016)
  16. 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)
  17. Lierler, Yuliya: Relating constraint answer set programming languages and algorithms (2014)
  18. Aziz, Rehan Abdul; Chu, Geoffrey; Stuckey, Peter J.: Stable model semantics for founded bounds (2013)
  19. De Cat, Broes; Bruynooghe, Maurice: Detection and exploitation of functional dependencies for model generation (2013)
  20. Giordano, Laura; Martelli, Alberto; Spiotta, Matteo; Dupré, Daniele Theseider: Business process verification with constraint temporal answer set programming (2013)

1 2 next