Multiset Constraints and P Systems
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.
Unable to display preview. Download preview PDF.
- 1.K. R. Apt. From Logic Programming to Prolog. International Series in Computer Science. Prentice Hall, 1997.Google Scholar
- 5.J.-P. Bodeveix, C. Percebois, S. Majoul. An Object-Oriented Coordination Model based on Multiset Rewriting. In Proc. of Ninth International Conference on Parallel and Distributed Computing Systems. Dijon, France, 1996.Google Scholar
- 6.I. Cervesato, N. Durgin, P. Lincoln, J. Mitchell, and A. Scedrov. Relating Strands and Multiset Rewriting for Security Protocol Analysis In P. Syverson, ed., 13th IEEE Computer Security Foundations Workshop—CSFW’00, pp. 35–51, 2000.Google Scholar
- 7.P. Ciancarini, D. Fogli, and M. Gaspari. A Logic Language Based on GAMMA-like Multiset Rewriting. In R. Dyckho., H. Herre, P. Schroeder-Heister eds., Extensions of Logic Programming, 5th International Workshop, LNCS 1050, 1996, pp. 83–101.Google Scholar
- 10.A. Dovier, C. Piazza, and G. Rossi. A uniform approach to constraintsolving for lists, multisets, compact lists, and sets. Technical Report, Dipartimento di Matematica, Universit`a di Parma, no. 235, July 2000 (available at http://prmat.math.unipr.it/-gianfr/PAPERS/RRPR235.ps).
- 13.G. Gupta and E. Pontelli. Optimization Schemas for Parallel Implementation of Nondeterministic Languages. Int. Parallel Proc. Symposium, IEEE, pp. 428–435, 1997.Google Scholar
- 14.C. Hankin, D. Le Métayer, and D. Sands. A Parallel Programming Style and Its Algebra of Programs. In Proc. Conf. on Parallel Architecture and Languages Europe (PARLE 93), vol. 694 of LNCS, 367–378, Springer-Verlag, Berlin, 1993.Google Scholar
- 15.J. Herbrand. Recherches sur la theorie de la demonstration. Master’s thesis, Universit’e de Paris, 1930. Also in Ecrits logiques de Jacques Herbrand, PUF, Paris, 1968.Google Scholar
- 18.K. Marriott, B. Meyer, and K. B. Wittenburg. A survey of visual language specification and recognition. In K. Marriott and B. Meyer, editors, Visual Language Theory pages 5–85, Springer, 1998.Google Scholar
- 19.A. Mal’cev. Axiomatizable Classes of Locally Free Algebras of Various Types. In The Metamathematics of Algebraic Systems, Collected Papers, Ch. 23. North Holland, 1971.Google Scholar
- 23.G. Rossi. The Languages CLP(SET) and CLP(BAG) User Manuals and Running Interpreters. In http://prmat.math.unipr.it/-gianfr/setlog.Home.html.