2214 search results - page 308 / 443 » Complexity of Reasoning |
122
click to vote
ICDT
2007
ACM
15 years 9 months ago
2007
ACM
Stay macro tree transducers (smtts) are an expressive formalism for reasoning about XSLT-like document transformations. Here, we consider the exact type checking problem for smtts....
126
Voted
ICLP
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We present a framework for the declarative diagnosis of nondeterministic timed concurrent constraint programs. We present a denotational semantics based on a (continuous)...
131
Voted
IESS
2007
Springer
15 years 9 months ago
2007
Springer
This work investigates the use of reconfigurable devices as computing platform for self-organizing embedded systems. Those usually consist of a set of distributed, autonomous node...
124
Voted
ILP
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Despite the considerable success of Inductive Logic Programming, deployed ILP systems still have efficiency problems when applied to complex problems. Several techniques ...
212
Voted
ILP
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Many reinforcement learning domains are highly relational. While traditional temporal-difference methods can be applied to these domains, they are limited in their capaci...