509 search results - page 68 / 102 » On the completeness of compositional reasoning methods |
LACL
2001
Springer
14 years 1 months ago
2001
Springer
In categorial systems with a fixed structural component, the learning problem comes down to finding the solution for a set of typeassignment equations. A hard-wired structural co...
ACE
2004
13 years 10 months ago
2004
Final year students in the Bachelor of Computing complete an industry project where they work in teams to build an IT system for an external client. Grading projects in these circ...
ICIP
2007
IEEE
14 years 10 months ago
2007
IEEE
A key goal of far-field activity analysis is to learn the usual pattern of activity in a scene and to detect statistically anomalous behavior. We propose a method for unsupervised...
DCC
2008
IEEE
14 years 8 months ago
2008
IEEE
Complete (n, r)-arcs in PG(k - 1, q) and projective (n, k, n - r)q-codes that admit no projective extensions are equivalent objects. We show that projective codes of reasonable le...
LOPSTR
2009
Springer
14 years 3 months ago
2009
Springer
We show how to combine the two most powerful approaches for automated termination analysis of logic programs (LPs): the direct approach which operates directly on LPs and the trans...