Two results for proiritized logic programming
| dc.creator | Zhang, Yan | |
| dc.date | 2002-03-05 | |
| dc.date.accessioned | 2026-07-07T03:18:11Z | |
| dc.date.available | 2026-07-07T03:18:11Z | |
| dc.description | 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. | |
| dc.description | 20 pages, to be appeared in journal Theory and Practice of Logic Programming | |
| dc.identifier | https://arxiv.org/abs/cs/0203007 | |
| dc.identifier | http://arxiv.org/abs/cs/0203007 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31014 | |
| dc.subject | Artificial Intelligence | |
| dc.subject | F.4.1 | |
| dc.title | Two results for proiritized logic programming | |
| dc.type | text |