A Decompositional Approach for Computing Least Fixed-Points of Datalog Programs with Z-Counters

@article{Fribourg1997ADA,
  title={A Decompositional Approach for Computing Least Fixed-Points of Datalog Programs with Z-Counters},
  author={Laurent Fribourg and Hans Ols{\'e}n},
  journal={Constraints},
  year={1997},
  volume={2},
  pages={305-335}
}
We present a method for characterizing the least fixed-points of a certain class of Datalog programs in Presburger arithmetic. The method consists in applying a set of rules that transform general computation paths into “canonical” ones. We use the method for treating the problem of reachability in the field of Petri nets, thus relating some unconnected results and extending them in several directions. 

From This Paper

Figures, tables, and topics from this paper.
28 Citations
38 References
Similar Papers

Similar Papers

Loading similar papers…