Pages that link to "Item:Q4302833"
From MaRDI portal
The following pages link to Extended Horn sets in propositional logic (Q4302833):
Displaying 32 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)
- On exact selection of minimally unsatisfiable subformulae (Q1777390) (← links)
- Solving the resolution-free SAT problem by submodel propagation in linear time (Q1777398) (← links)
- Recognizing renamable generalized propositional Horn formulas is NP- complete (Q1804878) (← links)
- Balanced \(0,\pm 1\) matrices. I: Decomposition (Q1850525) (← links)
- A short note on some tractable cases of the satisfiability problem. (Q1854345) (← links)
- A perspective on certain polynomial-time solvable classes of satisfiability (Q1861558) (← links)
- The arborescence-realization problem (Q1893159) (← links)
- A new algorithm for the propositional satisfiability problem (Q1894360) (← links)
- Maximum renamable Horn sub-CNFs (Q1961445) (← links)
- Mixed logical-linear programming (Q1961464) (← links)
- Recognition of tractable satisfiability problems through balanced polynomial representations (Q1962045) (← links)
- On some tractable classes in deduction and abduction (Q1978251) (← links)
- The Horn renamability, q-Horn and SLUR threshold for random \(k\)-CNF formulas (Q2341714) (← links)
- Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing (Q2387427) (← links)
- Domain permutation reduction for constraint satisfaction problems (Q2389649) (← links)
- Balanced matrices (Q2433704) (← links)
- A sharp threshold for the renameable-Horn and the \(q\)-Horn properties (Q2581546) (← links)
- Typical case complexity of satisfiability algorithms and the threshold phenomenon (Q2581549) (← links)
- Properties of SLUR Formulae (Q2891367) (← links)
