793 search results - page 82 / 159 » Argumentation and standards of proof |
PLILP
1992
Springer
15 years 4 months ago
1992
Springer
The unfold/fold framework constitutes the spine of many program transformation strategies. However, by unrestricted use of folding the target program may terminate less often than...
85
Voted
ALGORITHMICA
2008
15 years 24 days ago
2008
In this paper we consider the following question: how many vertices of the discrete torus must be deleted so that no topologically nontrivial cycles remain? We look at two differe...
83
Voted
APAL
2008
15 years 24 days ago
2008
We extend the earlier results on the equivalence between the Boolean and the multivalued dependencies in relational databases and fragments of the Boolean propositional logic. It ...
109
Voted
ECCC
2008
15 years 22 days ago
2008
Testing a property P of graphs in the bounded degree model is the following computational problem: given a graph G of bounded degree d we should distinguish (with probability 0.9,...
125
click to vote
ENTCS
2006
15 years 20 days ago
2006
In this paper we introduce a new approach to formalizing certain type operations in type theory. Traditionally, many type constructors in type theory are independently axiomatized...