An NP-complete fragment of fibring logic
type: Item
instance of: scholarly article
title: An NP-complete fragment of fibring logic
zbMATH Open document ID: 1336.03028
author: Yin Wu
author: Min Jiang
author: Zhongqiang Huang
author: Fei Chao
author: Chang-Le Zhou
published in: Annals of Mathematics and Artificial Intelligence
publication date: 2016-01-28T00:00:00Z
Mathematics Subject Classification ID: 03B45
Mathematics Subject Classification ID: 03B62
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6536930
zbMATH Keywords: computability logic
zbMATH Keywords: combining logics
zbMATH Keywords: fibring semantics
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: s10472-015-9468-4
OpenAlex ID: W1051421224
cites work: Parameterized modal satisfiability
cites work: Q5465436
cites work: A survey of temporal extensions of description logics
cites work: Multi-dimensional modal logic as a framework for spatio-temporal reasoning
cites work: Combinations of modal logics
cites work: The foundations of mathematics. A study in the philosophy of science
cites work: Why combine logics?
cites work: Modal logic
cites work: Q3408862
cites work: Q4941925
cites work: Fibring non-truth-functional logics: Completeness preservation
cites work: Q3007251
cites work: Logics of Formal Inconsistency
cites work: Modulated fibring and the collapsing problem
cites work: Q4385435
cites work: Products of modal logics. III. Products of modal and temporal logics
cites work: Q4217280
cites work: Many-dimensional modal logics: theory and applications
cites work: Q4619817
cites work: Products of modal logics, part 1
cites work: Q5715695
cites work: Parametrized Logic Programming
cites work: The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic
cites work: A guide to completeness and complexity for modal logics of knowledge and belief
cites work: Characterizing the NP-PSPACE Gap in the Satisfiability Problem for Modal Logic
cites work: On modal logics betweenK × K × KandS5 × S5 × S5
cites work: Simulation and transfer results in modal logic -- a survey
cites work: Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi
cites work: The Computational Complexity of Provability in Systems of Modal Propositional Logic
cites work: Complexity of products of modal logics
cites work: Q4298260
cites work: Fibring as biporting subsumes asymmetric combinations
cites work: Q4843187
cites work: Combinations and completeness transfer for quantified modal logics
cites work: Two-dimensional modal logic
cites work: Synchronization of logics
cites work: Fibring of logics as a categorial construction
cites work: Fibring Modal First-Order Logics: Completeness Preservation
cites work: On Graph-theoretic Fibring of Logics
cites work: On meet-combination of logics
cites work: Q4833777
cites work: Q4342095
cites work: Q4353561
cites work: Q4215611
cites work: Fibring: Completeness preservation
DOI: 10.1007/S10472-015-9468-4
description: scientific article; zbMATH DE number 6536930