Substructural logics and their applications to computer science
Project/Area Number |
20700015
|
Research Category |
Grant-in-Aid for Young Scientists (B)
|
Allocation Type | Single-year Grants |
Research Field |
Fundamental theory of informatics
|
Research Institution | Waseda University |
Principal Investigator |
|
Project Period (FY) |
2008 – 2011
|
Project Status |
Completed (Fiscal Year 2011)
|
Budget Amount *help |
¥2,470,000 (Direct Cost: ¥1,900,000、Indirect Cost: ¥570,000)
Fiscal Year 2011: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Fiscal Year 2010: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Fiscal Year 2009: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Fiscal Year 2008: ¥520,000 (Direct Cost: ¥400,000、Indirect Cost: ¥120,000)
|
Keywords | 部分構造論理 / パラコンシステント論理 / 時間論理 / ソフトウェアモデル検査 / Webオントロジー言語 / モデル検査 / 線形論理 / 完全性定理 / 決定可能性 / カット除去定理 / 数理論理学 / 分岐時間論理 / 線形時間論理 |
Research Abstract |
The aim of this study is to construct proof systems and semantics for substuructural logics, and to propose computer science applications of these proof systems and semantics. In this study, we construct some proof systems and semantics for some temporal and paraconsistent substructural logics, and propose some new applications(such as software model checking and Web ontology languages) of the proposed proof systems and semantics. We have obtained some theoretical results(such as completeness and decidability results) on the proposed proof systems and semantics.
|
Report
(6 results)
Research Products
(131 results)