arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1104.5133cs.PLcs.LO
收藏

模糊回答集规划约化为模糊逻辑中的模型发现

Reducing Fuzzy Answer Set Programming to Model Finding in Fuzzy Logics

Jeroen Janssen, Steven Schockaert, Dirk Vermeir, Martine De Cock

摘要:

近年来,回答集编程已经扩展到处理多值谓词。由此产生的形式主义允许建模的连续问题,优雅的ASP允许离散问题的建模,通过结合ASP与模糊逻辑的稳定模型语义。然而,与经典ASP的情况下,许多有效的求解器已被构造,迄今为止,没有有效的模糊答案集编程求解器。经典ASP的一种公知技术包括将ASP程序$P$转换为命题理论,该命题理论的模型精确地对应于$P$的答案集。在本文中,我们将展示如何将这一想法扩展到模糊ASP,铺平了道路,实现高效的模糊ASP求解器,可以利用现有的模糊逻辑推理。出现在逻辑编程理论与实践(TPLP)中。

英文摘要:

In recent years answer set programming has been extended to deal with multi-valued predicates. The resulting formalisms allows for the modeling of continuous problems as elegantly as ASP allows for the modeling of discrete problems, by combining the stable model semantics underlying ASP with fuzzy logics. However, contrary to the case of classical ASP where many efficient solvers have been constructed, to date there is no efficient fuzzy answer set programming solver. A well-known technique for classical ASP consists of translating an ASP program $P$ to a propositional theory whose models exactly correspond to the answer sets of $P$. In this paper, we show how this idea can be extended to fuzzy ASP, paving the way to implement efficient fuzzy ASP solvers that can take advantage of existing fuzzy logic reasoners. To appear in Theory and Practice of Logic Programming (TPLP).

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