1916 search results - page 201 / 384 » Reasoning with class algebra |
117
click to vote
WAOA
2004
Springer
15 years 9 months ago
2004
Springer
Borodin, Nielsen and Rackoff [5] proposed a framework for ing the main properties of greedy-like algorithms with emphasis on scheduling problems, and Davis and Impagliazzo [6] ext...
147
click to vote
CSL
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. A new tree automata framework, called equational tree automata, is presented. In the newly introduced setting, congruence closures of recognizable tree languages are reco...
122
click to vote
ECSQARU
2001
Springer
15 years 8 months ago
2001
Springer
Abstract A (general) preferential entailment is defined by a “preference relation” among “states”. States can be either interpretations or sets of interpretations, or “c...
151
click to vote
LOPSTR
2001
Springer
15 years 8 months ago
2001
Springer
In this paper we define a sequent calculus to formally specify, simulate, debug and verify security protocols. In our sequents we distinguish between the current knowledge of prin...
117
Voted
LICS
1999
IEEE
15 years 8 months ago
1999
IEEE
We give a new decision procedure for the guarded fragment with equality. The procedure is based on resolution with superposition. We argue that this method will be more useful in ...