Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

F.-Y. Villemin

dblp:20/1795 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
0since 2021 · last 1994
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 3 first-authorSystems, architecture and hardware · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Program synthesis and code generation · 77% Program analysis · 23%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Program synthesis and code generation › programming by demonstration
trace-based synthesis
0.011981
PAPE: An On-Line System for Inferring Procedures from Sets of Their Traces · IJCAI 1981
Program analysis › specification mining
behavioral model inference
0.011981
PAPE: An On-Line System for Inferring Procedures from Sets of Their Traces · IJCAI 1981

Methods — techniques the papers use, named apart from their topics

trace analysis · 0.0automata learning · 0.0
YearPublicationVenuePosition
1994 Knowledge-based Querying
abstract
The system we present is an intelligent database assistant based on a knowledge level view of databases: When a user wants to retrieve data from a database, he first conceptualizes the question (usually expressed by means of other concepts common to persons doing the same job, or "trade concepts"), then translates this "mental" concept into a (Set) query. In our L/sub ex/ system, concepts are implemented in a hybrid language closed to mental concept formulation. Each well-formed concept in L/sub ex/ corresponds a safe extended relational calculus of tuples formula, and, therefore, a SQL query. In our system, a relational database is first reified (a "concept vision" of the database is built in L/sub ex/). Domain knowledge and user knowledge are expressed by a set of L/sub ex/ concepts. A query is viewed as computing the interpretation of its corresponding concept, which is done by (automatically) rewriting it into a SQL query.>
F.-Y. Villemin, A. Paoli
ICTAI1
1991 The ALDOUS90 Project: Merging Object-Oriented Databases and Knowledge-based Systems
F.-Y. Villemin, A. Paoli, I. Tourrilhes, M. Le
DEXA1
1982 SERFRE: A general-purpose multi-processor reduction machine
F.-Y. Villemin
ICPP1
1981 PAPE: An On-Line System for Inferring Procedures from Sets of Their Traces
F.-Y. Villemin
IJCAI1