Affordable Access

Characterization of Strongly Equivalent Logic Programs in Intermediate Logics

Authors
  • de Jongh, Dick
  • Hendriks, Lex
Type
Preprint
Publication Date
Jun 03, 2002
Submission Date
Jun 03, 2002
Identifiers
arXiv ID: cs/0206005
Source
arXiv
License
Unknown
External links

Abstract

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.

Report this publication

Statistics

Seen <100 times