36 search results - page 4 / 8 » Completeness and Compactness of Quantitative Domains |
MLDM
2005
Springer
14 years 25 days ago
2005
Springer
Abstract. The ability to discover the topic of a large set of text documents using relevant keyphrases is usually regarded as a very tedious task if done by hand. Automatic keyphra...
SIAMMA
2010
13 years 2 months ago
2010
This paper is devoted to the study of some qualitative and quantitative aspects of nonlinear propagation phenomena in diffusive media. More precisely, we consider the case a react...
JELIA
2004
Springer
14 years 21 days ago
2004
Springer
In this work we reconsider the replacement of predicate-like notation by functional terms, using a similar syntax to Functional Logic Programming, but under a completely different...
JELIA
2004
Springer
14 years 21 days ago
2004
Springer
Logical formalisation of agent behaviour is desirable, not only in order to provide a clear semantics of agent-based systems, but also to provide the foundation for sophisticated r...
ICLP
2005
Springer
14 years 26 days ago
2005
Springer
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...