Selected papers of the Second Workshop on Concurrency and compositionality
Programming by multiset transformation
Communications of the ACM
From logic programming to Prolog
From logic programming to Prolog
A survey of visual language specification and recognition
Visual language theory
A uniform axiomatic view of lists, multisets, and sets, and the relevant unification algorithms
Fundamenta Informaticae
Journal of Computer and System Sciences
An Efficient Unification Algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
Sets and constraint logic programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
P systems with active membranes: attacking NP-complete problems
Journal of Automata, Languages and Combinatorics
Optimization Schemas for Parallel Implementation of Nondeterministic Languages and Systems
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
A Parallel Programming Style and Its Algebra of Programs
PARLE '93 Proceedings of the 5th International PARLE Conference on Parallel Architectures and Languages Europe
Embedding Multiset Constraints into a Lazy Functional Logic Language
PLILP '98/ALP '98 Proceedings of the 10th International Symposium on Principles of Declarative Programming
A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
A Logic Language based on GAMMA-like Multiset Rewriting
ELP '96 Proceedings of the 5th International Workshop on Extensions of Logic Programming
Relating Strands and Multiset Rewriting for Security Protocol Analysis
CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
| Hi-index | 0.00 |
Multisets are the fundamental data structure of P systems. In this paper we relate P systems with the language and theory for multisets presented in [9.] This allows us, on the one hand, to define and implement P systems using multiset constraints in a constraint logic programming framework, and, on the other hand, to define and implement constraint solving procedures used to test multiset constraint satisfiability in terms of P systems with active membranes. While the former can be exploited to provide a precise formulation of a P system, as well as a working implementation of it, based on a first-order theory, the latter provides a way to obtain a P system for a given problem (in particular, NP problems) starting from a rather natural encoding of its solution in terms of multiset constraints.