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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Daniel A. Grimaldi

dblp:299/5181 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2024
0009-0000-6131-2372ORCID · verified

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

Artificial intelligence and machine learning · 3 · 2 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021Theory of computation · 1 · 1 since 2021

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
1 paper
Logic in computer science · 100%
Artificial intelligence
1 paper
Knowledge representation and reasoning · 100%

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

TopicWeightPapersLastEvidence papers
Logic in computer science
belief revision
0.712023
Weak-Ensconcement for Shielded Base Contraction · KR 2023
Knowledge, reasoning and agents › Knowledge representation and reasoning
belief revision
0.512021
Updating the Belief Promotion Operator · IJCAI 2021
Knowledge, reasoning and agents › Knowledge representation and reasoning › belief revision
credibility-limited base revision
0.112021
Updating the Belief Promotion Operator · IJCAI 2021
YearPublicationVenuePosition
2024 Moderated revision
abstract
In this article, we provide a new kind of belief revision operator that we call Moderated Revision. At first glance, it is a non-prioritized operator that combines a basic classical AGM operator with a credibility-limited one. The underlying idea is this: when new observation μ is received, it is accepted but with doubts, i.e., uncertainty. We use a revision operator to model the accepted part and a credibility-limited one to represent uncertainty, whenever necessary. In the presence of uncertainty, a selection of the old knowledge balances the result of the revision through a disjunction, allowing the agent to accept part of the new observation and remain unsettled about the rest.
Daniel A. Grimaldi, Maria Vanina Martinez, Ricardo Oscar Rodríguez
Int. J. Approx. Reason.1
2023 Weak-Ensconcement for Shielded Base Contraction
abstract
In this article, we provide the weak version of ensconcement which characterizes an interesting family of Shielded base contractions. In turn, this characterization induces a class of AGM contractions satisfying certain postulates that we reveal here. Finally, we show a connection among the class of contractions given by our weak ensconcement and other kinds of base contraction operators. In doing so, we also point out a flaw in the original theorems that link the epistemic entrenchment with ensconcement (which are well established in the literature), and then we provide two possible solutions.
Alejandro J. Mercado, Daniel A. Grimaldi, Ricardo Oscar Rodríguez
KR2
2021 Updating the Belief Promotion Operator
abstract
In this note, we introduce the local version of the operator for belief promotion proposed by Schwind et al. We propose a set of postulates and provide a representation theorem that characterizes the proposal. This family of operators is related to belief promotion in the same way that updating is related to revision, and we provide several results that allow us to show this relationship formally. Furthermore, we also show the relationship of the proposed operator with features of credibility-limited revision theory.
Daniel A. Grimaldi, Maria Vanina Martinez, Ricardo Oscar Rodríguez
IJCAI1