The following pages link to Clausal temporal resolution (Q5738910):
Displaying 37 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)
- Temporal similarity by measuring possibilistic uncertainty in CBR (Q1037857) (← links)
- Temporal resolution using a breadth-first search algorithm (Q1383357) (← links)
- On feasible cases of checking multi-agent systems behavior. (Q1401355) (← links)
- Clausal resolution in a logic of rational agency (Q1606116) (← links)
- An explicit transition system construction approach to LTL satisfiability checking (Q1707341) (← links)
- Backdoors for linear temporal logic (Q1725638) (← links)
- Loop-type sequent calculi for temporal logic (Q2228437) (← links)
- First-order rewritability of ontology-mediated queries in linear temporal logic (Q2238711) (← links)
- Verification and enforcement of access control policies (Q2248087) (← links)
- \(\mathrm{K}_{\mathrm S}\mathrm{P}\) a resolution-based theorem prover for \({\mathsf{K}}_n\): architecture, refinements, strategies and experiments (Q2303247) (← links)
- SAT-based explicit LTL reasoning and its application to satisfiability checking (Q2335900) (← links)
- A survey on temporal logics for specifying and verifying real-time systems (Q2418645) (← links)
- Mechanising first-order temporal resolution (Q2486579) (← links)
- Alternating automata and temporal logic normal forms (Q2488275) (← 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)
- Temporal logics of knowledge and their applications in security (Q2866724) (← links)
- A Cookbook for Temporal Conceptual Data Modelling with Description Logics (Q2946734) (← links)
- One-Pass Tableaux for Computation Tree Logic (Q3498455) (← links)
- Tableaux for logics of time and knowledge with interactions relating to synchrony (Q3647215) (← links)
- Deductive verification of simple foraging robotic behaviours (Q3653523) (← links)
- Temporal abductive reasoning about biochemical reactions (Q4586234) (← links)
- First-Order Resolution Methods for Modal Logics (Q4916086) (← links)
- A derivation-loop method for temporal logic (Q5040806) (← links)
- A Refined Resolution Calculus for CTL (Q5191106) (← links)
- Fair Derivations in Monodic Temporal Reasoning (Q5191107) (← links)
- A resolution calculus for the branching-time temporal logic CTL (Q5410337) (← links)
- Verification from Declarative Specifications Using Logic Programming (Q5504672) (← links)
- Refutation-aware Gentzen-style calculi for propositional until-free linear-time temporal logic (Q6067745) (← links)
- Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic (Q6135954) (← links)
- On the expressive power of the normal form for branching-time temporal logics (Q6659914) (← links)
