BriefGPT.xyz
Dec, 2016
通过动态规划计算答案集数量
Counting Answer Sets via Dynamic Programming
HTML
PDF
Johannes Fichte, Markus Hecher, Michael Morak, Stefan Woltran
TL;DR
该论文提出一种基于动态规划的ASP(#ASP)算法，以解决基于原子命题公式的可满足性问题(#SAT)，该算法利用底层ASP程序的结构，实验结果表明该算法在与现有求解器的比较中很有前途。
Abstract
While the solution counting problem for
propositional satisfiability
(#SAT) has received renewed attention in recent years, this research trend has not affected other AI solving paradigms like
answer set programming
→