模糊语言逻辑规划的高效查询应答

2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future Pub Date : 2012-03-15 DOI:10.1109/rivf.2012.6169836

V. Le

{"title":"模糊语言逻辑规划的高效查询应答","authors":"V. Le","doi":"10.1109/rivf.2012.6169836","DOIUrl":null,"url":null,"abstract":"In fuzzy linguistic logic programming, there are two approaches to compute answers to queries w.r.t. a logic program: (i) by bottom-up iterating the immediate consequence operator TP; or (ii) by using the procedural semantics. The former is not goal-oriented and exhaustive. The latter is goal-oriented, but may lead to an infinite loop and recomputes subgoals in rule bodies. This paper presents an efficient tabulation proof procedure, which can overcome these problems, for fuzzy linguistic logic programming, shows its termination, and proves its soundness.","PeriodicalId":115212,"journal":{"name":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Efficient Query Answering for Fuzzy Linguistic Logic Programming\",\"authors\":\"V. Le\",\"doi\":\"10.1109/rivf.2012.6169836\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In fuzzy linguistic logic programming, there are two approaches to compute answers to queries w.r.t. a logic program: (i) by bottom-up iterating the immediate consequence operator TP; or (ii) by using the procedural semantics. The former is not goal-oriented and exhaustive. The latter is goal-oriented, but may lead to an infinite loop and recomputes subgoals in rule bodies. This paper presents an efficient tabulation proof procedure, which can overcome these problems, for fuzzy linguistic logic programming, shows its termination, and proves its soundness.\",\"PeriodicalId\":115212,\"journal\":{\"name\":\"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-03-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/rivf.2012.6169836\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/rivf.2012.6169836","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

在模糊语言逻辑规划中，有两种方法来计算一个逻辑程序的查询的答案:(i)由下至上迭代直接推理算子TP;或者(ii)通过使用过程语义。前者不是目标导向的，也不是详尽的。后者是面向目标的，但可能导致无限循环并重新计算规则主体中的子目标。本文针对模糊语言逻辑规划问题，提出了一种有效的制表证明方法，并给出了该方法的终止性，证明了其正确性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Efficient Query Answering for Fuzzy Linguistic Logic Programming

In fuzzy linguistic logic programming, there are two approaches to compute answers to queries w.r.t. a logic program: (i) by bottom-up iterating the immediate consequence operator TP; or (ii) by using the procedural semantics. The former is not goal-oriented and exhaustive. The latter is goal-oriented, but may lead to an infinite loop and recomputes subgoals in rule bodies. This paper presents an efficient tabulation proof procedure, which can overcome these problems, for fuzzy linguistic logic programming, shows its termination, and proves its soundness.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future

自引率

0.00%

发文量