Spartacus
From MaRDI portal
Software:24354
swMATH12426MaRDI QIDQ24354FDOQ24354
Author name not available (Why is that?)
Cited In (14)
- Completeness and termination for a Seligman-style tableau system
- Terminating Tableaux for Hybrid Logic with Eventualities
- Herod and Pilate: Two Tableau Provers for Basic Hybrid Logic
- InKreSAT: Modal Reasoning via Incremental Reduction to SAT
- Symmetric blocking
- Hybrid Specification of Reactive Systems: An Institutional Approach
- An assumption-based approach for solving the minimal S5-satisfiability problem
- Terminating Tableaux for Graded Hybrid Logic with Global Modalities and Role Hierarchies
- \(\mathrm{K}_{\mathrm S}\mathrm{P}\) a resolution-based theorem prover for \({\mathsf{K}}_n\): architecture, refinements, strategies and experiments
- A goal-directed decision procedure for hybrid PDL
- : A Resolution-Based Prover for Multimodal K
- A prover dealing with nominals, binders, transitivity and relation hierarchies
- Modal Logic S5 Satisfiability in Answer Set Programming
- An efficient approach to nominal equalities in hybrid logic tableaux
This page was built for software: Spartacus
