Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
Signed data dependencies in logic programs
Journal of Logic Programming
A three-valued semantics for deductive databases and logic programs
Journal of Computer and System Sciences
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
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Two results for prioritized logic programming
Theory and Practice of Logic Programming
On properties of update sequences based on causal rejection
Theory and Practice of Logic Programming
Reasoning about evolving nonmonotonic knowledge bases
ACM Transactions on Computational Logic (TOCL)
Propositional independence: formula-variable independence and forgetting
Journal of Artificial Intelligence Research
Discovering classes of strongly equivalent logic programs
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
A stronger notion of equivalence for logic programs
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Reasoning under inconsistency: A forgetting-based approach
Artificial Intelligence
A Model-Theoretic Approach to Belief Change in Answer Set Programming
ACM Transactions on Computational Logic (TOCL)
Forgetting for answer set programs revisited
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
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, reveal their close connections to the notion of forgetting in classical propositional theories, and provide a precise semantic characterization for them. Based on these notions, we then develop a general framework for conflict solving in logic programs. We investigate various semantic properties and features in relation to strong and weak forgettings and conflict solving in the proposed framework. We argue that many important conflict solving problems can be represented within this framework. In particular, we show that all major logic program update approaches can be transformed into our framework, under which each approach becomes a specific conflict solving case with certain constraints. We also study essential computational properties of strong and weak forgettings and conflict solving in the framework.