Sciweavers

1322 search results - page 43 / 265
» Unsound Theorem Proving
Sort
View
CADE
2007
Springer
14 years 8 months ago
First Order Reasoning on a Large Ontology
We present results of our work on using first order theorem proving to reason over a large ontology (the Suggested Upper Merged Ontology ? SUMO), and methods for making SUMO suita...
Adam Pease, Geoff Sutcliffe
HICSS
1994
IEEE
105views Biometrics» more  HICSS 1994»
13 years 11 months ago
A Methodology for Equational Reasoning
1 This paper presents a methodology to guide equational reasoning in a goal directed way. Suggested by rippling methods developed in the eld of inductive theorem proving we use att...
Jürgen Cleve, Dieter Hutter
ASM
2010
ASM
13 years 10 months ago
Automatic Verification for a Class of Proof Obligations with SMT-Solvers
Abstract. Software development in B and Event-B generates proof obligations that have to be discharged using theorem provers. The cost of such developments therefore depends direct...
David Déharbe
CORR
2008
Springer
129views Education» more  CORR 2008»
13 years 7 months ago
A polytime proof of correctness of the Rabin-Miller algorithm from Fermat's little theorem
Although a deterministic polytime algorithm for primality testing is now known ([4]), the Rabin-Miller randomized test of primality continues being the most efficient and widely u...
Grzegorz Herman, Michael Soltys
INFOCOM
2002
IEEE
14 years 16 days ago
Real-time Model and Convergence Time of BGP
—BGP allows routers to use general preference policies for route selection. This paper studies the impact of these policies on convergence time. We first describe a real-time mo...
Davor Obradovic