作成者 |
|
|
本文言語 |
|
出版者 |
|
|
発行日 |
|
|
収録物名 |
|
巻 |
|
号 |
|
開始ページ |
|
終了ページ |
|
出版タイプ |
|
アクセス権 |
|
Crossref DOI |
|
関連DOI |
|
関連DOI |
|
|
|
関連URI |
|
|
|
関連情報 |
|
|
|
|
概要 |
We investigate the computational complexity of the label updating calculation in ATMS and show that the following two decision problems are NP-complete. (1) The problem of deciding whether there exist...s a consistent environment calculated from a new justification for a node. (2) The problem of deciding whether there exists an environment calculated from a new justification for a node such that it is not a superset of any environment in the label of the node.続きを見る
|