A resolution-based proof method for temporal logics of knowledge and belief
From MaRDI portal
Recommendations
Cites work
- A guide to completeness and complexity for modal logics of knowledge and belief
- A structure-preserving clause form translation
- scientific article; zbMATH DE number 3670430 (Why is no real title available?)
- scientific article; zbMATH DE number 67448 (Why is no real title available?)
- scientific article; zbMATH DE number 1348464 (Why is no real title available?)
- scientific article; zbMATH DE number 1142326 (Why is no real title available?)
- scientific article; zbMATH DE number 1536563 (Why is no real title available?)
- scientific article; zbMATH DE number 1536569 (Why is no real title available?)
- scientific article; zbMATH DE number 795590 (Why is no real title available?)
- Knowledge, belief and time
- TABLEAUX: A general theorem prover for modal logics
- The complexity of reasoning about knowledge and time. I: Lower bounds
- What can machines know?
Cited in
(8)- Automated theorem proving in temporal logic: T-resolution
- Clausal resolution in a logic of rational agency
- Sequent calculi for branching time temporal logics of knowledge and beliefwith awareness: completeness and decidability
- scientific article; zbMATH DE number 67448 (Why is no real title available?)
- Resolution for temporal logics of knowledge
- A Tableau-Based Proof Method for Temporal Logics of Knowledge and Belief
- scientific article; zbMATH DE number 1536563 (Why is no real title available?)
- Logic for Programming, Artificial Intelligence, and Reasoning
This page was built for publication: A resolution-based proof method for temporal logics of knowledge and belief
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4632296)