Complete inference via knowledge Petri nets and resolution rules

DOI10.1016/J.INS.2024.120816MaRDI QIDQ6564892zbMATH OpenFDO

Authors KaiCheng Tan, Jiliang Luo, Zepei Li, Jiazhong Zhou, Zhiwu Li

Publication date 1 July 2024

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.INS.2024.120816

zbMATH Keywords

inference methodPetri netpropositional logicresolution

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Logic in artificial intelligence (68T27) Knowledge representation (68T30) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Recommendations

• Inference approach based on Petri nets
• scientific article; zbMATH DE number 4106816
• An operator fuzzy logic system and its inference algorithm of Petri net
• A fuzzy Petri net for knowledge representation and reasoning
• scientific article; zbMATH DE number 4033141

Cites work

• A Machine-Oriented Logic Based on the Resolution Principle
• A new paradigm for uncertain knowledge representation by plausible Petri nets
• A predicate-transition net model for parallel interpretation of logic programs
• Efficiency and Completeness of the Set of Support Strategy in Theorem Proving
• Feedback control of Petri nets based on place invariants
• Graph-Based Algorithms for Boolean Function Manipulation
• scientific article; zbMATH DE number 2088665 (Why is no real title available?)
• scientific article; zbMATH DE number 3902027 (Why is no real title available?)
• scientific article; zbMATH DE number 1882060 (Why is no real title available?)
• scientific article; zbMATH DE number 3310921 (Why is no real title available?)
• scientific article; zbMATH DE number 3415409 (Why is no real title available?)
• Inference approach based on Petri nets
• Logical Reasoning and Petri Nets
• On finding short resolution refutations and small unsatisfiable subsets
• Performance of clause selection heuristics for saturation-based theorem proving
• Petri-Net Controller Synthesis for Partially Controllable and Observable Discrete Event Systems
• Proof procedure and answer extraction in Petri net model of logic programs
• Resolution, Refinements, and Search Strategies: A Comparative Study
• Selecting the selection
• Structural Controller for Logical Expression of Linear Constraints on Petri Nets
• The complexity of theorem-proving procedures
• The search efficiency of theorem proving strategies

This page was built for publication: Complete inference via knowledge Petri nets and resolution rules

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6564892)