Sorin Craciunescu

发表

Preuves de programmes logiques par induction et coinduction

Sorin Craciunescu, 2001, JFPLC.

Vérification des programmes logiques. (Proving the Equivalence of Logic Programs)

Sorin Craciunescu, 2004 .

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

Sorin Craciunescu, F. Mesnard, 2006 .