The following pages link to TRP++ (Q26576):
Displayed 19 items.
- Extracting unsatisfiable cores for LTL via temporal resolution (Q266863) (← links)
- Invariant-free clausal temporal resolution (Q352974) (← links)
- Towards a notion of unsatisfiable and unrealizable cores for LTL (Q433349) (← links)
- Enhancing unsatisfiable cores for LTL with information on temporal relevance (Q507378) (← links)
- Variable and clause elimination for LTL satisfiability checking (Q748758) (← links)
- Bounded linear-time temporal logic: a proof-theoretic investigation (Q764266) (← links)
- \({\mathcal E}\)-connections of abstract description systems (Q814594) (← links)
- Certifying proofs for SAT-based model checking (Q2058379) (← links)
- Theorem proving for pointwise metric temporal logic over the naturals via translations (Q2228435) (← links)
- SAT-based explicit LTL reasoning and its application to satisfiability checking (Q2335900) (← links)
- Using temporal logics of knowledge for specification and verification -- a case study (Q2494726) (← links)
- Theorem proving using clausal resolution: from past to present (Q2695485) (← links)
- (Q3384170) (← links)
- Ordered Resolution for Coalition Logic (Q3455769) (← links)
- A Modal-Layered Resolution Calculus for K (Q3455770) (← links)
- CTL-RP: A computation tree logic resolution prover (Q3568224) (← links)
- First-Order Resolution Methods for Modal Logics (Q4916086) (← links)
- (Q5015285) (← links)
- A Refined Resolution Calculus for CTL (Q5191106) (← links)