Pages that link to "Item:Q673602"
From MaRDI portal
The following pages link to On finding solutions for extended Horn formulas (Q673602):
Displaying 17 items.
- Satisfiability of acyclic and almost acyclic CNF formulas (Q385062) (← links)
- A logic-based approach to polymer sequence analysis (Q655183) (← links)
- Solving peptide sequencing as satisfiability (Q929155) (← links)
- On exact selection of minimally unsatisfiable subformulae (Q1777390) (← 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)
- Mixed logical-linear programming (Q1961464) (← links)
- Propagation complete encodings of smooth DNNF theories (Q2079276) (← links)
- The Horn renamability, q-Horn and SLUR threshold for random \(k\)-CNF formulas (Q2341714) (← links)
- Generalising unit-refutation completeness and SLUR via nested input resolution (Q2352484) (← 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)
- Generalising and Unifying SLUR and Unit-Refutation Completeness (Q2927648) (← links)
- Satisfiability of Acyclic and almost Acyclic CNF Formulas (II) (Q3007673) (← links)
- Bounds on the size of PC and URC formulas (Q5145828) (← links)
- Fuzzy logic programs as hypergraphs. Termination results (Q6079415) (← links)
