4573 search results - page 332 / 915 » Automated Reasoning |
139
Voted
CSL
2000
Springer
15 years 11 months ago
2000
Springer
We study definability of languages in arithmetic and the free monoid by bounded versions of fixed-point and transitive-closure logics. In particular we give logical characterisat...
207
click to vote
ECSQARU
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. Given several Dempster-Shafer belief functions, the framework of valuation networks describes an efficient method for computing the marginal of the combined belief functi...
159
click to vote
LICS
1999
IEEE
15 years 11 months ago
1999
IEEE
We prove full completeness of multiplicative linear logic (MLL) without MIX under the Chu interpretation. In particular we show that the cut-free proofs of MLL theorems are in a n...
161
click to vote
LICS
1999
IEEE
15 years 11 months ago
1999
IEEE
We present some new decision and comparison problems of unusually high computational complexity. Most of the problems are strictly combinatorial in nature; others involve basic lo...
180
click to vote
LICS
1999
IEEE
15 years 11 months ago
1999
IEEE
Pitts and Stark have proposed the -calculus as a language for investigating the interaction of unique name generation and higher-order functions. They developed a sound model base...