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.

Raymond Rolland

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

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

Artificial intelligence and machine learning · 4Graphics, computer vision, multimedia, augmented reality and games · 3Theory of computation · 1

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.

Theoretical computer science
2 papers
Logic in computer science · 100%

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

TopicWeightPapersLastEvidence papers
Logic in computer science › nonmonotonic reasoning
circumscription
0.021994
Preferential Entailments for Circumscriptions · KR 1994
Circumscription and Definability · IJCAI 1991
Logic in computer science
nonmonotonic reasoning
0.011994
Preferential Entailments for Circumscriptions · KR 1994
Logic in computer science › nonmonotonic reasoning
preferential entailment
0.011994
Preferential Entailments for Circumscriptions · KR 1994
Logic in computer science › model theory
definability
0.011991
Circumscription and Definability · IJCAI 1991
YearPublicationVenuePosition
2000 Equivalent Sets of Formulas for Circumscriptions
Yves Moinard, Raymond Rolland
ECAI2
1994 Preferential Entailments for Circumscriptions
Yves Moinard, Raymond Rolland
KR2
1991 Circumscription and Definability
Yves Moinard, Raymond Rolland
IJCAI2
1988 A Formula Circumscriptively both Valid and Unprovable
Philippe Besnard, Jean Houdebine, Raymond Rolland
ECAI3