◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

F. Mesnard

5 papers hereh-index 17883 citations78 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author1
  • last author4

Across the 5 of 5 papers where every author was matched, so the position is known.

fields
  • cs.PL4
  • cs.LO1

identity via Semantic Scholar / OpenAlex

activity
20022008
most citedRecurrence with affine level mappings is P-time decidable for CLP(R)

4 citations · 5 across the 5 of their papers we have counts for

collaborators
Showing 2008 · cs.PLShow all

1 paper · 2 filters

cs.PL2008★ 1 cited

A Non-Termination Criterion for Binary Constraint Logic Programs

Etienne Payet, Fred Mesnard

On the one hand, termination analysis of logic programs is now a fairly established research topic within the logic programming community. On the other hand, non-termination analys…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.