SPECIAL ISSUE OF THEORY AND PRACTICE OF LOGIC PROGRAMMING ON NEW TRENDS OF CONSTRAINT LOGIC PROGRAMMING
The notion of constraint logic programming was introduced in the middle Eighties. CLP(X) languages were the first languages capable of integrating “traditional” declarative programming and constraint programming. Later, the success of the Answer Set Programming paradigm and of its solvers allowed the community to use not only a knowledge representation (KR) language, but also a language perfectly suited for encoding problems in the classes NP and Sigma P 2.
The efficiency of the solvers is in part due to their implementation of conflict-driven learning. Similar techniques have also been exploited by SAT solving. However, ASP and SAT are rather limited by grounding as soon as the problems require the encoding of large integer or, even worse, rational domains.
In response, several proposals emerged in both communities for adding constraints on different domains that can be dealt with mixed techniques using external solvers, leading to research directions known as satisfiability modulo theories (SMT) and constraint answer set programming (CASP). Moreover, also traditional CLP solvers have been extended so as to exploit tabling, external solvers, and parallelism, and support the Minizinc paradigm.
In this issue we would like to investigate recent results on this emerging modern view of Constraint Logic Programming that builds on the developments mentioned above. We would also like to explore applications of this new technology.
An expression of interest to submit, title and abstract:
- Feb 15 2016 (STRICT)
- February 29 2016 (TENTATIVE)
Submissions must be made in the TPLP format
via the EasyChair submission system, available at
Agostino Dovier University of Udine