Characterization of Strongly Equivalent Logic Programs in Intermediate Logics

Details Characterization of Strongly Equivalent Logic Programs in Intermediate Logics Characterization of Strongly Equivalent Logic Programs in Intermediate Logics

Publishing date

2002-06-03

URL

arxiv.org/abs/cs/0206005v1

Science

Computer Science

Field

Logic in Computer Science

Additional info

Under consideration for publication in Theory and Practice of Logic Programming

Type

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Characterization of Strongly Equivalent Logic Programs in Intermediate Logics does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Characterization of Strongly Equivalent Logic Programs in Intermediate Logics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Characterization of Strongly Equivalent Logic Programs in Intermediate Logics will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-693120