SEDatalog: A set extension of Datalog

被引：0

作者：

Zhou, Q ^{[1
]}

Long, LG ^{[1
]}

机构：

[1] Zhongshan Univ, Software Inst, Guangzhou 510275, Guangdong, Peoples R China

来源：

INTELLIGENT INFORMATION PROCESSING II | 2005年 / 163卷

关键词：

the order of a set; the order of predicate; n-th order set;

D O I：

10.1007/0-387-23152-8_49

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

In this paper we propose an extension, SEDatalog, of Datalog so that sets can be naturally constructed in logic programming. In SEDatalog, sets can be defined by statements so it has a strong capability in creating sets. Three deductive rules are also introduced in this paper, which make SEDatalog strong in deductions and programming even when sets are involved in deductions. The syntactical description and the semantical interpretation of SEDatalog are comprehensively discussed in detail. The soundness and completeness theorem of SEDatalog is proved, which provides a solid foundation of SEDatalog.

引用

页码：383 / 388

页数：6