The following pages link to (Q4012170):
Displaying 38 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)
- Two party immediate response disputes: Properties and efficiency (Q814510) (← links)
- A clausal resolution method for branching-time logic \(\text{ECTL}^+\) (Q862827) (← links)
- Dual systems of tableaux and sequents for PLTL (Q1035676) (← links)
- Automated theorem proving in temporal logic: \(T\)-resolution (Q1322389) (← links)
- The saturated tableaux for linear miniscope Horn-like temporal logic (Q1344880) (← links)
- Temporal resolution using a breadth-first search algorithm (Q1383357) (← links)
- An explicit transition system construction approach to LTL satisfiability checking (Q1707341) (← links)
- Modeling data-intensive reactive systems with relational transition systems (Q1901696) (← links)
- A transformation-based synthesis of temporal specification (Q1906037) (← links)
- Computational complexity of hybrid interval temporal logics (Q2084954) (← links)
- The token reification approach to temporal reasoning (Q2171256) (← links)
- Hybrid fragments of Halpern-Shoham logic and their expressive power (Q2334600) (← links)
- A survey on temporal logics for specifying and verifying real-time systems (Q2418645) (← links)
- A clausal resolution method for extended computation tree logic ECTL (Q2495388) (← links)
- Theorem proving using clausal resolution: from past to present (Q2695485) (← links)
- A compact linear translation for bounded model checking (Q2864381) (← links)
- Sub-propositional Fragments of the Interval Temporal Logic of Allen’s Relations (Q2938489) (← links)
- A Cookbook for Temporal Conceptual Data Modelling with Description Logics (Q2946734) (← links)
- Stable Models for Temporal Theories (Q3449185) (← links)
- Resolution for temporal logics of knowledge (Q4209289) (← links)
- (Q4412853) (← links)
- A clausal resolution method for CTL branching-time temporal logic (Q4421285) (← links)
- Removing irrelevant information in temporal resolution proofs (Q4421286) (← links)
- Temporal equilibrium logic: a survey (Q4583305) (← links)
- A resolution-based proof method for temporal logics of knowledge and belief (Q4632296) (← links)
- Search strategies for resolution in temporal logics (Q4647556) (← links)
- Computational complexity of a core fragment of Halpern-Shoham logic (Q5079792) (← links)
- Temporal reasoning over linear discrete time (Q5236442) (← links)
- Temporal representation and reasoning in artificial intelligence: A review (Q5943344) (← links)
- Refutation-aware Gentzen-style calculi for propositional until-free linear-time temporal logic (Q6067745) (← links)
- Simplifying inductive schemes in temporal logic (Q6487562) (← links)
- SAT meets tableaux for linear temporal logic satisfiability (Q6611959) (← links)
