Hostname: page-component-cd9895bd7-gvvz8 Total loading time: 0 Render date: 2024-12-25T04:59:38.102Z Has data issue: false hasContentIssue false
  • English
  • Français

Two results for prioritized logic programming

Published online by Cambridge University Press:  10 March 2003

YAN ZHANG
YAN ZHANG
Affiliation:
School of Computing and Information Technology, University of Western Sydney, Locked Bag 1797, Penrith South DC, NSW 1797, Australia (e-mail: [email protected])
Get access Rights & Permissions [Opens in a new window]

Abstract

Prioritized default reasoning has illustrated its rich expressiveness and flexibility in knowledge representation and reasoning. However, many important aspects of prioritized default reasoning have yet to be thoroughly explored. In this paper, we investigate two properties of prioritized logic programs in the context of answer set semantics. Specifically, we reveal a close relationship between mutual defeasibility and uniqueness of the answer set for a prioritized logic program. We then explore how the splitting technique for extended logic programs can be extended to prioritized logic programs. We prove splitting theorems that can be used to simplify the evaluation of a prioritized logic program under certain conditions.

Keywords

nonmonotonic reasoningprioritized logic programsknowledge representation
Type
Research Article
Information
Theory and Practice of Logic Programming , Volume 3 , Issue 2 , March 2003 , pp. 223 - 242
Copyright
© 2003 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)