Pages that link to "Item:Q997066"
From MaRDI portal
The following pages link to Satisfiability of mixed Horn formulas (Q997066):
Displaying 15 items.
- Unique Horn renaming and Unique 2-Satisfiability (Q673674) (← links)
- 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)
- On the complexity of the maximum satisfiability problem for Horn formulas (Q1099168) (← links)
- Horn logic, search and satisfiability. A collection of papers in memory of Robert G. Jeroslow (Q1356203) (← links)
- On a generalization of Horn constraint systems (Q2399383) (← links)
- Satisfiability on mixed instances (Q2800587) (← links)
- A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs (Q3007679) (← links)
- SAT-Based Horn Least Upper Bounds (Q3453244) (← 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)
- The satisfiabilty problem for a class consisting of horn sentences and some non-horn sentences in proportional logic (Q3677734) (← links)
- (Q4732442) (← links)
- Satisfiability Checking of Non-clausal Formulas Using General Matings (Q5756567) (← links)
