On decidability of the decomposability problem for finite theories

DOI10.1007/S11202-010-0068-6zbMath1226.03022OpenAlexW2011298343MaRDI QIDQ630293

Denis K. Ponomaryov, Andrey S. Morozov

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

zbMATH Keywords

logic programmingdecomposable theorydecomposition of a theoryHorn theorymonadic logic

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Logic programming (68N17)

Related Items (4)

Progression of Decomposed Local-Effect Action Theories ⋮ Algorithmic issues of AND-decomposition of Boolean formulas ⋮ The complexity of AND-decomposition of Boolean functions ⋮ On the relationship between the complexity of decidability and decomposability of first-order theories

Cites Work

• Partition-based logical reasoning for first-order and propositional theories
• Formal Properties of Modularisation
• Extracting Modules from Ontologies: A Logic-Based Approach
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On decidability of the decomposability problem for finite theories