Issue No. 03 - June (1993 vol. 5)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.224194
<p>Petri net models for the Horn clause form of propositional logic and of first-order predicate logic are studied. A net model for logical inconsistency check is proposed. Algorithms for computing T-invariants of Petri net models of logical inference systems are investigated. The algorithms are based on the idea of resolution and exploit the presence of one-literal, pure-literal, and splitting clauses to lead to faster computation. Algorithms for computing T-invariants of high-level Petri net (HLPN) models of predicate logic are presented.</p>
logical inference; Horn clauses; Petri net models; propositional logic; first-order predicate logic; net model; logical inconsistency check; T-invariants; resolution; one-literal; pure-literal; splitting clauses; Horn clauses; inference mechanisms; Petri nets
C. Lin, A. Chaudhury, A. Whinston and D. Marinescu, "Logical Inference of Horn Clauses in Petri Net Models," in IEEE Transactions on Knowledge & Data Engineering, vol. 5, no. , pp. 416-425, 1993.