Computational complexity of multimodal logics based on rough sets

MaRDI QIDQ2708314zbMATH OpenFDO

Authors Stéphane Demri, Jarosław Stepaniuk

Publication date 30 October 2001

Published in Fundamenta Informaticae (Search for Journal in Brave)

zbMATH Keywords

computational complexityincomplete informationLadner-style algorithmmultimodal logicssatisfiabilitytolerance rough sets

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Modal logic (including the logic of norms) (03B45) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Logic in artificial intelligence (68T27)

Recommendations

• scientific article; zbMATH DE number 1303627
• A modal logic for Pawlak's approximation spaces with rough cardinality n
• A Modal Logic for Multiple-Source Tolerance Approximation Spaces
• scientific article; zbMATH DE number 1612551
• scientific article; zbMATH DE number 1062288

Cited in

(6)

• Logics from Galois connections
• scientific article; zbMATH DE number 1612551 (Why is no real title available?)
• A modal logic for Pawlak's approximation spaces with rough cardinality n
• scientific article; zbMATH DE number 1303627 (Why is no real title available?)
• scientific article; zbMATH DE number 1515320 (Why is no real title available?)
• Rudiments of rough sets

This page was built for publication: Computational complexity of multimodal logics based on rough sets

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