1888 search results - page 29 / 378 » Proof theory and computational analysis |
RTA
2005
Springer
14 years 25 days ago
2005
Springer
Proofs of equalities may be built from assumptions using proof rules for reflexivity, symmetry, and transitivity. Reflexivity is an axiom proving x=x for any x; symmetry is a 1-p...
VISAPP
2010
13 years 5 months ago
2010
phies are also mentioned and a common mathematical abstraction for all these inverses problems will be presented. By focusing on a simple linear forward model, first a synthetic an...
TPDS
2010
13 years 5 months ago
2010
—In distributed computing systems (DCSs) where server nodes can fail permanently with nonzero probability, the system performance can be assessed by means of the service reliabil...
BVAI
2007
Springer
14 years 1 months ago
2007
Springer
We tested the efficiency of category learning when participants are provided only with pairs of objects, known to belong either to the same class (Positive Equivalence Constraints ...
POPL
2004
ACM
14 years 7 months ago
2004
ACM
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...