Sciweavers

1684 search results - page 53 / 337
» The lexicographic decision function
Sort
View
ENTCS
2007
121views more  ENTCS 2007»
14 years 9 months ago
Rewrite-Based Decision Procedures
The rewrite-based approach to satisfiability modulo theories consists of using generic theorem-proving strategies for first-order logic with equality. If one can prove that an i...
Maria Paola Bonacina, Mnacho Echenim
APPROX
2007
Springer
153views Algorithms» more  APPROX 2007»
15 years 4 months ago
Distribution-Free Testing Lower Bounds for Basic Boolean Functions
: In the distribution-free property testing model, the distance between functions is measured with respect to an arbitrary and unknown probability distribution D over the input dom...
Dana Glasner, Rocco A. Servedio
CORR
2008
Springer
142views Education» more  CORR 2008»
14 years 10 months ago
Declarative Combinatorics: Boolean Functions, Circuit Synthesis and BDDs in Haskell
We describe Haskell implementations of interesting combinatorial generation algorithms with focus on boolean functions and logic circuit representations. First, a complete exact c...
Paul Tarau
CODES
2000
IEEE
15 years 1 months ago
On the roles of functions and objects in system specification
We present an analysis of the benefits and drawbacks of function and object based models in system specification. Functional models should be used for functional design space expl...
Axel Jantsch, Ingo Sander
DATE
2006
IEEE
133views Hardware» more  DATE 2006»
15 years 3 months ago
Analysis and synthesis of quantum circuits by using quantum decision diagrams
Quantum information processing technology is in its pioneering stage and no proficient method for synthesizing quantum circuits has been introduced so far. This paper introduces a...
Afshin Abdollahi, Massoud Pedram