4 found
Order:
Disambiguations
Juan A. Rodríguez-Aguilar [3]Juan Antonio Rodríguez-Aguilar [1]
  1.  1
    Solving Highly Cyclic Distributed Optimization Problems Without Busting the Bank: A Decimation-Based Approach.Jesús Cerquides, Juan Antonio Rodríguez-Aguilar, Rémi Emonet & Gauthier Picard - 2021 - Logic Journal of the IGPL 29 (1):72-95.
    In the context of solving large distributed constraint optimization problems, belief-propagation and incomplete inference algorithms are candidates of choice. However, in general, when the problem structure is very cyclic, these solution methods suffer from bad performance, due to non-convergence and many exchanged messages. As to improve performances of the MaxSum inference algorithm when solving cyclic constraint optimization problems, we propose here to take inspiration from the belief-propagation-guided decimation used to solve sparse random graphs. We propose the novel DeciMaxSum method, which (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  2. Communicating Open Systems.Mark dʼInverno, Michael Luck, Pablo Noriega, Juan A. Rodriguez-Aguilar & Carles Sierra - 2012 - Artificial Intelligence 186:38-94.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  3.  35
    Multi-Modal CTL: Completeness, Complexity, and an Application.Thomas Ågotnes, Wiebe Van der Hoek, Juan A. Rodríguez-Aguilar, Carles Sierra & Michael Wooldridge - 2009 - Studia Logica 92 (1):1 - 26.
    We define a multi-modal version of Computation Tree Logic (CTL) by extending the language with path quantifiers $E^\delta $ and $E^\delta $ where δ denotes one of finitely many dimensions, interpreted over Kripke structures with one total relation for each dimension. As expected, the logic is axiomatised by taking a copy of a CTL axiomatisation for each dimension. Completeness is proved by employing the completeness result for CTL to obtain a model along each dimension in turn. We also show that (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  4.  80
    Multi-Modal CTL: Completeness, Complexity, and an Application. [REVIEW]Thomas Ågotnes, Wiebe Van der Hoek, Juan A. Rodríguez-Aguilar, Carles Sierra & Michael Wooldridge - 2009 - Studia Logica 92 (1):1-26.
    We define a multi-modal version of Computation Tree Logic (ctl) by extending the language with path quantifiers E δ and A δ where δ denotes one of finitely many dimensions, interpreted over Kripke structures with one total relation for each dimension. As expected, the logic is axiomatised by taking a copy of a ctl axiomatisation for each dimension. Completeness is proved by employing the completeness result for ctl to obtain a model along each dimension in turn. We also show that (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark