Pages that link to "Item:Q4302833"
From MaRDI portal
The following pages link to Extended Horn sets in propositional logic (Q4302833):
Displaying 13 items.
- About some UP-based polynomial fragments of SAT (Q513329) (← links)
- On the Boolean connectivity problem for Horn relations (Q608293) (← links)
- A logic-based approach to polymer sequence analysis (Q655183) (← links)
- Computing minimal models by partial instantiation (Q672131) (← links)
- On finding solutions for extended Horn formulas (Q673602) (← links)
- Ideal clutters (Q697573) (← links)
- Solving peptide sequencing as satisfiability (Q929155) (← links)
- Logic applied to integer programming and integer programming applied to logic (Q1130078) (← links)
- New methods for computing inferences in first order logic (Q1309900) (← links)
- Computing definite logic programs by partial instantiation (Q1326778) (← links)
- A rounding algorithm for integer programs (Q1327212) (← links)
- Recognition of \(q\)-Horn formulae in linear time (Q1337669) (← links)
- Hierarchies of polynomially solvable satisfiability problems (Q1380432) (← links)
