VLDB 2026 Research / reviewers in the wild / expert
Yuri David Santos
dblp:167/5139
· DBLP profile ↗
3ranked-venue papers
2as first author
1since 2021 · last 2022
0000-0001-8957-6564ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-authorTheory of computation · 2 · 1 first-author · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Iterative social consolidations: Forming beliefs from many-valued evidence and peers' opinionsabstractAbstract Recently, several logics modelling evidence have been proposed in the literature. These logics often also feature beliefs. We call the process or function that maps evidence to beliefs consolidation. In this paper, we use a four-valued modal logic of evidence as a basis. In the models for this logic, agents are represented by nodes, peer connections by edges and the private evidence that each agent has by a four-valued valuation. From this basis, we propose methods of consolidating the beliefs of the agents, taking into account both their private evidence as well as their peers’ opinions. To this end, beliefs are computed iteratively. The final consolidated beliefs are the ones in the point of stabilization of the model. However, it turns out that some consolidation policies will not stabilize for certain models. Finding the conditions for stabilization is one of the main problems studied here, along with other properties of such consolidations. Our main contributions are twofold: we offer a new dynamic perspective on the process of forming evidence-based beliefs, in the context of evidence logics, and we set up and address some mathematically challenging problems, which are related to graph theory and practical subject areas such as belief/opinion diffusion and contagion in multi-agent networks. Yuri David Santos, Barteld P. Kooi, Rineke Verbrugge |
J. Log. Comput. | 1 |
| 2018 | Partial meet pseudo-contractionsabstractIn the AGM paradigm for belief revision, epistemic states are represented by logically closed sets of sentences, the so-called belief sets.An alternative approach uses belief bases, arbitrary sets of sentences.Both approaches have their problems when it comes to contraction operations.Belief bases are more expressive, but, at the same time, they present a serious syntax dependence.Between those two extremes lie a whole gamut of operations called pseudo-contractions, some of which may be interesting alternatives to the classical ones, providing a good balance between syntax dependence and expressivity.In this paper we explore some very natural and general constructions for pseudocontractions, showing some of their properties and giving their axiomatic characterizations.We also illustrate possible practical scenarios where they can be employed. Yuri David Santos, Vinícius Bitencourt Matos, Márcio Moretto Ribeiro, Renata Wassermann |
Int. J. Approx. Reason. | 1 |
| 2016 | Consolidating Probabilistic Knowledge Bases via Belief Contraction
Glauber De Bona, Marcelo Finger, Márcio Moretto Ribeiro, Yuri David Santos, Renata Wassermann |
KR | 4 |