2272 search results - page 232 / 455 » A Calculus for |
149
click to vote
IJCAI
2001
15 years 6 months ago
2001
A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quant...
138
click to vote
AAAI
1996
15 years 6 months ago
1996
Overcoming the disadvantages of equidistant discretization of continuous actions, we introduce an approach that separates time into slices of varying length bordered by certain ev...
147
click to vote
IJCAI
1989
15 years 5 months ago
1989
We consider the role played by the concept of action in AI. We first briefly summarize the advantages and limitations of past approaches to taking the concept as primitive, as emb...
140
click to vote
CONCUR
2010
Springer
15 years 5 months ago
2010
Springer
We consider a calculus for multiparty sessions with delegation, enriched with security levels for session participants and data. We propose a type system that guarantees both sessi...
132
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract We investigate here a new version of the Calculus of Inductive Constructions (CIC) on which the proof assistant Coq is based: the Calculus of Congruent Inductive Construct...