Approximate Probabilistic Parallel Multiset Rewriting Using MCMC

Probabilistic parallel multiset rewriting systems (PPMRS) model probabilistic, dynamic systems consisting of multiple, (inter-) acting agents and objects (entities), where multiple individual actions can be performed in parallel. The main computational challenge in these approaches is computing the distribution of parallel actions (compound actions), that can be formulated as a constraint satisfaction problem (CSP). Unfortunately, computing the partition function for this distribution exactly is infeasible, as it requires to enumerate all solutions of the CSP, which are subject to a combinatorial explosion.

[1]  Martin C. Cooper,et al.  Soft arc consistency revisited , 2010, Artif. Intell..

[2]  Gheorghe Paun,et al.  Membrane Computing , 2002, Natural Computing Series.

[3]  Gérard Berry,et al.  The chemical abstract machine , 1989, POPL '90.

[4]  Kristian Kersting,et al.  Lifted Filtering via Exchangeable Decomposition , 2018, IJCAI.

[5]  Olle Häggström.  Finite Markov Chains and Algorithmic Applications , 2002 .

[6]  Alex Kamenev,et al.  Extinction in the Lotka-Volterra model. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[7]  Vibhav Gogate,et al.  SampleSearch: Importance sampling in presence of determinism , 2011, Artif. Intell..

[8]  Thomas Kirste,et al.  LiMa: Sequential Lifted Marginal Filtering on Multiset State Descriptions , 2017, KI.

[9]  Adnan Darwiche,et al.  On probabilistic inference by weighted model counting , 2008, Artif. Intell..

[10]  Giancarlo Mauri,et al.  Dynamical probabilistic P systems , 2006, Int. J. Found. Comput. Sci..

[11]  Bart Selman,et al.  Taming the Curse of Dimensionality: Discrete Integration by Hashing and Optimization , 2013, ICML.

[12]  Sanjit A. Seshia,et al.  Distribution-Aware Sampling and Weighted Model Counting for SAT , 2014, AAAI.

[13]  Bart Selman,et al.  A New Approach to Model Counting , 2005, SAT.

[14]  L. Schwartz.  Analytical Theory Of Biological Populations , 2016 .

[15]  Jean-Louis Giavitto,et al.  MGS: a Rule-Based Programming Language for Complex Objects and Collections , 2001, Electron. Notes Theor. Comput. Sci..

[16]  Gabriel Ciobanu,et al.  Probabilistic transitions for P systems , 2007 .

[17]  Paolo Milazzo,et al.  Maximally Parallel Probabilistic Semantics for Multiset Rewriting , 2011, Fundam. Informaticae.

[18]  Gordon D. Plotkin,et al.  Multi-level modelling via stochastic multi-level multiset rewriting† , 2013, Mathematical Structures in Computer Science.

[19]  Thomas Schiex,et al.  Valued Constraint Satisfaction Problems: Hard and Easy Problems , 1995, IJCAI.