Connict resolution is an important issue in knowledge representation and reasoning. A common idea of solving connicts 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 rst 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 deened in terms of answer sets of the corresponding PLPs. By illustrating typical examples, we show how connicts between rules are resolved in PLPs and DPLPs. We also investigate basic properties of PLPs and DPLPs in detail.
[1]
Chitta Baral,et al.
Logic Programming and Knowledge Representation
,
1994,
J. Log. Program..
[2]
Francesco Buccafurri,et al.
Stable Models and Their Computation for Logic Programming with Inheritance and True Negation
,
1996,
J. Log. Program..
[3]
Li-Yan Yuan,et al.
Circumscription by Inference Rules with Priority
,
1996,
ECAI.
[4]
Gerhard Brewka.
Well-Founded Semantics for Extended Logic Programs with Dynamic Preferences
,
1996,
J. Artif. Intell. Res..
[5]
R. Ben-Eliyahu,et al.
A hierarchy of tractable subsets for computing stable models
,
1996,
cs/9608104.
[6]
Norman Y. Foo,et al.
Towards Generalized Rule-based Updates
,
1997,
IJCAI.