Deterministic and non-deterministic stable model semantics for unbound DATALOG queries

被引：0
|
作者：
Sacca, D
机构：
来源：
DATABASE THEORY - ICDT '95 | 1995年 / 893卷
关键词：
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
There are presently many proposals to extend the notion of stable model to the domain of partial interpretations. This paper is concerned with the analysis of the expressive powers of such types of stable model under various versions of deterministic semantics for unbound (i.e., without ground terms) queries on DATALOG programs with negation. Various versions of non-deterministic semantics are also proposed and their expressive powers are fully characterized as well.
引用
收藏
页码：353 / 367
页数：15
相关论文
共 50 条
  • [41] A Relational Model of a Parallel and Non-deterministic λ-Calculus
    Bucciarelli, Antonio
    Ehrhard, Thomas
    Manzonetto, Giulio
    LOGICAL FOUNDATIONS OF COMPUTER SCIENCE, 2009, 5407 : 107 - 121
  • [42] Research of a multithreaded non-deterministic system model
    Pashchenko, Dmitry, V
    Trokoz, Dmitry A.
    Martyshkin, Alexey, I
    Pashchenko, Tatyana Yu
    Butaev, Mikhail M.
    Babich, Mikhail Yu
    NEXO REVISTA CIENTIFICA, 2021, 34 (01): : 193 - 204
  • [43] Deterministic vs non-deterministic graph property testing
    Lior Gishboliner
    Asaf Shapira
    Israel Journal of Mathematics, 2014, 204 : 397 - 416
  • [44] Detecting Assumptions on Deterministic Implementations of Non-deterministic Specifications
    Shi, August
    Gyori, Alex
    Legunsen, Owolabi
    Marinov, Darko
    2016 9TH IEEE INTERNATIONAL CONFERENCE ON SOFTWARE TESTING, VERIFICATION AND VALIDATION (ICST), 2016, : 80 - 90
  • [45] A value-propagating transformation technique for Datalog programs based on non-deterministic constructs
    Potikas, Petros
    Rondogiannis, Panos
    Gergatsoulis, Manolis
    FUNDAMENTA INFORMATICAE, 2006, 72 (04) : 485 - 527
  • [46] Deterministic and non-deterministic switching in chains of magnetic hysterons
    Tanasa, R.
    Stancu, A.
    JOURNAL OF PHYSICS-CONDENSED MATTER, 2011, 23 (42)
  • [47] Deterministic vs non-deterministic graph property testing
    Gishboliner, Lior
    Shapira, Asaf
    ISRAEL JOURNAL OF MATHEMATICS, 2014, 204 (01) : 397 - 416
  • [48] Efficient deterministic and non-deterministic pseudorandom number generation
    Li, Jie
    Zheng, Jianliang
    Whitlock, Paula
    MATHEMATICS AND COMPUTERS IN SIMULATION, 2018, 143 : 114 - 124
  • [49] There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations
    Nystrom, SO
    INFORMATION PROCESSING LETTERS, 1996, 60 (06) : 289 - 293
  • [50] There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations
    Computer Science Department, Uppsala University, Box 311, S-751 05 Uppsala, Sweden
    Inf. Process. Lett., 6 (289-293):
12345