Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/on-the-relationship-between-the-complexity-of-decidability-and-d790f806tY
References (10)
-
C. Lutz, F. Wolter (2009)
Mathematical Logic for Life Science Ontologies -
E. Börger, E. Grädel, Y. Gurevich (1997)
The Classical Decision Problem -
D. Ponomaryov (2009)
On decomposability in logical calculi ? -
J. D. Monk (1976)
10.1007/978-1-4684-9452-5Mathematical Logic
-
P. Emelyanov (2018)
On Two Kinds of Dataset Decomposition -
L. Bachmair, H. Ganzinger, Uwe Waldmann (1993)
Set constraints are the monadic class[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science
-
P. Emelyanov, D. Ponomaryov (2020)
The complexity of AND - decomposition of Boolean functionsDiscret. Appl. Math., 280
-
D. Ponomaryov, M. Soutchanski (2017)
Progression of Decomposed Local-Effect Action TheoriesACM Transactions on Computational Logic (TOCL), 18
-
B. Konev, C. Lutz, D. Ponomaryov, F. Wolter (2010)
Decomposing Description Logic Ontologies -
A. Morozov, D. Ponomaryov (2010)
On decidability of the decomposability problem for finite theoriesSiberian Mathematical Journal, 51
- Publisher
- Springer Journals
- Copyright
- Copyright © Pleiades Publishing, Ltd. 2021
- ISSN
- 1995-0802
- eISSN
- 1818-9962
- DOI
- 10.1134/s199508022112026x
- Publisher site
- See Article on Publisher Site
Abstract
We consider the decomposability problem, i.e., the problem to decide whether a logical theory \documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$${\mathcal{T}}$$\end{document} is equivalent to a union of two (or several) components in signatures, which correspond to a partition of the signature of \documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$${\mathcal{T}}$$\end{document} ‘‘modulo’’ a given shared subset of symbols. We introduce several tools for proving that the computational complexity of this problem coincides with the complexity of entailment. As an application of these tools we derive tight bounds for the complexity of decomposability of theories in signature fragments of first-order logic, i.e., those fragments, which are obtained by restricting signature.
Journal
Lobachevskii Journal of Mathematics – Springer Journals
Published: Dec 1, 2021
Keywords: decomposition; decidability; computational complexity