Pages that link to "Item:Q997066"
From MaRDI portal
The following pages link to Satisfiability of mixed Horn formulas (Q997066):
Displaying 6 items.
- Generalized \(k\)-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation (Q714020) (← links)
- On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls (Q1040040) (← links)
- A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs (Q3007679) (← links)
- A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors (Q3502705) (← links)
- A CNF Class Generalizing Exact Linear Formulas (Q3502711) (← links)
- On Some Aspects of Mixed Horn Formulas (Q3637161) (← links)
