Reasoning with infinite stable models

作     者：Bonatti, PA 

作者机构：Univ Naples Federico II Dipartimento Sci Fisiche I-80126 Naples Italy 

出 版 物：《ARTIFICIAL INTELLIGENCE》 (人工智能)

年 卷 期：2004年第156卷第1期

页      面：75-111页

核心收录：

学科分类：08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：finitary programs answer set programming first-order nonmonotonic reasoning infinite domains logic programming stable model semantics 

摘      要：This paper illustrates extensively the theoretical properties, the implementation issues, and the programming style underlying finitary programs. They are a class of normal logic programs whose consequences under the stable model semantics can be effectively computed, despite the fact that finitary programs admit function symbols (hence infinite domains) and recursion. From a theoretical point of view, finitary programs are interesting because they enjoy properties that are extremely unusual for a nonmonotonic formalism, such as compactness. From the application point of view, the theory of finitary programs shows how the existing technology for answer set programming can be extended from problem solving below the second level of the polynomial hierarchy to all semidecidable problems. Moreover, finitary programs allow a more natural encoding of recursive data structures and may increase the performance of credulous reasoners. (C) 2004 Elsevier B.V. All rights reserved.