Skip to main content

Resultados relacionados

Resultados totales (Incluyendo duplicados): 14
Encontrada(s) 1 página(s)

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

On the formal foundations of cash management systems

  • Salas-Molina, Francisco|||0000-0002-1168-7931
  • Pla Santamaría, David|||0000-0003-1563-3997
  • Garcia-Bernabeu, Ana|||0000-0003-3181-7745
  • Rodriguez-Aguilar, Juan A
[EN] Cash management aims to find a balance between what is held in cash and what is allocated in other investments in exchange for a given return. Dealing with cash management systems with multiple accounts and different links between them is a complex task. Current cash management models provide analytic solutions without exploring the underlying structure of accounts and its main properties. There is a need for a formal definition of cash management systems. In this work, we introduce a formal approach to manage cash with multiple accounts based on graph theory. Our approach allows a formal reasoning on the relation between accounts in cash management systems. A critical part of this formal reasoning is the characterization of desirable and non-desirable cash management policies. Novel theoretical results guide cash managers in the analysis of complex cash management systems., This work is partially funded by projects Logistar (H2020-769142), AI4EU (H2020-825619) and 2017 SGR 172.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

A stochastic goal programming model to derive stable cash management policies

  • Salas-Molina, Francisco|||0000-0002-1168-7931
  • Pla Santamaría, David|||0000-0003-1563-3997
  • Rodriguez-Aguilar, Juan A.
[EN] In this paper, we consider cash management systems with multiple bank accounts described by a given particular relationship between accounts and by a linear state transition law. Since cash managers may simultaneously consider a number of possibly conflicting goals, we provide a general stochastic goal programming model that is able to handle multiple goals and also the inherent uncertainty introduced by expected cash flows. We describe in detail an instance of our general model that considers the optimization of three different criteria such as cost, risk and cash balance stability. We claim that cash balance stability is an interesting goal to deal with the inherent uncertainty of expected cash flows. We also provide useful instructions for cash managers to set the main parameters of our model in practice. Our model provides a systematic approach to multiobjective cash management that is ready to be implemented in decision support systems for cash management., This work has been partially funded by Generalitat de Catalunya (2017 SGR 172), AI4EU(H2020-825619), LOGISTAR (H2020-769142).
Repositori Obert UdL
Publication Artículo científico (JournalArticle)

Encoding Ethics to Compute Value-Aligned Norms

  • Serramia, Marc
  • Rodriguez Soto, Manel
  • López Sánchez, Maite
  • Rodriguez Aguilar, Juan A.
  • Bistaffa, Filippo
  • Boddington, Paula
  • Wooldridge, Michael
  • Ansótegui Gil, Carlos José
Norms have been widely enacted in human and agent societies to regulate individuals’ actions. However, although legislators may have ethics in mind when establishing norms, moral values are only sometimes explicitly considered. This paper advances the state of the art by providing a method for selecting the norms to enact within a society that best aligns with the moral values of such a society. Our approach to aligning norms and values is grounded in the ethics literature. Specifically, from the literature’s study of the relations between norms, actions, and values, we formally define how actions and values relate through the so-called value judgment function and how norms and values relate through the so-called norm promotion function. We show that both functions provide the means to compute value alignment for a set of norms. Moreover, we detail how to cast our decision-making problem as an optimisation problem: finding the norms that maximise value alignment. We also show how to solve our problem using off-the-shelf optimisation tools. Finally, we illustrate our approach with a specific case study on the European Value Study., This work has been funded by projects VAE (TED2021-131295B-C31), VALAWAI (HE101070930), LOGISTAR (H2020-769142), AI4EU (H2020-825619), Crowd4SDG (H2020-872944), ACISUD (PID2022-136787NB-I00), COREDEM (H2020-785907), Fairtrans (PID2021-124361OBC33), AUTODEMO (SR21-00329), TAILOR (H2020-952215), assist-Decidim (23S02974-001), 2021 SGR 00313, and 2021 SGR 00754. F. Bistafa was supported by the H2020-MSCAIF- 2016 HPA4CF project. The authors have no competing interests to declare that are relevant to the content of this article. Maite Lopez-Sanchez belongs to the WAI research group (University of Barcelona) an associated unit to CSIC through the IIIA.
Repositori Obert UdL
Publication Artículo científico (JournalArticle)

