DocumentCode :
924689
Title :
Logical inference of Horn clauses in Petri net models
Author :
Lin, Chuang ; Chaudhury, A. ; Whinston, Andrew B. ; Marinescu, Dan C.
Author_Institution :
State Inf. Center, Inf. Sci. Inst., Beijing, China
Volume :
5
Issue :
3
fYear :
1993
fDate :
6/1/1993 12:00:00 AM
Firstpage :
416
Lastpage :
425
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
Keywords :
Horn clauses; Petri nets; inference mechanisms; Horn clauses; Petri net models; T-invariants; first-order predicate logic; logical inconsistency check; logical inference; net model; one-literal; propositional logic; pure-literal; resolution; splitting clauses; Artificial intelligence; Decision support systems; Deductive databases; Expert systems; Helium; Inference algorithms; Information management; Logic programming; Management information systems; Petri nets;
fLanguage :
English
Journal_Title :
Knowledge and Data Engineering, IEEE Transactions on
Publisher :
ieee
ISSN :
1041-4347
Type :
jour
DOI :
10.1109/69.224194
Filename :
224194
Link To Document :
بازگشت