331 search results - page 44 / 67 » HOLCF: Higher Order Logic of Computable Functions |
121
click to vote
TPHOL
1997
IEEE
15 years 4 months ago
1997
IEEE
This note lists references which address –in some way or another– the problems relating to formal manipulation of logical expressions where terms can fail to denote. Reference...
106
Voted
AMAI
2004
Springer
15 years 5 months ago
2004
Springer
The majority of the work in the area of Markov decision processes has focused on expected values of rewards in the objective function and expected costs in the constraints. Althou...
107
Voted
SEMCO
2007
IEEE
15 years 6 months ago
2007
IEEE
Many recent advances in complex domains such as Natural Language Processing (NLP) have taken a discriminative approach in conjunction with the global application of structural and...
CSFW
2008
IEEE
15 years 7 months ago
2008
IEEE
DKAL is a new declarative authorization language for distributed systems. It is based on existential fixed-point logic and is considerably more expressive than existing authoriza...
JOLLI
2007
15 years 11 days ago
2007
Every pregroup grammar is shown to be strongly equivalent to one which uses basic types and left and right adjoints of basic types only. Therefore a semantical interpretation is i...