摘要翻译：
本文介绍了一种用于答案集编程(ASP)的扩展tableau演算。证明系统基于[Gebser&Schaub，ICLP2006]中定义的ASP表，并增加了扩展规则。我们从理论和实证两个方面研究了扩展ASP表的能力。本文研究了扩展ASP表与Tseitin为子句集定义的扩展分辨率证明系统之间的关系，并通过给出一族正规逻辑程序P_n的多项式长度证明，将扩展ASP表从ASP表中分离出来，其中ASP表对n具有指数长度极小证明。此外，扩展的ASP表暗示了对程序简化对ASP中证明长度的影响的有趣见解。与扩展的ASP表密切相关，我们实证研究了冗余规则对ASP求解效率的影响。出现在逻辑程序设计(TPLP)的理论与实践中。
---
英文标题：
《Extended ASP tableaux and rule redundancy in normal logic programs》
---
作者：
Matti J\"arvisalo and Emilia Oikarinen
---
最新提交年份：
2008
---
分类信息：

一级分类：Computer Science        计算机科学
二级分类：Artificial Intelligence        人工智能
分类描述：Covers all areas of AI except Vision, Robotics, Machine Learning, Multiagent Systems, and Computation and Language (Natural Language Processing), which have separate subject areas. In particular, includes Expert Systems, Theorem Proving (although this may overlap with Logic in Computer Science), Knowledge Representation, Planning, and Uncertainty in AI. Roughly includes material in ACM Subject Classes I.2.0, I.2.1, I.2.3, I.2.4, I.2.8, and I.2.11.
涵盖了人工智能的所有领域，除了视觉、机器人、机器学习、多智能体系统以及计算和语言（自然语言处理），这些领域有独立的学科领域。特别地，包括专家系统，定理证明（尽管这可能与计算机科学中的逻辑重叠），知识表示，规划，和人工智能中的不确定性。大致包括ACM学科类I.2.0、I.2.1、I.2.3、I.2.4、I.2.8和I.2.11中的材料。
--

---
英文摘要：
  We introduce an extended tableau calculus for answer set programming (ASP). The proof system is based on the ASP tableaux defined in [Gebser&Schaub, ICLP 2006], with an added extension rule. We investigate the power of Extended ASP Tableaux both theoretically and empirically. We study the relationship of Extended ASP Tableaux with the Extended Resolution proof system defined by Tseitin for sets of clauses, and separate Extended ASP Tableaux from ASP Tableaux by giving a polynomial-length proof for a family of normal logic programs P_n for which ASP Tableaux has exponential-length minimal proofs with respect to n. Additionally, Extended ASP Tableaux imply interesting insight into the effect of program simplification on the lengths of proofs in ASP. Closely related to Extended ASP Tableaux, we empirically investigate the effect of redundant rules on the efficiency of ASP solving.   To appear in Theory and Practice of Logic Programming (TPLP).
---
PDF链接：
https://arxiv.org/pdf/0809.3204