{"title":"可能性分层最小模型语义","authors":"J. Nieves, Mauricio Osorio","doi":"10.1109/ENC.2009.14","DOIUrl":null,"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.0000,"publicationDate":"2009-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Possibilistic Stratified Minimal Model Semantics\",\"authors\":\"J. Nieves, Mauricio Osorio\",\"doi\":\"10.1109/ENC.2009.14\",\"DOIUrl\":null,\"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.0000,\"publicationDate\":\"2009-09-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Mexican International Conference on Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ENC.2009.14\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Mexican International Conference on Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ENC.2009.14","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","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.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
