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
Nested expressions in logic programs
Annals of Mathematics and Artificial Intelligence
A New Logical Characterisation of Stable Models and Answer Sets
NMELP '96 Selected papers from the Non-Monotonic Extensions of Logic Programming
ASSAT: computing answer sets of a logic program by SAT solvers
Artificial Intelligence - Special issue on nonmonotonic reasoning
A generalization of the Lin-Zhao theorem
Annals of Mathematics and Artificial Intelligence
Propositional theories are strongly equivalent to logic programs
Theory and Practice of Logic Programming
Semantic forgetting in answer set programming
Artificial Intelligence
Knowledge forgetting: Properties and applications
Artificial Intelligence
Propositional independence: formula-variable independence and forgetting
Journal of Artificial Intelligence Research
Characterising equilibrium logic and nested logic programs: Reductions and complexity1,2
Theory and Practice of Logic Programming
On solution correspondences in answer-set programming
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Solving logic program conflict through strong and weak forgettings
Artificial Intelligence
Reasoning under inconsistency: A forgetting-based approach
Artificial Intelligence
Forgetting for knowledge bases in DL-Lite
Annals of Mathematics and Artificial Intelligence
Answer set programming at a glance
Communications of the ACM
Answer sets for propositional theories
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Interpolable formulas in equilibrium logic and answer set programming
Journal of Artificial Intelligence Research
On the progression of knowledge in the situation calculus
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
The logical difference for the lightweight description logic EL
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
A new semantic forgetting for answer set programs (ASP), called SM-forgetting, is proposed in the paper. It distinguishes itself from the others in that it preserves not only skeptical and credulous consequences on unforgotten variables, but also strong equivalence-forgetting same variables in strongly equivalent logic programs has strongly equivalent results. The forgetting presents a positive answer to Gabbay, Pearce and Valverde's open question - if ASP has uniform interpolation property. We also investigate some properties, algorithm and computational complexities for the forgetting. It shows that computing the forgetting result is generally intractable even for Horn logic programs.