An NP-complete fragment of fibring logic
From MaRDI portal
Publication:905999
DOI10.1007/s10472-015-9468-4zbMath1336.03028OpenAlexW1051421224MaRDI QIDQ905999
Fei Chao, Zhongqiang Huang, Min Jiang, Yin Wu, Chang-Le Zhou
Publication date: 28 January 2016
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-015-9468-4
Modal logic (including the logic of norms) (03B45) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combined logics (03B62)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The foundations of mathematics. A study in the philosophy of science
- A guide to completeness and complexity for modal logics of knowledge and belief
- Why combine logics?
- Simulation and transfer results in modal logic -- a survey
- Synchronization of logics
- Many-dimensional modal logics: theory and applications
- A survey of temporal extensions of description logics
- Combinations of modal logics
- Parameterized modal satisfiability
- The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic
- Products of modal logics. III. Products of modal and temporal logics
- Multi-dimensional modal logic as a framework for spatio-temporal reasoning
- Fibring non-truth-functional logics: Completeness preservation
- Fibring as biporting subsumes asymmetric combinations
- Fibring: completeness preservation
- Combinations and completeness transfer for quantified modal logics
- On Graph-theoretic Fibring of Logics
- The Computational Complexity of Provability in Systems of Modal Propositional Logic
- Fibring of logics as a categorial construction
- Complexity of products of modal logics
- Products of modal logics, part 1
- Modulated fibring and the collapsing problem
- On modal logics betweenK × K × KandS5 × S5 × S5
- Fibring Modal First-Order Logics: Completeness Preservation
- On meet-combination of logics
- Logics of Formal Inconsistency
- Parametrized Logic Programming
- Characterizing the NP-PSPACE Gap in the Satisfiability Problem for Modal Logic
- Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi
- Two-dimensional modal logic
- Two-dimensional modal logic
This page was built for publication: An NP-complete fragment of fibring logic
