On decidability of the decomposability problem for finite theories
From MaRDI portal
Publication:630293
DOI10.1007/S11202-010-0068-6zbMATH Open1226.03022OpenAlexW2011298343MaRDI QIDQ630293FDOQ630293
Authors: Andrei S. Morozov, Denis Ponomaryov 
Publication date: 17 March 2011
Published in: Siberian Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11202-010-0068-6
Recommendations
Cites Work
- Modular reuse of ontologies: theory and practice
- Title not available (Why is that?)
- On decomposability in logical calculi
- Partition-based logical reasoning for first-order and propositional theories
- Title not available (Why is that?)
- Title not available (Why is that?)
- Formal Properties of Modularisation
- Extracting Modules from Ontologies: A Logic-Based Approach
Cited In (13)
- On decidability of the theory with the transitive closure operator
- Generalized decomposability notions for first-order theories
- A remark concerning decidability of complete theories
- Decidability and complexity of fibred logics without shared connectives
- Algorithmic issues of AND-decomposition of Boolean formulas
- On decomposability of theories
- A formal derivation of the decidability of the theory SA
- Progression of decomposed local-effect action theories
- Title not available (Why is that?)
- The complexity of AND-decomposition of Boolean functions
- A note on the decidability of de Finetti's coherence
- On decomposability in logical calculi
- On the relationship between the complexity of decidability and decomposability of first-order theories
This page was built for publication: On decidability of the decomposability problem for finite theories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q630293)
