Cited in
(35)- scientific article; zbMATH DE number 7445165 (Why is no real title available?)
- Extracting unsatisfiable cores for LTL via temporal resolution
- Bounded linear-time temporal logic: a proof-theoretic investigation
- Towards a notion of unsatisfiable and unrealizable cores for LTL
- Enhancing unsatisfiable cores for LTL with information on temporal relevance
- Polsat
- A Refined Resolution Calculus for CTL
- \({\mathcal E}\)-connections of abstract description systems
- CTL-RP: A computation tree logic resolution prover
- Certifying proofs for SAT-based model checking
- A new rule for LTL tableaux
- Theorem proving for pointwise metric temporal logic over the naturals via translations
- TSPASS
- TATL
- TeMP
- MUP
- TTM
- MUSer2
- VaqUoT
- VaqTree
- HyLoRes
- CTL-RP
- KoMeT
- lbtt
- Variable and clause elimination for LTL satisfiability checking
- CLProver
- Using temporal logics of knowledge for specification and verification -- a case study
- A Modal-Layered Resolution Calculus for K
- Invariant-free clausal temporal resolution
- First-order resolution methods for modal logics
- Ordered resolution for coalition logic
- Theorem proving using clausal resolution: from past to present
- Leviathan
- SAT-based explicit LTL reasoning and its application to satisfiability checking
- Aalta
This page was built for software: TRP++
