发明名称 SATISFIABILITY PROBLEM CALCULATION METHOD, SATISFIABILITY PROBLEM CALCULATION SYSTEM AND PROGRAM
摘要 PROBLEM TO BE SOLVED: To reduce SAT calculation time.SOLUTION: A calculation processing part M assigns a boolean value to a variable x1 included in a Boolean expression that is expressed in a conjunctive normal form, and gives notice of the assigned boolean value to calculation processing parts C1, C2 and Cn that operate the Boolean expression including the variable x1, and then, the calculation processing parts C1, C2 and Cn after receiving the notice of the boolean value store the boolean value in first-level ques cq11, cq21 and cqn1, and calculate each boolean value of other variables included in the Boolean expression, on the basis of the boolean value. Even when any of the calculation processing parts has not finished calculating each boolean value of other variables, the calculation processing part M assigns the boolean value to a variable x3 included in the Boolean expression, and gives notice of the assigned boolean value to the calculation processing parts C1, C2 and Cn that operate the Boolean expression including the variable x3, and then, the calculation processing parts C1, C2 and Cn after receiving the notice of the boolean value store the boolean value in second-level ques cq12, cq22 and cqn2, and calculate each boolean value of other variables included in the Boolean expression, on the basis of the boolean value.
申请公布号 JP2013246657(A) 申请公布日期 2013.12.09
申请号 JP20120120166 申请日期 2012.05.25
申请人 FUJITSU LTD 发明人 PARIZY MATTHIEU;TAKAYAMA KOICHIRO;HIGUCHI HIROYUKI
分类号 G06F9/50 主分类号 G06F9/50
代理机构 代理人
主权项
地址