Logic programming with infinite sets

被引：3
|
作者：
Cenzer, D [1 ]
Remmel, JB
Marek, VW
机构：
[1] Univ Florida, Gainesville, FL 32611 USA
[2] Univ Calif San Diego, La Jolla, CA 92093 USA
[3] Univ Kentucky, Lexington, KY 40506 USA
来源：
ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE | 2005年 / 44卷 / 04期
基金：
美国国家科学基金会;
关键词：
nonmonotonic logic; logic programming;
D O I：
10.1007/s10472-005-7030-5
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Using the ideas from current investigations in Knowledge Representation we study the use of a class of logic programs for reasoning about infinite sets. Our programs reason about the codes for various infinite sets. Depending on the form of atoms allowed in the bodies of clauses we obtain a variety of completeness results for various classes of arithmetic sets of integers.
引用
收藏
页码：309 / 339
页数：31
相关论文
共 50 条
12345