Modal Theorem Proving: An Equational Viewpoint
DOI10.1093/LOGCOM/2.3.247zbMATH Open0757.03007OpenAlexW2063582240MaRDI QIDQ4018166FDOQ4018166
Yves Auffray, Patrice Enjalbert
Publication date: 16 January 1993
Published in: Journal Of Logic And Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/4e2599bc3e884a2b934874f4eab20653130de2fa
Recommendations
automated deductionmodal logicterm rewritingterminationpossible worldsskolemizationequational resolutiontranslations of modal formulas
Modal logic (including the logic of norms) (03B45) Mechanization of proofs and logical operations (03B35)
Cited In (17)
- Identity in modal logic theorem proving
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Representing scope in intuitionistic deductions
- Multimodal logic programming using equational and order-sorted logic
- First-Order Resolution Methods for Modal Logics
- Resolution-based calculi for modal and temporal logics
- A tableau-like proof procedure for normal modal logics
- First order meta theories
- Title not available (Why is that?)
- Title not available (Why is that?)
- Completeness of hyper-resolution via the semantics of disjunctive logic programs
- Modular proof systems for partial functions with Evans equality
- Capturing equilibrium models in modal logic
- Labelled proofs for quantified modal logic
- Unsorted functional translations
This page was built for publication: Modal Theorem Proving: An Equational Viewpoint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4018166)