Characterization of Strongly Equivalent Logic Programs in Intermediate Logics
<|reference_start|>Characterization of Strongly Equivalent Logic Programs in Intermediate Logics: The non-classical, nonmonotonic inference relation associated with the answer set semantics for logic programs gives rise to a relationship of 'strong equivalence' between logical programs that can be verified in 3-valued Goedel logic, G3, the strongest non-classical intermediate propositional logic (Lifschitz, Pearce and Valverde, 2001). In this paper we will show that KC (the logic obtained by adding axiom ~A v ~~A to intuitionistic logic), is the weakest intermediate logic for which strongly equivalent logic programs, in a language allowing negations, are logically equivalent.<|reference_end|>
@article{de jongh2002characterization,
    title={Characterization of Strongly Equivalent Logic Programs in Intermediate
  Logics},
    author={Dick de Jongh, Lex Hendriks},
    journal={arXiv preprint arXiv:cs/0206005},
    year={2002},
    archivePrefix={arXiv},
    eprint={cs/0206005},
    primaryClass={cs.LO}
}