arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/9901012cs.LOcs.AI
收藏

逻辑程序设计中的极值问题与稳定模型计算

Extremal problems in logic programming and stable model computation

Pawel Cholewinski, Miroslaw Truszczynski

摘要:

本文研究如下问题:给定一类逻辑程序C,确定C程序的最大稳定模型数。我们建立了最大值的类的所有逻辑程序与最多n个条款,并为类的所有逻辑程序的大小最多n。我们还表征的方案,达到最大值。我们得到了类似的结果为类的所有析取逻辑程序与最多n个条款,每个长度最多m,和类的所有析取逻辑程序的大小最多n。我们在逻辑程序上的结果对于设计计算稳定模型的算法有直接的意义。几个这样的算法,在精神上类似的戴维斯-普特南程序,在本文中描述。我们的结果意味着,有一个算法,找到所有的稳定模型的程序与n个条款后,考虑搜索空间的大小为O(3^{n/3})的最坏情况。我们的研究结果也提供了一些见解的可表示性问题的家庭的集合作为家庭的稳定模型的逻辑程序。

英文摘要:

We study the following problem: given a class of logic programs C, determine the maximum number of stable models of a program from C. We establish the maximum for the class of all logic programs with at most n clauses, and for the class of all logic programs of size at most n. We also characterize the programs for which the maxima are attained. We obtain similar results for the class of all disjunctive logic programs with at most n clauses, each of length at most m, and for the class of all disjunctive logic programs of size at most n. Our results on logic programs have direct implication for the design of algorithms to compute stable models. Several such algorithms, similar in spirit to the Davis-Putnam procedure, are described in the paper. Our results imply that there is an algorithm that finds all stable models of a program with n clauses after considering the search space of size O(3^{n/3}) in the worst case. Our results also provide some insights into the question of representability of families of sets as families of stable models of logic programs.

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

↑