@article{MesnardS08,
  title = {Recurrence with affine level mappings is P-time decidable for CLP(R)},
  author = {Frédéric Mesnard and Alexander Serebrenik},
  year = {2008},
  doi = {10.1017/S1471068407003122},
  url = {http://dx.doi.org/10.1017/S1471068407003122},
  researchr = {https://researchr.org/publication/MesnardS08},
  cites = {0},
  citedby = {0},
  journal = {tplp},
  volume = {8},
  number = {1},
  pages = {111-119},
}

@inproceedings{SerebrenikM04,
  title = {On Termination of Binary CLP Programs},
  author = {Alexander Serebrenik and Frédéric Mesnard},
  year = {2004},
  doi = {10.1007/11506676_15},
  url = {http://dx.doi.org/10.1007/11506676_15},
  tags = {termination},
  researchr = {https://researchr.org/publication/SerebrenikM04},
  cites = {0},
  citedby = {0},
  pages = {231-244},
  booktitle = {LOPSTR},
}
@proceedings{lpe:2003,
  title = {Proceedings of the 13th International Workshop on Logic Programming Environments, Tata Institute of Fundamental Research, Mumbai, India, December 8, 2003},
  year = {2003},
  tags = {meta programming, logic programming, programming, logic, Meta-Environment},
  researchr = {https://researchr.org/publication/lpe%3A2003},
  cites = {0},
  citedby = {0},
  booktitle = {Proceedings of the 13th International Workshop on Logic Programming Environments, Tata Institute of Fundamental Research, Mumbai, India, December 8, 2003},
  conference = {lpe},
  editor = {Frédéric Mesnard and Alexander Serebrenik},
  volume = {CW371},
  series = {Report},
  publisher = {Katholieke Universiteit Leuven, Department of Computer Science, Celestijnenlaan 200A, B-3001 Heverlee (Belgium)},
}