Pages that link to "Item:Q1284704"
From MaRDI portal
The following pages link to Decidability by resolution for propositional modal logics (Q1284704):
Displaying 19 items.
- Proof complexity of modal resolution (Q832717) (← links)
- Filter-based resolution principle for lattice-valued propositional logic LP\((X)\) (Q867665) (← links)
- Resolution principles in possibilistic logic (Q911797) (← links)
- MOLOG: A system that extends PROLOG with modal logic (Q1079962) (← links)
- Modal resolution in clausal form (Q1118577) (← links)
- EXPtime tableaux for ALC (Q1589576) (← links)
- SAT-based decision procedures for classical modal logics (Q1610667) (← links)
- Decidability of some classes of modal logic (Q1873248) (← links)
- Efficient local reductions to basic modal logic (Q2055845) (← links)
- Local is best: efficient reductions to modal logic \textsf{K} (Q2102930) (← links)
- Decidability of order-based modal logics (Q2361346) (← links)
- Automated theorem proving by resolution in non-classical logics (Q2385426) (← links)
- Resolution with order and selection for hybrid logics (Q2429982) (← links)
- Using resolution for testing modal satisfiability and building models (Q2751044) (← links)
- Unsorted functional translations (Q2825403) (← links)
- (Q3815280) (← links)
- (Q4707763) (← links)
- First-Order Resolution Methods for Modal Logics (Q4916086) (← links)
- Deciding Extended Modal Logics by Combining State Space Generation and SAT Solving (Q6108819) (← links)