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 条
  • [21] On the problem of computing the well-founded semantics
    Lonc, Zbigniew
    Truszczynski, Miroslaw
    Theory and Practice of Logic Programming, 2001, 1 (05) : 591 - 609
  • [22] On the computation of the disjunctive well-founded semantics
    Johnson, CA
    JOURNAL OF AUTOMATED REASONING, 2001, 26 (04) : 333 - 356
  • [23] Forgetting under the Well-Founded Semantics
    Alferes, Jose Julio
    Knorr, Matthias
    Wang, Kewen
    LOGIC PROGRAMMING AND NONMONOTONIC REASONING (LPNMR 2013), 2013, 8148 : 36 - 41
  • [24] Loop checking and the well-founded semantics
    Lifschitz, V
    McCain, N
    Przymusinski, TC
    Stark, RF
    LOGIC PROGRAMMING AND NONMONOTONIC REASONING, 1995, 928 : 127 - 142
  • [25] Computing the well-founded semantics faster
    Berman, K.A.
    Schlipf, J.S.
    Franco, J.V.
    International Journal of Pressure Vessels and Piping, 1996, 65 (02)
  • [26] Well-founded semantics for Boolean grammars
    Kountouriotis, Vassilis
    Nomikos, Christos
    Rondogiannis, Panos
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2006, 4036 : 203 - 214
  • [27] On the computation of the disjunctive well-founded semantics
    Johnson, C.A.
    1600, Kluwer Academic Publishers (26):
  • [28] Well-founded semantics for hybrid rules
    Drabent, Wlodzimierz
    Maluszynski, Jan
    WEB REASONING AND RULE SYSTEMS, PROCEEDINGS, 2007, 4524 : 1 - +
  • [29] Well-founded semantics for Boolean grammars
    Kountouriotis, Vassilis
    Nomikos, Christos
    Rondogiannis, Panos
    INFORMATION AND COMPUTATION, 2009, 207 (09) : 945 - 967
  • [30] Indistinguishability Obfuscation from Well-Founded Assumptions
    Jain, Aayush
    Lin, Huijia
    Sahai, Amit
    STOC '21: PROCEEDINGS OF THE 53RD ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2021, : 60 - 73