O. Pivert, Virginie Thion, Hélène Jaudoin, Grégory Smits
{"title":"On a Fuzzy Algebra for Querying Graph Databases","authors":"O. Pivert, Virginie Thion, Hélène Jaudoin, Grégory Smits","doi":"10.1109/ICTAI.2014.116","DOIUrl":"https://doi.org/10.1109/ICTAI.2014.116","url":null,"abstract":"This paper proposes a notion of fuzzy graph database and describes a fuzzy query algebra that makes it possible to handle such database, which may be fuzzy or not, in a flexible way. The algebra, based on fuzzy set theory and the concept of a fuzzy graph, is composed of a set of operators that can be used to express preference queries on fuzzy graph databases. The preferences concern i) the content of the vertices of the graph and ii) the structure of the graph. In a similar way as relational algebra constitutes the basis of SQL, the fuzzy algebra proposed here underlies a user-oriented query language and an associated tool implementing this language that are also presented in the paper.","PeriodicalId":142794,"journal":{"name":"2014 IEEE 26th International Conference on Tools with Artificial Intelligence","volume":"217 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116062205","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":"Hidden Tractable Classes: From Theory to Practice","authors":"Achref El Mouelhi, Philippe Jégou, C. Terrioux","doi":"10.1109/ICTAI.2014.73","DOIUrl":"https://doi.org/10.1109/ICTAI.2014.73","url":null,"abstract":"Tractable classes constitute an important issue in CP, at least from a theoretical viewpoint. But they are not actually used in practice. Either their treatment is too costly for time complexity or, even if there exist efficient algorithms to manage them, they do not appear in the real problems. We propose here to address this issue thanks to the notion of hidden tractable classes. Such classes are based on a known tractable class C, and a transformation t, and are defined by sets of instances P such that their transformation using t is in C, that is t (P) in C. We propose a general framework to study such notions. After, we focus our study on the tractable class BTP, and several transformations which are the filterings classically used in CP. We show then that the use of filterings allows sometimes to highlight the occurrence of BTP in the benchmarks generally considered for solver comparisons, i.e. That BTP is sometimes \"hidden\" in the benchmarks. Thus, this approach allows to extend the set of known tractable classes.","PeriodicalId":142794,"journal":{"name":"2014 IEEE 26th International Conference on Tools with Artificial Intelligence","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133272272","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":"Online Stochastic Planning for Taxi and Ridesharing","authors":"C. Manna, S. Prestwich","doi":"10.1109/ICTAI.2014.138","DOIUrl":"https://doi.org/10.1109/ICTAI.2014.138","url":null,"abstract":"In this paper we consider the problem of on-line stochastic ride-sharing and taxi-sharing with time windows. We study a scenario in which people needing a taxi, or a ride, assign their source and destination points plus other restrictions (such as earlier time to departure and maximum time to reach a destination), at the same time, there are taxis or drivers interested in providing a ride (also with departure and destination points, vehicle capacity and time restrictions). We model the time window restrictions as a soft constraint (a reasonable delay might be acceptable in a realistic scenario), and consider the problem as an on-line continual planning problem, in which additional ride requests may arrive while plans for previous ride-matching are being executed. Finally, such new requests may arrive at each time step with some probability. The aim is to maximize the shared trips while minimising the expected travel delay for each trip. In this paper we propose an on-line stochastic optimization planning approach in which instead of myopically optimising for the offered trips and requested trips that are known, incorporate information that partially describes the stochastic future into the model in order to improve the quality of the solution. We prove the effectiveness of the method in a real world scenario using a number of instances extracted from a travel survey in north-eastern Illinois (USA) conducted by the Chicago Metropolitan Agency for Planning.","PeriodicalId":142794,"journal":{"name":"2014 IEEE 26th International Conference on Tools with Artificial Intelligence","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134217832","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":"Quality over Quantity in Soft Constraints","authors":"Alexander Knapp, Alexander Schiendorfer, W. Reif","doi":"10.1109/ICTAI.2014.75","DOIUrl":"https://doi.org/10.1109/ICTAI.2014.75","url":null,"abstract":"Partial constraint satisfaction and soft constraints enable to deal with over-constrained problems in practice. Constraint relationships have been introduced to provide a qualitative approach to specifying preferences over the constraints that should be satisfied. In contrast to quantitative approaches like weighted or fuzzy CSPs, the preferences just rely on a directed acyclic graph. The approach is particularly aimed at scenarios where soft-constraint problems stemming from several independently modeled agents have to be aggregated into one problem in a multi-agent system. Existing transformations into weighted CSP introduce unintended, additional preference decisions. We first illustrate the application of constraint relationships in a case study from energy management along with deficiencies of existing work. We then show how to embed constraint relationships into the soft constraint frameworks of partial valuation structures and further c-semi rings by means of free constructions. We finally provide a prototypical implementation of heuristics for the well-known branch-and-bound algorithm along with an empirical evaluation.","PeriodicalId":142794,"journal":{"name":"2014 IEEE 26th International Conference on Tools with Artificial Intelligence","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115638064","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":"Towards Optimal Decision Guidance for Smart Grids with Integrated Renewable Generation and Water Desalination","authors":"Malak T. Al-Nory, A. Brodsky","doi":"10.1109/ICTAI.2014.83","DOIUrl":"https://doi.org/10.1109/ICTAI.2014.83","url":null,"abstract":"Renewable energy sources such as solar and wind are becoming increasingly prevalent for the energy mix of almost every country. However, this kind of energy is non-dispatch able, i.e., The supply can be interrupted and is usually not adjustable as in regular fossil-fueled power plants. The integration of these renewable energy sources in the Smart Grid (SG) has a large impact on the grid operations because of the variability and uncertainty of the supply. In addition to the increased criticality of the grid intermittence management, the SG must be able to manage this type of interruption of these energy sources effectively. Energy storage solutions such as batteries are not well developed yet and do not provide long term cost effective solutions. This paper provides a mathematical modeling approach to compensate for the intermittence of the supply from renewable energy sources for the SG. The idea is suitable in case of the integration of power generation with desalination production. The desalination plants can be used as a deferrable load to mitigate for the supply interruption. The optimal solution is based on a mathematical programming model to find the optimal scheduling of production and storage of desalinated water over the planning horizon such that the solution is not just feasible but also economically optimal. The real-world case study explains the advantages gained when applying the proposed approach.","PeriodicalId":142794,"journal":{"name":"2014 IEEE 26th International Conference on Tools with Artificial Intelligence","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116104474","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}
Weam M. Binjumah, Yi Sun, M. Hewitt, R. Adams, N. Davey, D. Gullick, S. Wilkinson, M. Cronin, G. Moss
{"title":"Feature Selection Modelling for Percutaneous Absorption across Synthetic Membranes","authors":"Weam M. Binjumah, Yi Sun, M. Hewitt, R. Adams, N. Davey, D. Gullick, S. Wilkinson, M. Cronin, G. Moss","doi":"10.1109/ICTAI.2014.155","DOIUrl":"https://doi.org/10.1109/ICTAI.2014.155","url":null,"abstract":"Predicting the rate of percutaneous absorption across mammalian and artificial membranes is a complex problem. In previous studies, prediction and accuracy are approached using different machine learning models. Results show that Gaussian processes provided the best result, based on a range of statistical measures. In general the ultimate aim of these machine learning experiments is to try to understand, analyze and predict the percutaneous absorption of drugs across human skin. One way to do this is to select the best set of chemical descriptors and the dataset of synthetic (Polydimethyl siloxane, PDMS) membranes, containing so many descriptors, is considered a suitable dataset to use in this study. Hence, one of the main purposes of the study is to use feature selection methods to select the molecular properties that exert the most important influence on percutaneous absorption across PDMS membranes, in the hope that this will better inform studies on human skin.","PeriodicalId":142794,"journal":{"name":"2014 IEEE 26th International Conference on Tools with Artificial Intelligence","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116182652","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":"Determination of Soil Damage by Fuzzy Analysis","authors":"Michal Grec, M. Horáček, V. Novák","doi":"10.1109/ICTAI.2014.86","DOIUrl":"https://doi.org/10.1109/ICTAI.2014.86","url":null,"abstract":"We analyse three soil horizons in each square kilometre of certain local area. The goal of the work is to determine the degree of damage to soil horizons by cluster analysis. From these analyses we constructed RGB maps that show areas with the same or similar damage of soil horizons in the whole area and we also tried to determine the degree of soil damage. We applied cluster analysis and fuzzy cluster analysis.","PeriodicalId":142794,"journal":{"name":"2014 IEEE 26th International Conference on Tools with Artificial Intelligence","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115528214","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":"An Ontology-Based Automatic Approach for Lithologic Correlation","authors":"L. Garcia, J. Carbonera, Mara Abel","doi":"10.1109/ICTAI.2014.29","DOIUrl":"https://doi.org/10.1109/ICTAI.2014.29","url":null,"abstract":"In this paper we present an automatic approach for the litho logic correlation task, which is a crucial task in the domain of Petroleum Geology. In our approach, we consider the litho logic correlation task as formally equivalent to the task of DNA sequence alignment, in the domain of Bioinformatics. This allows us to use well-known sequence alignment algorithms for dealing with this task. Moreover, our approach uses a domain ontology for representing the knowledge about the domain objects. This ensures an agreement regarding the formal vocabulary used for describing the geological objects, allowing us to deal with the data collected by different geologists in a homogeneous way. Finally, we also use clustering techniques for finding groups of geological objects that are sufficiently similar for being correlated by the sequence alignment algorithms. We discuss some results of the application of our approach to a real dataset.","PeriodicalId":142794,"journal":{"name":"2014 IEEE 26th International Conference on Tools with Artificial Intelligence","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123028049","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":"Diversification by Clauses Deletion Strategies in Portfolio Parallel SAT Solving","authors":"Long Guo, Saïd Jabbour, J. Lonlac, L. Sais","doi":"10.1109/ICTAI.2014.110","DOIUrl":"https://doi.org/10.1109/ICTAI.2014.110","url":null,"abstract":"Conflict based clause learning is known to be an important component in Modern SAT solving. Because of the exponential blow up of the size of learnt clauses database, maintaining a relevant and polynomially bounded set of learnt clauses is crucial for the efficiency of clause learning based SAT solvers. In this paper, we first compare several criteria for selecting the most relevant learnt clauses with a simple random selection strategy. We then propose new criteria allowing us to select relevant clauses w.r.t. A given search state. Then, we use such strategies as a means to diversify the search in a portfolio based parallel solver. An experimental evaluation comparing the classical Many SAT solver with the one augmented with multiple deletion strategies, shows the interest of such approach.","PeriodicalId":142794,"journal":{"name":"2014 IEEE 26th International Conference on Tools with Artificial Intelligence","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121740183","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}
David Genest, M. Legeay, S. Loiseau, Christophe Bechade
{"title":"A Graphical Language to Query Conceptual Graphs","authors":"David Genest, M. Legeay, S. Loiseau, Christophe Bechade","doi":"10.1109/ICTAI.2014.53","DOIUrl":"https://doi.org/10.1109/ICTAI.2014.53","url":null,"abstract":"This paper presents a general query language for conceptual graphs. First, we introduce kernel query graphs. A kernel query graph can be used to express an \"or\" between two sub-graphs, or an \"option\" on an optional sub-graph. Second, we propose a way to express two kinds of queries (ask and select) using kernel query graphs. Third, the answers of queries are computed by an operation based on graph homomorphism: the projection from a kernel query graph.","PeriodicalId":142794,"journal":{"name":"2014 IEEE 26th International Conference on Tools with Artificial Intelligence","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122891914","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}