Modal definability of first-order formulas with free variables and query answering

DOI10.1016/j.jal.2013.03.007zbMath1284.03152OpenAlexW2154397897MaRDI QIDQ2446543

Stanislav Kikot, Evgeni E. Zolin

Publication date: 17 April 2014

Published in: Journal of Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jal.2013.03.007

zbMATH Keywords

modal logicdescription logicknowledge basecorrespondence theorymodal definabilityconjunctive query

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in artificial intelligence (68T27) Classical first-order logic (03B10)

Related Items

A dichotomy for some elementarily generated modal logics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Axiomatization of modal logic squares with distinguished diagonal
• Tools and techniques in modal logic
• Many-dimensional modal logics: theory and applications
• Tractable reasoning and efficient query answering in description logics: The DL-Lite family
• Elementary canonical formulae: extending Sahlqvist's theorem
• Every world can see a reflexive world
• Interpolation for extended modal languages
• Query Answering in the Description Logic Horn- $\mathcal{SHIQ}$
• The Complexity of Conjunctive Query Answering in Expressive Description Logics
• An extension of Kracht's theorem to generalized Sahlqvist formulas
• On axiomatising products of Kripke frames
• The Description Logic Handbook