Ackermann Encoding, Bisimulations, and OBDDs

Details Ackermann Encoding, Bisimulations, and OBDDs Ackermann Encoding, Bisimulations, and OBDDs

2003-11-16

arxiv.org/abs/cs/0311018v1

Computer Science

Logic in Computer Science

To appear on 'Theory and Practice of Logic Programming'

Scientific paper

We propose an alternative way to represent graphs via OBDDs based on the observation that a partition of the graph nodes allows sharing among the employed OBDDs. In the second part of the paper we present a method to compute at the same time the quotient w.r.t. the maximum bisimulation and the OBDD representation of a given graph. The proposed computation is based on an OBDD-rewriting of the notion of Ackermann encoding of hereditarily finite sets into natural numbers.

Affiliated with

Also associated with

No associations

Rating

Ackermann Encoding, Bisimulations, and OBDDs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Ackermann Encoding, Bisimulations, and OBDDs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Ackermann Encoding, Bisimulations, and OBDDs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-635190