611 search results - page 76 / 123 » Yuri, Logic, and Computer Science |
JANCL
2008
14 years 9 months ago
2008
This paper employs epistemic logic to investigate the philosophical foundations of Bayesian updating in belief revision. By Bayesian updating, we understand the tenet that an agen...
TPHOL
1997
IEEE
15 years 2 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...
100
click to vote
CSL
2007
Springer
15 years 4 months ago
2007
Springer
Calculi with explicit substitutions (ES) are widely used in different areas of computer science. Complex systems with ES were developed these last 15 years to capture the good comp...
RTA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Interaction nets are a graphical formalism inspired by Linear Logic proof-nets often used for studying higher order rewriting e.g. β-reduction. Traditional presentations...
TLCA
2009
Springer
15 years 4 months ago
2009
Springer
The straightforward elimination of union types is known to break subject reduction, and for some extensions of the lambda-calculus, to break strong normalization as well. Similarly...