EDBT 2026 Demo / reviewers in the wild / expert
Raul Trejo
dblp:65/265
· DBLP profile ↗
5ranked-venue papers
2as first author
0since 2021 · last 2002
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 5 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2
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
3 papers |
Computational complexity · 78% Algorithmic game theory and mechanism design · 22% | |
| Artificial intelligence
3 papers |
Planning, search and constraint satisfaction · 62% Learning theory · 38% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational complexity › complexity of reasoning
planning complexity |
0.1 | 3 | 2001 | Computational Complexity of Planning with Temporal Goals · IJCAI 2001 Computational complexity of planning and approximate planning in the presence of incompleteness · Artif. Intell. 2000 Computational Complexity of Planning and Approximate Planning in Presence of Incompleteness · IJCAI 1999 |
Machine learning › Learning theory
computational complexity |
0.0 | 1 | 2000 | Computational complexity of planning and approximate planning in the presence of incompleteness · Artif. Intell. 2000 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › planning under uncertainty
planning under incomplete information |
0.0 | 1 | 2000 | Computational complexity of planning and approximate planning in the presence of incompleteness · Artif. Intell. 2000 |
Algorithmic game theory and mechanism design
incomplete information |
0.0 | 1 | 1999 | Computational Complexity of Planning and Approximate Planning in Presence of Incompleteness · IJCAI 1999 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
temporal planning |
0.0 | 1 | 2001 | Computational Complexity of Planning with Temporal Goals · IJCAI 2001 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
planning under uncertainty |
0.0 | 1 | 1999 | Computational Complexity of Planning and Approximate Planning in Presence of Incompleteness · IJCAI 1999 |
Methods — techniques the papers use, named apart from their topics
complexity analysis · 0.1temporal logic · 0.1approximate planning · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2002 | A realistic (non-associative) logic and a possible explanations of 7 pm 2 law
Raul Trejo, Vladik Kreinovich, I. R. Goodman, Jesus Martinez, Reginaldo Gonzalez |
Int. J. Approx. Reason. | 1 |
| 2001 | Computational Complexity of Planning with Temporal Goals
Chitta Baral, Vladik Kreinovich, Raul Trejo |
IJCAI | 3 |
| 2001 | From Planning to Searching for the Shortest Plan: An Optimal Transition
Raul Trejo, Joel Galloway, Charanjiv Sachar, Vladik Kreinovich, Chitta Baral, Le-Chi Tuan |
Int. J. Uncertain. Fuzziness Knowl. Based Syst. | 1 |
| 2000 | Computational complexity of planning and approximate planning in the presence of incompleteness
Chitta Baral, Vladik Kreinovich, Raul Trejo |
Artif. Intell. | 3 |
| 1999 | Computational Complexity of Planning and Approximate Planning in Presence of Incompleteness
Chitta Baral, Vladik Kreinovich, Raul Trejo |
IJCAI | 3 |