Answer sets for prioritized logic programs (1997) [28 citations — 6 self]
Abstract:
Conflict resolution is an important issue in knowledge representation and reasoning. A common idea of solving conflicts in reasoning is to add preferences in the underlying reasoning mechanism. This paper describes extensions of Gelfond and Lifschitz's extended logic programs [5] by adding preference information. We first propose prioritized logic programs (PLPs) in which the preference is expressed statically. An extended answer set semantics is provided for PLPs. We then extend PLPs to dynamic PLPs (DPLPs) in which the preference can be expressed dynamically. The semantics of DPLPs is defined in terms of answer sets of the corresponding PLPs. By illustrating typical examples, we show how conflicts between rules are resolved in PLPs and DPLPs. We also investigate basic properties of PLPs and DPLPs in detail. 1
Citations
| 554 | Classical negation in logic programs and disjunctive databases. New Generation Computing 9:365–385 – Gelfond, Lifschitz - 1991 |
| 197 | Logic Programming and Knowledge Representation – Baral, Gelfond - 1994 |
| 82 | Logic Programs with Exceptions – Kowalski, Sadri - 1990 |
| 73 | Well-founded semantics for extended logic programs with dynamic preferences – Brewka - 1996 |
| 20 | Stable Models and their Computation for Logic Programming with Inheritance and True Negation – Buccafurri, Leone, et al. - 1996 |
| 16 | Towards Generalized Rule-based Updates – Zhang, Foo - 1997 |
| 4 | Circumscription by inference rules with priority – Wang, You, et al. - 1996 |
| 3 | A hierarchy of tractable subsets for computing stable models – Ben-Eliyahu - 1996 |
| 1 | Prioritized logic programs and their applications. Manuscript – Zhang, Foo - 1997 |

