Sciweavers

1322 search results - page 112 / 265
» Unsound Theorem Proving
Sort
View
TPHOL
2008
IEEE
14 years 4 months ago
Certifying a Termination Criterion Based on Graphs, without Graphs
Although graphs are very common in computer science, they are still very difficult to handle for proof assistants as proving properties of graphs may require heavy computations. T...
Pierre Courtieu, Julien Forest, Xavier Urbain
ISTA
2004
13 years 11 months ago
Evidential Paradigm and Intelligent Mathematical Text Processing
Abstract: This paper presents the evidential paradigm of computer-supported mathematical assistance in "doing" mathematics and in reasoning activity. At present, the evid...
Alexander V. Lyaletski, Anatoly E. Doroshenko, And...
MLQ
2007
116views more  MLQ 2007»
13 years 9 months ago
Local sentences and Mahlo cardinals
Local sentences were introduced by Ressayre in [Res88] who proved certain remarkable stretching theorems establishing the equivalence between the existence of finite models for t...
Olivier Finkel, Stevo Todorcevic
IACR
2011
121views more  IACR 2011»
12 years 9 months ago
Two RFID Privacy Models in Front of a Court
In ASIACRYPT 2007, Vaudenay proposed a comprehensive privacy model for unilateral RFID schemes. Soon after, in ASIACCS 2008, Paise and Vaudenay presented a new version of the cited...
Mohammad Hassan Habibi, Mohammad Reza Aref
CADE
2005
Springer
14 years 10 months ago
A Proof-Producing Decision Procedure for Real Arithmetic
We present a fully proof-producing implementation of a quantifier elimination procedure for real closed fields. To our knowledge, this is the first generally useful proof-producing...
Sean McLaughlin, John Harrison