226 search results - page 31 / 46 » BDDs and Automated Deduction |
118
click to vote
DAC
2003
ACM
16 years 5 months ago
2003
ACM
In some cases, minimum Sum-Of-Products (SOP) expressions of Boolean functions can be derived by detecting decomposition and observing the functional properties such as unateness, ...
158
click to vote
CADE
2007
Springer
16 years 4 months ago
2007
Springer
We bring together two recent trends in description logic (DL): lightweight DLs in which the subsumption problem is tractable and conservative extensions as a central tool for forma...
110
click to vote
TPHOL
2006
IEEE
15 years 10 months ago
2006
IEEE
We extract on the computer a number of moduli of uniform continuity for the first few elements of a sequence of closed terms t of G¨odel’s T of type (N→N)→(N→N). The gen...
130
click to vote
LPAR
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Matching is a basic operation extensively used in computation. Second-order matching, in particular, provides an adequate environment for expressing program transformatio...
146
click to vote
VLDB
1990
ACM
15 years 8 months ago
1990
ACM
Database programming requires having the knowledge of database semantics both to maintain database integrity and to explore more optimization opportunities. Automated programming ...