Rewrite rule systems for modal propositional logic

DOI10.1016/0743-1066(92)90028-2MaRDI QIDQ3992233zbMATH OpenOpenAlexFDO

Authors Annie Foret

Publication date 13 August 1992

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0743-1066(92)90028-2

zbMATH Keywords

automated decision procedurelocal confluencemodal logicmodal propositional logicrewrite rule systemsterm rewriting systems

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Grammars and rewriting systems (68Q42)

Recommendations

• Confluent term rewriting for only-knowing logics
• No complete linear term rewriting system for propositional logic
• Modal resolution in clausal form
• Computing with rewrite systems
• A loop-free decision procedure for modal propositional logics K4, S4 and S5

Cited in

(8)

• Sentence-Normalized Conditional Narrowing Modulo in Rewriting Logic and Maude
• A paramodulation-based calculus for refuting schemata of clause sets defined by rewrite rules
• Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics (Invited Talk).
• scientific article; zbMATH DE number 2016837 (Why is no real title available?)
• scientific article; zbMATH DE number 1377705 (Why is no real title available?)
• A note on strictly positive logics and word rewriting systems
• No complete linear term rewriting system for propositional logic
• Confluent term rewriting for only-knowing logics

This page was built for publication: Rewrite rule systems for modal propositional logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3992233)