Modal definability of first-order formulas with free variables and query answering
From MaRDI portal
Publication:2446543
DOI10.1016/j.jal.2013.03.007zbMath1284.03152MaRDI 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
modal logic; description logic; knowledge base; correspondence theory; modal definability; conjunctive query
03B45: Modal logic (including the logic of norms)
68T27: Logic in artificial intelligence
03B10: Classical first-order logic
Related Items
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