Logical Inference of Horn Clauses in Petri Net Models

  • Authors:
  • C. Lin;A. Chaudhury;A. Whinston;D. C. Marinescu

  • Affiliations:
  • -;-;-;-

  • Venue:
  • IEEE Transactions on Knowledge and Data Engineering
  • Year:
  • 1993

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.