Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A Unified View on Forgetting and Strong Equivalence Notions in Answer Set Programming (2312.07993v1)

Published 13 Dec 2023 in cs.AI

Abstract: Answer Set Programming (ASP) is a prominent rule-based language for knowledge representation and reasoning with roots in logic programming and non-monotonic reasoning. The aim to capture the essence of removing (ir)relevant details in ASP programs led to the investigation of different notions, from strong persistence (SP) forgetting, to faithful abstractions, and, recently, strong simplifications, where the latter two can be seen as relaxed and strengthened notions of forgetting, respectively. Although it was observed that these notions are related, especially given that they have characterizations through the semantics for strong equivalence, it remained unclear whether they can be brought together. In this work, we bridge this gap by introducing a novel relativized equivalence notion, which is a relaxation of the recent simplification notion, that is able to capture all related notions from the literature. We provide necessary and sufficient conditions for relativized simplifiability, which shows that the challenging part is for when the context programs do not contain all the atoms to remove. We then introduce an operator that combines projection and a relaxation of (SP)-forgetting to obtain the relativized simplifications. We furthermore present complexity results that complete the overall picture.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (32)
  1. Computational complexity: a modern approach. Cambridge University Press.
  2. Limits and Possibilities of Forgetting in Abstract Argumentation. In Raedt, L. D., ed., Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022, Vienna, Austria, 23-29 July 2022, 2539–2545. ijcai.org.
  3. Intentional forgetting: An emerging field in AI and beyond. KI-Künstliche Intelligenz, 33: 5–8.
  4. Berthold, M. 2022. On syntactic forgetting with strong persistence. In Proceedings of the 19th International Conference on Principles of Knowledge Representation and Reasoning, KR 2022, Haifa, Israel. July 31 - August 5, 2022, 43–52. IJCAI Organization.
  5. A syntactic operator for forgetting that satisfies strong persistence. Theory and Practice of Logic Programming, 19(5-6): 1038–1055.
  6. Forgetting Aspects in Assumption-Based Argumentation. In Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning, 86–96. IJCAI Organization.
  7. Abstracting soft constraints: Framework, properties, examples. Artificial Intelligence, 139(2): 175–211.
  8. Model checking and abstraction. ACM Transactions on Programming Languages and Systems (TOPLAS), 1512–1542.
  9. Semantical characterizations and complexity of equivalences in answer set programming. ACM Transactions on Computational Logic (TOCL), 8(3): 17.
  10. On the Computational Cost of Disjunctive Logic Programming: Propositional Case. Ann. Math. Artif. Intell., 15(3-4): 289–323.
  11. A Brief Survey on Forgetting from a Knowledge Representation and Reasoning Perspective. KI – Künstliche Intelligenz. Online http://link.springer.com/article/10.1007/s13218-018-0564-6.
  12. On Solution Correspondences in Answer Set Programming. In Proceedings of the 19th International Joint Conference on Artificial Intelligence, 97–102.
  13. A theory of abstraction. AIJ, 57(2-3): 323–389.
  14. Forgetting in modular answer set programming. In Proc. of the Thirty-Third AAAI Conference on Artificial Intelligence, 2843–2850. AAAI Press.
  15. The Ultimate Guide to Forgetting in Answer Set Programming. In Proc. of the 15th International Conference on Principles of Knowledge Representation and Reasoning, 135–144.
  16. You can’t always forget what you want: On the limits of forgetting in answer set programming. In Proc. of the 22nd European Conference on Artificial Intelligence, 957–965. IOS Press.
  17. Forgetting in Answer Set Programming – A Survey. Theory and Practice of Logic Programming, 23(1): 111–156.
  18. On the limits of forgetting in Answer Set Programming. Artif. Intell., 286: 103307.
  19. Knoblock, C. A. 1994. Automatically generating abstractions for planning. Artificial Intelligence, 68(2): 243–302.
  20. Preserving strong equivalence while forgetting. In Logics in Artificial Intelligence: 14th European Conference, JELIA 2014, Funchal, Madeira, Portugal, September 24-26, 2014. Proceedings 14, 412–425. Springer.
  21. Strongly Equivalent Logic Programs. ACM Transactions on Computational Logic, 2(4): 526–541.
  22. Agent Abstraction via Forgetting in the Situation Calculus. In Giacomo, G. D.; Catalá, A.; Dilkina, B.; Milano, M.; Barro, S.; Bugarín, A.; and Lang, J., eds., Proceedings of the 24th European Conference on Artificial Intelligence, ECAI 2020, volume 325 of Frontiers in Artificial Intelligence and Applications, 809–816. IOS Press.
  23. Papadimitriou, C. H. 2003. Computational complexity. John Wiley and Sons Ltd.
  24. The persistence and transience of memory. Neuron, 94(6): 1071–1084.
  25. Omission-based Abstraction for Answer Set Programs. In Proc. of the 16th International Conference on Principles of Knowledge Representation and Reasoning, 42–51. AAAI Press.
  26. A Semantic Perspective on Omission Abstraction in ASP. In Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, 733–737. IJCAI Organization.
  27. Foundations for Projecting Away the Irrelevant in ASP Programs. In Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning, 614–624. IJCAI Organization.
  28. Please delete that! Why should I? Explaining learned irrelevance classifications of digital objects. KI-Künstliche Intelligenz, 33(1): 35–44.
  29. Turner, H. 2001. Strong equivalence for logic programs and default theories (made easy). In Logic Programming and Nonmotonic Reasoning: 6th International Conference, LPNMR 2001 Vienna, Austria, September 17–19, 2001 Proceedings 6, 81–92. Springer.
  30. On Generating Abstract Explanations via Knowledge Forgetting. In ICAPS 2022 Workshop on Explainable AI Planning.
  31. Forgetting for Answer Set Programs Revisited. In IJCAI 2013, Proceedings of the 23rd International Joint Conference on Artificial Intelligence, Beijing, China, August 3-9, 2013, 1162–1168. IJCAI/AAAI.
  32. Woltran, S. 2004. Characterizations for Relativized Notions of Equivalence in Answer Set Programming. In Alferes, J. J.; and Leite, J. A., eds., Logics in Artificial Intelligence, 9th European Conference, JELIA 2004, Lisbon, Portugal, September 27-30, 2004, Proceedings, volume 3229 of Lecture Notes in Computer Science, 161–173. Springer.
Citations (1)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now