Solving Logic Program Conflict through Strong and Weak Forgettings
Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence. Pages 627-633.
Abstract
We consider how to forget a set of atoms in a logic program. Intuitively, when a set of atoms is forgotten from a logic program, all atoms in the set should be eliminated from this program in some way, and other atoms related to them in the program might also be affected. We define notions of strong and weak forgettings in logic programs to capture such intuition and reveal their close connections to the notion of forgetting in classical propositional theories. Based on these notions, we then propose a framework for conflict solving in logic programs, which is general enough to represent many important conflict solving problems. We also study some essential semantic and computational properties in relation to strong and weak forgettings and conflict solving in our framework.
@inproceedings{ijcai2005p27,
title = {Solving Logic Program Conflict through Strong and Weak Forgettings},
author = {Zhang, Yan and Foo, Norman Y. and Wang, Kewen},
booktitle = {Proceedings of the Nineteenth International Joint Conference on
Artificial Intelligence, {IJCAI-05}},
publisher = {International Joint Conferences on Artificial Intelligence},
pages = {627--633},
year = {2005},
url = {https://ijcai.org/proceedings/2005/27},
}
TY - CPAPER TI - Solving Logic Program Conflict through Strong and Weak Forgettings AU - Zhang, Yan AU - Foo, Norman Y. AU - Wang, Kewen T2 - Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05 PB - International Joint Conferences on Artificial Intelligence PY - 2005 SP - 627 EP - 633 UR - https://ijcai.org/proceedings/2005/27 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
