6274 search results - page 693 / 1255 » Proofs, Programs, Processes |
209
click to vote
CP
2005
Springer
16 years 19 days ago
2005
Springer
Abstract. Most CSP algorithms are based on refinements and extensions of backtracking, and employ one of two simple “branching schemes”: 2-way branching or d-way branching, fo...
165
click to vote
AISC
2004
Springer
16 years 15 days ago
2004
Springer
Abstract. We present a personal view and strategy for algorithm-supported mathematical theory exploration and draw some conclusions for the desirable functionality of future mathem...
172
click to vote
ICALP
2004
Springer
16 years 14 days ago
2004
Springer
Monadic least fixed point logic MLFP is a natural logic whose expressiveness lies between that of first-order logic FO and monadic second-order logic MSO. In this paper we take ...
203
click to vote
SAS
2004
Springer
16 years 13 days ago
2004
Springer
Abstract. In this paper we investigate the existence of a deductive veri cation method based on a logic that describes pointer aliasing. The main idea of such a method is that the ...
209
click to vote
ICALP
2003
Springer
16 years 9 days ago
2003
Springer
Abstract. We introduce a concept of similarity between vertices of directed graphs. Let GA and GB be two directed graphs with respectively nA and nB vertices. We define a nA × nB...