Pages that link to "Item:Q1677431"
From MaRDI portal
The following pages link to Minimal sets on propositional formulae. Problems and reductions (Q1677431):
Displaying 15 items.
- On the query complexity of selecting minimal sets for monotone predicates (Q253999) (← links)
- Extracting unsatisfiable cores for LTL via temporal resolution (Q266863) (← links)
- Mining top-\(k\) motifs with a SAT-based framework (Q511756) (← links)
- Extension and equivalence problems for clause minimal formulae (Q1777408) (← links)
- An assumption-based approach for solving the minimal S5-satisfiability problem (Q1799062) (← links)
- A logic-algebraic tool for reasoning with knowledge-based systems (Q1994361) (← links)
- Timed automata relaxation for reachability (Q2044206) (← links)
- A primal-dual approximation algorithm for \textsc{minsat} (Q2161258) (← links)
- Enumeration of minimal models and MUSes in WASP (Q2694547) (← links)
- On Tackling Explanation Redundancy in Decision Trees (Q5041018) (← links)
- (Q5101345) (← links)
- ASP and subset minimality: enumeration, cautious reasoning and MUSes (Q6103676) (← links)
- On computing probabilistic abductive explanations (Q6116531) (← links)
- A memetic algorithm for restoring feasibility in scheduling with limited makespan (Q6177176) (← links)
- Certified logic-based explainable AI -- the case of monotonic classifiers (Q6535329) (← links)
