A NEW RESOLUTION INFERENCE BY PETRI NET
- 10.2991/iske.2007.240How to use a DOI?
- Resolution inference; Petri net; T-invariant; Cutting
This paper provides a method of resolution inference by Petri net, which is different from the method of T-invariant. Only through reducing the structure of Petri net model step by step, the resolution inference can be accomplished. We discuss inferences not only ground clause set but also first-order clause set. Their completeness theorems are proved further. All the computations of inference can be finished in polynomial time.
- © 2007, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Shifen Xia AU - Yingbin Qin AU - Yang Xu PY - 2007/10 DA - 2007/10 TI - A NEW RESOLUTION INFERENCE BY PETRI NET BT - Proceedings of the 2007 International Conference on Intelligent Systems and Knowledge Engineering (ISKE 2007) PB - Atlantis Press SP - 1418 EP - 1422 SN - 1951-6851 UR - https://doi.org/10.2991/iske.2007.240 DO - 10.2991/iske.2007.240 ID - Xia2007/10 ER -