Accepted papers

The recently accepted papers in TPLP are the following:

Regular Papers

  1. Constraint Answer Set Solver EZCSP and Why Integration Schemas Matter. (*)
    Marcello Balduccini and Yuliya Lierler
  2. On Relation between Constraint Answer Set Programming and Satisfiability Modulo Theories. (*)
    Yuliya Lierler, Benjamin Susman
  3. Contractibility for Open Global Constraints. (*)
    Michael J. Maher

  4. Logic + control: On program construction and verification.
    Wlodzimierz Drabent
  5. CASP Solutions for Planning in Hybrid Domains. (*)
    Marcello Balduccini, Daniele Magazzeni, Marco Maratea, Emily LeBlanc
  6. Solving Distributed Constraint Optimization Problems Using Logic Programming. (*)
    Tiep Le, Tran Cao Son, Enrico Pontelli, William Yeoh
  7. Clingcon: The Next Generation. (*)
    Mutsunori Banbara, Benjamin Kaufmann, Max Ostrowski, Torsten Schaub
  8. Constraint Solving for Finite Model Finding in SMT Solvers (*)
    Andrew Reynolds, Cesare Tinelli, Clark Barrett

 

Papers marked with (*) will appear in a Special Issue on New Trends of Constraint Logic Programming

Accepted Technical Notes/Rapid Publication Papers

  • <none>

Accepted Book Reviews

  • <none>