2272 search results - page 102 / 455 » A Calculus for |
146
click to vote
CBSE
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In current software components models, components do not encapsulate control, and are composed by connection mechanisms which pass control from component to component. Co...
143
click to vote
ISMVL
2007
IEEE
15 years 10 months ago
2007
IEEE
We define a resolution-style rule for solving the Max-SAT problem of Signed CNF formulas (Signed Max-SAT) and prove that our rule provides a complete calculus for that problem. F...
127
Voted
ACNS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Untraceability and unreuseability are essential security properties for electronic cash protocols. Many protocols have been proposed to meet these two properties. However...
141
click to vote
JVA
2006
IEEE
15 years 10 months ago
2006
IEEE
We present a natural deduction calculus for the computation tree logic CTL defined with the full set of classical and temporal logic operators. The system extends the natural ded...
101
click to vote
TABLEAUX
2005
Springer
15 years 9 months ago
2005
Springer
We extend classical first-order logic with subtyping by type predicates and type coercion. Type predicates assert that the value of a term belongs to a more special type than the ...