Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Perez, Ramon Pino"'
Modal logics have proved useful for many reasoning tasks in symbolic artificial intelligence (AI), such as belief revision, spatial reasoning, among others. On the other hand, mathematical morphology (MM) is a theory for non-linear analysis of struct
Externí odkaz:
http://arxiv.org/abs/2303.04895
The problem of finding envy-free allocations of indivisible goods can not always be solved; therefore, it is common to study some relaxations such as envy-free up to one good (EF1). Another property of interest for efficiency of an allocation is the
Externí odkaz:
http://arxiv.org/abs/2109.08461
Autor:
Borges, Nerio, Pérez, Ramón Pino
In most classical models of belief change, epistemic states are represented by theories (AGM) or formulas (Katsuno-Mendelzon) and the new pieces of information by formulas. The Representation Theorem for revision operators says that operators are rep
Externí odkaz:
http://arxiv.org/abs/1910.14138
Nested graphs have been used in different applications, for example to represent knowledge in semantic networks. On the other hand, graphs with cycles are really important in surface reconstruction, periodic schedule and network analysis. Also, of pa
Externí odkaz:
http://arxiv.org/abs/1811.03044
We use an algebraic viewpoint, namely a matrix framework to deal with the problem of resource allocation under uncertainty in the context of a qualitative approach. Our basic qualitative data are a plausibility relation over the resources, a hierarch
Externí odkaz:
http://arxiv.org/abs/1805.06864
Several tasks in artificial intelligence require to be able to find models about knowledge dynamics. They include belief revision, fusion and belief merging, and abduction. In this paper we exploit the algebraic framework of mathematical morphology i
Externí odkaz:
http://arxiv.org/abs/1802.05142
Autor:
Díaz, Amílcar Mata, Pérez, Ramón Pino
With the aim of studying social properties of belief merging and having a better understanding of impossibility, we extend in three ways the framework of logic-based merging introduced by Konieczny and Pino P\'erez. First, at the level of representat
Externí odkaz:
http://arxiv.org/abs/1606.04589
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Chacón, José Luis, Pérez, Ramón Pino
Most merging operators are defined by semantics methods which have very high computational complexity. In order to have operators with a lower computational complexity, some merging operators defined in a syntactical way have be proposed. In this wor
Externí odkaz:
http://arxiv.org/abs/1207.4813
Autor:
Pérez, Ramón Pino, Uzcátegui, Carlos
Publikováno v:
The Journal of Symbolic Logic, 2000 Sep 01. 65(3), 1321-1337.
Externí odkaz:
https://www.jstor.org/stable/2586702
