THE DEFINING POWER OF STRATIFIED AND HIERARCHICAL LOGIC PROGRAMS

被引：9
|
作者：
JAGER, G [1 ]
STARK, RF [1 ]
机构：
[1] INST INFORMAT & ANGEW MATH,CH-3012 BERN,SWITZERLAND
来源：
JOURNAL OF LOGIC PROGRAMMING | 1993年 / 15卷 / 1-2期
关键词：
D O I：
10.1016/0743-1066(93)90013-7
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We investigate the defining power of stratified and hierarchical logic programs. As an example for the treatment of negative information in the context of these structured programs we also introduce a stratified and hierarchical closed-world assumption. Our analysis tries to relate the defining power of stratified and hierarchical programs (with and without an appropriate closed-world assumption) very precisely to notions and hierarchies in classical definability theory.
引用
收藏
页码：55 / 77
页数：23
相关论文
共 50 条
  • [1] THE EXPRESSIVE POWER OF STRATIFIED LOGIC PROGRAMS
    KOLAITIS, PG
    INFORMATION AND COMPUTATION, 1991, 90 (01) : 50 - 66
  • [2] The expressive power of stratified logic programs with value invention
    Cabibbo, L
    INFORMATION AND COMPUTATION, 1998, 147 (01) : 22 - 56
  • [3] On the power of stratified logic programs with value invention for expressing database transformations
    Cabibbo, L
    DATABASE THEORY - ICDT '95, 1995, 893 : 208 - 221
  • [4] Learning hierarchical probabilistic logic programs
    Arnaud Nguembang Fadja
    Fabrizio Riguzzi
    Evelina Lamma
    Machine Learning, 2021, 110 : 1637 - 1693
  • [5] Learning hierarchical probabilistic logic programs
    Fadja, Arnaud Nguembang
    Riguzzi, Fabrizio
    Lamma, Evelina
    MACHINE LEARNING, 2021, 110 (07) : 1637 - 1693
  • [6] Transformation rules for locally stratified constraint logic programs
    Fioravanti, F
    Pettorossi, A
    Proietti, M
    PROGRAM DEVELOPMENT IN COMPUTATIONAL LOGIC: A DECADE OF RESEARCH ADVANCES IN LOGIC-BASED PROGRAM DEVELOPMENT, 2004, 3049 : 291 - 339
  • [7] Complexity Results for Checking Equivalence of Stratified Logic Programs
    Eiter, Thomas
    Fink, Michael
    Tompits, Hans
    Woltran, Stefan
    20TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2007, : 330 - 335
  • [8] Computing prioritized circumscription via compilation into stratified logic programs
    Wakaki, T
    Satoh, K
    PROCEEDINGS ISAI/IFIS 1996 - MEXICO - USA COLLABORATION IN INTELLIGENT SYSTEMS TECHNOLOGIES, 1996, : 362 - 369
  • [9] On the existence of stable models of non-stratified logic programs
    Costantini, S
    THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2006, 6 (1-2) : 169 - 212
  • [10] ON THE EXPRESSIVE POWER OF ANNOTATED LOGIC PROGRAMS
    KIFER, M
    SUBRAHMANIAN, VS
    LOGIC PROGRAMMING : PROCEEDINGS OF THE NORTH AMERICAN CONFERENCE, 1989, VOL 1-2, 1989, : 1069 - 1089
12345