scholarly journals An Algorithm Solving SAT Problem Based on Splitting Rule and Extension Rule

2017 ◽  
Author(s):  
Youjun Xu
Keyword(s):  
Sat Problem ◽  
Extension Rule ◽  
Splitting Rule

scholarly journals Enhanced Membrane Computing Algorithm for SAT Problems Based on the Splitting Rule

Symmetry ◽  
2019 ◽  
Vol 11 (11) ◽  
pp. 1412
Author(s):  
Hao ◽  
Liu
Keyword(s):  
Membrane Computing ◽  
Space Complexity ◽  
Natural Computing ◽  
Sat Problem ◽  
Computing Algorithm ◽  
Complete Problems ◽  
Np Complete ◽  
Splitting Rule ◽  
Np Problems ◽  
Time And Space Complexity

Boolean propositional satisfiability (SAT) problem is one of the most widely studied NP-complete problems and plays an outstanding role in many domains. Membrane computing is a branch of natural computing which has been proven to solve NP problems in polynomial time with a parallel compute mode. This paper proposes a new algorithm for SAT problem which combines the traditional membrane computing algorithm of SAT problem with a classic simplification rule, the splitting rule, which can divide a clause set into two axisymmetric subsets, deal with them respectively and simultaneously, and obtain the solution of the original clause set with the symmetry of their solutions. The new algorithm is shown to be able to reduce the space complexity by distributing clauses with the splitting rule repeatedly, and also reduce both time and space complexity by executing one-literal rule and pure-literal rule as many times as possible.

scholarly journals A Parallel Extension Rule-Based Algorithm for #SAT Problem Using Model-Counting Tree

IEEE Access ◽  
2018 ◽  
Vol 6 ◽  
pp. 41042-41049
Author(s):  
Naiyu Tian ◽  
Dantong Ouyang ◽  
Fengyu Jia ◽  
Meng Liu ◽  
Liming Zhang
Keyword(s):  
Rule Based ◽  
Sat Problem ◽  
Extension Rule ◽  
Model Counting ◽  
Parallel Extension

Extension Rule Algorithms Based on IMOM and IBOHM Heuristics Strategies

2009 ◽  
Vol 20 (6) ◽  
pp. 1521-1527 ◽  
Author(s):  
Ying LI ◽  
Ji-Gui SUN ◽  
Xia WU ◽  
Xing-Jun ZHU
Keyword(s):  
Extension Rule

A Linear-Time Solution for All-SAT Problem Based on P System

2018 ◽  
Vol 27 (2) ◽  
pp. 367-373 ◽  
Author(s):  
Ping GUO ◽  
Jian ZHU ◽  
Haizhu CHEN ◽  
Ruilong YANG
Keyword(s):  
Linear Time ◽  
P System ◽  
Sat Problem ◽  
Time Solution
Sign in / Sign up

Export Citation Format

Share Document