The subject of groundness analysis for (constraint) logic programs has been widely studied, and interesting domains have been proposed. Pos has been recognized has the most suitable domain for capturing the kind of dependencies arising in groundness analysis. Its (by now standard) implementation is directly based on reduced ordered binary-decision diagrams (ROBDDs), a well-known symbolic repres...

A “pairing function” J associates a unique natural number z to any two natural numbers x,y such that for two “unpairing functions” K and L, the equalities K(J(x,y))=x, L(J(x,y))=y and J(K(z),L(z))=z hold. Using pairing functions on natural number representations of truth tables, we derive an encoding for Binary Decision Diagrams with the unique property that its boolean evaluation faithfully mi...

In this paper we combine structural analysis of Petri nets with the symbolic representation of state spaces by Binary Decision Diagrams (BDDs). The size of a BDD is determined by the number of its variables and by their order. We suggest two methods based on structural properties (precisely one-token-P-invariants) which improve the encoding of states. One method attempts to derive a good variab...

The paper presents a new method for multivalued simulation of digital circuits based on calculation of Boolean derivatives on BDDs (or structural alternative graphs). A procedure for calculation of maximums of Boolean derivatives as the basis of multivalued simulation is given. The method is applicable for component level representations of digital circuits where as components arbitrary subcirc...

Symbolic model checking owes much of its success to powerful methods for reasoning about Boolean functions. The first symbolic model checkers used Ordered Binary Decision Diagrams (OBDDs) [1] to represent system transition relations and sets of system states [9]. All of the steps required for checking a model can be expressed as a series of operations on these representations, without ever enum...

This paper presents the application of the recently introduced implicit sets of products manipulations based on binary decision diagrams to the generation of irredundant prime covers of Boolean functions and of multiple output Boolean functions. The results obtained with this procedure are compared with the ones obtained with ESPRESSO and with the procedure presented in [11].

Binary Decision Diagrams (BDDs) have become the data structure of choice for representing discrete functions in some design and verification applications: They are compact and efficient to manipulate with strong theoretical underpinnings. However, and despite many appealing characteristics, BDDs are not a representation commonly considered for evolutionary computation (EC). The inherent difficu...

We present a study of the computational aspects of model checking based on binary decision diagrams (BDDs). By using a tracebased evaluation framework, we are able to generate realistic benchmarks and perform this evaluation collaboratively across several di erent BDD packages. This collaboration has resulted in signi cant performance improvements and in the discovery of several interesting cha...

We propose to design and study new techniques for description logic (DL) reasoning based on a prominent data structure that has been applied very successfully in various domains in computer science where one has to face the efficient representation and processing of large scale problems: Binary Decision Diagrams (BDDs). BDDs have been used very successfully for reasoning in propositional logics...

Almost the same types of restricted branching programs (or binary decision diagrams BDDs) are considered in complexity theory and in applications like hardware veriication. These models are read-once branching programs (free BDDs) and certain types of oblivious branching programs (ordered and indexed BDDs with k layers). The complexity of the satissability problem for these restricted branching...