Jul 1, 2015 · In this article, we prove the computational complexity of a class of fibring logics. Especially for a fibring logic composed of two S 5 systems, ...

The reduction method presented in this article can be generalized to settle the computational complexity problem of other fibring logics, and they help to ...

In this article, we prove the computational complexity of a class of fibring logics. Especially for a fibring logic composed of two S5 systems, we present a ...

Yin Wu, Min Jiang, Zhongqiang Huang, Fei Chao, Changle Zhou: An NP-complete fragment of fibring logic. Ann. Math. Artif. Intell. 75(3-4): 391-417 (2015).

This paper is a guided tour through the theory of flbring as a general mechanism for combining logics. We present the main ideas, constructions and ...

The fibring method provides a semantic way to take various modal logics as arguments to produce an integrated one, and the benefit of this method is clear: a ...

An NP-complete fragment of fibring logic ; 发表刊物：. ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE ; 合写作者：. 晁飞 ; 论文类型：. Article ; 通讯作者：. 江敏.

Fibring has been shown to be useful for combining logics endowed withtruth-functional semantics. However, the techniques used so far are unableto cope with ...

The logic of context with the ist (c, p) modality has been proposed by McCarthy as a foundation for contextual reasoning.

We study algorithms for probabilistic satisfiability (PSAT), an NP-complete ... An NP-complete fragment of fibring logic. Auteurs. Yin Wu · Min Jiang · Zhongqiang ...