Pages that link to "Item:Q1198035"
From MaRDI portal
The following pages link to Detecting embedded Horn structure in propositional logic (Q1198035):
Displaying 7 items.
- Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search (Q457253) (← links)
- Variable and term removal from Boolean formulae (Q1363769) (← links)
- Recognizing renamable generalized propositional Horn formulas is NP- complete (Q1804878) (← links)
- Testing heuristics: We have it all wrong (Q1922626) (← links)
- Maximum renamable Horn sub-CNFs (Q1961445) (← links)
- Mixed logical-linear programming (Q1961464) (← links)
- Tradeoffs in the Complexity of Backdoor Detection (Q3523063) (← links)
