Pages that link to "Item:Q5941135"
From MaRDI portal
The following pages link to On strongest necessary and weakest sufficient conditions (Q5941135):
Displaying 15 items.
- Projection and scope-determined circumscription (Q429594) (← links)
- Remedying inconsistent sets of premises (Q997052) (← links)
- Knowledge forgetting: properties and applications (Q1045992) (← links)
- Necessary and sufficient explanations for argumentation-based conclusions (Q2146001) (← links)
- Forgetting in multi-agent modal logics (Q2321251) (← links)
- On propositional definability (Q2389643) (← links)
- Semantic forgetting in answer set programming (Q2389674) (← links)
- Solving logic program conflict through strong and weak forgettings (Q2457621) (← links)
- Loop formulas for circumscription (Q2457644) (← links)
- First order LUB approximations: characterization and algorithms (Q2457687) (← links)
- Knowledge forgetting in propositional \(\mu\)-calculus (Q2679422) (← links)
- Forgetting-Based Inconsistency Measure (Q5268425) (← links)
- Progression of Decomposed Local-Effect Action Theories (Q5278214) (← links)
- Computing sufficient and necessary conditions in CTL: a forgetting approach (Q6204992) (← links)
- Minimality, necessity and sufficiency for argumentation and explanation (Q6548459) (← links)
