The Complexity of Decomposing Modal and First-Order Theories

DOI10.1109/LICS.2012.43zbMath1364.03031OpenAlexW2018476992MaRDI QIDQ5892436

Stefan Göller, Jean Christoph Jung, Markus Lohrey

Publication date: 16 May 2017

Published in: 2012 27th Annual IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/lics.2012.43

zbMATH Keywords

satisfiabilitymany-dimensional modal logicGaifman's theoremFeferman-Vaught decompositions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items (3)

The decision problem of modal product logics with a diagonal, and faulty counter machines ⋮ A Cookbook for Temporal Conceptual Data Modelling with Description Logics ⋮ The Complexity of Decomposing Modal and First-Order Theories

This page was built for publication: The Complexity of Decomposing Modal and First-Order Theories