Pages that link to "Item:Q3898029"
From MaRDI portal
The following pages link to Recognizing disguised NR(1) instances of the satisfiability problem (Q3898029):
Displaying 23 items.
- Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search (Q457253) (← links)
- Disjunctive closures for knowledge compilation (Q460617) (← links)
- Unique Horn renaming and Unique 2-Satisfiability (Q673674) (← links)
- On generalized Horn formulas and \(k\)-resolution (Q685363) (← links)
- Existence of simple propositional formulas (Q917333) (← links)
- Detecting embedded Horn structure in propositional logic (Q1198035) (← links)
- A linear algorithm for renaming a set of clauses as a Horn set (Q1318709) (← links)
- Recognition of \(q\)-Horn formulae in linear time (Q1337669) (← links)
- Polynomial-time inference of all valid implications for Horn and related formulae (Q1356205) (← links)
- On renamable Horn and generalized Horn functions (Q1356207) (← links)
- Horn functions and submodular Boolean functions (Q1392203) (← 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)
- Sorting, linear time and the satisfiability problem (Q1817067) (← links)
- Recognition and dualization of disguised bidual Horn functions. (Q1853017) (← links)
- A perspective on certain polynomial-time solvable classes of satisfiability (Q1861558) (← links)
- A new algorithm for the propositional satisfiability problem (Q1894360) (← links)
- Testing heuristics: We have it all wrong (Q1922626) (← links)
- Maximum renamable Horn sub-CNFs (Q1961445) (← 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)
- Properties of SLUR Formulae (Q2891367) (← links)
