Proof procedure and answer extraction in Petri net model of logic programs

DOI10.1109/32.21746MaRDI QIDQ3817016zbMATH OpenOpenAlexFDO

Authors George Peterka, Tadao Murata

Publication date 1989

Published in IEEE Transactions on Software Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/32.21746

zbMATH Keywords

answer extractionHorn clauseinvariantlogic programmingPetri netstheorem proving

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 125887
• scientific article; zbMATH DE number 3988724
• scientific article; zbMATH DE number 1337888
• Completeness results for linear logic on Petri nets
• A Petri net model for probabilistic logic

Cited in

(8)

• Inconsistency check of a set of clauses using Petri net reductions
• Higher-order Petri net models based on artificial neural networks
• Knowledge representation and reasoning using fuzzy Pr/T net-systems
• Inference approach based on Petri nets
• scientific article; zbMATH DE number 3900171 (Why is no real title available?)
• A Petri net model for probabilistic logic
• Some issues about Petri net application to manufacturing and process supervisory control
• Complete inference via knowledge Petri nets and resolution rules

This page was built for publication: Proof procedure and answer extraction in Petri net model of logic programs

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