Efficient BDD Encodings for Partial Order Constraints with Application to Expert Systems in Software Verification

@inproceedings{Kurihara2004EfficientBE,
  title={Efficient BDD Encodings for Partial Order Constraints with Application to Expert Systems in Software Verification},
  author={Masahito Kurihara and Hisashi Kondo},
  booktitle={IEA/AIE},
  year={2004}
}
We introduce a class of computational problems called the partial order constraint satisfaction problems (POCSPs) and present three methods for encoding them as binary decision diagrams (BDDs). The first method, which simply augments domain constraints with the transitivity and asymmetry for partial orders, is improved by the second method, which introduces the notion of domain variables to reduce the number of Boolean variables. The third method turns out to be most useful for monotonic domain… CONTINUE READING
24 Citations
17 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 17 references

Introduction to the OBDD algorithm for the ATP community

  • J. S. Moore
  • Journal of Automated Reasoning,
  • 1994
1 Excerpt

Termination of rewriting : Ph.D thesis, Univ

  • J. Steinbach
  • 1994
1 Excerpt

Towards an interactive fault tree analyser

  • O. Coudert, J. C. Madre
  • Proc. IASTED Int. Conf. on Reliability, Quality…
  • 1992
1 Excerpt

Similar Papers

Loading similar papers…