282 search results - page 40 / 57 » Propositional Fusion Rules |
ICDAR
2011
IEEE
12 years 7 months ago
2011
IEEE
—In this paper, we propose a novel method for extracting handwritten characters from multi-language document images, which may contain various types of characters, e.g. Chinese, ...
TABLEAUX
2009
Springer
14 years 2 months ago
2009
Springer
We develop a general criterion for cut elimination in sequent calculi for propositional modal logics, which rests on absorption of cut, contraction, weakening and inversion by the ...
TABLEAUX
2005
Springer
14 years 1 months ago
2005
Springer
We present a sound and complete tableau calculus for the class of regular grammar logics. Our tableau rules use a special feature called automaton-labelled formulae, which are simi...
TABLEAUX
2009
Springer
14 years 2 days ago
2009
Springer
Projection computation is a generalization of second-order quantifier elimination, which in turn is closely related to the computation of forgetting and of uniform interpolants. O...
CSFW
2000
IEEE
13 years 12 months ago
2000
IEEE
In this paper we present an improved logic for analysing authentication properties of cryptographic protocols, based on the SVO logic of Syverson and van Oorschot. Such logics are...