407 search results - page 8 / 82 » Malleable Proof Systems and Applications |
138
Voted
SAT
2009
Springer
15 years 8 months ago
2009
Springer
One of the starting points of propositional proof complexity is the seminal paper by Cook and Reckhow [6], where they defined propositional proof systems as poly-time computable f...
123
Voted
FUIN
2010
14 years 11 months ago
2010
Abstract. Writing dependently typed functional programs that capture non-trivial program properties, such as those involving membership, ordering and non-linear arithmetic, is diff...
106
click to vote
PERVASIVE
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. A logic-based language is often adopted in systems for pervasive computing, because it provides a convenient way to define rules that change the behavior of the systems d...
138
click to vote
CADE
1990
Springer
15 years 5 months ago
1990
Springer
imps is an Interactive Mathematical Proof System intended as a general purpose tool for formulating and applying mathematics in a familiar fashion. The logic of imps is based on a...
98
Voted
WSC
1998
15 years 3 months ago
1998
Proof AnimationTM is a family of products for animating discrete event simulations. Proof is available in a variety of versions, including an inexpensive, student version, midsize...