Pages that link to "Item:Q4589090"
From MaRDI portal
The following pages link to Algorithms for computing backbones of propositional formulae (Q4589090):
Displaying 16 items.
- On the query complexity of selecting minimal sets for monotone predicates (Q253999) (← links)
- Backjumping for quantified Boolean logic satisfiability (Q814445) (← links)
- Computational complexity of terminological reasoning in BACK (Q1104128) (← links)
- Minimal sets on propositional formulae. Problems and reductions (Q1677431) (← links)
- SAT competition 2020 (Q2060693) (← links)
- On preprocessing for weighted MaxSAT (Q2234104) (← links)
- Paracoherent answer set computation (Q2238696) (← links)
- The complete parsimony haplotype inference problem and algorithms based on integer programming, branch-and-bound and Boolean satisfiability (Q2628808) (← links)
- Mining Backbone Literals in Incremental SAT (Q3453214) (← links)
- Preprocessing for DQBF (Q3453223) (← links)
- SAT-Based Horn Least Upper Bounds (Q3453244) (← links)
- Cautious reasoning in ASP via minimal models and unsatisfiable cores (Q4559795) (← links)
- The (D)QBF Preprocessor HQSpre – Underlying Theory and Its Implementation1 (Q5015602) (← links)
- Abstract Solvers for Computing Cautious Consequences of ASP programs (Q5108499) (← links)
- Towards backbone computing: A Greedy-Whitening based approach (Q5145436) (← links)
- On the benefits of knowledge compilation for feature-model analyses (Q6630715) (← links)