Community Structure in Industrial SAT Instances

  • Ansótegui Gil, Carlos José
  • Bonet, Maria Luisa
  • Giráldez-Cru, Jesús
  • Levy, Jordi
Modern SAT solvers have experienced a remarkable progress on solving industrial instances. It is believed that most of these successful techniques exploit the underlying structure of industrial instances. Recently, there have been some attempts to analyze the structure of industrial SAT instances in terms of complex networks, with the aim of explaining the success of SAT solving techniques, and possibly improving them. In this paper, we study the community structure, or modularity, of industrial SAT instances. In a graph with clear community structure, or high modularity, we can find a partition of its nodes into communities such that most edges connect variables of the same community. Representing SAT instances as graphs, we show that most application benchmarks are characterized by a high modularity. On the contrary, random SAT instances are closer to the classical Erdös-Rényi random graph model, where no structure can be observed. We also analyze how this structure evolves by the effects of the execution of a CDCL SAT solver, and observe that new clauses learned by the solver during the search contribute to destroy the original structure of the formula. Motivated by this observation, we finally present an application that exploits the community structure to detect relevant learned clauses, and we show that detecting these clauses results in an improvement on the performance of the SAT solver. Empirically, we observe that this improves the performance of several SAT solvers on industrial SAT formulas, especially on satisfiable instances., This work is partially supported by the EU H2020 Research and Innovation Programme under the LOGISTAR project (Grant Agreement No. 769142), MINECO-FEDER projects RASO (TIN2015-71799-C2-1-P) and TASSAT3 (TIN2016-76573-C2-2-P), the Spanish Ministerio de Econom´ıa y Competitividad under the EXASOCO project (ref. PGC2018-101216- B-I00), including European Regional Development Funds (ERDF). The third author is also supported by a MICINN Juan de la Cierva fellowship (ref. FJCI-2017-32420).
Repositori Obert UdL
Publication Contribución de congreso (ConferenceOutput)

Reducing SAT to Max2SAT

  • Ansótegui Gil, Carlos José
  • Levy, Jordi
In the literature we find reductions from 3SAT to Max2SAT. These reductions are based on the usage of a gadget, i.e., a combinatorial structure that allows translating constraints of one problem to constraints of another. Unfortunately, the generation of these gadgets lacks an intuitive or efficient method. In this paper, we provide an efficient and constructive method for Reducing SAT to Max2SAT and show empirical results of how MaxSAT solvers are more efficient than SAT solvers solving the translation of hard formulas for Resolution., Supported by projects PROOFS (PID2019-109137GB-C21) and EU-H2020-RIP LOGISTAR (No. 769142).
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

A Computational Approach to Quantify the Benefits of Ridesharing for Policy Makers and Travellers

  • Bistaffa, Filippo
  • Blum, Christian
  • Cerquides, Jesús
  • Farinelli, Alessandro
  • Rodríguez-Aguilar, Juan Antonio
Peer-to-peer ridesharing enables people to arrange one-time rides with their own private cars, without the involvement of professional drivers. It is a prominent collective intelligence application producing significant benefits both for individuals (reduced costs) and for the entire community (reduced pollution and traffic). Despite these very promising potential advantages, the percentage of users who currently adopt ridesharing solutions is very low, well below the adoption rate required to achieve said benefits. One of the reasons of this insufficient engagement by the public is the lack of effective incentive policies by regulatory authorities, who are not able to estimate the costs and the benefits of a given ridesharing adoption policy. Here we address these issues by (i) developing a novel algorithm that makes large-scale, real-time peer-topeer ridesharing technologically feasible; and (ii) exhaustively quantifying the impact of different ridesharing scenarios in terms of environmental benefits (i.e., reduction of CO2 emissions, noise pollution, and traffic congestion) and quality of service for the users. Our analysis on a real-world dataset shows that major societal benefits are expected from deploying peer-to-peer ridesharing depending on the trade-off between environmental benefits and quality of service. Results on a real-world dataset show that our approach can produce reductions up to a 70.78% in CO2 emissions and up to 80.08% in traffic congestion., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

