Syntactic ASP forgetting with forks

DOI10.1007/978-3-031-15707-3_1OpenAlexW4293179464MaRDI QIDQ2694542

Yanyan Li

Publication date: 4 April 2023

Full work available at URL: https://doi.org/10.1007/978-3-031-15707-3_1

zbMATH Keywords

forgettinganswer set programmingequilibrium logicstrong persistencestrong equivalenceforks

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (1)

Syntactic ASP forgetting with forks

Cites Work

• 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
• 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
• A Syntactic Operator for Forgetting that Satisfies Strong Persistence
• Propositional theories are strongly equivalent to logic programs

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