1391 search results - page 196 / 279 » Completeness of Neighbourhood Logic |
128
click to vote
DAC
2002
ACM
16 years 7 months 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, ...
137
click to vote
DAC
2004
ACM
16 years 7 months ago
2004
ACM
Programmable circuit design has played an important role in improving design productivity over the last few decades. By imposing structure on the design, efficient automation of s...
277
click to vote
POPL
2004
ACM
16 years 6 months ago
2004
ACM
In prior work we introduced a pure type assignment system that encompasses a rich set of property types, including intersections, unions, and universally and existentially quantif...
144
click to vote
CADE
2007
Springer
16 years 6 months ago
2007
Springer
Abstract. Inductive definitions and rule inductions are two fundamental reasoning tools in logic and computer science. When inductive definitions involve binders, then Barendregt&#...
270
click to vote
CADE
2004
Springer
16 years 6 months ago
2004
Springer
Deduction modulo is a theoretical framework for reasoning modulo a congruence on propositions. Computational steps are thus removed from proofs, thus allowing a clean separatation...