Cheng-Chia Chen

Learn More
A b s t r a c t This paper is concerned with the Computational complexity of the following problems for various modal logics L: (1). The L-deducibility problem: given a finite set of ~ormulas S and a formula A, determine if A is in the modal theory THL(S) formed With all theorems of the modal logic L as logical axioms and with all members of S as proper(More)
—One of the key functions to popularize 3D content services on virtual environments is on the extensibility of the underlying system. In our previous work, we had implemented an extensible MultiUser Virtual Environment (MUVE) called IMNet which features plug-in modules for various application purposes. This feature is enabled by adopting the eXtensible(More)
  • 1