Sciweavers

7991 search results - page 352 / 1599
» Using More Reasoning to Improve
Sort
View
187
Voted
TPHOL
2005
IEEE
16 years 11 days ago
A HOL Theory of Euclidean Space
We describe a formalization of the elementary algebra, topology and analysis of finite-dimensional Euclidean space in the HOL Light theorem prover. (Euclidean space is RN with the...
John Harrison
DAC
2006
ACM
16 years 7 months ago
SAT sweeping with local observability don't-cares
SAT sweeping is a method for simplifying an AND/INVERTER graph (AIG) by systematically merging graph vertices from the inputs towards the outputs using a combination of structural...
Qi Zhu, Nathan Kitchen, Andreas Kuehlmann, Alberto...
SYNASC
2006
IEEE
91views Algorithms» more  SYNASC 2006»
16 years 24 days ago
MATHsAiD: A Mathematical Theorem Discovery Tool
In the eld of automated reasoning, one of the most challenging (even if, perhaps, somewhat overlooked) problems thus far has been to develop a means of discerning, from amongst al...
Roy L. McCasland, Alan Bundy
LICS
1999
IEEE
15 years 11 months ago
Proof Techniques for Cryptographic Processes
Contextual equivalences for cryptographic process calculi, like the spi-calculus, can be used to reason about correctness of protocols, but their definition suffers from quantific...
Michele Boreale, Rocco De Nicola, Rosario Pugliese
COLING
2010
15 years 1 months ago
Urdu and Hindi: Translation and sharing of linguistic resources
Hindi and Urdu share a common phonology, morphology and grammar but are written in different scripts. In addition, the vocabularies have also diverged significantly especially in ...
Karthik Visweswariah, Vijil Chenthamarakshan, Nand...