A Syntactic Operator for Forgetting that Satisfies Strong Persistence
From MaRDI portal
Publication:5108521
DOI10.1017/S1471068419000346zbMath1434.68561arXiv1907.12501MaRDI QIDQ5108521
Matthias Knorr, Matti Berthold, João Leite, Ricardo Gonçalves
Publication date: 4 May 2020
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.12501
Related Items (5)
A Syntactic Operator for Forgetting that Satisfies Strong Persistence ⋮ Syntactic ASP forgetting with forks ⋮ On the limits of forgetting in answer set programming ⋮ Syntactic ASP forgetting with forks ⋮ On syntactic forgetting under uniform equivalence
Cites Work
- Unnamed Item
- Unnamed Item
- Forgetting for knowledge bases in DL-lite
- Logic-based ontology comparison and module extraction, with an application to DL-Lite
- Reasoning under inconsistency: a forgetting-based approach
- Knowledge forgetting: properties and applications
- How to progress a database
- Semantic forgetting in answer set programming
- A bird's-eye view of forgetting in answer-set programming
- Solving logic program conflict through strong and weak forgettings
- Forgetting under the Well-Founded Semantics
- Preserving Strong Equivalence while Forgetting
- Back and Forth between Rules and SE-Models
- Minimal Logic Programs
- Negation as failure in the head
- You Can't Always Forget What You Want: On the Limits of Forgetting in Answer Set Programming
- When you must forget: Beyond strong persistence when forgetting in answer set programming
- Semantics of (disjunctive) logic programs based on partial evaluation
- A Syntactic Operator for Forgetting that Satisfies Strong Persistence
- Logics in Artificial Intelligence
- Knowledge Forgetting in Answer Set Programming
- Propositional theories are strongly equivalent to logic programs
- Strongly equivalent logic programs
This page was built for publication: A Syntactic Operator for Forgetting that Satisfies Strong Persistence
