Sciweavers

1101 search results - page 96 / 221
» Forcing in proof theory
Sort
View
CADE
2007
Springer
15 years 6 months ago
Semantic Selection of Premisses for Automated Theorem Proving
We develop and implement a novel algorithm for discovering the optimal sets of premisses for proving and disproving conjectures in first-order logic. The algorithm uses interpret...
Petr Pudlak
PLPV
2011
ACM
14 years 3 months ago
Local actions for a curry-style operational semantics
Soundness proofs of program logics such as Hoare logics and type systems are often made easier by decorating the operational semantics with information that is useful in the proof...
Gordon Stewart, Andrew W. Appel
AR
2002
157views more  AR 2002»
15 years 15 days ago
Acquiring state from control dynamics to learn grasping policies for robot hands
Abstract--A prominent emerging theory of sensorimotor development in biological systems proposes that control knowledge is encoded in the dynamics of physical interaction with the ...
Roderic A. Grupen, Jefferson A. Coelho Jr.
106
Voted
ICML
1995
IEEE
16 years 1 months ago
Stable Function Approximation in Dynamic Programming
The success ofreinforcement learninginpractical problems depends on the ability to combine function approximation with temporal di erence methods such as value iteration. Experime...
Geoffrey J. Gordon
98
Voted
ICFP
2008
ACM
16 years 17 days ago
Pattern minimization problems over recursive data types
In the context of program verification in an interactive theorem prover, we study the problem of transforming function definitions with ML-style (possibly overlapping) pattern mat...
Alexander Krauss