CIENCIALA, Luděk, Lucie CIENCIALOVÁ, Erzsébet CSUHAJ-VARJÚ and Petr SOSÍK. A logical representation of P colonies: An introduction. Online. In Enjoying Natural Computing. 11270 LNCS. Cham: Springer Verlag, 2018, p. 66-76. Lecture Notes in Computer Science. ISBN 978-3-030-00265-7. Available from: https://dx.doi.org/10.1007/978-3-030-00265-7_6.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name A logical representation of P colonies: An introduction
Authors CIENCIALA, Luděk (203 Czech Republic, guarantor, belonging to the institution), Lucie CIENCIALOVÁ (203 Czech Republic, belonging to the institution), Erzsébet CSUHAJ-VARJÚ (348 Hungary) and Petr SOSÍK (203 Czech Republic, belonging to the institution).
Edition 11270 LNCS. Cham, Enjoying Natural Computing, p. 66-76, 11 pp. Lecture Notes in Computer Science, 2018.
Publisher Springer Verlag
Other information
Original language English
Type of outcome Chapter(s) of a specialized book
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher Germany
Confidentiality degree is not subject to a state or trade secret
Publication form electronic version available online
WWW URL
RIV identification code RIV/47813059:19240/18:A0000340
Organization Filozoficko-přírodovědecká fakulta – Slezská univerzita v Opavě – Repository
ISBN 978-3-030-00265-7
Doi http://dx.doi.org/10.1007/978-3-030-00265-7_6
Keywords in English Formal languages; Context free grammars; P colonies
Tags SGS132016, ÚI
Tags International impact, Reviewed
Links LQ1602, research and development project.
Changed by Changed by: Mgr. Kamil Matula, učo 1145. Changed: 28/3/2019 16:42.
Abstract
We introduce a new way of representation of computation in P colonies. It is based on logical values, propositional logic and rule-based systems. A configuration of a P colony is transformed into a data structure based on a system of stacks. We present a conversion of conditions of applicability of rules, programs, multisets of programs and complete computational steps as propositional formulas in the disjunctive normal form. This representation allows, among others, to derive new results concerning the complexity of execution of computational steps of a P colony.
Print
Add to clipboard Displayed: 3/5/2024 12:07