3238 search results - page 154 / 648 » On the Computational Interpretation of Negation |
174
click to vote
CIE
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We study a realisability interpretation for inductive and coinductive definitions and discuss its application to program extraction from proofs. A speciality of this inte...
166
click to vote
ICLP
2005
Springer
16 years 5 hour ago
2005
Springer
The relationship between abstract interpretation and partial deduction has received considerable attention and (partial) integrations have been proposed starting from both the part...
184
click to vote
CIRA
2007
IEEE
16 years 25 days ago
2007
IEEE
—To enable effective human-agent collaboration, new human-centric computing paradigms are needed. This paper presents a soft constraint representation scheme based on generalized...
156
click to vote
DIGRA
2003
Springer
15 years 11 months ago
2003
Springer
Space, vast lands and dungeons… It is no coincidence that Space War and Adventure are among the best known of the first computer games. Both clearly appeal to the player’s cur...
172
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...