A stochastic goal programming model to derive stable cash management policies

  • Salas-Molina, Francisco
  • Rodríguez-Aguilar, Juan Antonio
  • Pla-Santamaría, David
In this paper, we consider cash management systems with multiple bank accounts described by a given particular relationship between accounts and by a linear state transition law. Since cash managers may simultaneously consider a number of possibly conflicting goals, we provide a general stochastic goal programming model that is able to handle multiple goals and also the inherent uncertainty introduced by expected cash flows. We describe in detail an instance of our general model that considers the optimization of three different criteria such as cost, risk and cash balance stability. We claim that cash balance stability is an interesting goal to deal with the inherent uncertainty of expected cash flows. We also provide useful instructions for cash managers to set the main parameters of our model in practice. Our model provides a systematic approach to multiobjective cash management that is ready to be implemented in decision support systems for cash management., This work has been partially funded by Generalitat de Catalunya (2017 SGR 172), AI4EU (H2020-825619), LOGISTAR (H2020-769142)., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

New complexity results for Lukasiewicz logic

  • Bofill, Miquel
  • Manyà, Felip
  • Vidal, Amanda
  • Villaret, Mateu
One aspect that has been poorly studied in multiple-valued logics, and in particular in Łukasiewicz logic, is the generation of instances of varying difficulty for evaluating, comparing and improving satisfiability solvers. With the ultimate goal of finding challenging benchmarks for Łukasiewicz satisfiability solvers, we start by defining a natural and intuitive class of clausal forms (simple Ł-clausal forms) and studying their complexity. Since we prove that the satisfiability problem of simple Ł-clausal forms can be solved in linear time, we then define two new classes of clausal forms (Ł-clausal forms and restricted Ł-clausal forms) that truly exploit the non-lattice operations of Łukasiewicz logic and whose satisfiability problems are NP-complete when clauses have at least three literals, and admit linear-time algorithms when clauses have at most two literals. We also define an efficient satisfiability preserving translation of Łukasiewicz logic formulas into Ł-clausal forms. Finally, we describe a random generator of Ł-clausal forms and report on an empirical investigation in which we identify an easy-hard-easy pattern and a phase transition phenomenon for Ł-clausal forms., This work was supported by Project LOGISTAR from the EU H2020 Research and Innovation Programme under Grant Agreement No. 769142, MINECO-FEDER Projects RASO (TIN2015-71799-C2-1-P) and LoCos (TIN2015-66293-R), and the UdG Project MPCUdG2016/055. Vidal acknowledges the support from the Project GA17-04630S of the Czech Science Foundation (GAČR)., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Contribución de congreso (ConferenceOutput)

Clause Branching in MaxSAT and MinSAT

  • Argelich, Josep
  • Li, Chu Min
  • Manyà, Felip
  • Zhu, Zhu
Trabajo presentado en el 21st International Conference of the Catalan Association for Artificial Intelligence (CCIA 2018), celebrada en Roses (España) del 8 al 10 de Octubre de 2018, We describe a new exact procedure, inspired on recent works on tableaux, for simultaneously solving MaxSAT and MinSAT. The main novelty of our procedure is that it implements a clause branching rule that preserves both the minimum and the maximum number of clauses than can be unsatisfied. Moreover, we prove the correctness of the procedure, and provide a review of the different types of branchings which are available for MaxSAT and MinSAT. We also give some preliminary experimental results that show that the new branching rule, when implemented into an existing branch-and-bound MaxSAT solver, produces substantial gains on industrial instances of the MaxSAT Evaluation., This work was supported by Project LOGISTAR from the EU H2020 Research and Innovation Programme under Grant Agreement No. 769142, and MINECO-FEDER projects RASO (TIN2015-71799-C2-1-P/2-P)., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Contribución de congreso (ConferenceOutput)

