A Logical Representation of P Colonies: An Introduction
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...
Saved in:
Published in | Enjoying Natural Computing Vol. 11270; pp. 66 - 76 |
---|---|
Main Authors | , , , |
Format | Book Chapter |
Language | English |
Published |
Switzerland
Springer International Publishing AG
2018
Springer International Publishing |
Series | Lecture Notes in Computer Science |
Online Access | Get full text |
Cover
Loading…
Summary: | 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. |
---|---|
ISBN: | 9783030002640 3030002640 |
ISSN: | 0302-9743 1611-3349 |
DOI: | 10.1007/978-3-030-00265-7_6 |