Bibliographic Details
| Title: |
Logical inference of clauses based on Petri net models. |
| Authors: |
Chuang Lin1, Chanson, Samuel T.2 chanson@cs.ust.hk |
| Source: |
International Journal of Intelligent Systems. Sep98, Vol. 13 Issue 9, p821-840. 20p. |
| Subjects: |
Horn clauses, Inference (Logic), Petri nets, Logic programming, Graph theory, Nets (Mathematics) |
| Abstract: |
This paper extends the logical inference of Horn clauses in Petri net models to cover a large class of non-Horn clauses. Based on four-valued logic and the conflict transition concept, we show how the Petri net model for this class of non-Horn clauses can be constructed. The clause inference is solved by the T-invariant method or the fixpoint of markings. Both forward and backward inference can be used in our model. It is further shown that these techniques are efficient for the common classes of monotonic reasoning. © 1998 John Wiley & Sons, Inc. [ABSTRACT FROM AUTHOR] |
|
Copyright of International Journal of Intelligent Systems is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
