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

Using ASP with recent extensions for causal explanations

INRIA Bretagne Atlantique(法国国家信息与自动化研究所布列塔尼大西洋分所);IRISA(法国雷恩信息系统与随机系统研究所)

Yves Moinard

英文摘要:

We examine the practicality for a user of using Answer Set Programming (ASP) for representing logical formalisms. We choose as an example a formalism aiming at capturing causal explanations from causal information. We provide an implementation, showing the naturalness and relative efficiency of this translation job. We are interested in the ease for writing an ASP program, in accordance with the claimed ``declarative'' aspect of ASP. Limitations of the earlier systems (poor data structure and difficulty in reusing pieces of programs) made that in practice, the ``declarative aspect'' was more theoretical than practical. We show how recent improvements in working ASP systems facilitate a lot the translation, even if a few improvements could still be useful.

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

↑