Token Evolution in an Ill-posed Constraint Petri-net

Hideaki Suzuki; Yoh Iwasa

Brain-inspired Information Communication Technologies

Research Article

Token Evolution in an Ill-posed Constraint Petri-net

Download634 downloads

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.4108/icst.bict.2014.257936,
    author={Hideaki Suzuki and Yoh Iwasa},
    title={Token Evolution in an Ill-posed Constraint Petri-net},
    proceedings={Brain-inspired Information Communication Technologies},
    publisher={ICST},
    proceedings_a={BIICT},
    year={2015},
    month={2},
    keywords={petri-net and/or-tree deductive inference token ill-posed problem},
    doi={10.4108/icst.bict.2014.257936}
}

Hideaki Suzuki
Yoh Iwasa
Year: 2015
Token Evolution in an Ill-posed Constraint Petri-net
BIICT
ICST
DOI: 10.4108/icst.bict.2014.257936

Hideaki Suzuki¹^,*, Yoh Iwasa²

1: National Institute of Information and Communications Technology
2: Kyushu University

*Contact email: hsuzuki@nict.go.jp

Abstract

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 evolve in the network. Incorporating these requirements would enable us to design highly distributed algorithms for deduction or parsing.

Keywords: petri-net and/or-tree deductive inference token ill-posed problem

Published: 2015-02-02
Publisher: ICST
Appears in: ACM Digital Library

: http://dx.doi.org/10.4108/icst.bict.2014.257936