4573 search results - page 538 / 915 » Automated Reasoning |
152
Voted
PLILP
1998
Springer
15 years 9 months ago
1998
Springer
We report on the current status of the LMC project, which seeks to deploy the latest developments in logic-programming technology to advance the state of the art of system speci ca...
125
click to vote
PLILP
1998
Springer
15 years 9 months ago
1998
Springer
The programming languages Erlang and Scheme have many common features, yet the performance of the current implementations of Erlang appears to be below that of good implementations...
108
click to vote
TARK
1998
Springer
15 years 9 months ago
1998
Springer
We look at the Big Match game, a variation of the repeated Matching Pennies game where if the rst player plays tails the game ends with the rst player receiving the last round...
106
Voted
LICS
1997
IEEE
15 years 9 months ago
1997
IEEE
Abstract. We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the emptiness problem for the intersection of recognizab...
190
click to vote
LICS
1997
IEEE
15 years 9 months ago
1997
IEEE
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...