書誌事項
- タイトル別名
-
- An Algorithm for β Clause Satisfiability Problem in Propositional Logic
- メイダイ ロンリ ニ オケル ベータ セツジュウソク カノウセイ モンダイ ト
- An Algorithm for β Clause Satisfiability Problem in Propositional Logic
この論文をさがす
抄録
The satisfiability problem (SAT) is one of the important problems in the field of computer science, since it is well known NP-complete problem. The problem is well studied and many valuable results are reported in the literature. We have already proposed IEMSAT algorithm as one of SAT algorithms. Recently, J. N. Hooker made a study of resolution for a set of β clauses. A β clause is a clause that has an additional quantitative condition. The condition is that a β clause is true if and only if at least number of β literals in the clause are true. He also referred to β SAT problem that is SAT consists of β clauses. He, however, did not propose efficient algorithm for it as yet.<br>This paper intends to present β SAT algorithm ( IEMBSAT ) that is an extended variant of IEMSAT. Some relations between a β clause and a clause are also clarified. Some computational experiments are made to show the effectiveness of IEMBSAT.
収録刊行物
-
- 電気学会論文誌C(電子・情報・システム部門誌)
-
電気学会論文誌C(電子・情報・システム部門誌) 114 (7-8), 796-804, 1994
一般社団法人 電気学会
- Tweet
キーワード
詳細情報 詳細情報について
-
- CRID
- 1390282679584126592
-
- NII論文ID
- 130006843379
- 120005971315
-
- NII書誌ID
- AN10065950
-
- ISSN
- 13488155
- 03854221
-
- HANDLE
- 2115/64534
-
- NDL書誌ID
- 3888247
-
- データソース種別
-
- JaLC
- IRDB
- NDL
- Crossref
- CiNii Articles
-
- 抄録ライセンスフラグ
- 使用不可