518 search results - page 74 / 104 » Automating Proofs in Category Theory |
DAC
2002
ACM
16 years 23 days ago
2002
ACM
This paper gives a simple but nontrivial set of local transformation rules for Control-NOT(CNOT)-based combinatorial circuits. It is shown that this rule set is complete, namely, ...
DAC
2005
ACM
16 years 23 days ago
2005
ACM
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
111
click to vote
ICSE
2008
IEEE-ACM
16 years 18 days ago
2008
IEEE-ACM
According to Parnas's information hiding principle and Baldwin and Clark's design rule theory, the key step to decomposing a system into modules is to determine the desi...
GECCO
2005
Springer
15 years 5 months ago
2005
Springer
Reactive real-time systems have to react to external events within time constraints: Triggered tasks must execute within deadlines. The goal of this article is to automate, based ...
106
click to vote
TPHOL
2005
IEEE
15 years 5 months ago
2005
IEEE
The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permu...