◍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 2002 · cs.LOShow all

1 paper · 2 filters

cs.LO2002

A Generalization of the Lifting Lemma for Logic Programming

Etienne Payet, Fred Mesnard

Since the seminal work of J. A. Robinson on resolution, many lifting lemmas for simplifying proofs of completeness of resolution have been proposed in the literature. In the logic…

◍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.