1989 search results - page 207 / 398 » Set functions for functional logic programming |
146
Voted
ALT
1995
Springer
15 years 7 months ago
1995
Springer
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
148
Voted
KR
2010
Springer
15 years 8 months ago
2010
Springer
This is a case-study in knowledge representation. We analyze the ‘one hundred prisoners and a lightbulb’ puzzle. In this puzzle it is relevant what the agents (prisoners) know...
119
click to vote
ESOP
2003
Springer
15 years 8 months ago
2003
Springer
Security folklore holds that a security mechanism based on stack inspection is incompatible with a global tail call optimization policy. An implementation of such a language may ha...
157
click to vote
TACAS
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
133
Voted
DEXA
2008
Springer
15 years 5 months ago
2008
Springer
The query performance for tracing tags depends upon the distribution of tag trajectories in the data space. We examine a more efficient representation of tag trajectories by means ...