1894 search results - page 219 / 379 » A TLA Proof System |
128
click to vote
AIED
2005
Springer
15 years 10 months ago
2005
Springer
: Two problem solving strategies, forward chaining and backward chaining, were compared to see how they affect students’ learning of geometry theorem proving with construction. I...
141
Voted
TLCA
2005
Springer
15 years 10 months ago
2005
Springer
αProlog is a logic programming language which is well-suited for rapid prototyping of type systems and operational semantics of typed λ-calculi and many other languages involving...
149
click to vote
FSTTCS
2004
Springer
15 years 10 months ago
2004
Springer
A self-stabilizing distributed protocol can recover from any state-corrupting fault. A self-stabilizing protocol is called adaptive if its recovery time is proportional to the numb...
142
click to vote
PADL
2004
Springer
15 years 10 months ago
2004
Springer
Gentzen’s Hauptsatz – cut elimination theorem – in sequent calculi reveals a fundamental property on logic connectives in various logics such as classical logic and intuition...
126
Voted
ICDCS
2003
IEEE
15 years 9 months ago
2003
IEEE
In a system proposed by Plaxton, Rajaraman and Richa (PRR), the expected cost of accessing a replicated object was proved to be asymptotically optimal for a static set of nodes an...