Phase Transition in Realistic Random SAT Models

  • Ansotegui, Carlos
  • Bonet, María Luisa
  • Levy, Jordi
Phase-transition in random SAT formulas is one of the properties best studied by theoretical SAT researchers. There exists a constant rk depending on k such that, if we choose randomly a k-SAT formula over n variables and m clauses, it will be satisfiable with high probability, if m/n < r, and unsatisfiable, otherwise. However, this criterion is useless in practice, because real-world or industrial instances have some properties not shown in random formulas. In the last years, several models of realistic random formulas have been proposed. Here we discuss about the phase transition in these models, and about the size of unsatisfiability proofs. We observe that in these models, like in real-world formulas, there is not a sharp phase transition, the transition occurs for smaller values of r, and the proofs on unsatisfiable formulas are smaller than in the classical random model. We also discuss about the strategies used by modern SAT solvers to exploit these properties., Research partially supported by the EU H2020 Research and Innovation Program under the LOGISTAR project (Grant Agreement No. 769142) and the MINECO-FEDER projects RASO (TIN2015-71799-C2-1-P) and TASSAT 3 (TIN2016-76573-C2-2-P).
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Encoding Ethics to Compute Value-Aligned Norms

  • Serramia, Marc
  • Rodríguez-Soto, Manel
  • López-Sánchez, Maite
  • Rodríguez-Aguilar, Juan Antonio
  • Bistaffa, Filippo
  • Boddington, Paula
  • Wooldridge, Michael
  • Ansotegui, Carlos
Norms have been widely enacted in human and agent societies to regulate individuals’ actions. However, although legislators may have ethics in mind when establishing norms, moral values are only sometimes explicitly considered. This paper advances the state of the art by providing a method for selecting the norms to enact within a society that best aligns with the moral values of such a society. Our approach to aligning norms and values is grounded in the ethics literature. Specifically, from the literature’s study of the relations between norms, actions, and values, we formally define how actions and values relate through the so-called value judgment function and how norms and values relate through the so-called norm promotion function. We show that both functions provide the means to compute value alignment for a set of norms. Moreover, we detail how to cast our decision-making problem as an optimisation problem: finding the norms that maximise value alignment. We also show how to solve our problem using off-the-shelf optimisation tools. Finally, we illustrate our approach with a specific case study on the European Value Study., This work has been funded by projects VAE (TED2021-131295B-C31), VALAWAI (HE-101070930), LOGISTAR (H2020-769142), AI4EU (H2020-825619), Crowd4SDG (H2020-872944), ACISUD (PID2022-136787NB-I00), COREDEM (H2020-785907), Fairtrans (PID2021-124361OB-C33), AUTODEMO (SR21-00329), TAILOR (H2020-952215), assist-Decidim (23S02974-001), 2021 SGR 00313, and 2021 SGR 00754. F. Bistaffa was supported by the H2020-MSCAIF- 2016 HPA4CF project. The authors have no competing interests to declare that are relevant to the content of this article. Maite Lopez-Sanchez belongs to the WAI research group (University of Barcelona) an associated unit to CSIC through the IIIA., Peer reviewed
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Encoding Ethics to Compute Value-Aligned Norms

  • Serramia, Marc
  • Rodriguez Soto, Manel
  • López Sánchez, Maite
  • Rodriguez Aguilar, Juan A.
  • Bistaffa, Filippo
  • Boddington, Paula
  • Wooldridge, Michael
  • Ansótegui Gil, Carlos José
