Cited in
(25)- Completeness and termination for a Seligman-style tableau system
- Modal logic S5 satisfiability in answer set programming
- Hybrid specification of reactive systems: an institutional approach
- Terminating Tableaux for Hybrid Logic with Eventualities
- Herod
- Pilate
- FaCT++
- Sibyl
- HTab
- HyLoTab
- HyLoRes
- InKreSAT
- HGen
- BDDTab
- Symmetric blocking
- \({\mathrm{K}{_ \mathrm{S}} \mathrm{P}}\): a resolution-based prover for multimodal K
- An assumption-based approach for solving the minimal S5-satisfiability problem
- \(\mathrm{K}_{\mathrm S}\mathrm{P}\) a resolution-based theorem prover for \({\mathsf{K}}_n\): architecture, refinements, strategies and experiments
- Herod and Pilate: two tableau provers for basic hybrid logic
- A goal-directed decision procedure for hybrid PDL
- A prover dealing with nominals, binders, transitivity and relation hierarchies
- Terminating tableaux for graded hybrid logic with global modalities and role hierarchies
- MOIN
- InKreSAT: modal reasoning via incremental reduction to SAT
- An efficient approach to nominal equalities in hybrid logic tableaux
This page was built for software: Spartacus
