A sufficient condition for strong equivalence under the well-founded semantics

被引：0
|
作者：
Nomikos, C
Rondogiannis, P
Wadge, WW
机构：
[1] Univ Ioannina, Dept Comp Sci, GR-45110 Ioannina, Greece
[2] Univ Athens, Dept Informat & Telecommun, Athens 15784, Greece
[3] Univ Victoria, Dept Comp Sci, Victoria, BC V8W 3P6, Canada
来源：
LOGIC PROGRAMMING, PROCEEDINGS | 2005年 / 3668卷
关键词：
D O I：
10.1007/11562931_35
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We consider the problem of strong equivalence [1] under the infinite-valued semantics [2] (which is a purely model-theoretic version of the well-founded semantics). We demonstrate that two programs are now strongly equivalent if and only if they are logically equivalent under the infinite-valued logic of [2]. In particular, we show that for propositional programs strong equivalence is decidable but coNP-complete. Our results have a direct practical implication for the well-founded semantics since, as we demonstrate, if two programs are strongly equivalent under the infinite-valued semantics, then they axe also strongly equivalent under the well-founded semantics.
引用
收藏
页码：414 / 415
页数：2
相关论文
共 50 条
  • [31] On the computation of the disjunctive well-founded semantics
    Johnson, C.A.
    1600, Kluwer Academic Publishers (26):
  • [32] Well-founded semantics for hybrid rules
    Drabent, Wlodzimierz
    Maluszynski, Jan
    WEB REASONING AND RULE SYSTEMS, PROCEEDINGS, 2007, 4524 : 1 - +
  • [33] Well-founded semantics for Boolean grammars
    Kountouriotis, Vassilis
    Nomikos, Christos
    Rondogiannis, Panos
    INFORMATION AND COMPUTATION, 2009, 207 (09) : 945 - 967
  • [34] Strong negation in well-founded and partial stable semantics for logic programs
    Cabalar, Pedro
    Odintsov, Sergei
    Pearce, David
    ADVANCES IN ARTIFICIAL INTELLIGENCE - IBERAMIA-SBIA 2006, PROCEEDINGS, 2006, 4140 : 592 - 601
  • [35] Hybrid reasoning with rules and constraints under well-founded semantics
    Drabent, Wlodzimierz
    Henriksson, Jakob
    Maluszynski, Jan
    WEB REASONING AND RULE SYSTEMS, PROCEEDINGS, 2007, 4524 : 348 - +
  • [36] 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
  • [37] The well-founded semantics is the principle of inductive definition
    Denecker, M
    LOGICS IN ARTIFICIAL INTELLIGENCE, 1998, 1489 : 1 - 16
  • [38] 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
  • [39] THE WELL-FOUNDED SEMANTICS FOR GENERAL LOGIC PROGRAMS
    VANGELDER, A
    ROSS, KA
    SCHLIPF, JS
    JOURNAL OF THE ACM, 1991, 38 (03) : 620 - 650
  • [40] Contradiction removal within well-founded semantics
    Pereira, L.M.
    Alferes, J.J.
    Aparicio, J.N.
    Logic Programming and Non-monotonic Reasoning - Proceedings, 1991,
12345