{"title":"Decomposing Constraint Satisfaction Problems by Means of Meta Constraint Satisfaction Optimization Problems","authors":"Sven Löffler, Ke Liu, P. Hofstedt","doi":"10.5220/0007455907550761","DOIUrl":"https://doi.org/10.5220/0007455907550761","url":null,"abstract":"This paper describes a new approach to decompose constraint satisfaction problems (CSPs) using an auxiliary constraint satisfaction optimization problem (CSOP) that detects sub-CSPs which share only few common variables. The purpose of this approach is to find sub-CSPs which can be solved in parallel and combined to a complete solution of the original CSP. Therefore, our decomposition approach has two goals: 1. to evenly balance the workload distribution over all cores and solve the partial CSPs as fast as possible and 2. to minimize the number of shared variables to make the join process of the solutions as fast as possible.","PeriodicalId":174978,"journal":{"name":"International Conference on Agents and Artificial Intelligence","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125877608","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Improvement of Multi-agent Continuous Cooperative Patrolling with Learning of Activity Length","authors":"Ayumi Sugiyama, Lingying Wu, T. Sugawara","doi":"10.1007/978-3-030-37494-5_14","DOIUrl":"https://doi.org/10.1007/978-3-030-37494-5_14","url":null,"abstract":"","PeriodicalId":174978,"journal":{"name":"International Conference on Agents and Artificial Intelligence","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126615207","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On Mining Conditions using Encoder-decoder Networks","authors":"Fernando O. Gallego, R. Corchuelo","doi":"10.5220/0007379506240630","DOIUrl":"https://doi.org/10.5220/0007379506240630","url":null,"abstract":"A condition is a constraint that determines when something holds. Mining them is paramount to understanding many sentences properly. There are a few pattern-based approaches that fall short because the patterns must be handcrafted and it is not easy to characterise unusual ways to express conditions; there is one machine-learning approach that requires specific-purpose dictionaries, taxonomies, and heuristics, works on opinion sentences only, and was evaluated on a small dataset with Japanese sentences on hotels. In this paper, we present an encoder-decoder model to mine conditions that does not have any of the previous drawbacks and outperforms the state of the art in terms of effectiveness.","PeriodicalId":174978,"journal":{"name":"International Conference on Agents and Artificial Intelligence","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129950573","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Operations for Shape Transformations based on Angles","authors":"Momo Tosue, Sosuke Moriguchi, Kazuko Takahashi","doi":"10.5220/0007359305760583","DOIUrl":"https://doi.org/10.5220/0007359305760583","url":null,"abstract":"We propose a symbolic expression for a qualitative shape of an object in the sequence of rotation angles of edges. We give a drawing algorithm for the expression based on rewriting strings and prove that we can draw a figure on a two-dimensional plane, for a consistent expression. We also refine this algorithm as an abstract rewriting system to represent shapes of figures and their changes, and prove that the system has confluence and termination.","PeriodicalId":174978,"journal":{"name":"International Conference on Agents and Artificial Intelligence","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131407281","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Designing Transparent and Autonomous Intelligent Vision Systems","authors":"J. Olszewska","doi":"10.5220/0007585208500856","DOIUrl":"https://doi.org/10.5220/0007585208500856","url":null,"abstract":"To process vast amounts of visual data such as images, videos, etc. in an automatic and computationally efficient way, intelligent vision systems have been developed over the last three decades. However, with the increasing development of complex technologies like companion robots which require advanced machine vision capabilities and, on the other hand, the growing attention to data security and privacy, the design of intelligent vision systems faces new challenges such as autonomy and transparency. Hence, in this paper, we propose to define the main requirements for the new generation of intelligent vision systems (IVS) we demonstrated in a prototype.","PeriodicalId":174978,"journal":{"name":"International Conference on Agents and Artificial Intelligence","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125941840","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Causality Analysis for Nonlinear Classification Model with Self-Organizing Map and Locally Approximation to Linear Model","authors":"Yasuhiro Kirihata, T. Maekawa, T. Onoyama","doi":"10.5220/0007258404190426","DOIUrl":"https://doi.org/10.5220/0007258404190426","url":null,"abstract":"In terms of nonlinear machine learning classifier such as Deep Learning, machine-learning model is generally a black box which has issue not to be clear the causality among its output classification and input attributes. In this paper, we propose a causality analysis method with self-organizing map and locally approximation to linear model. In this method, self-organizing map generates the cluster of input data and local linear models for each node on the map provides explanation of the generated model. Applying this method to the member rank prediction model based on Deep Learning, we validated our proposed method.","PeriodicalId":174978,"journal":{"name":"International Conference on Agents and Artificial Intelligence","volume":"5 11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127405967","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Modelling the Semantic Change Dynamics using Diachronic Word Embedding","authors":"M. Boukhaled, B. Fagard, T. Poibeau","doi":"10.5220/0007698109440951","DOIUrl":"https://doi.org/10.5220/0007698109440951","url":null,"abstract":"In this contribution, we propose a computational model to predict the semantic evolution of words over time. Though semantic change is very complex and not well suited to analytical manipulation, we believe that computational modelling is a crucial tool to study such phenomenon. Our aim is to capture the systemic change of word\"s meanings in an empirical model that can also predict this type of change, making it falsifiable. The model that we propose is based on the long short-term memory units architecture of recurrent neural networks trained on diachronic word embeddings. In order to illustrate the significance of this kind of empirical model, we then conducted an experimental evaluation using the Google Books N-Gram corpus. The results show that the model is effective in capturing the semantic change and can achieve a high degree of accuracy on predicting words\" distributional semantics.","PeriodicalId":174978,"journal":{"name":"International Conference on Agents and Artificial Intelligence","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125392622","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Extracting Primary Objects and Spatial Relations from Sentences","authors":"Neha Baranwal, Avinash Kumar Singh, Suna Bensch","doi":"10.5220/0007570002520259","DOIUrl":"https://doi.org/10.5220/0007570002520259","url":null,"abstract":"In verbal human-robot interaction natural language utterances have to be grounded in visual scenes by the robot. Visual language grounding is a challenging task that includes identifying a primary ...","PeriodicalId":174978,"journal":{"name":"International Conference on Agents and Artificial Intelligence","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121422740","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Miriam El Khoury Badran, J. B. Abdo, Wissam Al Jurdi, J. Demerjian
{"title":"Adaptive Serendipity for Recommender Systems: Let It Find You","authors":"Miriam El Khoury Badran, J. B. Abdo, Wissam Al Jurdi, J. Demerjian","doi":"10.5220/0007409507390745","DOIUrl":"https://doi.org/10.5220/0007409507390745","url":null,"abstract":"Recommender systems are nowadays widely implemented in order to predict the potential objects of interest for the user. With the wide world of the internet, these systems are necessary to limit the problem of information overload and make the user’s internet surfing a more agreeable experience. However, a very accurate recommender system creates a problem of over-personalization where there is no place for adventure and unexpected discoveries: the user will be trapped in filter bubbles and echo rooms. Serendipity is a beneficial discovery that happens by accident. Used alone, serendipity can be easily confused with randomness; this takes us back to the original problem of information overload. Hypothetically, combining accurate and serendipitous recommendations will result in a higher user satisfaction. The aim of this paper is to prove the following concept: including some serendipity at the cost of profile accuracy will result in a higher user satisfaction and is, therefore, more favourable to implement. We will be testing a first measure implementation of serendipity on an offline dataset that lacks serendipity implementation. By varying the ratio of accuracy and serendipity in the recommendation list, we will reach the optimal number of serendipitous recommendations to be included in an accurate list.","PeriodicalId":174978,"journal":{"name":"International Conference on Agents and Artificial Intelligence","volume":"154 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131630691","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Cooperative Linker for the Distributed Control of the Barcelona Drinking Water Network","authors":"Valeria Javalera-Rincon, Vicenç Puig Cayuela, Bernardo Morcego Seix, Fernando Orduña Cabrera","doi":"10.5220/0007349105600567","DOIUrl":"https://doi.org/10.5220/0007349105600567","url":null,"abstract":"This work shows how a Linker agent coordinates a cooperative MAS environment to seek a global optimum. The approach is applied to the Barcelona Drinking Water Network (DWN) administrated by AGBAR where the main problem was to coordinate the control of three different sectors of the network. Each part has a local controller (local agent) to solve the local water demands, but it also has to cooperate with the other agents to satisfy the water demands of the whole network. The cooperative Linker agent implemented, learns by using a Reinforcement Learning algorithm, called PlanningByExploration Behaviour with penalization (Javalera et al., 2019), to converge towards an optimal (or suboptimal) value of each of the variables that connect the local agents. For the training and simulation of the Linker agents real historical data of the Barcelona DWN provided by AGBAR were used, as well as the data to model the distributed topology of the DWN. Moreover, some results of the simulations of this approach in contrast with the results of a centralized Model Predictive Controller are depicted.","PeriodicalId":174978,"journal":{"name":"International Conference on Agents and Artificial Intelligence","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133995187","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}