| 带模理论的回答集程序设计 |
| |
| 引用本文： | 王以松,张明义.带模理论的回答集程序设计[J].贵州大学学报(自然科学版),2013(5):81-89,94. |
| |
| 作者姓名： | 王以松 张明义 |
| |
| 作者单位： | [1]贵州大学计算机科学与技术学院,贵州贵阳550025 [2]贵州科学院,贵州贵阳550025 |
| |
| 基金项目： | 贵州省优秀科技教育人才省长基金（（2012）62） |
| |
| 摘 要： | 基于回答集语义的逻辑程序（ASP）是一种描述性问题求解的典范，目前人们提出了各种ASP的扩张。本文提出带背景理论的回答集程序设计框架，它不仅是正规逻辑程序的一般化，对带聚合函数的ASP而言，也与SPT—PDB的回答集语义一致。经证明，当背景理论是命题逻辑时，该框架与Shen和You提出的方法一致。
|
| 关 键 词： | 逻辑程序设计 回答集 SMT 聚合函数 |
Answer Set Programming with Modulo Theories |
| |
| WANG Yi-song,ZHANG Ming-yi.Answer Set Programming with Modulo Theories[J].Journal of Guizhou University(Natural Science),2013(5):81-89,94. |
| |
| Authors: | WANG Yi-song ZHANG Ming-yi |
| |
| Institution: | 1. School of Computer Science ＆ Technology, Guizhou University, Guiyang 550025, China; 2. Guizhou Academy of Sciences, Guiyang 550025, China) |
| |
| Abstract: | Logic programming based on answer set semantics, named answer set programming, is prominent declarative problem solving paradigm. Various extensions of normal logic programs have been recently proposed. In the paper, a framework of answer set programming with background theories was proposed, for which an answer set semantics was presented. It is shown that the formalism （under the given semantics） is a generalization of normal logic programs under answer set semantics, and it can capture the SPT - PDB answer set semantics of logic programs with aggregate functions. It is also proved that the formalism coincides with the one defined by Shen and You in default manner whenever the background theory is propositional logic. |
| |
| Keywords: | logic programs answer sets Satisfiability Modulo Theories aggregate functions |
| 本文献已被 维普 等数据库收录！ |
