Cellular solutions to some numerical NP-complete problems: A prolog implementation
This chapter is devoted to the study of numerical NP-complete problems in the framework of cellular systems with membranes, also called P systems (Pǎun, 1998). The chapter presents efficient solutions to the subset sum and the knapsack problems. These solutions are obtained via families of P systems...
| Autores: | , , , , |
|---|---|
| Formato: | capítulo de livro |
| Estado: | Versión aceptada para publicación |
| Fecha de publicación: | 2005 |
| País: | España |
| Recursos: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/157134 |
| Acesso em linha: | https://hdl.handle.net/11441/157134 https://doi.org/10.4018/978-1-59140-333-3.ch005 |
| Access Level: | acceso abierto |
| Palavra-chave: | P systems Membrane computing Prolog Programing for IA |
| Resumo: | This chapter is devoted to the study of numerical NP-complete problems in the framework of cellular systems with membranes, also called P systems (Pǎun, 1998). The chapter presents efficient solutions to the subset sum and the knapsack problems. These solutions are obtained via families of P systems with the capability of generating an exponential working space in polynomial time. A simulation tool for P systems, written in Prolog, is also described. As an illustration of the use of this tool, the chapter includes a session in the Prolog simulator implementing an algorithm to solve one of the above problems. |
|---|