TRP++
From MaRDI portal
Software:26576
swMATH14679MaRDI QIDQ26576FDOQ26576
Author name not available (Why is that?)
Cited In (19)
- 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
- Ordered Resolution for Coalition Logic
- A Refined Resolution Calculus for CTL
- CTL-RP: A computation tree logic resolution prover
- \({\mathcal E}\)-connections of abstract description systems
- Certifying proofs for SAT-based model checking
- First-Order Resolution Methods for Modal Logics
- Theorem proving for pointwise metric temporal logic over the naturals via translations
- Variable and clause elimination for LTL satisfiability checking
- Using temporal logics of knowledge for specification and verification -- a case study
- A Modal-Layered Resolution Calculus for K
- Invariant-free clausal temporal resolution
- Theorem proving using clausal resolution: from past to present
- SAT-based explicit LTL reasoning and its application to satisfiability checking
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for software: TRP++
