On decidability of the decomposability problem for finite theories
From MaRDI portal
Publication:630293
Recommendations
Cites work
- scientific article; zbMATH DE number 4025396 (Why is no real title available?)
- scientific article; zbMATH DE number 43398 (Why is no real title available?)
- scientific article; zbMATH DE number 3404221 (Why is no real title available?)
- Extracting Modules from Ontologies: A Logic-Based Approach
- Formal Properties of Modularisation
- Modular reuse of ontologies: theory and practice
- On decomposability in logical calculi
- Partition-based logical reasoning for first-order and propositional theories
Cited in
(14)- On the relationship between the complexity of decidability and decomposability of first-order theories
- scientific article; zbMATH DE number 3871315 (Why is no real title available?)
- On decomposability in logical calculi
- The complexity of AND-decomposition of Boolean functions
- Generalized decomposability notions for first-order theories
- A formal derivation of the decidability of the theory SA
- A note on the decidability of de Finetti's coherence
- Progression of decomposed local-effect action theories
- On decomposability of theories
- On decidability of the theory with the transitive closure operator
- Decidability and complexity of fibred logics without shared connectives
- A remark concerning decidability of complete theories
- Algorithmic issues of AND-decomposition of Boolean formulas
- Universal Horn Sentences and the Joint Embedding Property
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)