Abstract
AbstractIn this paper, we develop computing machinery within the framework of the String Multiset Rewriting calculus (SMSR), as defined by Barbuti et al. [4], to solve the SAT problem in linear time regarding the number of variables of a given conjunctive normal form. This shows that SMSR can be considered a computational model capable of significantly reducing the time requirement of classical decision problems.
Funder
European Union, European Social Fund
University of Debrecen
Publisher
Springer Science and Business Media LLC
Reference23 articles.
1. Alhazov A, Cojocaru S, Gheorghe M, Rogozhin Y, Rozenberg G, Salomaa A (eds.) (2014) Membrane Computing. CMC 2013. Lecture Notes in Computer Science, vol. 8340, Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-54239-8_14
2. Ausiello G, Karhumäki J, Mauri G, Ong L (eds.) (2008) Fifth IFIP international conference on theoretical computer science-TCS 2008. IFIP International federation for information processing, Springer, vol. 273, Boston, MA. https://doi.org/10.1007/978-0-387-09680-3_18
3. Bagossy A, Battyányi P, An encoding of the $$\lambda$$-calculus in the String MultiSet Rewriting calculus, Acta Informatica (to appear)
4. Barbuti R, Caravagna G, Maggiolo-Schettini A, Milazzo P (2008) An intermediate language for the simulation of biological systems. Electron Notes Theoret Comput Sci 194:19–34
5. Barbuti R, Maggiolo-Schettini A, Milazzo P, Troina A (2006) A calculus of looping sequences for modelling microbiological systems. Fund Inform 72:21–35