Token Evolution in an Ill-posed Constraint Petri-net

Hideaki Suzuki, Yoh Iwasa
2015 Proceedings of the 8th International Conference on Bio-inspired Information and Communications Technologies (formerly BIONETICS)  
Unification constraints of predicate logic or string rewriting rules of context free grammar can be represented by a Petri-net with the AND/OR tree structure. In this network, deductive inference or parsing can be formulated as a problem to find a solution subtree within which variables have consistent substitution. The paper focuses on a token-based heuristic method to solve such an ill-posed problem, and presents three prerequisite conditions to be satisfied by tokens which propagate and
more » ... e in the network. Incorporating these requirements would enable us to design highly distributed algorithms for deduction or parsing.
doi:10.4108/icst.bict.2014.257936 dblp:conf/bionetics/SuzukiI14 fatcat:4ypwny3yrrbspkgzpjuz5v7dii