Logical reasoning and Petri nets

Authors:
Kurt Lautenbach
Affiliations:
University of Koblenz-Landau, Koblenz, Germany
Venue:
ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
Year:
2003

Citing 3
Cited 1

Proof Procedure and Answer Extraction in Petri Net Model of Logic Programs

IEEE Transactions on Software Engineering
Reproducibility of the Empty Marking

ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets
A New Technique for Finding a Generating Family of Siphons, Traps and st-Components. Application to Colored Petri Nets

Papers from the 12th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1993

Automatic Web service composition based on Horn clauses and Petri nets

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The main result of the paper states that a set F of propositional-logic formulas is contradictory iff in all net representations of F the empty marking is reproducible.