Search strategies for resolution in temporal logics
From MaRDI portal
Publication:4647556
DOI10.1007/3-540-61511-3_121zbMATH Open1412.68218OpenAlexW1537740740MaRDI QIDQ4647556FDOQ4647556
Publication date: 15 January 2019
Published in: Automated Deduction — Cade-13 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-61511-3_121
Cites Work
- The complexity of propositional linear temporal logics
- Myths about the mutual exclusion problem
- A Machine-Oriented Logic Based on the Resolution Principle
- Specifying Concurrent Program Modules
- Nonclausal deduction in first-order temporal logic
- Verifying concurrent processes using temporal logic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (5)
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Modelling and solving temporal reasoning as propositional satisfiability 👍 👎
- Resolution for temporal logics of knowledge 👍 👎
- Finding State Solutions to Temporal Logic Queries 👍 👎
- Resolution-based calculi for modal and temporal logics 👍 👎
- Temporal Constraint Satisfaction Problems in Fixed-Point Logic 👍 👎
- Automated theorem proving in temporal logic: \(T\)-resolution 👍 👎
- On Solving Temporal Logic Queries 👍 👎
- More efficient proof-search for sequents of temporal logic 👍 👎
This page was built for publication: Search strategies for resolution in temporal logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4647556)
