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 条
  • [41] SLT-resolution for the well-founded semantics
    Shen, YD
    Yuan, LY
    You, JH
    JOURNAL OF AUTOMATED REASONING, 2002, 28 (01) : 53 - 97
  • [42] A well-founded, scientifically well-founded Basic Education
    Beratung, Technische
    ELEKTROTECHNIK UND INFORMATIONSTECHNIK, 2009, 126 (10):
  • [43] XSB: A system for efficiently computing well-founded semantics
    Rao, P
    Sagonas, K
    Swift, T
    Warren, DS
    Freire, J
    LOGIC PROGRAMMING AND NONMONOTONIC REASONING, 1997, 1265 : 430 - 440
  • [44] Epistemic foundation of the well-founded semantics over bilattices
    Loyer, Y
    Straccia, U
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2004, PROCEEDINGS, 2004, 3153 : 513 - 524
  • [45] The approximate well-founded semantics for logic programs with uncertainty
    Loyer, Y
    Straccia, U
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2003, PROCEEDINGS, 2003, 2747 : 541 - 550
  • [46] The Well-Founded Semantics Is the Principle of Inductive Definition, Revisited
    Denecker, Marc
    Vennekens, Joost
    FOURTEENTH INTERNATIONAL CONFERENCE ON THE PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, 2014, : 22 - 31
  • [47] Ambiguity propagating defeasible logic and the well-founded semantics
    Maier, Frederick
    Nute, Donald
    LOGICS IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2006, 4160 : 306 - 318
  • [48] SAFE COMPUTATION OF THE WELL-FOUNDED SEMANTICS OF DATALOG QUERIES
    LEONE, N
    RULLO, P
    INFORMATION SYSTEMS, 1992, 17 (01) : 17 - 31
  • [49] SOUNDNESS AND COMPLETENESS OF PARTIAL DEDUCTIONS FOR WELL-FOUNDED SEMANTICS
    PRZYMUSINSKA, H
    PRZYMUSINSKI, T
    SEKI, H
    LECTURE NOTES IN ARTIFICIAL INTELLIGENCE, 1992, 624 : 1 - 12
  • [50] A rewriting method for well-founded semantics with explicit negation
    Cabalar, P
    LOGICS PROGRAMMING, PROCEEDINGS, 2002, 2401 : 378 - 392