The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - June (1993 vol.5)
pp: 416-425
ABSTRACT
<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>
INDEX TERMS
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
CITATION
C. Lin, A. Chaudhury, A. Whinston, D.C. Marinescu, "Logical Inference of Horn Clauses in Petri Net Models", IEEE Transactions on Knowledge & Data Engineering, vol.5, no. 3, pp. 416-425, June 1993, doi:10.1109/69.224194
32 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool