Pages that link to "Item:Q1610669"
From MaRDI portal
The following pages link to Using resolution for testing modal satisfiability and building models (Q1610669):
Displaying 16 items.
- Representing and building models for decidable subclasses of equational clausal logic (Q861367) (← links)
- Some techniques for proving termination of the hyperresolution calculus (Q861692) (← links)
- Decidability by resolution for propositional modal logics (Q1284704) (← links)
- Extracting models from clause sets saturated under semantic refinements of the resolution rule. (Q1401929) (← links)
- Pay-as-you-go consequence-based reasoning for the description logic \(\mathcal{SROIQ} \) (Q2238693) (← links)
- Blocking and other enhancements for bottom-up model generation methods (Q2303239) (← links)
- \(\mathrm{K}_{\mathrm S}\mathrm{P}\) a resolution-based theorem prover for \({\mathsf{K}}_n\): architecture, refinements, strategies and experiments (Q2303247) (← links)
- Resolution with order and selection for hybrid logics (Q2429982) (← links)
- Using resolution for testing modal satisfiability and building models (Q2751044) (← links)
- (Q2767089) (← links)
- A tableau calculus for minimal modal model generation (Q2825415) (← links)
- Using resolution for deciding solvable classes and building finite models (Q4560350) (← links)
- Modal logics for reasoning about infinite unions and intersections of binary relations (Q4583172) (← links)
- First-Order Resolution Methods for Modal Logics (Q4916086) (← links)
- A Resolution-based Model Building Algorithm for a Fragment of OCC1N = (Q4916224) (← links)
- Decidability Results for Saturation-Based Model Building (Q5191116) (← links)
