On the succinctness of some modal logics

DOI10.1016/J.ARTINT.2013.02.003MaRDI QIDQ360052zbMATH OpenOpenAlexFDO

Authors Wiebe van der Hoek, Petar Iliev, Tim French, Barteld Kooi

Publication date 23 August 2013

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL http://www.sciencedirect.com/science/article/pii/S0004370213000222

zbMATH Keywords

epistemic logicmodal logicdescription logicsknowledge representationsuccinctnessBoolean modal logicfinite model theory of modal logic

Mathematics Subject Classification ID

Knowledge representation (68T30) Logics of knowledge and belief (including belief change) (03B42) Modal logic (including the logic of norms) (03B45) Model theory of finite structures (03C13) Logic in artificial intelligence (68T27)

Recommendations

• On the relative succinctness of two extensions by definitions of multimodal logic
• Some exponential lower bounds on formula-size in modal logic
• The succinctness of the cover modality
• The Succinctness of First-order Logic over Modal Logic via a Formula Size Game
• Formula size games for modal logic and \(\mu\)-calculus

Cites work

• scientific article; zbMATH DE number 5604077 (Why is no real title available?)
• scientific article; zbMATH DE number 4148058 (Why is no real title available?)
• scientific article; zbMATH DE number 4033710 (Why is no real title available?)
• scientific article; zbMATH DE number 1936671 (Why is no real title available?)
• scientific article; zbMATH DE number 1501613 (Why is no real title available?)
• scientific article; zbMATH DE number 1841824 (Why is no real title available?)
• scientific article; zbMATH DE number 795590 (Why is no real title available?)
• scientific article; zbMATH DE number 2232435 (Why is no real title available?)
• An \(n!\) lower bound on formula size
• Comparing the succinctness of monadic query languages over finite trees
• Dynamic Epistemic Logic and Knowledge Puzzles
• Foundations of instance level updates in expressive description logics
• Introduction to algorithms.
• Modal logic
• On the relative succinctness of two extensions by definitions of multimodal logic
• The size of a revised knowledge base
• The succinctness of first-order logic on linear orders

Cited in

(13)

• Formula size games for modal logic and \(\mu\)-calculus
• A public announcement separation logic
• On the relative succinctness of two extensions by definitions of multimodal logic
• Expressive power and succinctness of the positive calculus of binary relations
• On the size of shortest modal descriptions
• Two remarks on strictly implicative formulas in modal logic S3
• Some exponential lower bounds on formula-size in modal logic
• The Succinctness of First-order Logic over Modal Logic via a Formula Size Game
• Succinctness in subsystems of the spatial \(\mu\)-calculus
• Computationally hard problems for logic programs under answer set semantics
• On the succinctness of atoms of dependency
• Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence
• The succinctness of the cover modality

This page was built for publication: On the succinctness of some modal logics

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