On syntactic forgetting under uniform equivalence
From MaRDI portal
Publication:2055801
DOI10.1007/978-3-030-75775-5_20OpenAlexW3160265600MaRDI QIDQ2055801
Ricardo Gonçalves, Tomi Janhunen, Matthias Knorr, João Leite
Publication date: 1 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-75775-5_20
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Forgetting for knowledge bases in DL-lite
- Logic-based ontology comparison and module extraction, with an application to DL-Lite
- Lazy narrowing: strong completeness and eager variable elimination
- Reasoning under inconsistency: a forgetting-based approach
- How to progress a database
- On the limits of forgetting in answer set programming
- Forgetting auxiliary atoms in forks
- Model-theoretic inseparability and modularity of description logic ontologies
- Semantic forgetting in answer set programming
- Solving logic program conflict through strong and weak forgettings
- The Logical Difference for the Lightweight Description Logic EL
- Preserving Strong Equivalence while Forgetting
- Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs
- Minimal Logic Programs
- Some (in)translatability results for normal logic programs and propositional theories
- Modularity Aspects of Disjunctive Stable Models
- 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
- First-order modular logic programs and their conservative extensions
- Modular Nonmonotonic Logic Programming Revisited
- Semantics of (disjunctive) logic programs based on partial evaluation
- A Syntactic Operator for Forgetting that Satisfies Strong Persistence
- Semantical characterizations and complexity of equivalences in answer set programming
- Knowledge Forgetting in Answer Set Programming
- Propositional theories are strongly equivalent to logic programs
- Forgetting Literals with Varying Propositional Symbols
- Macros, Macro Calls and Use of Ensembles in Modular Answer Set Programming
- Strongly equivalent logic programs
This page was built for publication: On syntactic forgetting under uniform equivalence
