Search Results

Documents authored by Valencia, Frank

Found 2 Possible Name Variants:

Valencia, Frank D.

Document
DOI: 10.4230/OASIcs.ICLP.2016.16
On the Expressiveness of Spatial Constraint Systems

Authors: Michell Guzmán and Frank D. Valencia

Published in: OASIcs, Volume 52, Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016)

Abstract
In this paper we shall report on our progress using spatial constraint system as an abstract representation of modal and epistemic behaviour. First we shall give an introduction as well as the background to our work. Then, we present our preliminary results on the representation of modal behaviour by using spatial constraint systems. Then, we present our ongoing work on the characterization of the epistemic notion of knowledge. Finally, we discuss about the future work of our research.
Cite as

Michell Guzmán and Frank D. Valencia. On the Expressiveness of Spatial Constraint Systems. In Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016). Open Access Series in Informatics (OASIcs), Volume 52, pp. 16:1-16:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)

Copy BibTex To Clipboard

@InProceedings{guzman_et_al:OASIcs.ICLP.2016.16,
  author =	{Guzm\'{a}n, Michell and Valencia, Frank D.},
  title =	{{On the Expressiveness of Spatial Constraint Systems}},
  booktitle =	{Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016)},
  pages =	{16:1--16:12},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-007-1},
  ISSN =	{2190-6807},
  year =	{2016},
  volume =	{52},
  editor =	{Carro, Manuel and King, Andy and Saeedloei, Neda and De Vos, Marina},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2016.16},
  URN =		{urn:nbn:de:0030-drops-67469},
  doi =		{10.4230/OASIcs.ICLP.2016.16},
  annote =	{Keywords: Epistemic logic, Modal logic, Constraint systems, Concurrent constraint programming}
}

Valencia, Frank

Document
DOI: 10.4230/LIPIcs.CONCUR.2024.7
Fairness and Consensus in an Asynchronous Opinion Model for Social Networks

Authors: Jesús Aranda, Sebastián Betancourt, Juan Fco. Díaz, and Frank Valencia

Published in: LIPIcs, Volume 311, 35th International Conference on Concurrency Theory (CONCUR 2024)

Abstract
We introduce a DeGroot-based model for opinion dynamics in social networks. A community of agents is represented as a weighted directed graph whose edges indicate how much agents influence one another. The model is formalized using labeled transition systems, henceforth called opinion transition systems (OTS), whose states represent the agents' opinions and whose actions are the edges of the influence graph. If a transition labeled (i,j) is performed, agent j updates their opinion taking into account the opinion of agent i and the influence i has over j. We study (convergence to) opinion consensus among the agents of strongly-connected graphs with influence values in the interval (0,1). We show that consensus cannot be guaranteed under the standard strong fairness assumption on transition systems. We derive that consensus is guaranteed under a stronger notion from the literature of concurrent systems; bounded fairness. We argue that bounded-fairness is too strong of a notion for consensus as it almost surely rules out random runs and it is not a constructive liveness property. We introduce a weaker fairness notion, called m-bounded fairness, and show that it guarantees consensus. The new notion includes almost surely all random runs and it is a constructive liveness property. Finally, we consider OTS with dynamic influence and show convergence to consensus holds under m-bounded fairness if the influence changes within a fixed interval [L,U] with 0 < L < U < 1. We illustrate OTS with examples and simulations, offering insights into opinion formation under fairness and dynamic influence.
Cite as

Jesús Aranda, Sebastián Betancourt, Juan Fco. Díaz, and Frank Valencia. Fairness and Consensus in an Asynchronous Opinion Model for Social Networks. In 35th International Conference on Concurrency Theory (CONCUR 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 311, pp. 7:1-7:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)

Copy BibTex To Clipboard

@InProceedings{aranda_et_al:LIPIcs.CONCUR.2024.7,
  author =	{Aranda, Jes\'{u}s and Betancourt, Sebasti\'{a}n and D{\'\i}az, Juan Fco. and Valencia, Frank},
  title =	{{Fairness and Consensus in an Asynchronous Opinion Model for Social Networks}},
  booktitle =	{35th International Conference on Concurrency Theory (CONCUR 2024)},
  pages =	{7:1--7:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-339-3},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{311},
  editor =	{Majumdar, Rupak and Silva, Alexandra},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024.7},
  URN =		{urn:nbn:de:0030-drops-207794},
  doi =		{10.4230/LIPIcs.CONCUR.2024.7},
  annote =	{Keywords: Social networks, fairness, DeGroot, consensus, asynchrony}
}
Document
DOI: 10.4230/LIPIcs.CONCUR.2019.29
Reasoning About Distributed Knowledge of Groups with Infinitely Many Agents

Authors: Michell Guzmán, Sophia Knight, Santiago Quintero, Sergio Ramírez, Camilo Rueda, and Frank Valencia

Published in: LIPIcs, Volume 140, 30th International Conference on Concurrency Theory (CONCUR 2019)

Abstract
Spatial constraint systems (scs) are semantic structures for reasoning about spatial and epistemic information in concurrent systems. We develop the theory of scs to reason about the distributed information of potentially infinite groups. We characterize the notion of distributed information of a group of agents as the infimum of the set of join-preserving functions that represent the spaces of the agents in the group. We provide an alternative characterization of this notion as the greatest family of join-preserving functions that satisfy certain basic properties. We show compositionality results for these characterizations and conditions under which information that can be obtained by an infinite group can also be obtained by a finite group. Finally, we provide algorithms that compute the distributive group information of finite groups.
Cite as

Michell Guzmán, Sophia Knight, Santiago Quintero, Sergio Ramírez, Camilo Rueda, and Frank Valencia. Reasoning About Distributed Knowledge of Groups with Infinitely Many Agents. In 30th International Conference on Concurrency Theory (CONCUR 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 140, pp. 29:1-29:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)

Copy BibTex To Clipboard

@InProceedings{guzman_et_al:LIPIcs.CONCUR.2019.29,
  author =	{Guzm\'{a}n, Michell and Knight, Sophia and Quintero, Santiago and Ram{\'\i}rez, Sergio and Rueda, Camilo and Valencia, Frank},
  title =	{{Reasoning About Distributed Knowledge of Groups with Infinitely Many Agents}},
  booktitle =	{30th International Conference on Concurrency Theory (CONCUR 2019)},
  pages =	{29:1--29:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-121-4},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{140},
  editor =	{Fokkink, Wan and van Glabbeek, Rob},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.29},
  URN =		{urn:nbn:de:0030-drops-109314},
  doi =		{10.4230/LIPIcs.CONCUR.2019.29},
  annote =	{Keywords: Reasoning about Groups, Distributed Knowledge, Infinitely Many Agents, Reasoning about Space, Algebraic Modeling}
}
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact