Hokkaido University Collection of Scholarly and Academic Papers >
Graduate School of Information Science and Technology / Faculty of Information Science and Technology >
Peer-reviewed Journal Articles, etc >
命題論理におけるβ節充足可能性問題とその解法
Title: | 命題論理におけるβ節充足可能性問題とその解法 |
Other Titles: | An Algorithm for β Clause Satisfiability Problem in Propositional Logic |
Authors: | 大柳, 俊夫1 Browse this author →KAKEN DB | 山本, 雅人2 Browse this author →KAKEN DB | 大内, 東3 Browse this author →KAKEN DB |
Authors(alt): | Ohyanagi, Toshio1 | Yamamoto, Masahito2 | Ohuchi, Azuma3 |
Keywords: | 命題論理充足可能性問題 | SAT | β節 | β節充足可能性問題 | βSAT | 0-1整数計画問題 |
Issue Date: | Jul-1994 |
Publisher: | 電気学会 |
Journal Title: | 電気学会論文誌 C 電子・情報・システム部門誌 |
Volume: | 114 |
Issue: | 7 |
Start Page: | 796 |
End Page: | 804 |
Abstract: | 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 Q 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. 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. |
Relation: | http://www.iee.jp/ |
Type: | article |
URI: | http://hdl.handle.net/2115/64534 |
Appears in Collections: | 情報科学院・情報科学研究院 (Graduate School of Information Science and Technology / Faculty of Information Science and Technology) > 雑誌発表論文等 (Peer-reviewed Journal Articles, etc)
|
Submitter: 山本 雅人
|