VLDB 2026 Research / reviewers in the wild / expert
Carlos Uzcátegui
dblp:91/2116
· DBLP profile ↗
14ranked-venue papers
0as first author
0since 2021 · last 2019
0000-0002-3452-2312ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 9Artificial intelligence and machine learning · 7Graphics, computer vision, multimedia, augmented reality and games · 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.
| Artificial intelligence
4 papers |
Knowledge representation and reasoning · 95% Probabilistic and Bayesian machine learning · 5% | |
| Theoretical computer science
3 papers |
Logic in computer science · 52% Automated reasoning and model checking · 48% |
Topics — the 6 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Knowledge, reasoning and agents › Knowledge representation and reasoning
belief revision |
0.0 | 1 | 2004 | A Unified Treatment for Knowledge Dynamics · KR 2004 |
Knowledge, reasoning and agents › Knowledge representation and reasoning › nonmonotonic reasoning › preference handling
preference reasoning |
0.0 | 1 | 2003 | Preferences and explanations · Artif. Intell. 2003 |
Automated reasoning and model checking
explanation generation |
0.0 | 1 | 2003 | Preferences and explanations · Artif. Intell. 2003 |
Knowledge, reasoning and agents › Knowledge representation and reasoning
abductive reasoning |
0.0 | 1 | 2000 | Ordering explanations and the structural rules for abduction · KR 2000 |
Logic in computer science › nonmonotonic reasoning
abduction |
0.0 | 1 | 1997 | Abductive Consequence Relations · Artif. Intell. 1997 |
Logic in computer science
nonmonotonic reasoning |
0.0 | 1 | 1997 | Abductive Consequence Relations · Artif. Intell. 1997 |
Methods — techniques the papers use, named apart from their topics
logic-based preference modeling · 0.1bayesian inference · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | Bases and Borel Selectors for Tall familiesabstractAbstract Given a family ${\cal C}$ of infinite subsets of ${\Bbb N}$ , we study when there is a Borel function $S:2^{\Bbb N} \to 2^{\Bbb N} $ such that for every infinite $x \in 2^{\Bbb N} $ , $S\left( x \right) \in {\Cal C}$ and $S\left( x \right) \subseteq x$ . We show that the family of homogeneous sets (with respect to a partition of a front) as given by the Nash-Williams’ theorem admits such a Borel selector. However, we also show that the analogous result for Galvin’s lemma is not true by proving that there is an $F_\sigma $ tall ideal on ${\Bbb N}$ without a Borel selector. The proof is not constructive since it is based on complexity considerations. We construct a ${\bf{\Pi }}_2^1 $ tall ideal on ${\Bbb N}$ without a tall closed subset. Jan Grebík, Carlos Uzcátegui |
J. Symb. Log. | 2 |
| 2017 | Ramsey type properties of ideals
Michael Hrusák, David Meza-Alcántara, E. Thümmel, Carlos Uzcátegui |
Ann. Pure Appl. Log. | 4 |
| 2008 | Reconstruction of a word from a multiset of its factors
Claribet Piña, Carlos Uzcátegui |
Theor. Comput. Sci. | 2 |
| 2006 | Mediation in the Framework of Morpho-Logic
Isabelle Bloch, Ramón Pino Pérez, Carlos Uzcátegui |
ECAI | 3 |
| 2005 | Randic ordering of chemical trees
Juan Rada, Carlos Uzcátegui |
Discret. Appl. Math. | 2 |
| 2004 | A Unified Treatment for Knowledge Dynamics
Isabelle Bloch, Ramón Pino Pérez, Carlos Uzcátegui |
KR | 3 |
| 2003 | Preferences and explanations
Ramón Pino Pérez, Carlos Uzcátegui |
Artif. Intell. | 2 |
| 2003 | Randic Structure of a Graph
Juan Rada, Carlos Uzcátegui |
Discret. Appl. Math. | 2 |
| 2001 | Explanatory Relations Based on Mathematical Morphology
Isabelle Bloch, Ramón Pino Pérez, Carlos Uzcátegui |
ECSQARU | 3 |
| 2000 | Ordering explanations and the structural rules for abduction
Ramón Pino Pérez, Carlos Uzcátegui |
KR | 2 |
| 2000 | On Representation Theorems for Nonmonotonic Consequence RelationsabstractAbstract One of the main tools in the study of nonmonotonic consequence relations is the representation of such relations in terms of preferential models. In this paper we give an unified and simpler framework to obtain such representation theorems. Ramón Pino Pérez, Carlos Uzcátegui |
J. Symb. Log. | 2 |
| 1999 | Jumping to Explanations versus Jumping to Conclusions
Ramón Pino Pérez, Carlos Uzcátegui |
Artif. Intell. | 2 |
| 1997 | Abductive Consequence Relations
Jorge Lobo 0001, Carlos Uzcátegui |
Artif. Intell. | 2 |
| 1996 | Abductive Change OperatorsabstractThis paper describes a change theory based on abductive reasoning. We take the AGM postulates for revisions, expansions and contractions, and Katsuno and Mendelzon postulates for updates and incorporate abduction into them. A key feature of the theory is that presents a unified view of standard change operators and abductive change operators rather than a new and independent change theory for abductive changes. Abductive operators reduce to standard change operators in the limiting cases. Jorge Lobo 0001, Carlos Uzcátegui |
Fundam. Informaticae | 2 |