ADDING CLOSED WORLD ASSUMPTIONS TO WELL-FOUNDED SEMANTICS

被引:2
|
作者
PEREIRA, LM [1 ]
ALFERES, JJ [1 ]
APARICIO, JN [1 ]
机构
[1] UNIV NOVA LISBOA,DCS,P-2825 MONTE DE CAPARICA,PORTUGAL
关键词
D O I
10.1016/0304-3975(94)90201-1
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Given a program P we specify an enlargement of its well-founded model which gives meaning to the adding of closed world assumptions. We do so by proposing the desirable principles of a closed world assumption (CWA), and proceed to formally define and apply them to well-founded semantics (WFS), in order to obtain a WFS added with CWA, the O-semantics. After an introduction and motivating examples, there follow the presentation of the concepts required to formalize the model structure, the properties it enjoys, and the criteria and procedures which allow the precise characterization of the preferred unique maximal model that gives the intended meaning to the O-semantics of a program, the O-model. Some properties are also exhibited that permit a more expedite obtention of the models. Several detailed examples are introduced throughout to illustrate the concepts and their application. Comparison is made with other work, and in the conclusions the novelty of the approach is brought out.
引用
收藏
页码:49 / 68
页数:20
相关论文
共 50 条
  • [31] Indistinguishability Obfuscation from Well-Founded Assumptions
    Jain, Aayush
    Lin, Huijia
    Sahai, Amit
    COMMUNICATIONS OF THE ACM, 2024, 67 (03) : 97 - 105
  • [32] Constructive negation under the well-founded semantics
    Liu, JY
    Adams, L
    Chen, WD
    JOURNAL OF LOGIC PROGRAMMING, 1999, 38 (03): : 295 - 330
  • [33] Linear tabulated resolution for the well-founded semantics
    Shen, YD
    Yuan, LY
    You, JH
    Zhou, NF
    LOGIC PROGRAMMING AND NONMONOTONIC REASONING, 1999, 1730 : 192 - 205
  • [34] The well-founded semantics is the principle of inductive definition
    Denecker, M
    LOGICS IN ARTIFICIAL INTELLIGENCE, 1998, 1489 : 1 - 16
  • [35] Fuzzy unification and argumentation for well-founded semantics
    Schweimeier, R
    Schroeder, M
    SOFSEM 2004: THEORY AND PRACTICE OF COMPUTER SCIENCE, PROCEEDINGS, 2004, 2932 : 102 - 121
  • [36] THE WELL-FOUNDED SEMANTICS FOR GENERAL LOGIC PROGRAMS
    VANGELDER, A
    ROSS, KA
    SCHLIPF, JS
    JOURNAL OF THE ACM, 1991, 38 (03) : 620 - 650
  • [37] Contradiction removal within well-founded semantics
    Pereira, L.M.
    Alferes, J.J.
    Aparicio, J.N.
    Logic Programming and Non-monotonic Reasoning - Proceedings, 1991,
  • [38] SLT-Resolution for the Well-Founded Semantics
    Yi-Dong Shen
    Li-Yan Yuan
    Jia-Huai You
    Journal of Automated Reasoning, 2002, 28 : 53 - 97
  • [39] Constructive negation under the well-founded semantics
    Yuan-Ze Univ, Taiwan
    J Logic Program, 3 (295-330):
  • [40] 2 SIMPLE CHARACTERIZATIONS OF WELL-FOUNDED SEMANTICS
    PRZYMUSINSKI, TC
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 629 : 449 - 462