Bijective faithful translations among default logics

被引:0
|
作者
Liberatore, Paolo [1 ]
机构
[1] Univ Roma La Sapienza, Dipartimento Ingn Informat Automat & Gest, I-00185 Rome, Italy
关键词
Default logic; non-monotonic reasoning; computational complexity; knowledge representation; propositional logic; COMPLEXITY;
D O I
10.1093/logcom/ext073
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this article, we report results about translations between variants of defaults logics such that the extensions of the theories that are the input and the output of the translation are in a bijective correspondence. We assume that a translation can introduce new variables and that the result of translating a theory can either be produced in time polynomial in the size of the theory or its output is of size polynomial in the size of the theory; we restrict to the case in which the original theory has extensions. This study fills a gap between two previous works, one studying bijective translations among restrictions of default logics and one studying non-bijective translations between default variants of default logic.
引用
收藏
页码:763 / 807
页数:45
相关论文
共 50 条
  • [31] Among the Faithful
    不详
    SCOTTISH GEOGRAPHICAL MAGAZINE, 1938, 54 (02): : 115 - 116
  • [32] Faithful orthogonal representations of graphs from partition logics
    Karl Svozil
    Soft Computing, 2020, 24 : 10239 - 10245
  • [33] Faithful orthogonal representations of graphs from partition logics
    Svozil, Karl
    SOFT COMPUTING, 2020, 24 (14) : 10239 - 10245
  • [34] Faithful translations between polyvariant flows and polymorphic types
    Amtoft, T
    Turbak, F
    PROGRAMMING LANGUAGES AND SYSTEMS, PROCEEDINGS, 2000, 1782 : 26 - 40
  • [35] Default reasoning with imperfect information in multivalued logics
    Stamate, Daniel
    38TH INTERNATIONAL SYMPOSIUM ON MULTIPLE-VALUED LOGIC (ISMVL 2008), 2008, : 163 - 168
  • [36] Embedding Modal Nonmonotonic Logics into Default Logic
    Robert Milnikel
    Studia Logica, 2003, 75 (3) : 377 - 382
  • [37] The complexity of model checking for propositional default logics
    Liberatore, P
    Schaerf, M
    DATA & KNOWLEDGE ENGINEERING, 2005, 55 (02) : 189 - 202
  • [38] Default description logics with reversing inference rules
    Sun, Yu
    Sui, Yuefei
    PROCEEDINGS OF THE FIFTH IEEE INTERNATIONAL CONFERENCE ON COGNITIVE INFORMATICS, VOLS 1 AND 2, 2006, : 280 - 285
  • [39] Uniform semantic treatment of default and autoepistemic logics
    Denecker, M
    Marek, VW
    Truszczynski, M
    ARTIFICIAL INTELLIGENCE, 2003, 143 (01) : 79 - 122
  • [40] The complexity of model checking for propositional default logics
    Liberatore, P
    Schaerf, M
    ECAI 1998: 13TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 1998, : 18 - 22