Pages that link to "Item:Q293437"
From MaRDI portal
The following pages link to Complexity versus stability for classes of propositional formulas (Q293437):
Displaying 4 items.
- On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls (Q1040040) (← links)
- Probability logic and optimization SAT: The PSAT and CPA models (Q1777404) (← links)
- Propositional truth maintenance systems: Classification and complexity analysis (Q1924776) (← links)
- Satisfiable formulas closed under replacement (Q2741513) (← links)