Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
2,299
Multiple Boolean Relations
- in Workshop Notes of the Intl. Workshop on Logic Synthesis, (Tahoe City, CA
, 1993
"... Flexibility in selecting the Boolean functions to implement a digital circuit has various forms which have been studied in the literature such as don't care conditions, Boolean relations, and synchronous recurrence equations. Each of these represents a particular degree of flexibility that may ..."
Abstract
-
Cited by 8 (4 self)
- Add to MetaCart
Flexibility in selecting the Boolean functions to implement a digital circuit has various forms which have been studied in the literature such as don't care conditions, Boolean relations, and synchronous recurrence equations. Each of these represents a particular degree of flexibility that may
Preferred representations of Boolean relations
- ELECTRONIC COLLOQUIUM ON COMPUTATIONAL COMPLEXITY, REPORT NO. 119 (2005)
, 2005
"... We introduce the notion of a plain basis for a co-clone in Post’s lattice. Such a basis is a set of relations B such that every constraint C over a relation in the co-clone is logically equivalent to a conjunction of equalities and constraints over B and the same variables as C; this differs from th ..."
Abstract
-
Cited by 5 (2 self)
- Add to MetaCart
We introduce the notion of a plain basis for a co-clone in Post’s lattice. Such a basis is a set of relations B such that every constraint C over a relation in the co-clone is logically equivalent to a conjunction of equalities and constraints over B and the same variables as C; this differs from
From boolean relations to control software
- in ICSEA 2011
"... Abstract—Many software as well digital hardware automatic synthesis methods define the set of implementations meeting the given system specifications with a boolean relation K. In such a context a fundamental step in the software (hardware) synthesis process is finding effective solutions to the fun ..."
Abstract
-
Cited by 5 (5 self)
- Add to MetaCart
Abstract—Many software as well digital hardware automatic synthesis methods define the set of implementations meeting the given system specifications with a boolean relation K. In such a context a fundamental step in the software (hardware) synthesis process is finding effective solutions
A recursive paradigm to solve Boolean relations
- Proc. DAC ’04
"... A recursive algorithm for solving Boolean relations is presented. It provides several features: wide exploration of solutions, parametrizable cost function and efficiency. The experimental results show the applicability of the method and tangible improvements with regard to previous heuristic approa ..."
Abstract
-
Cited by 10 (1 self)
- Add to MetaCart
A recursive algorithm for solving Boolean relations is presented. It provides several features: wide exploration of solutions, parametrizable cost function and efficiency. The experimental results show the applicability of the method and tangible improvements with regard to previous heuristic
Interpolating functions from large Boolean relations
- In Proc. Int’l Conf. on Computer-Aided Design (ICCAD
, 2009
"... Boolean relations are an important tool in system synthesis and verification to characterize solutions to a set of Boolean constraints. For physical realization as hardware, a deter-ministic function often has to be extracted from a relation. Prior methods however are unlikely to handle large proble ..."
Abstract
-
Cited by 8 (3 self)
- Add to MetaCart
Boolean relations are an important tool in system synthesis and verification to characterize solutions to a set of Boolean constraints. For physical realization as hardware, a deter-ministic function often has to be extracted from a relation. Prior methods however are unlikely to handle large
Local Search for Boolean Relations on the Basis of Unit Propagation
- In Proceedings of Design, Automation and Test in Europe Conference (DATE
, 2003
"... We propose a method for local search of Boolean relations relating variables of a CNF formula. The method is to branch on small subsets of the set of CNF variables and to analyze results of unit propagation. By taking into account variable value assignments deduced during the unit propagation proced ..."
Abstract
-
Cited by 10 (0 self)
- Add to MetaCart
We propose a method for local search of Boolean relations relating variables of a CNF formula. The method is to branch on small subsets of the set of CNF variables and to analyze results of unit propagation. By taking into account variable value assignments deduced during the unit propagation
Access path selection in a relational database management system
, 1979
"... ABSTRACT: In a high level query and data manipulation language such as SQL, requests are stated non-procedurally, without reference to access paths. This paper describes how System R chooses access paths for both simple (single relation) and complex queries (such as joins), given a user specificatio ..."
Abstract
-
Cited by 587 (1 self)
- Add to MetaCart
specification of desired data as a boolean expression of predicates. System R is an experimental database management system developed to carry out research on the relational model of data. System R was designed and built by members of the IBM San Jose Research'Laboratory. 1.
Synthesizing control software from boolean relations
- Int. J. on Advances in SW
"... Abstract—Many software as well digital hardware automatic synthesis methods define the set of implementations meeting the given system specifications with a boolean relation K. In such a context a fundamental step in the software (hardware) synthesis process is finding effective solutions to the fun ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
Abstract—Many software as well digital hardware automatic synthesis methods define the set of implementations meeting the given system specifications with a boolean relation K. In such a context a fundamental step in the software (hardware) synthesis process is finding effective solutions
Results 1 - 10
of
2,299
