Resolution for Weak Modal Logics - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 1994

Resolution for Weak Modal Logics

Résumé

We define modal resolution systems for the propositional weak modal logics C, CD and CT. These systems are based on the Enjalbert and Farinas Del Cerro'ss modal resolution systems with minor modifications. Roughly speaking, the axiom \Sigma(<> \perp, C) -> \perp is added if each disjunct of the clause C is a necessity formula (\perp denotes the empty clause) and the simplification rule (<> \perp \approx \perp) is deleted. Non clausal resolution systems are also presented for these weak modal logics. They are variants of Abadi and Manna's non clausal resolution systems. The new resolution systems are proved to be sound and refutationnally complete for these logics. The completeness proofs are inspired by the completeness proofs of the systems for normal mo dal logics with adequate modifications.
Fichier principal
Vignette du fichier
AIMSA94.pdf (549.32 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03200954 , version 1 (20-04-2021)

Identifiants

  • HAL Id : hal-03200954 , version 1

Citer

Stéphane Demri. Resolution for Weak Modal Logics. Proceedings of the 6th International Conference on Artificial Intelligence: Methodology, Systems, Applications (AIMSA'94), Philippe Jorrand; Vasil Sgurev, Jan 1994, Sofia, Bulgaria. pp.131-140. ⟨hal-03200954⟩

Collections

UGA CNRS
43 Consultations
28 Téléchargements

Partager

Gmail Facebook X LinkedIn More