Pages that link to "Item:Q2457621"
From MaRDI portal
The following pages link to Solving logic program conflict through strong and weak forgettings (Q2457621):
Displaying 14 items.
- Reasoning under inconsistency: a forgetting-based approach (Q991019) (← links)
- Knowledge forgetting: properties and applications (Q1045992) (← links)
- On syntactic forgetting under uniform equivalence (Q2055801) (← links)
- On the limits of forgetting in answer set programming (Q2211850) (← links)
- Forgetting in multi-agent modal logics (Q2321251) (← links)
- Semantic forgetting in answer set programming (Q2389674) (← links)
- Knowledge forgetting in propositional \(\mu\)-calculus (Q2679422) (← links)
- Forgetting in ASP: The Forgotten Properties (Q2835900) (← links)
- Preserving Strong Equivalence while Forgetting (Q2938510) (← links)
- When you must forget: Beyond strong persistence when forgetting in answer set programming (Q4592710) (← links)
- On Quantifying Literals in Boolean Logic and its Applications to Explainable AI (Q5026182) (← links)
- A Syntactic Operator for Forgetting that Satisfies Strong Persistence (Q5108521) (← links)
- Multi-shot ASP solving with clingo (Q5197744) (← links)
- Dual forgetting operators in the context of weakest sufficient and strongest necessary conditions (Q6152662) (← links)
