On syntactic forgetting under uniform equivalence
type: Item
instance of: scholarly article
title: On syntactic forgetting under uniform equivalence
DOI: 10.1007/978-3-030-75775-5_20
author: Ricardo Gonçalves
author: Tomi Janhunen
author: Matthias Knorr
author: João Leite
publication date: 2021-12-01T00:00:00Z
Mathematics Subject Classification ID: 68T27
zbMATH DE Number: 7437048
zbMATH Keywords: answer set programming
zbMATH Keywords: forgetting
zbMATH Keywords: uniform equivalence
MaRDI profile type: Publication
full work available at URL: 978-3-030-75775-5 20
OpenAlex ID: W3160265600
cites work: Forgetting auxiliary atoms in forks
cites work: Macros, Macro Calls and Use of Ensembles in Modular Answer Set Programming
cites work: A Syntactic Operator for Forgetting that Satisfies Strong Persistence
cites work: Q3880319
cites work: Semantics of (disjunctive) logic programs based on partial evaluation
cites work: Propositional theories are strongly equivalent to logic programs
cites work: Minimal Logic Programs
cites work: Modular Nonmonotonic Logic Programming Revisited
cites work: Semantical characterizations and complexity of equivalences in answer set programming
cites work: Semantic forgetting in answer set programming
cites work: Q3543581
cites work: You Can't Always Forget What You Want: On the Limits of Forgetting in Answer Set Programming
cites work: When you must forget: Beyond strong persistence when forgetting in answer set programming
cites work: On the limits of forgetting in answer set programming
cites work: First-order modular logic programs and their conservative extensions
cites work: Some (in)translatability results for normal logic programs and propositional theories
cites work: Modularity Aspects of Disjunctive Stable Models
cites work: Preserving Strong Equivalence while Forgetting
cites work: The logical difference for the lightweight description logic \(\mathcal {EL}\)
cites work: Model-theoretic inseparability and modularity of description logic ontologies
cites work: Logic-based ontology comparison and module extraction, with an application to DL-Lite
cites work: Q4411161
cites work: Reasoning under inconsistency: a forgetting-based approach
cites work: Strongly equivalent logic programs
cites work: How to progress a database
cites work: Lazy narrowing: strong completeness and eager variable elimination
cites work: Forgetting Literals with Varying Propositional Symbols
cites work: Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs
cites work: Knowledge Forgetting in Answer Set Programming
cites work: Forgetting for knowledge bases in DL-lite
cites work: Solving logic program conflict through strong and weak forgettings
description: scientific article; zbMATH DE number 7437048