888 search results - page 19 / 178 » The Power of Temporal Proofs |
130
click to vote
LPAR
2012
Springer
13 years 5 months ago
2012
Springer
We motivate and introduce a query language PrQL designed for inspecting machine representations of proofs. PrQL natively supports hiproofs which express proof structure using hiera...
ICML
1995
IEEE
15 years 10 months ago
1995
IEEE
The success ofreinforcement learninginpractical problems depends on the ability to combine function approximation with temporal di erence methods such as value iteration. Experime...
COCO
2008
Springer
14 years 11 months ago
2008
Springer
A central question in quantum information theory and computational complexity is how powerful nonlocal strategies are in cooperative games with imperfect information, such as mult...
CADE
2004
Springer
15 years 3 months ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated (innermost) termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequalit...
80
Voted
CORR
2011
Springer
14 years 4 months ago
2011
Springer
The Quantum Substate Theorem due to Jain, Radhakrishnan, and Sen [7] gives us a powerful operational interpretation of the observational divergence of two quantum states, a quanti...