2432 search results - page 153 / 487 » Cryptographic logical relations |
140
click to vote
JOLLI
1998
15 years 5 months ago
1998
The postulate of Recovery, among the six postulates for theory contraction, formulated and studied by Alchourr´on, G¨ardenfors and Makinson is the one that has provoked most cont...
147
click to vote
MSCS
2007
15 years 5 months ago
2007
We study full completeness and syntactical separability of MLL proof nets with the mix rule. The general method we use consists first in addressing the two questions in the less ...
204
Voted
JAR
2010
15 years 7 days ago
2010
The development of ontologies involves continuous but relatively small modifications. However, existing ontology reasoners do not take advantage of the similarities between differe...
180
click to vote
ESOP
2010
Springer
16 years 2 months ago
2010
Springer
Formal reasoning about concurrent programs is usually done with the assumption that the underlying memory model is sequentially consistent, i.e. the execution outcome is equivalen...
209
click to vote
INLG
2010
Springer
15 years 3 months ago
2010
Springer
The generation of referring expressions (GRE), an important subtask of Natural Language Generation (NLG) is to generate phrases that uniquely identify domain entities. Until recen...