Demo Data from EDBT 2026 / reviewers in the wild / expert
Alain Colmerauer
dblp:c/AColmerauer
· DBLP profile ↗
10ranked-venue papers
9as first author
0since 2021 · last 2008
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 6 · 5 first-authorSoftware engineering, systems software and programming languages · 5 · 4 first-authorGraphics, computer vision, multimedia, augmented reality and games · 3 · 3 first-authorTheory of computation · 3 · 3 first-authorApplied, interdisciplinary, general and emerging computing · 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
3 papers |
Programming languages and type systems · 96% Compilers and program optimization · 4% | |
| Theoretical computer science
1 paper |
Automata and formal languages · 100% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Programming languages and type systems
logic programming |
0.0 | 3 | 1983 | Prolog in Ten Figures · IJCAI 1983 Demonstrating PROLOG on APPLE II · IJCAI 1981 Last Steps Towards an Ultimate PROLOG · IJCAI 1981 |
Programming languages and type systems › logic programming
prolog |
0.0 | 3 | 1983 | Prolog in Ten Figures · IJCAI 1983 Demonstrating PROLOG on APPLE II · IJCAI 1981 Last Steps Towards an Ultimate PROLOG · IJCAI 1981 |
Automata and formal languages › formal grammars
context-free grammar |
0.0 | 1 | 1970 | Total Precedence Relations · J. ACM 1970 |
Automata and formal languages
context-free languages |
0.0 | 1 | 1970 | Total Precedence Relations · J. ACM 1970 |
Methods — techniques the papers use, named apart from their topics
boolean matrix computation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2008 | Back to the Complexity of Universal Programs
Alain Colmerauer |
CP | 1 |
| 2004 | On the Complexity of Universal Programs
Alain Colmerauer |
MCU | 1 |
| 2001 | Solving the Multiplication Constraint in Several Approximation Spaces
Alain Colmerauer |
ICLP | 1 |
| 2000 | Expressiveness of Full First Order Constraints in the Algebra of Finite or Infinite Trees
Alain Colmerauer, Thi-Bich-Hanh Dao |
CP | 1 |
| 1997 | Narrowing a Block of Sortings in Quadratic Time
Noëlle Bleuzen-Guernalec, Alain Colmerauer |
CP | 2 |
| 1990 | Prolog III as it Actually Is
Alain Colmerauer |
ICLP | 1 |
| 1983 | Prolog in Ten Figures
Alain Colmerauer |
IJCAI | 1 |
| 1981 | Last Steps Towards an Ultimate PROLOG
Alain Colmerauer, Henry Kanoui, Michel Van Caneghem |
IJCAI | 1 |
| 1981 | Demonstrating PROLOG on APPLE II
Alain Colmerauer, Henry Kanoui, Michel Van Caneghem |
IJCAI | 1 |
| 1970 | Total Precedence RelationsabstractA description is given of a method of syntactical analysis based on the use of precedence relations which are defined over the whole vocabulary of the context-free grammar under investigation.These relations are defined in such a way that trial-and-error is avoided whenever possible.To the same end, the customary restriction that analysis will be left-toright is not imposed.The results are formulated in such a way that all relations can be computed by simple operations on Boolean matrices.This study reveals the existence of an interesting subset of context-free languages, which is then compared with other well-known subsets. Alain Colmerauer |
J. ACM | 1 |