First-order logic and automated theorem proving (2nd ed.)
First-order logic and automated theorem proving (2nd ed.)
Generating hard satisfiability problems
Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
Perspectives on molecular computing
New Generation Computing
Membrane computing with external output
Fundamenta Informaticae
Journal of Computer and System Sciences
P systems with active membranes: attacking NP-complete problems
Journal of Automata, Languages and Combinatorics
Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
A Clause String DNA Algorithm for SAT
DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
Autonomous resolution based on DNA strand displacement
DNA'11 Proceedings of the 17th international conference on DNA computing and molecular programming
Hi-index | 0.00 |
Some DNA algorithms proposed in the literature for propositional satisfiability (SAT) are analyzed. In the class of 'extract model' the two sub-classes of 'literal string' and 'clause string' algorithms are compared and a new formulation of these algorithms is given in terms of membrane systems. Then, the duality between literal string and clause string formulation of SAT is expressed by means of 'singleton matrices' that introduce another membrane algorithm for SAT. The analysis developed suggests the perspective of membrane systems as problem-solving agents based on molecule localization, transformation, and propagation.