Recurrence with affine level mappings is P-time decidable for CLP(R)

Frédéric Mesnard, Alexander Serebrenik. Recurrence with affine level mappings is P-time decidable for CLP(R). TPLP, 8(1):111-119, 2008. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.