Pages that link to "Item:Q2145867"
From MaRDI portal
The following pages link to Complexity of the problem of being equivalent to Horn formulas (Q2145867):
Displaying 6 items.
- On solving the equality problem in theories defined by Horn clauses (Q1085152) (← links)
- On the complexity of equational problems in CNF (Q1404988) (← links)
- Copy complexity of Horn formulas with respect to unit read-once resolution (Q2235734) (← links)
- (Q4955310) (← links)
- Complexity of the problem of being equivalent to Horn formulas. II (Q6160501) (← links)
- Complexity of the problem of \(\forall \)-representation for sentences (Q6597851) (← links)