The Characterization on the Uniqueness of Answer Set for Prioritized Logic Programs

Abstract

Prioritized logic programming has illustrated its rich expressiveness and flexibility in knowledge representation and reasoning. However, some important aspects of prioritized logic programs have yet to be thoroughly explored. In this paper, we investigate basic properties of prioritized logic programs in the context of answer set semantics. Specifically, we propose a characterization on the uniqueness of answer set for prioritized logic programs, which has a weaker form than the traditional local stratification for general logic programs.