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 条
  • [21] On the problem of computing the well-founded semantics
    Lonc, Z
    Truszczynski, M
    COMPUTATIONAL LOGIC - CL 2000, 2000, 1861 : 673 - 687
  • [22] On the problem of computing the well-founded semantics
    Lonc, Z
    Truszczynski, M
    THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2001, 1 : 591 - 609
  • [23] Hybrid rules with well-founded semantics
    Włodzimierz Drabent
    Jan Małuszyński
    Knowledge and Information Systems, 2010, 25 : 137 - 168
  • [24] Well-founded semantics for defeasible logic
    Maier, Frederick
    Nute, Donald
    SYNTHESE, 2010, 176 (02) : 243 - 274
  • [25] Extended Well-Founded Semantics in Bilattices
    Stamate, Daniel
    PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY, VOL 9, 2005, 9 : 60 - 65
  • [26] On the problem of computing the well-founded semantics
    Lonc, Zbigniew
    Truszczynski, Miroslaw
    Theory and Practice of Logic Programming, 2001, 1 (05) : 591 - 609
  • [27] On the computation of the disjunctive well-founded semantics
    Johnson, CA
    JOURNAL OF AUTOMATED REASONING, 2001, 26 (04) : 333 - 356
  • [28] Loop checking and the well-founded semantics
    Lifschitz, V
    McCain, N
    Przymusinski, TC
    Stark, RF
    LOGIC PROGRAMMING AND NONMONOTONIC REASONING, 1995, 928 : 127 - 142
  • [29] 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)
  • [30] Well-founded semantics for Boolean grammars
    Kountouriotis, Vassilis
    Nomikos, Christos
    Rondogiannis, Panos
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2006, 4036 : 203 - 214
12345