{"title":"A New Semantics for Logic Programs Capturing and Extending the Stable Model Semantics","authors":"B. Benhamou, P. Siegel","doi":"10.1109/ICTAI.2012.167","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.167","url":null,"abstract":"Many research works had been done in order to define a semantics for logic programs. Most of these semantics are iterated fixed point semantics. The main idea is the canonical model approach which is a declarative semantics for logic programs that can be defined by selecting for each program one of its canonical models. The notion of canonical models of a logic program is what it is called the stable models. The stable models of a logic program are the minimal Her brand models of its \"reduct\" programs. The work that we describe in this paper is theoretical, we introduce a new semantics for logic programs that is different from the known fixed point semantics. In our approach, logic programs are expressed as CNF formulas (sets of clauses) of a propositional logic for which we define a notion of extension. We prove in this semantics, that each consistent CNF formula admits at least an extension and for each given stable model of a logic program there exists an extension of its corresponding CNF formula which logically entails it. On the other hand, we show that some of the extensions do not entail any stable model, in this case, we define a simple condition called a discrimination condition which allows to recognize such extensions. These extensions could be very important, but are not captured by the stable models semantics. Our approach, extends the stable model semantics in this sense. Following the new semantics, we give a full characterization of the stable models of a logic program by means of the extensions of its CNF encoding verifying the simple discrimination condition, and provide a procedure which can be used to compute such extensions from which we deduce the stable models and eventually the extra-stable models of the given logic program.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133400207","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 Argumentation Framework for Reasoning about Bounded Resources","authors":"P. Besnard, É. Grégoire, Badran Raddaoui","doi":"10.1109/ICTAI.2012.79","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.79","url":null,"abstract":"This paper is intended to lay down the basic foundations of logic-based argumentation for reasoning about bounded resources. First, a simple variant of Boolean logic is introduced, allowing us to reason about consuming resources. An adapted tableau method is presented as a means for automated reasoning in the logic. Then, the main concepts of logic-based argumentation are revisited in this framework.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133410463","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":"Directed Policy Search Using Relevance Vector Machines","authors":"Ioannis Rexakis, M. Lagoudakis","doi":"10.1109/ICTAI.2012.13","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.13","url":null,"abstract":"Several recent learning approaches based on approximate policy iteration suggest the use of classifiers for representing policies compactly. The space of possible policies, even under such structured representations, is huge and must be searched carefully to avoid computationally expensive policy simulations (rollouts). In our recent work, we proposed a method for directed exploration of policy space using support vector classifiers, whereby rollouts are directed to states around the boundaries between different action choices indicated by the separating hyper planes in the represented policies. While effective, this method suffers from the growing number of support vectors in the underlying classifiers as the number of training examples increases. In this paper, we propose an alternative method for directed policy search based on relevance vector machines. Relevance vector machines are used both for classification (to represent a policy) and regression (to approximate the corresponding relative action advantage function). Exploiting the internal structure of the regress or, we guide the probing of the state space only to critical areas corresponding to changes of action dominance in the underlying policy. This directed focus on critical parts of the state space iteratively leads to refinement and improvement of the underlying policy and delivers excellent control policies in only a few iterations, while the small number of relevance vectors yields significant computational time savings. We demonstrate the proposed approach and compare it with our previous method on standard reinforcement learning domains.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114799208","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":"Mining Fuzzy Association Rules from Heterogeneous Probabilistic Datasets","authors":"Bin Pei, Tingting Zhao, Suyun Zhao, Hong Chen","doi":"10.1109/ICTAI.2012.116","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.116","url":null,"abstract":"Association rule mining (ARM), as a useful method to discover relations between attributes of objects, has been widely studied. The previous methods focused on ARM either from a certain dataset with different type attributes, or from a probabilistic dataset with only Boolean attributes. However, little work on ARM from a probabilistic dataset with coexistence of different type attributes has been mentioned. Such dataset is named Heterogeneous Probabilistic Dataset (HPD), which is prevalent in the real-world applications. This paper develops a generic framework to discover association rules from a HPD. Considering the different type data in the dataset, we first convert a HPD to a probabilistic dataset with fuzzy sets by fuzzification. A novel Shannon-like Entropy is then introduced to measure the information of an item with coexistence of fuzzy uncertainty hidden in different type data and random uncertainty in the transformed dataset. Based on this Shannon-like Entropy, Support and Confidence degrees for such multi-uncertain dataset are defined. Finally, we design an Apriori-like algorithm to mine association rules from a HPD using the above measures. Experimental results show that the proposed algorithm for HPD is feasible and effective.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134538879","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 Collaborative Approach to Solve a Nurse Scheduling Problem","authors":"Juan Pablo Cares, M. Riff","doi":"10.1109/ICTAI.2012.54","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.54","url":null,"abstract":"In this paper we present a collaborative approach designed to solve a real world problem: the Nurse Scheduling Problem (NSP) at a Chilean hospital. Nurses represent the main shared resources in the hospital. In this paper, we attempt to find a fair/balanced schedule for them, considering a set of constraints and each nurse preferences concerning the different shifts. We propose a collaborative framework in order to manage two objectives: To maximize the nurses preferences and to minimize unfairness assignments. We use real-world instances of the problem for testing, the results show that our collaboration technique is a very effective one in terms of the CPU time and the quality of the solution found.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134620207","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":"Mel-frequency Cepstral Coefficients for Eye Movement Identification","authors":"Cuong V Nguyen, Vu C. Dinh, L. Ho","doi":"10.1109/ICTAI.2012.42","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.42","url":null,"abstract":"Human identification is an important task for various activities in society. In this paper, we consider the problem of human identification using eye movement information. This problem, which is usually called the eye movement identification problem, can be solved by training a multiclass classification model to predict a person's identity from his or her eye movements. In this work, we propose using Mel-frequency cepstral coefficients (MFCCs) to encode various features for the classification model. Our experiments show that using MFCCs to represent useful features such as eye position, eye difference, and eye velocity would result in a much better accuracy than using Fourier transform, cepstrum, or raw representations. We also compare various classification models for the task. From our experiments, linear-kernel SVMs achieve the best accuracy with 93.56% and 91.08% accuracy on the small and large datasets respectively. Besides, we conduct experiments to study how the movements of each eye contribute to the final classification accuracy.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"556 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116398769","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 Parallel Radial Basis Probabilistic Neural Network for Scalable Data Mining in Distributed Memory Machines","authors":"Y. Kokkinos, K. Margaritis","doi":"10.1109/ICTAI.2012.155","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.155","url":null,"abstract":"This work presents scalable algorithms for basic construction of parallel Radial Basis Probabilistic Neural Networks. The final goal is to build a neural network that can efficiently be implemented in distributed memory machines. Thus a fast simple parallel training scheme for RBPNNs is studied, that is based almost solely on Gaussian summations which can by their part be efficiently mapped on parallel as well as on pipeline distributed machines. The suggested training scheme is tested for accuracy and performance and can guarantee simplicity, parallelization and linear speed ups in common parallel implementations, namely neuron parallel and pipelining studied here.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122169120","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":"Adaptive Fuzzy Rule-Based Classification System Integrating Both Expert Knowledge and Data","authors":"W. Tang, K. Mao, L. Mak, G. Ng","doi":"10.1109/ICTAI.2012.114","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.114","url":null,"abstract":"This paper presents an adaptive fuzzy rule-based classification system using a new hybrid modeling method that integrates both expert knowledge and new knowledge learnt from data. Inspired by human learning, the membership functions of fuzzy rules are optimized based on a hybrid error function that combines errors caused by the class predefined by expert knowledge and nearby historical data. The weights of the two errors can be adjusted by a conservative parameter. Experimental results show that our method significantly reduces classification ambiguity in 9 datasets.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125875166","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":"Advanced Block Detection and Quantification of Fibrotic Areas in Microscopy Images of Obstructive Nephropathy","authors":"T. Goudas, Ilias Maglogiannis, A. Chatziioannou","doi":"10.1109/ICTAI.2012.130","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.130","url":null,"abstract":"Obstructive nephropathy is not a rare disease and experts need a tool, which will provide them fast and accurate reproducible results for disease assessment. In this work we deal with the analysis of biopsy images for the detection and quantification of obstructive nephropathy. The problem is analyzed on a 3-stage approach. Block based segmentation is applied on the images. Image characterization is achieved through the classification of the informative part of the image utilizing Random Forests classifiers. The second approach deals with characterization of each block separately. Each block was classified with the above classifier and the majority vote of the blocks characterized the whole image. Additionally, a scoring system, based on the characterization of the segmentation blocks, was developed in order to describe and quantify the pathology in an image.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122290007","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":"Latent Beta Topographic Mapping","authors":"Kirthevasan Kandasamy","doi":"10.1109/ICTAI.2012.27","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.27","url":null,"abstract":"This paper describes Latent Beta Topographic Mapping (LBTM), a generative probability model for non linear dimensionality reduction and density estimation. LBTM is based on Generative Topographic Mapping (GTM) and hence inherits its ability to map complex non linear manifolds. However, the GTM is limited in its ability to reliably estimate sophisticated densities on the manifold. This paper explores the possibilities of learning a probability distribution for the data on the lower dimensional latent space. Learning a distribution helps not only in density estimation but also in maintaining topographic structure. In addition, LBTM provides useful methods for sampling, inference and visualization of high dimensional data. Experimental results indicate that LBTM can reliably learn the structure and distribution of the data and is competitive with existing methods for dimensionality reduction and density estimation.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130378121","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}