Pages that link to "Item:Q2211850"
From MaRDI portal
The following pages link to On the limits of forgetting in answer set programming (Q2211850):
Displaying 12 items.
- On syntactic forgetting under uniform equivalence (Q2055801) (← links)
- Rough forgetting (Q2096552) (← links)
- A polynomial reduction of forks into logic programs (Q2144173) (← links)
- Forgetting auxiliary atoms in forks (Q2321342) (← links)
- Semantic forgetting in answer set programming (Q2389674) (← links)
- Solving logic program conflict through strong and weak forgettings (Q2457621) (← links)
- Knowledge forgetting in propositional \(\mu\)-calculus (Q2679422) (← links)
- Forgetting in ASP: The Forgotten Properties (Q2835900) (← links)
- When you must forget: Beyond strong persistence when forgetting in answer set programming (Q4592710) (← links)
- Knowledge Forgetting in Answer Set Programming (Q5417593) (← links)
- Computing sufficient and necessary conditions in CTL: a forgetting approach (Q6204992) (← links)
- Common equivalence and size of forgetting from Horn formulae (Q6661056) (← links)