Sciweavers

68 search results - page 5 / 14
» Three Tactic Theorem Proving
Sort
View
113
Voted
AMC
2006
104views more  AMC 2006»
14 years 11 months ago
Three counterexamples refuting Kieu's plan for "quantum adiabatic hypercomputation"; and some uncomputable quantum mechanical ta
-- Tien D. Kieu, in 10 papers posted to the quant-ph section of the xxx.lanl.gov preprint archive [some of which were also published in printed journals such as Proc. Royal Soc. A ...
Warren D. Smith
92
Voted
CADE
2006
Springer
15 years 12 months ago
Automatic Construction and Verification of Isotopy Invariants
Abstract. We extend our previous study of the automatic construction of isomorphic classification theorems for algebraic domains by considering the isotopy equivalence relation. Is...
Volker Sorge, Andreas Meier, Roy L. McCasland, Sim...
ENTCS
2006
122views more  ENTCS 2006»
14 years 11 months ago
Verification of Clock Synchronization Algorithms: Experiments on a Combination of Deductive Tools
We report on an experiment in combining Isabelle with automatic first-order arithmetic provers to increase automation on the verification of distributed protocols. As a case study...
Damián Barsotti, Leonor Prensa Nieto, Alwen...
TCS
2008
14 years 11 months ago
Polyhedra genus theorem and Euler formula: A hypermap-formalized intuitionistic proof
This article presents formalized intuitionistic proofs for the polyhedra genus theorem, the Euler formula and a sufficient condition of planarity. They are based on a hypermap mod...
Jean-François Dufourd
CORR
2010
Springer
95views Education» more  CORR 2010»
14 years 9 months ago
From Holant To #CSP And Back: Dichotomy For Holant$^c$ Problems
We explore the intricate interdependent relationship among counting problems, considered from three frameworks for such problems: Holant Problems, counting CSP and weighted H-color...
Jin-yi Cai, Sangxia Huang, Pinyan Lu