3047 search results - page 250 / 610 » On the Meaning of Logical Completeness |
244
click to vote
ENTCS
2007
15 years 7 months ago
2007
We introduce the idea of optimisation validation, which is to formally establish that an instance of an optimising transformation indeed improves with respect to some resource mea...
180
click to vote
JANCL
2007
15 years 7 months ago
2007
Logic of proofs LP introduced by S. Artemov in 1995 describes properties of proof predicate “t is a proof of F” in the propositional language extended by atoms of the form [[t...
203
click to vote
ICASSP
2011
IEEE
14 years 11 months ago
2011
IEEE
In this paper, we present a new evaluation approach for missing data techniques (MDTs) where the efficiency of those are investigated using listwise deletion method as reference....
201
click to vote
LATA
2009
Springer
16 years 2 months ago
2009
Springer
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
241
click to vote
TPHOL
2005
IEEE
16 years 1 months ago
2005
IEEE
The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permu...