Norms have been widely enacted in human and agent societies to regulate individuals’ actions. However, although legislators may have ethics in mind when establishing norms, moral values are only sometimes explicitly considered. This paper advances the state of the art by providing a method for selecting the norms to enact within a society that best aligns with the moral values of such a society. Our approach to aligning norms and values is grounded in the ethics literature. Specifically, from the literature’s study of the relations between norms, actions, and values, we formally define how actions and values relate through the so-called value judgment function and how norms and values relate through the so-called norm promotion function. We show that both functions provide the means to compute value alignment for a set of norms. Moreover, we detail how to cast our decision-making problem as an optimisation problem: finding the norms that maximise value alignment. We also show how to solve our problem using off-the-shelf optimisation tools. Finally, we illustrate our approach with a specific case study on the European Value Study., This work has been funded by projects VAE (TED2021-131295B-C31), VALAWAI (HE101070930), LOGISTAR (H2020-769142), AI4EU (H2020-825619), Crowd4SDG (H2020-872944), ACISUD (PID2022-136787NB-I00), COREDEM (H2020-785907), Fairtrans (PID2021-124361OBC33), AUTODEMO (SR21-00329), TAILOR (H2020-952215), assist-Decidim (23S02974-001), 2021 SGR 00313, and 2021 SGR 00754. F. Bistafa was supported by the H2020-MSCAIF- 2016 HPA4CF project. The authors have no competing interests to declare that are relevant to the content of this article. Maite Lopez-Sanchez belongs to the WAI research group (University of Barcelona) an associated unit to CSIC through the IIIA.
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Reducing SAT to Max2SAT

  • Ansótegui Gil, Carlos José
  • Levy, Jordi
In the literature we find reductions from 3SAT to Max2SAT. These reductions are based on the usage of a gadget, i.e., a combinatorial structure that allows translating constraints of one problem to constraints of another. Unfortunately, the generation of these gadgets lacks an intuitive or efficient method. In this paper, we provide an efficient and constructive method for Reducing SAT to Max2SAT and show empirical results of how MaxSAT solvers are more efficient than SAT solvers solving the translation of hard formulas for Resolution., Supported by projects PROOFS (PID2019-109137GB-C21) and EU-H2020-RIP LOGISTAR (No. 769142).
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Community Structure in Industrial SAT Instances

  • Ansótegui Gil, Carlos José
  • Bonet, Maria Luisa
  • Giráldez-Cru, Jesús
  • Levy, Jordi
Modern SAT solvers have experienced a remarkable progress on solving industrial instances. It is believed that most of these successful techniques exploit the underlying structure of industrial instances. Recently, there have been some attempts to analyze the structure of industrial SAT instances in terms of complex networks, with the aim of explaining the success of SAT solving techniques, and possibly improving them. In this paper, we study the community structure, or modularity, of industrial SAT instances. In a graph with clear community structure, or high modularity, we can find a partition of its nodes into communities such that most edges connect variables of the same community. Representing SAT instances as graphs, we show that most application benchmarks are characterized by a high modularity. On the contrary, random SAT instances are closer to the classical Erdös-Rényi random graph model, where no structure can be observed. We also analyze how this structure evolves by the effects of the execution of a CDCL SAT solver, and observe that new clauses learned by the solver during the search contribute to destroy the original structure of the formula. Motivated by this observation, we finally present an application that exploits the community structure to detect relevant learned clauses, and we show that detecting these clauses results in an improvement on the performance of the SAT solver. Empirically, we observe that this improves the performance of several SAT solvers on industrial SAT formulas, especially on satisfiable instances., This work is partially supported by the EU H2020 Research and Innovation Programme under the LOGISTAR project (Grant Agreement No. 769142), MINECO-FEDER projects RASO (TIN2015-71799-C2-1-P) and TASSAT3 (TIN2016-76573-C2-2-P), the Spanish Ministerio de Econom´ıa y Competitividad under the EXASOCO project (ref. PGC2018-101216- B-I00), including European Regional Development Funds (ERDF). The third author is also supported by a MICINN Juan de la Cierva fellowship (ref. FJCI-2017-32420).