EXTENSION OF DEDUCTIVE QUERY LANGUAGES USING CONSTRUCTIONS WITH A RESTRICTED UNIVERSAL QUANTIFIER

被引:0
|
作者
ZADOROZHNYI, VI [1 ]
机构
[1] RUSSIAN ACAD SCI,INST PROBLEMS INFORMAT,MOSCOW 117900,RUSSIA
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
The possibility of including constructions with a restricted universal quantifier into pure Datalog is studied. Model-theoretical and evaluation (based on fixed point iteration) semantics are defined for the Datalog(For All) language obtained. Problems of expressiveness and optimization of magic sets for Datalog(For All) are discussed.
引用
收藏
页码:62 / 70
页数:9
相关论文
共 48 条