A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf
.
The Characterization on the Uniqueness of Answer Set for Prioritized Logic Programs
[chapter]
2003
Lecture Notes in Computer Science
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.
doi:10.1007/978-3-540-39592-8_49
fatcat:dt5gnebz3ne7difd2gqrpb4cti