Syntactic ASP forgetting with forks

DOI10.1007/978-3-031-15707-3_1MaRDI QIDQ2694542zbMATH OpenOpenAlexFDO

Authors 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

answer set programmingequilibrium logicforgettingforksstrong equivalencestrong persistence

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Recommendations

• Syntactic ASP forgetting with forks
• A syntactic operator for forgetting that satisfies strong persistence
• On the limits of forgetting in answer set programming
• Forgetting auxiliary atoms in forks
• Forgetting in ASP: the forgotten properties

Cites work

• A denotational semantics for equilibrium logic
• A generalization of the Lin-Zhao theorem
• A syntactic operator for forgetting that satisfies strong persistence
• Cut-free formulations for a quantified logic of here and there
• Forgetting auxiliary atoms in forks
• Logic programs with stable model semantics as a constraint programming paradigm
• Minimal Logic Programs
• Preserving strong equivalence while forgetting
• Propositional theories are strongly equivalent to logic programs
• You can't always forget what you want: on the limits of forgetting in answer set programming

Cited in

(1)

• Syntactic ASP forgetting with forks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2694542)