Solving logic program conflict through strong and weak forgettings

Authors:
Yan Zhang;Norman Foo;Kewen Wang
Affiliations:
School of Computing & IT, University of Western Sydney, NSW, Australia;School of Comp. Sci. & Eng., University of New South Wales, NSW, Australia;School of Computing & IT, Griffith University, QLD, Australia
Venue:
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Year:
2005

Citing 4
Cited 10

On strongest neccessary and weakest sufficient conditions

Artificial Intelligence
Strongly equivalent logic programs

ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
On properties of update sequences based on causal rejection

Theory and Practice of Logic Programming
Propositional independence: formula-variable independence and forgetting

Journal of Artificial Intelligence Research

Semantic forgetting in answer set programming

Artificial Intelligence
Introspective Forgetting

AI '08 Proceedings of the 21st Australasian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Resolving Conflicts in Action Descriptions

Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Forgetting and conflict resolving in disjunctive logic programming

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
A theory of forgetting in logic programming

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
A unified framework for representing logic program updates

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Forgetting in logic programs with ordered disjunction

AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Reasoning under inconsistency: A forgetting-based approach

Artificial Intelligence
Merging and aligning ontologies in dl-programs

RuleML'05 Proceedings of the First international conference on Rules and Rule Markup Languages for the Semantic Web
Forgetting for defeasible logic

LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning

Quantified Score

Hi-index	0.00

Visualization

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.