Strategies for modal resolution: Results and problems

DOI10.1007/BF00302639zbMath0709.03008OpenAlexW2079384024MaRDI QIDQ920970

Yves Auffray, Patrice Enjalbert, Jean-Jacques Hébrard

Publication date: 1990

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00302639

zbMATH Keywords

resolutionpropositional modal logicS4Horn clause for modal logics

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Mechanization of proofs and logical operations (03B35)

Related Items (10)

The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics ⋮ A tableau-like proof procedure for normal modal logics ⋮ Resolution theorem proving in reified modal logics ⋮ Uniform and non uniform strategies for tableaux calculi for modal logics ⋮ Resolution with order and selection for hybrid logics ⋮ Multimodal logic programming using equational and order-sorted logic ⋮ A framework for the transfer of proofs, lemmas and strategies from classical to non classical logics ⋮ Temporal representation and reasoning in artificial intelligence: A review ⋮ Proof methods for reasoning about possibility and necessity ⋮ Modal Logic S5 Satisfiability in Answer Set Programming

Cites Work

• MOLOG: A system that extends PROLOG with modal logic
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Strategies for modal resolution: Results and problems