Pages that link to "Item:Q3142267"
From MaRDI portal
The following pages link to On the restricted equivalence for subclasses of propositional logic (Q3142267):
Displaying 8 items.
- Complexity versus stability for classes of propositional formulas (Q293437) (← links)
- On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls (Q1040040) (← links)
- The Logical Difference Problem for Description Logic Terminologies (Q3541706) (← links)
- (Q4005186) (← links)
- (Q4934323) (← links)
- (Q5283963) (← links)
- Theoretical Computer Science (Q5897360) (← links)
- Common equivalence and size of forgetting from Horn formulae (Q6661056) (← links)