On the succinctness of some modal logics

DOI10.1016/J.ARTINT.2013.02.003zbMATH Open1270.03037OpenAlexW2094001511MaRDI QIDQ360052FDOQ360052

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

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

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)

Cites Work

• Introduction to algorithms.
• Modal logic
• Title not available (Why is that?)
• Dynamic Epistemic Logic and Knowledge Puzzles
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The size of a revised knowledge base
• On the relative succinctness of two extensions by definitions of multimodal logic
• Foundations of instance level updates in expressive description logics
• Title not available (Why is that?)
• Comparing the succinctness of monadic query languages over finite trees
• An \(n!\) lower bound on formula size
• The succinctness of first-order logic on linear orders
• Title not available (Why is that?)

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)