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

稳定模型语义的扩展与实现

Extending and Implementing the Stable Model Semantics

Patrik Simons

摘要:

提出了一种计算逻辑程序稳定模型语义的算法。它表明,可以扩展的语义和算法来处理新的和更具表现力的规则类型。重点放在使用有效的执行技术。特别是,实现安全地避免测试失败的每一个文字,使使用前瞻可行的前瞻性。此外,从搜索空间最小化的原则出发,给出了一个很好的启发式算法。由于缺乏竞争力的算法和实现的稳定模型的计算,该系统进行了比较,三个可满足性求解器。这表明,启发式可以通过打破关系来改进,但留下了如何打破关系的问题。它还表明,更有表现力的规则的稳定模型语义的语义明显优于命题逻辑时,一个问题有一个更紧凑的逻辑程序表示。合取范式表示永远不会比逻辑程序表示更紧凑。

英文摘要:

An algorithm for computing the stable model semantics of logic programs is developed. It is shown that one can extend the semantics and the algorithm to handle new and more expressive types of rules. Emphasis is placed on the use of efficient implementation techniques. In particular, an implementation of lookahead that safely avoids testing every literal for failure and that makes the use of lookahead feasible is presented. In addition, a good heuristic is derived from the principle that the search space should be minimized. Due to the lack of competitive algorithms and implementations for the computation of stable models, the system is compared with three satisfiability solvers. This shows that the heuristic can be improved by breaking ties, but leaves open the question of how to break them. It also demonstrates that the more expressive rules of the stable model semantics make the semantics clearly preferable over propositional logic when a problem has a more compact logic program representation. Conjunctive normal form representations are never more compact than logic program ones.

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

↑