Sciweavers

503 search results - page 81 / 101
» Interpolative Boolean Logic
Sort
View
CP
2007
Springer
15 years 3 months ago
Propagation = Lazy Clause Generation
Finite domain propagation solvers effectively represent the possible values of variables by a set of choices which can be naturally modelled as Boolean variables. In this paper we...
Olga Ohrimenko, Peter J. Stuckey, Michael Codish
ISCAS
2006
IEEE
94views Hardware» more  ISCAS 2006»
15 years 3 months ago
On the sensitivity of BDDs with respect to path-related objective functions
— Reduced ordered Binary Decision Diagrams (BDDs) are a data structure for efficient representation and manipulation of Boolean functions. They are frequently used in logic synt...
Rüdiger Ebendt, Rolf Drechsler
ASPDAC
2006
ACM
117views Hardware» more  ASPDAC 2006»
15 years 3 months ago
SAT-based optimal hypergraph partitioning with replication
We propose a methodology for optimal k-way partitioning with replication of directed hypergraphs via Boolean satisfiability. We begin by leveraging the power of existing and emerg...
Michael G. Wrighton, André DeHon
DNA
2005
Springer
118views Bioinformatics» more  DNA 2005»
15 years 3 months ago
Molecular Learning of wDNF Formulae
We introduce a class of generalized DNF formulae called wDNF or weighted disjunctive normal form, and present a molecular algorithm that learns a wDNF formula from training example...
Byoung-Tak Zhang, Ha-Young Jang
BIRTHDAY
2004
Springer
15 years 2 months ago
Duality for Three: Ternary Symmetry in Process Spaces
Ternary algebra has been used for detection of hazards in logic circuits since 1948. Process spaces have been introduced in 1995 act models of concurrent processes. Surprisingly, p...
Janusz A. Brzozowski, Radu Negulescu