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 条
  • [1] Local closed world reasoning with description logics under the well-founded semantics
    Knorr, Matthias
    Alferes, Jose Julio
    Hitzler, Pascal
    ARTIFICIAL INTELLIGENCE, 2011, 175 (9-10) : 1528 - 1554
  • [2] A NONDETERMINISTIC WELL-FOUNDED SEMANTICS
    TORRES, A
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 1995, 14 (01) : 37 - 73
  • [3] On Signings and the Well-Founded Semantics
    Maher, Michael J. J.
    THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2022, 22 (01) : 115 - 127
  • [4] A tutorial on the well-founded semantics
    Van Gelder, A
    PROGRAMMING AND COMPUTER SOFTWARE, 1998, 24 (01) : 32 - 42
  • [5] Aggregation and well-founded semantics
    Osorio, M
    Jayaraman, B
    NON-MONOTONIC EXTENSIONS OF LOGIC PROGRAMMING, 1997, 1216 : 71 - 90
  • [6] Possibilistic Well-Founded Semantics
    Osorio, Mauricio
    Carlos Nieves, Juan
    MICAI 2009: ADVANCES IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2009, 5845 : 15 - +
  • [7] A Well-Founded Semantics with disjunction
    Alcântara, J
    Damásio, CV
    Pereira, LM
    LOGIC PROGRAMMING, PROCEEDINGS, 2005, 3668 : 341 - 355
  • [8] The well-founded semantics is a stratified fitting semantics
    Hitzler, P
    Wendt, M
    KI2002: ADVANCES IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2002, 2479 : 205 - 221
  • [9] EQUIVALENCE OF WELL-FOUNDED AND STABLE SEMANTICS
    GIRE, F
    JOURNAL OF LOGIC PROGRAMMING, 1994, 21 (02): : 95 - 111
  • [10] Well-founded semantics for defeasible logic
    Frederick Maier
    Donald Nute
    Synthese, 2010, 176 : 243 - 274