Inconsistency check of a set of clauses using Petri net reductions

DOI10.1016/0016-0032(88)90047-6zbMath0641.68080OpenAlexW2043967474MaRDI QIDQ1100906

B. George

Publication date: 1988

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0016-0032(88)90047-6

zbMATH Keywords

first-order predicate logicinconsistencyproof procedurePetri net reductionplace/transition netresultionset of clauses

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• System modelling with high-level Petri nets
• A predicate-transition net model for parallel interpretation of logic programs
• Proof procedure and answer extraction in Petri net model of logic programs
• A Search Technique for Clause Interconnectivity Graphs
• A Proof Procedure Using Connection Graphs
• A Machine-Oriented Logic Based on the Resolution Principle
• A Computing Procedure for Quantification Theory

This page was built for publication: Inconsistency check of a set of clauses using Petri net reductions