The complexity of decision problems for modal propositional ogics
博士 === 國立臺灣大學 === 資訊工程研究所 === 81 === In this dissertation we will investigate the computational complexity of decision problems for various modal propositional logics and their Horn fragments. In the first part we will show that every logic between C and...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
1993
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/90339243948035929602 |