Semantical considerations on nonmonotonic logic
Artificial Intelligence
Petri nets: an introduction
Modeling production rules by means of predicate transition networks
Information Sciences: an International Journal
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
A Predicate-Transition Net Model for Parallel Interpretation of Logic Programs
IEEE Transactions on Software Engineering
Proof Procedure and Answer Extraction in Petri Net Model of Logic Programs
IEEE Transactions on Software Engineering
Every logic program has a natural stratification and an iterated least fixed point model
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A procedural semantics for well founded negation in logic programs
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Logic programs with classical negation
Logic programming
Nonmonotonic reasoning: logical foundations of common sense
Nonmonotonic reasoning: logical foundations of common sense
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Making default inferences from logic programs
Computational Intelligence
Unfounded sets and well-founded semantics for general logic programs
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
A Petri Net Model for Reasoning in the Presence of Inconsistency
IEEE Transactions on Knowledge and Data Engineering
Constraint-centric workflow change analytics
Decision Support Systems
Design of a high speed logic engine for distributed decision support systems
Intelligent Decision Technologies
| Hi-index | 0.00 |
The formalism of nonmonotonic reasoning has been integrated into logic programming to define semantics for logic program with negation. Because a Petri net provides a uniform model for both the logic of knowledge and the control of inference, the class of high-level Petri nets called predicate/transition nets (PrT-nets) has been employed to study production rule based expert systems and Horn clause logic programs. We show that a PrT-net can implement the nonmonotonicity associated with a logic program with negation as well as the monotonicity of Horn clause logic program. In particular, we define a semantics for a normal logic program and implement it with PrT-net. We demonstrate that in the presence of inconsistency in a normal logic program, the semantics still works well by deducing meaningful answers. The variations and potential applications of the PrT-net are also addressed.