Syntactic ASP forgetting with forks

DOI10.1016/J.ARTINT.2023.104033OpenAlexW4387817554MaRDI QIDQ6152659

No author found.

Publication date: 13 February 2024

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2023.104033

zbMATH Keywords

forgettinganswer set programmingequilibrium logicstrong persistencestrong equivalenceforks

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30) Logic programming (68N17)

Cites Work

• Unnamed Item
• Cut-free formulations for a quantified logic of here and there
• A generalization of the Lin-Zhao theorem
• Logic programs with stable model semantics as a constraint programming paradigm
• Forgetting auxiliary atoms in forks
• Syntactic ASP forgetting with forks
• Preserving Strong Equivalence while Forgetting
• Minimal Logic Programs
• You Can't Always Forget What You Want: On the Limits of Forgetting in Answer Set Programming
• A denotational semantics for equilibrium logic
• Semantics of (disjunctive) logic programs based on partial evaluation
• A Syntactic Operator for Forgetting that Satisfies Strong Persistence
• Propositional theories are strongly equivalent to logic programs
• Thirty years of Epistemic Specifications

This page was built for publication: Syntactic ASP forgetting with forks