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
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
Solution of a Satisfiability Problem on a Gel-Based DNA Computer
DNA '00 Revised Papers from the 6th 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
Aqueous Solutions of Algorithmic Problems: Emphasizing Knights on a 3 x 3
DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
A Proposal of DNA Computing on Beads with Application to SAT Problems
DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
Membrane Computing with External Output
Fundamenta Informaticae
On efficient algorithms for SAT
CMC'12 Proceedings of the 13th international conference on Membrane Computing
| 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.