H. A. Garcia-Baleon, V. Aquino, O. Starostenko, J. Ramírez-Cruz
In this paper we present a bimodal biometric system for cryptographic key generation that works with speech and electrocardiogram (ECG) signals using wavelet transforms. This work is based on the uniqueness and quasi-stationary behavior of ECG and speech signals with respect to an individual. The architecture of the proposed system considers three security factors, namely, user password, biometric samples, and a token. The stages that comprise the architecture are textit{one time enrollment} and textit{key derivation}. The system architecture is able to verify the identity of individuals off-line avoiding the use of a centralized database for storing the biometric information. The system also implements an error-correction layer using the Hadamard code. The performance of the system is assessed using ECG signals from the MIT-BIH database and speech signals from a speech database created for testing purposes. Simulation results report a false acceptance rate (FAR) of 1.27% and a false rejection rate (FRR) of 10.62% for the system. The random cryptographic key released by the system may be used in several encryption algorithms.
本文提出了一种利用小波变换处理语音和心电图信号的双峰生物识别密码密钥生成系统。这项工作是基于唯一性和准平稳行为的心电图和语音信号相对于个人。该系统的架构考虑了三个安全因素，即用户密码、生物特征样本和令牌。组成体系结构的阶段是textit{一次性登记}和textit{密钥派生}。该系统架构能够离线验证个人身份，避免使用中央数据库存储生物特征信息。该系统还使用Hadamard码实现了纠错层。系统的性能评估使用来自MIT-BIH数据库的心电信号和来自为测试目的创建的语音数据库的语音信号。仿真结果报告的错误接受率(FAR)为1.27% and a false rejection rate (FRR) of 10.62% for the system. The random cryptographic key released by the system may be used in several encryption algorithms.
{"title":"Bimodal Biometric System for Cryptographic Key Generation Using Wavelet Transforms","authors":"H. A. Garcia-Baleon, V. Aquino, O. Starostenko, J. Ramírez-Cruz","doi":"10.1109/ENC.2009.25","DOIUrl":"https://doi.org/10.1109/ENC.2009.25","url":null,"abstract":"In this paper we present a bimodal biometric system for cryptographic key generation that works with speech and electrocardiogram (ECG) signals using wavelet transforms. This work is based on the uniqueness and quasi-stationary behavior of ECG and speech signals with respect to an individual. The architecture of the proposed system considers three security factors, namely, user password, biometric samples, and a token. The stages that comprise the architecture are textit{one time enrollment} and textit{key derivation}. The system architecture is able to verify the identity of individuals off-line avoiding the use of a centralized database for storing the biometric information. The system also implements an error-correction layer using the Hadamard code. The performance of the system is assessed using ECG signals from the MIT-BIH database and speech signals from a speech database created for testing purposes. Simulation results report a false acceptance rate (FAR) of 1.27% and a false rejection rate (FRR) of 10.62% for the system. The random cryptographic key released by the system may be used in several encryption algorithms.","PeriodicalId":273670,"journal":{"name":"2009 Mexican International Conference on Computer Science","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114274236","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}
Angélica de Antonio Jiménez, Jaime Ramírez Rodríguez, Zayra Madrigal Alfaro
The integration of interaction and simulation in e-learning systems represents a milestone in educational research and supports the student’s learning process in innumerable ways. Nevertheless, current standards do not provide appropriate mechanisms to treat simulations as learning objects, which makes their integration into e-learning systems a hard task. This work proposes an architecture as extension to SCORM which includes a Tutoring Module for Simulations (TMS). The main objective consists in providing mechanisms to track and “observe” the student’s actions while interacting with a simulation, thus enabling the TMS to take decisions or intervene when necessary, and/or to modify the simulation course.
{"title":"SCORM Compliant-Architecture for Including Simulations in E-learning Systems","authors":"Angélica de Antonio Jiménez, Jaime Ramírez Rodríguez, Zayra Madrigal Alfaro","doi":"10.1109/ENC.2009.48","DOIUrl":"https://doi.org/10.1109/ENC.2009.48","url":null,"abstract":"The integration of interaction and simulation in e-learning systems represents a milestone in educational research and supports the student’s learning process in innumerable ways. Nevertheless, current standards do not provide appropriate mechanisms to treat simulations as learning objects, which makes their integration into e-learning systems a hard task. This work proposes an architecture as extension to SCORM which includes a Tutoring Module for Simulations (TMS). The main objective consists in providing mechanisms to track and “observe” the student’s actions while interacting with a simulation, thus enabling the TMS to take decisions or intervene when necessary, and/or to modify the simulation course.","PeriodicalId":273670,"journal":{"name":"2009 Mexican International Conference on Computer Science","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114481540","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}
A. Chávez-Aragón, J. Ramírez-Cruz, O. F. Reyes-Galaviz, Huberto Ayanegui-Santiago, Edgar Alberto Portilla-Flores
Name disambiguation is a focal point on realworld information integration, analysis, and data mining. This problem, also known as the classical name authority control problem, consists in "same authors with different spellings" or "different authors with the same spelling". The problem is augmented in large data repositories where information changes and grows over time (e.g., DBLP, CiteSeer). In particular, we are mainly interested in DBLP because we use this database to discover the publishing movement among Mexican researchers. In this paper, we propose an algorithm that solves the name authority control problem. Our approach aims to improve the identity author tracking by using semantic information about authors, even thought they use different name varieties to sign their research work over time.
{"title":"An Algorithm to Tackle the Name Authority Control Problem Using Semantic Information","authors":"A. Chávez-Aragón, J. Ramírez-Cruz, O. F. Reyes-Galaviz, Huberto Ayanegui-Santiago, Edgar Alberto Portilla-Flores","doi":"10.1109/ENC.2009.38","DOIUrl":"https://doi.org/10.1109/ENC.2009.38","url":null,"abstract":"Name disambiguation is a focal point on realworld information integration, analysis, and data mining. This problem, also known as the classical name authority control problem, consists in \"same authors with different spellings\" or \"different authors with the same spelling\". The problem is augmented in large data repositories where information changes and grows over time (e.g., DBLP, CiteSeer). In particular, we are mainly interested in DBLP because we use this database to discover the publishing movement among Mexican researchers. In this paper, we propose an algorithm that solves the name authority control problem. Our approach aims to improve the identity author tracking by using semantic information about authors, even thought they use different name varieties to sign their research work over time.","PeriodicalId":273670,"journal":{"name":"2009 Mexican International Conference on Computer Science","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122983413","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}
Abraham Sánchez, Xochitl Hernandez, O. Torres, Alfredo Toriz P.
Autonomous mobile robots need the capability to explore and navigate in dynamic or unknown environments in order to be useful in a wide range of industrial applications. In the past two decades, a number of different approaches have been proposed to develop flexible and efficient navigation systems.Despite the potentials of the approaches and algorithms developed by the robotics community, industrial applications of autonomous mobile robots are not yet widespread. This paper reflects the efforts made by our work group to have useful navigation systems in industrial applications.
{"title":"Mobile Robots Navigation in Industrial Environments","authors":"Abraham Sánchez, Xochitl Hernandez, O. Torres, Alfredo Toriz P.","doi":"10.1109/ENC.2009.18","DOIUrl":"https://doi.org/10.1109/ENC.2009.18","url":null,"abstract":"Autonomous mobile robots need the capability to explore and navigate in dynamic or unknown environments in order to be useful in a wide range of industrial applications. In the past two decades, a number of different approaches have been proposed to develop flexible and efficient navigation systems.Despite the potentials of the approaches and algorithms developed by the robotics community, industrial applications of autonomous mobile robots are not yet widespread. This paper reflects the efforts made by our work group to have useful navigation systems in industrial applications.","PeriodicalId":273670,"journal":{"name":"2009 Mexican International Conference on Computer Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129658138","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}
As one of the first theoretical programming languages for exact real number computation, Real PCF showed to be impractical due to the parallel construct needed for even basic operations. Later, Marcial et al. [12], [11] proposed a variant of Real PCF avoiding the parallelism by introducing a non-deterministic constructor into the language. This language is called LRT. In this paper we present an implementation of a calculator for exact real number computation based on LRT and compare its efficacy with an application of the standard use of real numbers in an imperative programming language. Finally, our implementation is compared with a standard implementation of exact real number computation based on the sign digit representation.
{"title":"Comparing Implementations of a Calculator for Exact Real Number Computation","authors":"J. R. Marcial-Romero, J. A. H. Servín, H. Venegas","doi":"10.1109/ENC.2009.16","DOIUrl":"https://doi.org/10.1109/ENC.2009.16","url":null,"abstract":"As one of the first theoretical programming languages for exact real number computation, Real PCF showed to be impractical due to the parallel construct needed for even basic operations. Later, Marcial et al. [12], [11] proposed a variant of Real PCF avoiding the parallelism by introducing a non-deterministic constructor into the language. This language is called LRT. In this paper we present an implementation of a calculator for exact real number computation based on LRT and compare its efficacy with an application of the standard use of real numbers in an imperative programming language. Finally, our implementation is compared with a standard implementation of exact real number computation based on the sign digit representation.","PeriodicalId":273670,"journal":{"name":"2009 Mexican International Conference on Computer Science","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127244405","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}
This work presents a real-case scenario with mobile clients. The main goal of this work is to evaluate the performance of the two most popular third generation technologies (EVDO and HSDPA). The tests were performed at three speeds (60km/h, 80km/h and 100km/h). The tests were conducted in the most careful effort to have the most accurate results. The performance evaluation was based on the throughput (Uplink/Downlink) of each technology. In the results we can see that: HSDPA technology doubles the downlink speeds obtained by EVDO Rev. A. Also with EVDO the loss-rate between 60 km/h to 80km/h was 6.46% and increases to 60.17% at 100km/h. The HSDPA loss-rate results were: 14.85% from 60km/h to 80km/h and 68.64% from 60km/h to 100km/h. Based on the results obtained; we could say that the most suitable technology for symmetric applications in mobile environments is EVDO Rev. A, as the same way we could say that HSDA, will be the most suitable technology for asymmetric requirements in mobile environments. This work provides very helpful information to the potential users to know what technology fits their requirements. Also this information can be useful to the carriers to improve its network and to know what kind of services can provide/offer.
{"title":"Performance Analysis between HSDPA and EVDO with Mobile Clients","authors":"J. A. Esquerra, J. A. P. Díaz","doi":"10.1109/ENC.2009.41","DOIUrl":"https://doi.org/10.1109/ENC.2009.41","url":null,"abstract":"This work presents a real-case scenario with mobile clients. The main goal of this work is to evaluate the performance of the two most popular third generation technologies (EVDO and HSDPA). The tests were performed at three speeds (60km/h, 80km/h and 100km/h). The tests were conducted in the most careful effort to have the most accurate results. The performance evaluation was based on the throughput (Uplink/Downlink) of each technology. In the results we can see that: HSDPA technology doubles the downlink speeds obtained by EVDO Rev. A. Also with EVDO the loss-rate between 60 km/h to 80km/h was 6.46% and increases to 60.17% at 100km/h. The HSDPA loss-rate results were: 14.85% from 60km/h to 80km/h and 68.64% from 60km/h to 100km/h. Based on the results obtained; we could say that the most suitable technology for symmetric applications in mobile environments is EVDO Rev. A, as the same way we could say that HSDA, will be the most suitable technology for asymmetric requirements in mobile environments. This work provides very helpful information to the potential users to know what technology fits their requirements. Also this information can be useful to the carriers to improve its network and to know what kind of services can provide/offer.","PeriodicalId":273670,"journal":{"name":"2009 Mexican International Conference on Computer Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124325770","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}
Existing memory-less greedy-face-greedy (GFG) routing algorithm [1] can guarantee the delivery in wireless ad hoc networks modeled by a connected unit disk graph. The FACE mode in GFG routing is a recovery mode used when no neighbor closer to destination exists. Face mode requires extracting a planar sub graph out of the unit disk graph. In this paper, we propose to apply partial Delaunay triangulation (PDT) instead of Gabriel graph (GG) used in the original GFG routing. PDT is locally defined without any message exchange in addition to those needed to learn locations of neighbors. This appears to be the densest known such message free planar graph. PDT can be used instead of GG for storing data in wireless sensor networks, where each datum is stored in the face of PDT containing hashed location of datum. Simulation results show the GFG routing has better performance on a PDT than on a GG, since PDT is denser than GG. Applying dominating set based routing or a shortcut scheme can further enhance the PDT-based routing performance.
{"title":"Partial Delaunay Triangulations Based Data-Centric Storage and Routing with Guaranteed Delivery in Wireless Ad Hoc and Sensor Networks","authors":"Yanli Deng, I. Stojmenovic","doi":"10.1109/ENC.2009.15","DOIUrl":"https://doi.org/10.1109/ENC.2009.15","url":null,"abstract":"Existing memory-less greedy-face-greedy (GFG) routing algorithm [1] can guarantee the delivery in wireless ad hoc networks modeled by a connected unit disk graph. The FACE mode in GFG routing is a recovery mode used when no neighbor closer to destination exists. Face mode requires extracting a planar sub graph out of the unit disk graph. In this paper, we propose to apply partial Delaunay triangulation (PDT) instead of Gabriel graph (GG) used in the original GFG routing. PDT is locally defined without any message exchange in addition to those needed to learn locations of neighbors. This appears to be the densest known such message free planar graph. PDT can be used instead of GG for storing data in wireless sensor networks, where each datum is stored in the face of PDT containing hashed location of datum. Simulation results show the GFG routing has better performance on a PDT than on a GG, since PDT is denser than GG. Applying dominating set based routing or a shortcut scheme can further enhance the PDT-based routing performance.","PeriodicalId":273670,"journal":{"name":"2009 Mexican International Conference on Computer Science","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127406298","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}
J. G. Ramos, Ricardo A. Solís, Héctor Oceguera, Josep Silva
The lowercase semantic web consists of web pages enriched with semantic special tags which are called microformats, and it is considered a pragmatic path to the Semantic Web. In this work, we present a practical approach for modeling (microformat based) semantic relations between web pages by means of classical graph like data structures, such as semantic networks. In order to provide categorization into the semantic network we implement the special set of entrance points to the semantic network, which are so-called, semantic indexes. Then we present an agent software approach to retrieve semantically related information between web pages, we describe the main modules and data structures of the process and finally we present snapshots of the tool.
{"title":"A Practical Approach to Modeling and Extracting Information from Semantic Web Based on Microformats","authors":"J. G. Ramos, Ricardo A. Solís, Héctor Oceguera, Josep Silva","doi":"10.1109/ENC.2009.40","DOIUrl":"https://doi.org/10.1109/ENC.2009.40","url":null,"abstract":"The lowercase semantic web consists of web pages enriched with semantic special tags which are called microformats, and it is considered a pragmatic path to the Semantic Web. In this work, we present a practical approach for modeling (microformat based) semantic relations between web pages by means of classical graph like data structures, such as semantic networks. In order to provide categorization into the semantic network we implement the special set of entrance points to the semantic network, which are so-called, semantic indexes. Then we present an agent software approach to retrieve semantically related information between web pages, we describe the main modules and data structures of the process and finally we present snapshots of the tool.","PeriodicalId":273670,"journal":{"name":"2009 Mexican International Conference on Computer Science","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125468371","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}
P. Bucciol, J. Zechinelli-Martini, Genoveva Vargas-Solar
This paper addresses the real-time transmission optimization of loss tolerant information streams over Vehicular Ad Hoc Networks. The proposed FEC and Interleaving Real Time Optimization (FIRO) technique dynamically adapts the two well-known error resilience techniques to the actual channel conditions, according to the stream constraints in terms of maximum allowed packet loss rate and tolerated delay. To increase the quality of the communication, FIRO implements a dynamic feedback mechanism based on periodic RTCP Receiver Reports. Frequency of reports is dynamically adapted based on the accuracy of the estimates. The FEC and Interleaving parameters are updated based on both short- and long-term channel estimates. To evaluate the performance of FIRO in a realistic environment, in this paper the proposed technique is applied to real time vehicle-to-vehicle video streaming. However, FIRO can also be implemented in other scenarios where a loss tolerant information flow is streamed over a lossy channel with real time constraints. Results show that FIRO consistently improves the performance of the received video stream at both network and application layers, thanks to the joint effect of FEC, Interleaving, dynamic parameter update and dynamic update of the inter-arrival frequency of the receiver reports. As a side benefit of the packet-level design, FIRO can be implemented on Off-The-Shelf IEEE 802.11 devices.
研究了车载Ad Hoc网络中容错信息流的实时传输优化问题。本文提出的FEC和交错实时优化(Interleaving Real Time Optimization, FIRO)技术根据最大允许丢包率和可容忍延迟的流约束，将这两种著名的错误恢复技术动态地适应于实际信道条件。为了提高通信质量，FIRO实现了基于周期性RTCP接收方报告的动态反馈机制。报告的频率根据估计的准确性动态调整。FEC和交错参数根据短期和长期信道估计进行更新。为了评估FIRO在现实环境中的性能，本文将该技术应用于实时车对车视频流。然而，FIRO也可以在其他场景中实现，在这些场景中，容错信息流在具有实时限制的有损通道上进行流式传输。结果表明，由于FEC、交错、动态参数更新和接收端报告间到达频率的动态更新的共同作用，FIRO在网络层和应用层都能持续提高接收视频流的性能。作为包级设计的附带好处，FIRO可以在现成的IEEE 802.11设备上实现。
{"title":"Optimized Transmission of Loss Tolerant Information Streams for Real-Time Vehicle-to-Vehicle Communications","authors":"P. Bucciol, J. Zechinelli-Martini, Genoveva Vargas-Solar","doi":"10.1109/ENC.2009.26","DOIUrl":"https://doi.org/10.1109/ENC.2009.26","url":null,"abstract":"This paper addresses the real-time transmission optimization of loss tolerant information streams over Vehicular Ad Hoc Networks. The proposed FEC and Interleaving Real Time Optimization (FIRO) technique dynamically adapts the two well-known error resilience techniques to the actual channel conditions, according to the stream constraints in terms of maximum allowed packet loss rate and tolerated delay. To increase the quality of the communication, FIRO implements a dynamic feedback mechanism based on periodic RTCP Receiver Reports. Frequency of reports is dynamically adapted based on the accuracy of the estimates. The FEC and Interleaving parameters are updated based on both short- and long-term channel estimates. To evaluate the performance of FIRO in a realistic environment, in this paper the proposed technique is applied to real time vehicle-to-vehicle video streaming. However, FIRO can also be implemented in other scenarios where a loss tolerant information flow is streamed over a lossy channel with real time constraints. Results show that FIRO consistently improves the performance of the received video stream at both network and application layers, thanks to the joint effect of FEC, Interleaving, dynamic parameter update and dynamic update of the inter-arrival frequency of the receiver reports. As a side benefit of the packet-level design, FIRO can be implemented on Off-The-Shelf IEEE 802.11 devices.","PeriodicalId":273670,"journal":{"name":"2009 Mexican International Conference on Computer Science","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122213218","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}
In this paper, we introduce a recursive construction of a possibilistic logic programming semantics that we call Possibilistic Stratified Minimal Model Semantics. We show that this semantics has some interesting properties such as it is always defined and satisfies relevance. One of the main implications of satisfying relevance by this semantics is that it will allow performing top-down queries from a possibilistic knowledge base.
{"title":"Possibilistic Stratified Minimal Model Semantics","authors":"J. Nieves, Mauricio Osorio","doi":"10.1109/ENC.2009.14","DOIUrl":"https://doi.org/10.1109/ENC.2009.14","url":null,"abstract":"In this paper, we introduce a recursive construction of a possibilistic logic programming semantics that we call Possibilistic Stratified Minimal Model Semantics. We show that this semantics has some interesting properties such as it is always defined and satisfies relevance. One of the main implications of satisfying relevance by this semantics is that it will allow performing top-down queries from a possibilistic knowledge base.","PeriodicalId":273670,"journal":{"name":"2009 Mexican International Conference on Computer Science","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132122735","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：