Sciweavers

3658 search results - page 671 / 732
» The logic of proofs, semantically
Sort
View
TIT
2008
140views more  TIT 2008»
13 years 8 months ago
A Resource Framework for Quantum Shannon Theory
Quantum Shannon theory is loosely defined as a collection of coding theorems, such as classical and quantum source compression, noisy channel coding theorems, entanglement distilla...
Igor Devetak, Aram Wettroth Harrow, Andreas J. Win...
BMCBI
2004
126views more  BMCBI 2004»
13 years 8 months ago
A probabilistic model for the evolution of RNA structure
Background: For the purposes of finding and aligning noncoding RNA gene- and cis-regulatory elements in multiple-genome datasets, it is useful to be able to derive multi-sequence ...
Ian Holmes
CORR
2000
Springer
103views Education» more  CORR 2000»
13 years 8 months ago
Automatic Termination Analysis of Programs Containing Arithmetic Predicates
For logic programs with arithmetic predicates, showing termination is not easy, since the usual order for the integers is not well-founded. A new method, easily incorporated in th...
Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua S...
JCSS
2000
121views more  JCSS 2000»
13 years 7 months ago
The Closure of Monadic NP
It is a well-known result of Fagin that the complexity class NP coincides with the class of problems expressible in existential second-order logic ( 1 1), which allows sentences c...
Miklós Ajtai, Ronald Fagin, Larry J. Stockm...
JACM
2002
163views more  JACM 2002»
13 years 7 months ago
Formal verification of standards for distance vector routing protocols
We show how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols. We do three case studies: ...
Karthikeyan Bhargavan, Davor Obradovic, Carl A. Gu...