Sciweavers

1224 search results - page 86 / 245
» Theory decision by decomposition
Sort
View
117
Voted
TPHOL
2005
IEEE
15 years 6 months 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
STOC
1989
ACM
117views Algorithms» more  STOC 1989»
15 years 4 months ago
On the Theory of Average Case Complexity
This paper takes the next step in developing the theory of average case complexity initiated by Leonid A Levin. Previous works Levin 84, Gurevich 87, Venkatesan and Levin 88] have...
Shai Ben-David, Benny Chor, Oded Goldreich, Michae...
RSEISP
2007
Springer
15 years 6 months ago
Checking Brain Expertise Using Rough Set Theory
Most information about the external world comes from our visual brain. However, it is not clear how this information is processed. We will analyze brain responses using machine lea...
Andrzej W. Przybyszewski
109
Voted
NIPS
2004
15 years 2 months ago
Theories of Access Consciousness
Theories of access consciousness address how it is that some mental states but not others are available for evaluation, choice behavior, and verbal report. Farah, O'Reilly, a...
Michael D. Colagrosso, Michael C. Mozer
117
Voted
AISC
2008
Springer
15 years 2 months ago
MetiTarski: An Automatic Prover for the Elementary Functions
Many inequalities involving the functions ln, exp, sin, cos, etc., can be proved automatically by MetiTarski: a resolution theorem prover (Metis) modified to call a decision proced...
Behzad Akbarpour, Lawrence C. Paulson