Pages that link to "Item:Q253999"
From MaRDI portal
The following pages link to On the query complexity of selecting minimal sets for monotone predicates (Q253999):
Displaying 12 items.
- Counting minimal unsatisfiable subsets (Q832272) (← links)
- Minimal sets on propositional formulae. Problems and reductions (Q1677431) (← links)
- Paracoherent answer set computation (Q2238696) (← links)
- Determining inference semantics for disjunctive logic programs (Q2289011) (← links)
- MCS Extraction with Sublinear Oracle Queries (Q2818026) (← links)
- Efficient Reasoning for Inconsistent Horn Formulae (Q2835881) (← links)
- Cautious reasoning in ASP via minimal models and unsatisfiable cores (Q4559795) (← links)
- Omission-Based Abstraction for Answer Set Programs (Q4957218) (← links)
- Better Paracoherent Answer Sets with Less Resources (Q5108500) (← links)
- Witnesses for Answer Sets of Logic Programs (Q5886522) (← links)
- Computing generating sets of minimal size in finite algebras (Q6108373) (← links)
- Contrastive explanations for answer-set programs (Q6545521) (← links)