Clingcon: The next generation

DOI10.1017/S1471068417000138zbMath1379.68040arXiv1705.04569MaRDI QIDQ4593092

Torsten Schaub, Max Ostrowski, Benjamin Kaufmann, Mutsunori Banbara

Publication date: 9 November 2017

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1705.04569

zbMATH Keywords

constraint programming (CP)answer set programming (ASP)constraint answer set programming (CASP)SAT modulo theories (SMT)

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)

Related Items (10)

Building Information Modeling Using Constraint Logic Programming ⋮ Shared aggregate sets in answer set programming ⋮ Constraint Answer Set Programming without Grounding ⋮ Clingo goes linear constraints over reals and integers ⋮ Unnamed Item ⋮ Multi-shot ASP solving with clingo ⋮ Manipulation of Articulated Objects Using Dual-arm Robots via Answer Set Programming ⋮ Solving a multi-resource partial-ordering flexible variant of the job-shop scheduling problem with hybrid ASP ⋮ Testing in ASP: revisited language and programming environment ⋮ Clingcon

Uses Software

• Gringo
• clasp
• Sugar

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Advances in knowledge representation, logic programming, and abstract argumentation. Essays dedicated to Gerhard Brewka on the occasion of his 60th birthday
• Compiling finite linear CSP into SAT
• Integrating answer set programming and constraint logic programming
• Extending and implementing the stable model semantics
• Propagation via lazy clause generation
• Multi-Criteria Optimization in Answer Set Programming
• aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming
• A translational approach to constraint answer set solving
• GRASP: a search algorithm for propositional satisfiability
• Constraint Answer Set Solving
• ASP modulo CSP: The clingcon system
• Multi-threaded ASP solving with clasp
• Conflict-driven ASP solving with external sources
• Boolean Equi-propagation for Concise and Efficient SAT Encodings of Combinatorial Problems
• Answer Set Solving with Lazy Nogood Generation
• Unsatisfiability-based optimization in clasp
• Stable model semantics for founded bounds
• Integrating Answer Set Reasoning with Constraint Solving Techniques
• Logic Programming
• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving
• Recent Advances in Constraints
• Principles and Practice of Constraint Programming – CP 2004

This page was built for publication: Clingcon: The next generation