Sciweavers

251 search results - page 5 / 51
» Lattice-Valued Binary Decision Diagrams
Sort
View
CCL
1994
Springer
13 years 11 months ago
Ordered Binary Decision Diagrams and the Davis-Putnam Procedure
Abstract. We compare two prominent decision procedures for propositional logic: Ordered Binary Decision Diagrams (obdds) and the DavisPutnam procedure. Experimental results indicat...
Tomás E. Uribe, Mark E. Stickel
DEXA
2004
Springer
83views Database» more  DEXA 2004»
13 years 11 months ago
Efficient Rule Base Verification Using Binary Decision Diagrams
As their field of application has evolved and matured, the importance of verifying knowledge-based systems is now widely recognized. Nevertheless, some problems have remained. In t...
Christophe Mues, Jan Vanthienen
ECSQARU
2007
Springer
14 years 1 months ago
Shared Ordered Binary Decision Diagrams for Dempster-Shafer Theory
The binary representation is widely used for representing focal sets of Dempster-Shafer belief functions because it allows to compute efficiently all relevant operations. However, ...
Norbert Lehmann
ERSHOV
2001
Springer
13 years 12 months ago
Resolution and Binary Decision Diagrams Cannot Simulate Each Other Polynomially
There are many different ways of proving formulas in proposition logic. Many of these can easily be characterized as forms of resolution (e.g. [12] and [9]). Others use so-called...
Jan Friso Groote, Hans Zantema
FPGA
2007
ACM
185views FPGA» more  FPGA 2007»
14 years 1 months ago
Power-aware FPGA logic synthesis using binary decision diagrams
Power consumption in field programmable gate arrays (FPGAs) has become an important issue as the FPGA market has grown to include mobile platforms. In this work we present a power...
Kevin Oo Tinmaung, David Howland, Russell Tessier