Sciweavers

251 search results - page 15 / 51
» Lattice-Valued Binary Decision Diagrams
Sort
View
AAAI
2006
13 years 8 months ago
Controlled Search over Compact State Representations, in Nondeterministic Planning Domains and Beyond
Two of the most efficient planners for planning in nondeterministic domains are MBP and ND-SHOP2. MBP achieves its efficiency by using Binary Decision Diagrams (BDDs) to represent...
Ugur Kuter, Dana S. Nau
JAIR
2008
171views more  JAIR 2008»
13 years 7 months ago
AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Graphical Models
Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Multi-Valued Decision Diagrams (MDD) with AND nodes, in order to capture function ...
Robert Mateescu, Rina Dechter, Radu Marinescu 0002
CAV
2000
Springer
187views Hardware» more  CAV 2000»
13 years 11 months ago
Combining Decision Diagrams and SAT Procedures for Efficient Symbolic Model Checking
In this paper we show how to do symbolic model checking using Boolean Expression Diagrams (BEDs), a non-canonical representation for Boolean formulas, instead of Binary Decision Di...
Poul Frederick Williams, Armin Biere, Edmund M. Cl...
GLVLSI
1996
IEEE
145views VLSI» more  GLVLSI 1996»
13 years 11 months ago
Boolean Function Representation Using Parallel-Access Diagrams
Inthispaperweintroduceanondeterministiccounterpart to Reduced, Ordered Binary Decision Diagrams for the representation and manipulation of logic functions. ROBDDs are conceptually...
Valeria Bertacco, Maurizio Damiani
ISMVL
2007
IEEE
94views Hardware» more  ISMVL 2007»
14 years 1 months ago
Representations of Elementary Functions Using Edge-Valued MDDs
This paper proposes a method to represent elementary functions such as trigonometric, logarithmic, square root, and reciprocal functions using edge-valued multi-valued decision di...
Shinobu Nagayama, Tsutomu Sasao