Kikot, Stanislav and Zolin, E. (2013) Modal definability of first-order formulas with free variables and query answering. Journal of Applied Logic 11 (2), pp. 190-216. ISSN 1570-8683.
Abstract
We present an algorithmically efficient criterion of modal definability for first-order existential conjunctive formulas with several free variables. Then we apply it to establish modal definability of some family of first-order ∀∃-formulas. Finally, we use our definability results to show that, in any expressive description logic, the problem of answering modally definable conjunctive queries is polynomially reducible to the problem of knowledge base consistency.
Metadata
| Item Type: | Article |
|---|---|
| Keyword(s) / Subject(s): | Modal logic, Modal definability, Correspondence theory, Description logic, Knowledge base, Conjunctive query |
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Administrator |
| Date Deposited: | 20 Mar 2013 10:28 |
| Last Modified: | 09 Aug 2023 12:32 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/6323 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
