Thumbnail
Access Restriction
Open

Author Wang, Yisong ♦ Wang, Kewen ♦ Wang, Zhe ♦ Zhuang, Zhiqiang
Source CiteSeerX
Content type Text
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Description The theory of (variable) forgetting has received signif-icant attention in nonmonotonic reasoning, especially, in answer set programming. However, the problem of establishing a theory of forgetting for some expressive nonmonotonic logics such as McCarthy’s circumscrip-tion is rarely explored. In this paper a theory of for-getting for propositional circumscription is proposed, which is not a straightforward adaption of existing ap-proaches. In particular, some properties that are essen-tial for existing proposals do not hold any longer or have to be reformulated. Several useful properties of the new forgetting are proved, which demonstrate suitability of the forgetting for circumscription. A sound and com-plete algorithm for the forgetting is developed and an analysis of computational complexity is given.
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Learning Resource Type Article
Publisher Institution In Bonet and Koenig